id
int64
text
string
metadata
dict
line_start_n_end_idx
dict
quality_signals
dict
eai_taxonomy
dict
pid
string
-4,882,343,666,140,923,000
Price Drop Confirmed!!! Wait till Jan... Discussion in 'Macintosh Computers' started by MacRoni, Nov 5, 2002. 1. MacRoni macrumors member Joined: Oct 25, 2002 #1 A few hours ago, Apple updated their site, then took down the revision an hour later. Looks like there will only be a $200 price break until the new PB rev. is coming out at MWSF. Here's a picture grab:   Attached Files: 2. technocoy macrumors 6502a technocoy Joined: Sep 4, 2002 Location: Raleigh, NC #2 uuhh... and how does this prove that there are no revisions?? it doesn't even list the powerbook features?? it just confirms a price drop. think before you post, and get everyone excited;) technocoy   3. daniel77 macrumors 6502 Joined: Oct 13, 2002 Location: seattle, wa 4. mr evil brkfast macrumors member Joined: Jun 18, 2002 Location: Toronto, Canada #4 Apple may have jumped the gun on the loan info. There may be a $200 dollar price drop but until we see it and no other changes/ or an update we'll not know for sure.   5. gopher macrumors 65816 Joined: Mar 31, 2002 Location: Maryland, USA #5 Note that's now 180 days and not 90 days! That means you can spread out your purchase over 6 months and not pay interest. Quite a deal...and it says: "limited time only!" So get it while it is hot. $1000 iBook at 6 months is $167 a month. Not bad! And NO Interest!   Share This Page
{ "url": "https://forums.macrumors.com/threads/price-drop-confirmed-wait-till-jan.13883/", "source_domain": "forums.macrumors.com", "snapshot_id": "crawl=CC-MAIN-2017-09", "warc_metadata": { "Content-Length": "146322", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:QZHQBLXV4K7BEJECLGWC52MFZHUXF6GS", "WARC-Concurrent-To": "<urn:uuid:0fb66a85-78cd-43ca-9d36-f0f24a019994>", "WARC-Date": "2017-02-28T09:34:42Z", "WARC-IP-Address": "162.254.116.214", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:KF7MRQ4JWZEXHI6PG4GODK6UO4IWYMQQ", "WARC-Record-ID": "<urn:uuid:53361f2e-e3d8-419d-9c21-c26bf845dffe>", "WARC-Target-URI": "https://forums.macrumors.com/threads/price-drop-confirmed-wait-till-jan.13883/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:8d9a5e07-592c-4a9f-a2b2-21803c495b44>" }, "warc_info": "robots: classic\r\nhostname: ip-10-171-10-108.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-09\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }
{ "line_start_idx": [ 0, 41, 42, 111, 112, 142, 143, 155, 172, 179, 363, 364, 391, 397, 398, 418, 419, 450, 451, 465, 466, 478, 494, 508, 524, 531, 543, 544, 679, 680, 734, 735, 749, 755, 784, 785, 797, 814, 828, 844, 882, 883, 895, 912, 926, 946, 953, 1123, 1129, 1157, 1158, 1170, 1187, 1201, 1219, 1226, 1401, 1402, 1433, 1434, 1479, 1480, 1510, 1516, 1517 ], "line_end_idx": [ 41, 42, 111, 112, 142, 143, 155, 172, 179, 363, 364, 391, 397, 398, 418, 419, 450, 451, 465, 466, 478, 494, 508, 524, 531, 543, 544, 679, 680, 734, 735, 749, 755, 784, 785, 797, 814, 828, 844, 882, 883, 895, 912, 926, 946, 953, 1123, 1129, 1157, 1158, 1170, 1187, 1201, 1219, 1226, 1401, 1402, 1433, 1434, 1479, 1480, 1510, 1516, 1517, 1532 ] }
{ "red_pajama_v2": { "ccnet_original_length": 1532, "ccnet_original_nlines": 64, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.29936304688453674, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.019108280539512634, "rps_doc_frac_lines_end_with_ellipsis": 0.03076923079788685, "rps_doc_frac_no_alph_words": 0.3152866065502167, "rps_doc_frac_unique_words": 0.6763485670089722, "rps_doc_mean_word_length": 4.232365131378174, "rps_doc_num_sentences": 26, "rps_doc_symbol_to_word_ratio": 0.02229299023747444, "rps_doc_unigram_entropy": 4.902973175048828, "rps_doc_word_count": 241, "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.047058820724487305, "rps_doc_frac_chars_top_3gram": 0.04117647185921669, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -150.88540649414062, "rps_doc_books_importance_length_correction": -139.74160766601562, "rps_doc_openwebtext_importance": -87.76103973388672, "rps_doc_openwebtext_importance_length_correction": -87.76103973388672, "rps_doc_wikipedia_importance": -46.25210189819336, "rps_doc_wikipedia_importance_length_correction": -33.10817337036133 }, "fasttext": { "dclm": 0.11035239696502686, "english": 0.9056521654129028, "fineweb_edu_approx": 0.7576342225074768, "eai_general_math": 0.0022727299947291613, "eai_open_web_math": 0.14063245058059692, "eai_web_code": -0.000006199999916134402 } }
{ "free_decimal_correspondence": { "primary": { "code": "004.16", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "658.85", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Business", "level_3": "Management" } } }, "bloom_cognitive_process": { "primary": { "code": "5", "label": "Evaluate" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "1", "label": "Factual" }, "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": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "0", "label": "No missing content" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "5", "label": "Comment Section" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
1,901,778,763,101,019,600
Python vs C++: Selecting the Right Tool for the Job Python vs C++: Selecting the Right Tool for the Job by Jim Anderson intermediate python Are you a C++ developer comparing Python vs C++? Are you looking at Python and wondering what all the fuss is about? Do you wonder how Python compares to the concepts you already know? Or perhaps you have a bet on who would win if you locked C++ and Python in a cage and let them battle it out? Then this article is for you! In this article, you’ll learn about: • Differences and similarities when you’re comparing Python vs C++ • Times when Python might be a better choice for a problem and vice versa • Resources to turn to as you have questions while learning Python This article is aimed at C++ developers who are learning Python. It assumes a basic knowledge of both languages and will use concepts from Python 3.6 and up, as well as C++11 or later. Let’s dive into looking at Python vs C++! Remove ads Comparing Languages: Python vs C++ Frequently, you’ll find articles that extoll the virtues of one programming language over another. Quite often, they devolve into efforts to promote one language by degrading the other. This isn’t that type of article. When you’re comparing Python vs C++, remember that they’re both tools, and they both have uses for different problems. Think about comparing a hammer and a screwdriver. You could use a screwdriver to drive in nails, and you could use a hammer to force in screws, but neither experience will be all that effective. Using the right tool for the job is important. In this article, you’ll learn about the features of Python and C++ that make each of them the right choice for certain types of problems. So, don’t view the “vs” in Python vs C++ as meaning “against.” Rather, think of it as a comparison. Compilation vs Virtual Machine Let’s start with the biggest difference when you’re comparing Python vs C++. In C++, you use a compiler that converts your source code into machine code and produces an executable. The executable is a separate file that can then be run as a stand-alone program: Compiling a C++ program for windows. This process outputs actual machine instructions for the specific processor and operating system it’s built for. In this drawing, it’s a Windows program. This means you’d have to recompile your program separately for Windows, Mac, and Linux: Compiling a C++ program on three operating systems. You’ll likely need to modify your C++ code to run on those different systems as well. Python, on the other hand, uses a different process. Now, remember that you’ll be looking at CPython which is the standard implementation for the language. Unless you’re doing something special, this is the Python you’re running. Python runs each time you execute your program. It compiles your source just like the C++ compiler. The difference is that Python compiles to bytecode instead of native machine code. Bytecode is the native instruction code for the Python virtual machine. To speed up subsequent runs of your program, Python stores the bytecode in .pyc files: Python compiles a py file into a pyc file. If you’re using Python 2, then you’ll find these files next to the .py files. For Python 3, you’ll find them in a __pycache__ directory. The generated bytecode doesn’t run natively on your processor. Instead, it’s run by the Python virtual machine. This is similar to the Java virtual machine or the .NET Common Runtime Environment. The initial run of your code will result in a compilation step. Then, the bytecode will be interpreted to run on your specific hardware: Python compiles a py file into a pyc file and then executes it. As long as the program hasn’t been changed, each subsequent run will skip the compilation step and use the previously compiled bytecode to interpret: Python executes a pyc file. Interpreting code is going to be slower than running native code directly on the hardware. So why does Python work that way? Well, interpreting the code in a virtual machine means that only the virtual machine needs to be compiled for a specific operating system on a specific processor. All of the Python code it runs will run on any machine that has Python. Another feature of this cross-platform support is that Python’s extensive standard library is written to work on all operating systems. Using pathlib, for example, will manage path separators for you whether you’re on Windows, Mac, or Linux. The developers of those libraries spent a lot of time making it portable so you don’t need to worry about it in your Python program! Before you move on, let’s start keeping track of a Python vs C++ comparison chart. As you cover new comparisons, they’ll be added in italics: Feature Python C++ Faster Execution x Cross-Platform Execution x Now that you’ve seen the differences in run time when you’re comparing Python vs C++, let’s dig into the specifics of the languages’ syntax. Syntax Differences Python and C++ share many syntactical similarities, but there are a few areas worth discussing: • Whitespace • Boolean expressions • Variables and pointers • Comprehensions Let’s start with the most contentious one first: whitespace. Whitespace The first thing most developers notice when comparing Python vs C++ is the “whitespace issue.” Python uses leading whitespace to mark scope. This means that the body of an if block or other similar structure is indicated by the level of indentation. C++ uses curly braces ({}) to indicate the same idea. While the Python lexer will accept any whitespace as long as you’re consistent, PEP8 (the official style guide for Python) specifies 4 spaces for each level of indentation. Most editors can be configured to do this automatically. There has been an enormous amount of writing, shouting, and ranting about Python’s whitespace rules already, so let’s just jump past that issue and on to other matters. Instead of relying on a lexical marker like ; to end each statement, Python uses the end of the line. If you need to extend a statement over a single line, then you can use the backslash (\) to indicate that. (Note that if you’re inside a set of parentheses, then the continuation character is not needed.) There are people who are unhappy on both sides of the whitespace issue. Some Python developers love that you don’t have to type out braces and semicolons. Some C++ developers hate the reliance on formatting. Learning to be comfortable with both is your best bet. Now that you’ve looked at the whitespace issue, let’s move on to one that’s a bit less contentious: Boolean expressions. Boolean Expressions The way you’ll use Boolean expressions changes slightly in Python vs C++. In C++, you can use numeric values to indicate true or false, in addition to the built-in values. Anything that evaluates to 0 is considered false, while every other numeric value is true. Python has a similar concept but extends it to include other cases. The basics are quite similar. The Python documentation states that the following items evaluate to False: • Constants defined as false: • None • False • Zeros of any numeric type: • 0 • 0.0 • 0j • Decimal(0) • Fraction(0, 1) • Empty sequences and collections: • '' • () • [] • {} • set() • range(0) All other items are True. This means that an empty list [] is False, while a list containing only zero [0] is still True. Most objects will evaluate to True, unless the object has __bool__() which returns False or __len__() which returns 0. This allows you to extend your custom classes to act as Boolean expressions. Python has a few slight changes from C++ in the Boolean operators as well. For starters, if and while statements do not require the surrounding parentheses as they do in C++. Parentheses can aid in readability, however, so use your best judgment. Most C++ Boolean operators have similar operators in Python: C++ Operator Python Operator && and || or ! not & & | | Most of the operators are similar to C++, but if you want to brush up you can read Operators and Expressions in Python. Variables and Pointers When you first start using Python after writing in C++, you might not give variables much thought. They seem to generally work as they do in C++. However, they’re not the same. Whereas in C++ you use variables to reference values, in Python you use names. First, let’s back up a bit and take a broader look at Python’s object model. In Python, everything is an object. Numbers are held in objects. Modules are held in objects. Both the object of a class and the class itself are objects. Functions are also objects: >>> >>> a_list_object = list() >>> a_list_object [] >>> a_class_object = list >>> a_class_object <class 'list'> >>> def sayHi(name): ... print(f'Hello, {name}') ... >>> a_function_object = sayHi >>> a_function_object <function sayHi at 0x7faa326ac048> Calling list() creates a new list object, which you assign to a_list_object. Using the name of the class list by itself places a label on the class object. You can place a new label on a function as well. This is a powerful tool and, like all powerful tools, it can be dangerous. (I’m looking at you, Mr. Chainsaw.) Moving back to the Python vs C++ discussion, note that this is behavior is different from what you’ll see in C++. Unlike Python, C++ has variables that are assigned to a memory location, and you must indicate how much memory that variable will use: int an_int; float a_big_array_of_floats[REALLY_BIG_NUMBER]; In Python, all objects are created in memory, and you apply labels to them. The labels themselves don’t have types, and they can be put on any type of object: >>> >>> my_flexible_name = 1 >>> my_flexible_name 1 >>> my_flexible_name = 'This is a string' >>> my_flexible_name 'This is a string' >>> my_flexible_name = [3, 'more info', 3.26] >>> my_flexible_name [3, 'more info', 3.26] >>> my_flexible_name = print >>> my_flexible_name <built-in function print> You can assign my_flexible_name to any type of object, and Python will just roll with it. When you’re comparing Python vs C++, the difference in variables vs names can be a bit confusing, but it comes with some excellent benefits. One is that in Python you don’t have pointers, and you never need to think about heap vs stack issues. You’ll dive into memory management a bit later in this article. Comprehensions Python has a language feature called list comprehensions. While it’s possible to emulate list comprehensions in C++, it’s fairly tricky. In Python, they’re a basic tool that’s taught to beginning programmers. One way of thinking about list comprehensions is that they’re like a super-charged initializer for lists, dicts, or sets. Given one iterable object, you can create a list, and filter or modify the original as you do so: >>> >>> [x**2 for x in range(5)] [0, 1, 4, 9, 16] This script starts with the iterable range(5) and creates a list that contains the square for each item in the iterable. It’s possible to add conditions to the values in the first iterable: >>> >>> odd_squares = [x**2 for x in range(5) if x % 2] >>> odd_squares [1, 9] The if x % 2 at the end of this comprehension limits the numbers used from range(5) to only the odd ones. At this point you might be having two thoughts: 1. That’s a powerful syntax trick that will simplify some parts of my code. 2. You can do the same thing in C++. While it’s true that you can create a vector of the squares of the odd numbers in C++, doing so usually means a little more code: std::vector<int> odd_squares; for (int ii = 0; ii < 10; ++ii) { if (ii % 2) { odd_squares.push_back(ii*ii); } } For developers coming from C-style languages, list comprehensions are one of the first noticeable ways they can write more Pythonic code. Many developers start writing Python with C++ structure: odd_squares = [] for ii in range(5): if (ii % 2): odd_squares.append(ii) This is perfectly valid Python. It will likely run more slowly, however, and it’s not as clear and concise as the list comprehension. Learning to use list comprehensions will not only speed up your code, but it will also make your code more Pythonic and easier to read! Python’s std::algorithms C++ has a rich set of algorithms built into the standard library. Python has a similar set of built-in functions that cover the same ground. The first and most powerful of these is the in operator, which provides a quite readable test to see if an item is included in a list, set, or dictionary: >>> >>> x = [1, 3, 6, 193] >>> 6 in x True >>> 7 in x False >>> y = { 'Jim' : 'gray', 'Zoe' : 'blond', 'David' : 'brown' } >>> 'Jim' in y True >>> 'Fred' in y False >>> 'gray' in y False Note that the in operator, when used on dictionaries, only tests for keys, not values. This is shown by the final test, 'gray' in y. in can be combined with not for quite readable syntax: if name not in y: print(f"{name} not found") Next up in your parade of Python built-in operators is any. This is a boolean function that returns True if any element of the given iterable evaluates to True. This can seem a little silly until you remember your list comprehensions! Combining these two can produce powerful, clear syntax for many situations: >>> >>> my_big_list = [10, 23, 875] >>> my_small_list = [1, 2, 8] >>> any([x < 3 for x in my_big_list]) False >>> any([x < 3 for x in my_small_list]) True Finally, you have all, which is similar to any. This returns True only if—you guessed it—all of the elements in the iterable are True. Again, combining this with list comprehensions produces a powerful language feature: >>> >>> list_a = [1, 2, 9] >>> list_b = [1, 3, 9] >>> all([x % 2 for x in list_a]) False >>> all([x % 2 for x in list_b]) True any and all can cover much of the same ground where C++ developers would look to std::find or std::find_if. Before moving on to variable typing, let’s update your Python vs C++ comparison chart: Feature Python C++ Faster Execution x Cross-Platform Execution x Single-Type Variables x Multiple-Type Variables x Comprehensions x Rich Set of Built-In Algorithms x x Okay, now you’re ready to look at variable and parameter typing. Let’s go! Static vs Dynamic Typing Another large topic when you’re comparing Python vs C++ is the use of data types. C++ is a statically typed language, while Python is dynamically typed. Let’s explore what that means. Static Typing C++ is statically typed, which means that each variable you use in your code must have a specific data type like int, char, float, and so forth. You can only assign values of the correct type to a variable, unless you jump through some hoops. This has some advantages for both the developer and the compiler. The developer gains the advantage of knowing what the type of a particular variable is ahead of time, and therefore which operations are allowed. The compiler can use the type information to optimize the code, making it smaller, faster, or both. This advance knowledge comes at a cost, however. The parameters passed into a function must match the type expected by the function, which can reduce the flexibility and potential usefulness of the code. Duck Typing Dynamic typing is frequently referred to as duck typing. It’s an odd name, and you’ll read more about that in just a minute! But first, let’s start with an example. This function takes a file object and reads the first ten lines: def read_ten(file_like_object): for line_number in range(10): x = file_like_object.readline() print(f"{line_number} = {x.strip()}") To use this function, you’ll create a file object and pass it in: with open("types.py") as f: read_ten(f) This shows how the basic design of the function works. While this function was described as “reading the first ten lines from a file object,” there is nothing in Python that requires that file_like_object be a file. As long as the object passed in supports .readline(), the object can be of any type: class Duck(): def readline(self): return "quack" my_duck = Duck() read_ten(my_duck) Calling read_ten() with a Duck object produces: 0 = quack 1 = quack 2 = quack 3 = quack 4 = quack 5 = quack 6 = quack 7 = quack 8 = quack 9 = quack This is the essence of duck typing. The saying goes, “If it looks like a duck, swims like a duck, and quacks like a duck, then it probably is a duck.” In other words, if the object has the needed methods, then it’s acceptable to pass it in, regardless of the object’s type. Duck or dynamic typing gives you an enormous amount of flexibility, as it allows any type to be used where it meets the required interfaces. However, there is a problem here. What happens if you pass in an object that doesn’t meet the required interface? For example, what if you pass in a number to read_ten(), like this: read_ten(3)? This results in an exception being thrown. Unless you catch the exception, your program will blow up with a traceback: Traceback (most recent call last): File "<stdin>", line 1, in <module> File "duck_test.py", line 4, in read_ten x = file_like_object.readline() AttributeError: 'int' object has no attribute 'readline' Dynamic typing can be quite a powerful tool, but as you can see, you must use caution when employing it. Let’s move on to a feature that benefits from Python’s dynamic typing: templates. Templates Python doesn’t have templates like C++, but it generally doesn’t need them. In Python, everything is a subclass of a single base type. This is what allows you to create duck typing functions like the ones above. The templating system in C++ allows you to create functions or algorithms that operate on multiple different types. This is quite powerful and can save you significant time and effort. However, it can also be a source of confusion and frustration, as compiler errors in templates can leave you baffled. Being able to use duck typing instead of templates makes some things much easier. But this, too, can cause hard-to-detect issues. As in all complex decisions, there are trade-offs when you’re comparing Python vs C++. Type Checking There’s been a lot of interest and discussion in the Python community lately about static type checking in Python. Projects like mypy have raised the possibility of adding pre-runtime type checking to specific spots in the language. This can be quite useful in managing interfaces between portions of large packages or specific APIs. It helps to address one of the downsides of duck typing. For developers using a function, it helps if they can fully understand what each parameter needs to be. This can be useful on large project teams where many developers need to communicate through APIs. Once again, let’s take a look at your Python vs C++ comparison chart: Feature Python C++ Faster Execution x Cross-Platform Execution x Single-Type Variables x Multiple-Type Variables x Comprehensions x Rich Set of Built-In Algorithms x x Static Typing x Dynamic Typing x Now you’re ready to move on to differences in object-oriented programming. Object-Oriented Programming Like C++, Python supports an object-oriented programming model. Many of the same concepts you learned in C++ carry over into Python. You’ll still need to make decisions about inheritance, composition, and multiple inheritance. Similarities Inheritance between classes works similarly in Python vs C++. A new class can inherit methods and attributes from one or more base classes, just like you’ve seen in C++. Some of the details are a bit different, however. Base classes in Python do not have their constructor called automatically like they do in C++. This can be confusing when you’re switching languages. Multiple inheritance also works in Python, and it has just as many quirks and strange rules as it does in C++. Similarly, you can also use composition to build classes, where you have objects of one type hold other types. Considering everything is an object in Python, this means that classes can hold anything else in the language. Differences There are some differences, however, when you’re comparing Python vs C++. The first two are related. The first difference is that Python has no concept of access modifiers for classes. Everything in a class object is public. The Python community has developed a convention that any member of a class starting with a single underscore is treated as private. This is in no way enforced by the language, but it seems to work out pretty well. The fact that every class member and method is public in Python leads to the second difference: Python has far weaker encapsulation support than C++. As mentioned, the single underscore convention makes this far less of an issue in practical codebases than it is in a theoretical sense. In general, any user that breaks this rule and depends on the internal workings of a class is asking for trouble. Operator Overloads vs Dunder Methods In C++, you can add operator overloads. These allow you to define the behavior of specific syntactical operators (like ==) for certain data types. Usually, this is used to add more natural usage of your classes. For the == operator, you can define exactly what it means for two objects of a class to be equal. One difference that takes some developers a long time to grasp is how to work around the lack of operator overloads in Python. It’s great that Python’s objects all work in any of the standard containers, but what if you want the == operator to do a deep comparison between two objects of your new class? In C++, you would create an operator==() in your class and do the comparison. Python has a similar structure that’s used quite consistently across the language: dunder methods. Dunder methods get their name because they all start and end with a double underscore, or “d-under.” Many of the built-in functions that operate on objects in Python are handled by calls to that object’s dunder methods. For your example above, you can add __eq__() to your class to do whatever fancy comparison you like: class MyFancyComparisonClass(): def __eq__(self, other): return True This produces a class that compares the same way as any other instance of its class. Not particularly useful, but it demonstrates the point. There are a large number of dunder methods used in Python, and the built-in functions make use of them extensively. For example, adding __lt__() will allow Python to compare the relative order of two of your objects. This means that not only will the < operator now work, but that >, <=, and >= will also work as well. Even better, if you have several objects of your new class in a list, then you can use sorted() on the list and they’ll be sorted using __lt__(). Once again, let’s take a look at your Python vs C++ comparison chart: Feature Python C++ Faster Execution x Cross-Platform Execution x Single-Type Variables x Multiple-Type Variables x Comprehensions x Rich Set of Built-In Algorithms x x Static Typing x Dynamic Typing x Strict Encapsulation x Now that you’ve seen object-oriented coding across both languages, let’s look at how Python and C++ manage those objects in memory. Memory Management One of the biggest differences, when you’re comparing Python vs C++, is how they handle memory. As you saw in the section about variables in C++ and Python’s names, Python does not have pointers, nor does it easily let you manipulate memory directly. While there are times when you want to have that level of control, most of the time it’s not necessary. Giving up direct control of memory locations brings a few benefits. You don’t need to worry about memory ownership, or making sure that memory is freed once (and only once) after it’s been allocated. You also never have to worry about whether or not an object was allocated on the stack or the heap, which tends to trip up beginning C++ developers. Python manages all of these issues for you. To do this everything in Python is a derived class from Python’s object. This allows the Python interpreter to implement reference counting as a means of keeping track of which objects are still in use and which can be freed. This convenience comes at a price, of course. To free allocated memory objects for you, Python will occasionally need to run what is called a garbage collector, which finds unused memory objects and frees them. Python uses two tools to free memory: 1. The reference counting collector 2. The generational collector Let’s look at each of these individually. Reference Counting Collector The reference counting collector is fundamental to the standard Python interpreter and is always running. It works by keeping track of how many times a given block of memory (which is always a Python object) has a name attached to it while your program is running. Many rules describe when the reference count is incremented or decremented, but an example of one case might clarify: >>> 1>>> x = 'A long string' 2>>> y = x 3>>> del x 4>>> del y In the above example, line 1 creates a new object containing the string "A long string". It then places the name x on this object, increasing the object’s reference count to 1: A Python object with reference count of one. On line 2 it assigns y to name the same object, which will increase the reference count to 2: A Python object with reference count of two. When you call del with x in line 3, you’re removing one of the references to the object, dropping the count back to 1: Two Python objects, each with reference count of one. Finally, when you remove y, the final reference to the object, its reference count drops to zero and it can be freed by the reference counting garbage collector. It may or may not be freed immediately at this point, but generally, that shouldn’t matter to the developer: The Python None object with reference count of two and another Python object with reference count of zero. While this will take care of finding and freeing many of the objects that need to be freed, there are a few situations it will not catch. For that, you need the generational garbage collector. Generational Garbage Collector One of the big holes in the reference counting scheme is that your program can build a cycle of references, where object A has a reference to object B, which has a reference back to object A. It’s entirely possible to hit this situation and have nothing in your code referring to either object. In this case, neither of the objects will ever hit a reference count of 0. The generational garbage collector involves a complex algorithm that is beyond the scope of this article, but it will find some of these orphaned reference cycles and free them for you. It runs on an occasional basis controlled by settings described in the documentation. One of these parameters is to disable this garbage collector entirely. When You Don’t Want Garbage Collection When you’re comparing Python vs C++, as when you’re comparing any two tools, each advantage comes with a trade-off. Python doesn’t require explicit memory management, but occasionally it will spend a longer amount of time than expected on garbage collection. The inverse is true for C++: your program will have consistent response times, but you’ll need to expend more effort in managing memory. In many programs the occasional garbage collection hit is unimportant. If you’re writing a script that only runs for 10 seconds, then you’re unlikely to notice the difference. Some situations, however, require consistent response times. Real-time systems are a great example, where responding to a piece of hardware in a fixed amount of time can be essential to the proper operation of your system. Systems with hard real-time requirements are some of the systems for which Python is a poor language choice. Having a tightly controlled system where you’re certain of the timing is a good use of C++. These are the types of issues to consider when you’re deciding on the language for a project. Time to update your Python vs C++ chart: Feature Python C++ Faster Execution x Cross-Platform Execution x Single-Type Variables x Multiple-Type Variables x Comprehensions x Rich Set of Built-In Algorithms x x Static Typing x Dynamic Typing x Strict Encapsulation x Direct Memory Control x Garbage Collection x Threading, Multiprocessing, and Async IO The concurrency models in C++ and Python are similar, but they have different results and benefits. Both languages have support for threading, multiprocessing, and Async IO operations. Let’s look at each of these. Threading While both C++ and Python have threading built into the language, the results can be markedly different, depending on the problem you’re solving. Frequently, threading is used to address performance problems. In C++, threading can provide a general speed-up for both computationally bound and I/O bound problems, as threads can take full advantage of the cores on a multiprocessor system. Python, on the other hand, has made a design trade-off to use the Global Interpreter Lock, or the GIL, to simplify its threading implementation. There are many benefits to the GIL, but the drawback is that only one thread will be running at a single time, even if there are multiple cores. If your problem is I/O bound, like fetching several web pages at once, then this limitation will not bother you in the least. You’ll appreciate Python’s easier threading model and built-in methods for inter-thread communications. If your problem is CPU-bound, however, then the GIL will restrict your performance to that of a single processor. Fortunately, Python’s multiprocessing library has a similar interface to its threading library. Multiprocessing Multiprocessing support in Python is built into the standard library. It has a clean interface that allows you to spin up multiple processes and share information between them. You can create a pool of processes and spread work across them using several techniques. While Python still uses similar OS primitives to create the new processes, much of the low-level complication is hidden from the developer. C++ relies on fork() to provide multiprocessing support. While this gives you direct access to all of the controls and issues of spawning multiple processes, it’s also much more complex. Async IO While both Python and C++ support Async IO routines, they’re handled differently. In C++, the std::async methods are likely to use threading to achieve the Async IO nature of their operations. In Python, Async IO code will only run on a single thread. There are trade-offs here as well. Using separate threads allows the C++ Async IO code to perform faster on computationally bound problems. The Python tasks used in its Async IO implementation are more lightweight, so it’s faster to spin up a large number of them to handle I/O bound issues. Your Python vs C++ comparison chart remains unchanged for this section. Both languages support a full range of concurrency options, with varying trade-offs between speed and convenience. Miscellaneous Issues If you’re comparing Python vs C++ and looking at adding Python to your toolbelt, then there are a few other things to consider. While your current editor or IDE will certainly work for Python, you might want to add certain extensions or language packs. It’s also worth giving PyCharm a look, as it’s Python-specific. Several C++ projects have Python bindings. Things like Qt, WxWidgets, and many messaging APIs having multiple-language bindings. If you want to embed Python in C++, then you can use the Python/C API. Finally, there are several methods for using your C++ skills to extend Python and add functionality, or to call your existing C++ libraries from within your Python code. Tools like CTypes, Cython, CFFI, Boost.Python and Swig can help you combine these languages and use each for what it’s best at. Summary: Python vs C++ You’ve spent some time reading and thinking about the differences between Python vs C++. While Python has easier syntax and fewer sharp edges, it’s not a perfect fit for all problems. You’ve looked at the syntax, memory management, processing, and several other aspects of these two languages. Let’s take a final look at your Python vs C++ comparison chart: Feature Python C++ Faster Execution x Cross-Platform Execution x Single-Type Variables x Multiple-Type Variables x Comprehensions x Rich Set of Built-In Algorithms x x Static Typing x Dynamic Typing x Strict Encapsulation x Direct Memory Control x Garbage Collection x If you’re comparing Python vs C++, then you can see from your chart that this is not a case where one is better than the other. Each of them is a tool that’s well crafted for various use cases. Just like you don’t use a hammer for driving screws, using the right language for the job will make your life easier! Conclusion Congrats! You’ve now seen some of the strengths and weaknesses of both Python and C++. You’ve learned some of the features of each language and how they are similar. You’ve seen that C++ is great when you want: • Fast execution speed (potentially at the cost of development speed) • Complete control of memory Conversely, Python is great when you want: • Fast development speed (potentially at the cost of execution speed) • Managed memory You’re now ready to make a wise language choice when it comes to your next project! 🐍 Python Tricks 💌 Get a short & sweet Python Trick delivered to your inbox every couple of days. No spam ever. Unsubscribe any time. Curated by the Real Python team. Python Tricks Dictionary Merge About Jim Anderson Jim Anderson Jim Anderson Jim has been programming for a long time in a variety of languages. He has worked on embedded systems, built distributed build systems, done off-shore vendor management, and sat in many, many meetings. » More about Jim Each tutorial at Real Python is created by a team of developers so that it meets our high quality standards. The team members who worked on this tutorial are: Master Real-World Python Skills With Unlimited Access to Real Python Join us and get access to hundreds of tutorials, hands-on video courses, and a community of expert Pythonistas: Level Up Your Python Skills » Master Real-World Python Skills With Unlimited Access to Real Python Join us and get access to hundreds of tutorials, hands-on video courses, and a community of expert Pythonistas: Level Up Your Python Skills » What Do You Think? Real Python Comment Policy: The most useful comments are those written with the goal of learning from or helping out other readers—after reading the whole article and all the earlier comments. Complaints and insults generally won’t make the cut here. What’s your #1 takeaway or favorite thing you learned? How are you going to put your newfound skills to use? Leave a comment below and let us know. Keep Learning Related Tutorial Categories: intermediate python
{ "url": "https://realpython.com/python-vs-cpp/", "source_domain": "realpython.com", "snapshot_id": "crawl=CC-MAIN-2021-25", "warc_metadata": { "Content-Length": "121568", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:DSPCI5A2WFZMO7STMOPUO32BOLC4MSUP", "WARC-Concurrent-To": "<urn:uuid:1b2edc84-e06d-49d7-b0c6-31399039c69b>", "WARC-Date": "2021-06-22T13:10:21Z", "WARC-IP-Address": "104.22.17.171", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:DXASTTFT4MAVK74O7TJ5R47KVV253YXQ", "WARC-Record-ID": "<urn:uuid:02fa7607-3217-47c8-bab7-b1717d0a910f>", "WARC-Target-URI": "https://realpython.com/python-vs-cpp/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:2749d888-11c7-4e89-96fe-f003813f2d50>" }, "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-37.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, 52, 53, 105, 106, 142, 143, 468, 469, 506, 507, 576, 652, 721, 722, 907, 908, 950, 951, 962, 963, 998, 999, 1218, 1219, 1533, 1534, 1819, 1820, 1851, 1852, 2114, 2115, 2152, 2153, 2395, 2396, 2448, 2449, 2535, 2536, 2766, 2767, 3109, 3110, 3153, 3154, 3291, 3292, 3625, 3626, 3690, 3691, 3841, 3842, 3870, 3871, 4231, 4232, 4368, 4369, 4608, 4609, 4751, 4752, 4771, 4790, 4817, 4818, 4959, 4960, 4979, 4980, 5076, 5077, 5092, 5116, 5143, 5162, 5163, 5224, 5225, 5236, 5237, 5541, 5542, 5772, 5773, 5942, 5943, 6250, 6251, 6514, 6515, 6636, 6637, 6657, 6658, 6921, 6922, 7096, 7097, 7129, 7140, 7152, 7183, 7191, 7201, 7210, 7227, 7248, 7285, 7294, 7303, 7312, 7321, 7333, 7348, 7349, 7471, 7472, 7668, 7669, 7916, 7917, 7978, 7979, 8008, 8015, 8021, 8027, 8031, 8035, 8036, 8156, 8157, 8180, 8181, 8437, 8438, 8515, 8516, 8699, 8700, 8704, 8731, 8749, 8752, 8778, 8797, 8812, 8833, 8866, 8870, 8900, 8922, 8957, 8958, 9274, 9275, 9524, 9525, 9537, 9585, 9586, 9745, 9746, 9750, 9775, 9796, 9798, 9840, 9861, 9880, 9926, 9947, 9970, 9999, 10020, 10046, 10047, 10137, 10138, 10446, 10447, 10462, 10463, 10672, 10673, 10893, 10894, 10898, 10927, 10944, 10945, 11066, 11067, 11136, 11137, 11141, 11193, 11209, 11216, 11217, 11323, 11324, 11372, 11373, 11451, 11490, 11491, 11621, 11622, 11652, 11686, 11704, 11742, 11748, 11750, 11751, 11946, 11947, 11964, 11984, 12001, 12032, 12033, 12303, 12304, 12329, 12330, 12471, 12472, 12627, 12628, 12632, 12655, 12666, 12671, 12682, 12688, 12751, 12766, 12771, 12787, 12793, 12809, 12815, 12816, 12949, 12950, 13005, 13006, 13024, 13055, 13056, 13367, 13368, 13372, 13404, 13434, 13472, 13478, 13518, 13523, 13524, 13744, 13745, 13749, 13772, 13795, 13828, 13834, 13867, 13872, 13873, 13981, 13982, 14069, 14070, 14089, 14108, 14135, 14159, 14185, 14202, 14238, 14239, 14314, 14315, 14340, 14341, 14525, 14526, 14540, 14541, 14784, 14785, 15097, 15098, 15302, 15303, 15315, 15316, 15546, 15547, 15579, 15613, 15653, 15699, 15700, 15766, 15767, 15795, 15811, 15812, 16113, 16114, 16128, 16152, 16175, 16176, 16193, 16211, 16212, 16260, 16261, 16271, 16281, 16291, 16301, 16311, 16321, 16331, 16341, 16351, 16361, 16362, 16513, 16514, 16778, 16779, 16974, 16975, 17094, 17095, 17130, 17168, 17211, 17247, 17304, 17305, 17410, 17411, 17493, 17494, 17504, 17505, 17717, 17718, 18021, 18022, 18239, 18240, 18254, 18255, 18589, 18590, 18849, 18850, 18920, 18921, 18940, 18959, 18986, 19010, 19036, 19053, 19089, 19105, 19122, 19123, 19198, 19199, 19227, 19228, 19455, 19456, 19469, 19470, 19690, 19691, 19841, 19842, 19953, 19954, 20176, 20177, 20189, 20190, 20291, 20292, 20630, 20631, 20781, 20782, 21033, 21034, 21071, 21072, 21382, 21383, 21765, 21766, 21966, 21967, 22187, 22188, 22220, 22249, 22269, 22270, 22411, 22412, 22731, 22732, 22878, 22879, 22949, 22950, 22969, 22988, 23015, 23039, 23065, 23082, 23118, 23134, 23151, 23174, 23175, 23307, 23308, 23326, 23327, 23682, 23683, 24032, 24033, 24303, 24304, 24515, 24516, 24554, 24555, 24593, 24625, 24626, 24668, 24669, 24698, 24699, 25082, 25083, 25087, 25113, 25125, 25137, 25149, 25150, 25327, 25328, 25373, 25374, 25468, 25469, 25514, 25515, 25634, 25635, 25689, 25690, 25961, 25962, 26069, 26070, 26263, 26264, 26295, 26296, 26666, 26667, 27010, 27011, 27050, 27051, 27447, 27448, 27847, 27848, 28143, 28144, 28185, 28186, 28205, 28224, 28251, 28275, 28301, 28318, 28354, 28370, 28387, 28410, 28434, 28455, 28456, 28497, 28498, 28712, 28713, 28723, 28724, 29113, 29114, 29404, 29405, 29845, 29846, 29862, 29863, 30129, 30130, 30270, 30271, 30458, 30459, 30468, 30469, 30721, 30722, 31014, 31015, 31202, 31203, 31224, 31225, 31542, 31543, 31672, 31673, 31744, 31745, 32043, 32044, 32067, 32068, 32362, 32363, 32427, 32428, 32447, 32466, 32493, 32517, 32543, 32560, 32596, 32612, 32629, 32652, 32676, 32697, 32698, 33010, 33011, 33022, 33023, 33189, 33190, 33235, 33236, 33308, 33339, 33340, 33383, 33384, 33456, 33475, 33476, 33560, 33561, 33579, 33580, 33728, 33729, 33760, 33761, 33780, 33781, 33807, 33808, 34010, 34011, 34028, 34029, 34188, 34189, 34258, 34259, 34371, 34372, 34402, 34403, 34435, 34472, 34473, 34585, 34586, 34616, 34617, 34636, 34637, 34888, 34889, 35037, 35038, 35052, 35053 ], "line_end_idx": [ 52, 53, 105, 106, 142, 143, 468, 469, 506, 507, 576, 652, 721, 722, 907, 908, 950, 951, 962, 963, 998, 999, 1218, 1219, 1533, 1534, 1819, 1820, 1851, 1852, 2114, 2115, 2152, 2153, 2395, 2396, 2448, 2449, 2535, 2536, 2766, 2767, 3109, 3110, 3153, 3154, 3291, 3292, 3625, 3626, 3690, 3691, 3841, 3842, 3870, 3871, 4231, 4232, 4368, 4369, 4608, 4609, 4751, 4752, 4771, 4790, 4817, 4818, 4959, 4960, 4979, 4980, 5076, 5077, 5092, 5116, 5143, 5162, 5163, 5224, 5225, 5236, 5237, 5541, 5542, 5772, 5773, 5942, 5943, 6250, 6251, 6514, 6515, 6636, 6637, 6657, 6658, 6921, 6922, 7096, 7097, 7129, 7140, 7152, 7183, 7191, 7201, 7210, 7227, 7248, 7285, 7294, 7303, 7312, 7321, 7333, 7348, 7349, 7471, 7472, 7668, 7669, 7916, 7917, 7978, 7979, 8008, 8015, 8021, 8027, 8031, 8035, 8036, 8156, 8157, 8180, 8181, 8437, 8438, 8515, 8516, 8699, 8700, 8704, 8731, 8749, 8752, 8778, 8797, 8812, 8833, 8866, 8870, 8900, 8922, 8957, 8958, 9274, 9275, 9524, 9525, 9537, 9585, 9586, 9745, 9746, 9750, 9775, 9796, 9798, 9840, 9861, 9880, 9926, 9947, 9970, 9999, 10020, 10046, 10047, 10137, 10138, 10446, 10447, 10462, 10463, 10672, 10673, 10893, 10894, 10898, 10927, 10944, 10945, 11066, 11067, 11136, 11137, 11141, 11193, 11209, 11216, 11217, 11323, 11324, 11372, 11373, 11451, 11490, 11491, 11621, 11622, 11652, 11686, 11704, 11742, 11748, 11750, 11751, 11946, 11947, 11964, 11984, 12001, 12032, 12033, 12303, 12304, 12329, 12330, 12471, 12472, 12627, 12628, 12632, 12655, 12666, 12671, 12682, 12688, 12751, 12766, 12771, 12787, 12793, 12809, 12815, 12816, 12949, 12950, 13005, 13006, 13024, 13055, 13056, 13367, 13368, 13372, 13404, 13434, 13472, 13478, 13518, 13523, 13524, 13744, 13745, 13749, 13772, 13795, 13828, 13834, 13867, 13872, 13873, 13981, 13982, 14069, 14070, 14089, 14108, 14135, 14159, 14185, 14202, 14238, 14239, 14314, 14315, 14340, 14341, 14525, 14526, 14540, 14541, 14784, 14785, 15097, 15098, 15302, 15303, 15315, 15316, 15546, 15547, 15579, 15613, 15653, 15699, 15700, 15766, 15767, 15795, 15811, 15812, 16113, 16114, 16128, 16152, 16175, 16176, 16193, 16211, 16212, 16260, 16261, 16271, 16281, 16291, 16301, 16311, 16321, 16331, 16341, 16351, 16361, 16362, 16513, 16514, 16778, 16779, 16974, 16975, 17094, 17095, 17130, 17168, 17211, 17247, 17304, 17305, 17410, 17411, 17493, 17494, 17504, 17505, 17717, 17718, 18021, 18022, 18239, 18240, 18254, 18255, 18589, 18590, 18849, 18850, 18920, 18921, 18940, 18959, 18986, 19010, 19036, 19053, 19089, 19105, 19122, 19123, 19198, 19199, 19227, 19228, 19455, 19456, 19469, 19470, 19690, 19691, 19841, 19842, 19953, 19954, 20176, 20177, 20189, 20190, 20291, 20292, 20630, 20631, 20781, 20782, 21033, 21034, 21071, 21072, 21382, 21383, 21765, 21766, 21966, 21967, 22187, 22188, 22220, 22249, 22269, 22270, 22411, 22412, 22731, 22732, 22878, 22879, 22949, 22950, 22969, 22988, 23015, 23039, 23065, 23082, 23118, 23134, 23151, 23174, 23175, 23307, 23308, 23326, 23327, 23682, 23683, 24032, 24033, 24303, 24304, 24515, 24516, 24554, 24555, 24593, 24625, 24626, 24668, 24669, 24698, 24699, 25082, 25083, 25087, 25113, 25125, 25137, 25149, 25150, 25327, 25328, 25373, 25374, 25468, 25469, 25514, 25515, 25634, 25635, 25689, 25690, 25961, 25962, 26069, 26070, 26263, 26264, 26295, 26296, 26666, 26667, 27010, 27011, 27050, 27051, 27447, 27448, 27847, 27848, 28143, 28144, 28185, 28186, 28205, 28224, 28251, 28275, 28301, 28318, 28354, 28370, 28387, 28410, 28434, 28455, 28456, 28497, 28498, 28712, 28713, 28723, 28724, 29113, 29114, 29404, 29405, 29845, 29846, 29862, 29863, 30129, 30130, 30270, 30271, 30458, 30459, 30468, 30469, 30721, 30722, 31014, 31015, 31202, 31203, 31224, 31225, 31542, 31543, 31672, 31673, 31744, 31745, 32043, 32044, 32067, 32068, 32362, 32363, 32427, 32428, 32447, 32466, 32493, 32517, 32543, 32560, 32596, 32612, 32629, 32652, 32676, 32697, 32698, 33010, 33011, 33022, 33023, 33189, 33190, 33235, 33236, 33308, 33339, 33340, 33383, 33384, 33456, 33475, 33476, 33560, 33561, 33579, 33580, 33728, 33729, 33760, 33761, 33780, 33781, 33807, 33808, 34010, 34011, 34028, 34029, 34188, 34189, 34258, 34259, 34371, 34372, 34402, 34403, 34435, 34472, 34473, 34585, 34586, 34616, 34617, 34636, 34637, 34888, 34889, 35037, 35038, 35052, 35053, 35101 ] }
{ "red_pajama_v2": { "ccnet_original_length": 35101, "ccnet_original_nlines": 628, "rps_doc_curly_bracket": 0.0005128100165165961, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.40741756558418274, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01826922968029976, "rps_doc_frac_lines_end_with_ellipsis": 0.001589830033481121, "rps_doc_frac_no_alph_words": 0.18695054948329926, "rps_doc_frac_unique_words": 0.20852753520011902, "rps_doc_mean_word_length": 4.7048163414001465, "rps_doc_num_sentences": 321, "rps_doc_symbol_to_word_ratio": 0.0004120900121051818, "rps_doc_unigram_entropy": 5.917581081390381, "rps_doc_word_count": 5793, "rps_doc_frac_chars_dupe_10grams": 0.056099798530340195, "rps_doc_frac_chars_dupe_5grams": 0.11245643347501755, "rps_doc_frac_chars_dupe_6grams": 0.09656944125890732, "rps_doc_frac_chars_dupe_7grams": 0.06905154883861542, "rps_doc_frac_chars_dupe_8grams": 0.060465969145298004, "rps_doc_frac_chars_dupe_9grams": 0.060465969145298004, "rps_doc_frac_chars_top_2gram": 0.006237389985471964, "rps_doc_frac_chars_top_3gram": 0.01023664977401495, "rps_doc_frac_chars_top_4gram": 0.009246010333299637, "rps_doc_books_importance": -3927.03076171875, "rps_doc_books_importance_length_correction": -3927.03076171875, "rps_doc_openwebtext_importance": -1699.128662109375, "rps_doc_openwebtext_importance_length_correction": -1699.128662109375, "rps_doc_wikipedia_importance": -1202.489990234375, "rps_doc_wikipedia_importance_length_correction": -1202.489990234375 }, "fasttext": { "dclm": 0.666870653629303, "english": 0.8959579467773438, "fineweb_edu_approx": 2.6497440338134766, "eai_general_math": 0.8416743874549866, "eai_open_web_math": 0.19644737243652344, "eai_web_code": 0.9510262608528137 } }
{ "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.1334", "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": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
2,455,629,904,485,728,000
projecteuler.net Coin sums Published on Friday, 22nd November 2002, 06:00 pm; Solved by 80961; Difficulty rating: 5% Problem 31 In the United Kingdom the currency is made up of pound (£) and pence (p). There are eight coins in general circulation: 1p, 2p, 5p, 10p, 20p, 50p, £1 (100p), and £2 (200p). It is possible to make £2 in the following way: 1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p How many different ways can £2 be made using any number of coins?
{ "url": "https://projecteuler.net/problem=31", "source_domain": "projecteuler.net", "snapshot_id": "crawl=CC-MAIN-2020-16", "warc_metadata": { "Content-Length": "5066", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:MOED3GTIA5RFZMJI54MT7TO5ZBYLZYHK", "WARC-Concurrent-To": "<urn:uuid:6a321b41-5d05-479b-82e7-1cc7196608e0>", "WARC-Date": "2020-04-08T13:17:45Z", "WARC-IP-Address": "31.170.122.77", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:QS4GWCC3SZBGKNSVWMMVP72RTIN7L7PX", "WARC-Record-ID": "<urn:uuid:d67b1a8a-903e-4147-b009-64800eaf268f>", "WARC-Target-URI": "https://projecteuler.net/problem=31", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:f1fcb0a1-687d-4f77-82a2-e5bbbccf864a>" }, "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-210.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, 17, 18, 28, 29, 97, 119, 120, 131, 132, 252, 253, 306, 307, 355, 356, 398, 399 ], "line_end_idx": [ 17, 18, 28, 29, 97, 119, 120, 131, 132, 252, 253, 306, 307, 355, 356, 398, 399, 464 ] }
{ "red_pajama_v2": { "ccnet_original_length": 464, "ccnet_original_nlines": 17, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.21259842813014984, "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.4409448802471161, "rps_doc_frac_unique_words": 0.8641975522041321, "rps_doc_mean_word_length": 4.172839641571045, "rps_doc_num_sentences": 4, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.186807632446289, "rps_doc_word_count": 81, "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.02958579920232296, "rps_doc_frac_chars_top_3gram": 0, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -71.4934310913086, "rps_doc_books_importance_length_correction": -74.51780700683594, "rps_doc_openwebtext_importance": -42.32703399658203, "rps_doc_openwebtext_importance_length_correction": -45.35141372680664, "rps_doc_wikipedia_importance": -44.30672073364258, "rps_doc_wikipedia_importance_length_correction": -47.33110427856445 }, "fasttext": { "dclm": 0.9082612991333008, "english": 0.9025838971138, "fineweb_edu_approx": 2.4282212257385254, "eai_general_math": 0.8421391844749451, "eai_open_web_math": 0.6046831607818604, "eai_web_code": 0.0030138499569147825 } }
{ "free_decimal_correspondence": { "primary": { "code": "511.6", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Arithmetic" } }, "secondary": { "code": "332.4", "labels": { "level_1": "Social sciences", "level_2": "Economics", "level_3": "Finance" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }
ece34605c058195ed03b4d393ef1a36c
1,763,281,669,172,515,600
health care cloud computing How Cloud Computing Can Address Healthcare Industry Challenges Healthcare & Cloud Computing The sustainability and welfare of mankind depends on the healthcare industry. Whereas the technologies aren’t utilized enough in the healthcare industry thus restricts the healthcare sector in the operational competence. There are still healthcare sectors which depend on paper records. As well as there are healthcare sectors that has digitized their information. The use of technology will help to coordinate care and ease between patients and physicians, in the midst of the medical community. Cloud computing is adopted globally to reform and modernize the healthcare sector. The healthcare industry is shifted into a model which helps to collectively support and coordinate the workflows and medical information. Cloud computing helps healthcare industry in storing large data, facilitates sharing of information among physicians and hospitals and increases the data analysis or tracking features. This helps with the treatments, performance of physicians or students, costs and studies. Overcome Challenges in Healthcare Industry through Cloud Computing In the healthcare industry, the utmost importance should be given to the following: security, confidentiality, availability of data to users, long-term preservation, data traceability and data reversibility. Some challenges faced by the healthcare industry in IT systems are with respect to exchange, maintenance or making use of huge information. Hence, while moving healthcare information into cloud computing, a careful thought should be given to the type of application i.e., clinical and nonclinical application the organization wants to go with. So, while moving the application into cloud deployment model, details, such as security, privacy and application requirements should be considered while setting up the healthcare digitally is required. The cloud services can be public, private or hybrid. For a clinical application, the cloud deployment will take place in private or hybrid cloud as they require the highest level of precautions. The nonclinical application will fit under public cloud deployment model.  Cloud computing is emerging as a vital technology in healthcare industry but still they are underutilized. The persons involved in the healthcare, like medical practitioners, hospitals, research facilities, etc., could consider different cloud service models that could address their business needs. The service models includes Software as a Service (SaaS), Infrastructure as a Service (IaaS) or Platform as a Service (PaaS). Among the three service models, SaaS, a pay-per-use business model is the most attractive option economically. Especially for the small hospitals or physicians as SaaS doesn’t need full-time IT personnel as well reduces the capital expenses needed for hardware, software or operating system. PaaS, is a perfect option for large-scale healthcare institutions who have the resources to develop the cloud solutions further. IaaS will be feasible for healthcare industry that could seek more scalable infrastructure. As IaaS is cost-effective as well provides scalability with security, flexibility, data protection and back-ups. Thus, cloud computing could be a permanent solution or game-changer for a healthcare industry; with respect to its service offerings, operating models, capabilities and end-user services. With cloud computing, the challenges faced in the healthcare industry with respect to managing the medical information, storing data, retrieving data or accessing could be eliminated. Meanwhile the healthcare industry can overtake other industries in use of technology with adoption of cloud services. Thus, accessing or monitoring the healthcare related information across the globe would be easier with implementation of cloud services. Related post from 8KMiles… How pharmaceuticals are securely embracing the cloud Keeping watch on AWS root user activity is normal or anomaly Avoid malicious cloud trial action in your AWS account cloud watch lamda 27 Best practice tips on amazon web services security groups
{ "url": "http://8kmiles.com/how-cloud-computing-can-address-healthcare-industry-challenges/", "source_domain": "8kmiles.com", "snapshot_id": "crawl=CC-MAIN-2017-39", "warc_metadata": { "Content-Length": "63302", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:4H366XIFIJPVBEQZYY3TCMEDCTHOYZXI", "WARC-Concurrent-To": "<urn:uuid:d5a9218b-039e-4c43-987e-8e3188946795>", "WARC-Date": "2017-09-25T11:36:03Z", "WARC-IP-Address": "54.82.16.186", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:CCE2HWAMOLDXNBD4ZRVRBWZPM7DFLMRO", "WARC-Record-ID": "<urn:uuid:5a092423-b03d-4741-acd3-df42f489aeb2>", "WARC-Target-URI": "http://8kmiles.com/how-cloud-computing-can-address-healthcare-industry-challenges/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:a8fc5491-46dd-4be5-a615-4db1fd4cd0b5>" }, "warc_info": "robots: classic\r\nhostname: ip-10-37-236-142.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-39\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for September 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }
{ "line_start_idx": [ 0, 28, 29, 92, 93, 122, 123, 620, 621, 1117, 1118, 1185, 1186, 1738, 1739, 2211, 2212, 2638, 2639, 2931, 2932, 3266, 3267, 3894, 3895, 3922, 3975, 3976, 4037, 4038, 4111, 4112 ], "line_end_idx": [ 28, 29, 92, 93, 122, 123, 620, 621, 1117, 1118, 1185, 1186, 1738, 1739, 2211, 2212, 2638, 2639, 2931, 2932, 3266, 3267, 3894, 3895, 3922, 3975, 3976, 4037, 4038, 4111, 4112, 4172 ] }
{ "red_pajama_v2": { "ccnet_original_length": 4172, "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.3385939598083496, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.005738880019634962, "rps_doc_frac_lines_end_with_ellipsis": 0.03125, "rps_doc_frac_no_alph_words": 0.12482065707445145, "rps_doc_frac_unique_words": 0.4457429051399231, "rps_doc_mean_word_length": 5.792988300323486, "rps_doc_num_sentences": 32, "rps_doc_symbol_to_word_ratio": 0.0014347200049087405, "rps_doc_unigram_entropy": 4.981738090515137, "rps_doc_word_count": 599, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.028242070227861404, "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.06743516027927399, "rps_doc_frac_chars_top_3gram": 0.042363110929727554, "rps_doc_frac_chars_top_4gram": 0.019884729757905006, "rps_doc_books_importance": -288.9283447265625, "rps_doc_books_importance_length_correction": -288.9283447265625, "rps_doc_openwebtext_importance": -126.04904174804688, "rps_doc_openwebtext_importance_length_correction": -126.04904174804688, "rps_doc_wikipedia_importance": -84.93917846679688, "rps_doc_wikipedia_importance_length_correction": -84.93917846679688 }, "fasttext": { "dclm": 0.10635823011398315, "english": 0.9375157952308655, "fineweb_edu_approx": 2.4138731956481934, "eai_general_math": 0.08772951364517212, "eai_open_web_math": 0.055445730686187744, "eai_web_code": 0.029134929180145264 } }
{ "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": "610", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Medicine", "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": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "6", "label": "Content Listing" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
2,178,165,578,140,224,500
question mishra.anurag643_153409 avatar image mishra.anurag643_153409 asked smadhavan edited What does "last component of primary key" mean when using the IN operator? if I need to update certain column with some value and this change needs to be done on multiple rows in that case I can use IN operator with where clause . But I was going through documentation and there is mentioned as below : " To specify more than one row, use primary_key_name IN ( primary_key_value, primary_key_value … ). This only works for the last component of the primary key." on above I understand we need to use primary key IN operator , but I am confused with "This only works for the last component of the primary key." what does above line indicate here ? [EDIT] Sample schema: CREATE TABLE killrvideo.poc ( id int, address text, name text, age text, education text, status text, PRIMARY KEY ((id, address), name, age) ) WITH CLUSTERING ORDER BY (name ASC, age ASC); cqlsh:killrvideo> select * from poc; id | address | name | age | education | status ----+---------+------+-----+-----------+-------- 4 | satna | RM | 23 | BE | Single 1 | satna | AM | 27 | BE | Single 2 | satna | RT | 31 | BE | Single 3 | Pune | AK | 27 | BE | Single update command : update poc set status = 'M' where age in ('27','31'); error : InvalidRequest: Error from server: code=2200 [Invalid query] message="Some partition key parts are missing: id, address" cql 10 |1000 Up to 8 attachments (including images) can be used with a maximum of 1.0 MiB each and 10.0 MiB total. 1 Answer Erick Ramirez avatar image Erick Ramirez answered smadhavan edited A primary key can be composed of: • a partition key column for a simple primary key • a composite partition key • a partition key + clustering column(s) for a compound primary key Here are some examples: SIMPLE PRIMARY KEY PRIMARY KEY (email) COMPOSITE PARTITION KEY PRIMARY KEY ((title, year)) COMPOUND PRIMARY KEY PRIMARY KEY (stock_id, exchange_time) PRIMARY KEY ((album, year), track_number) Where the primary key only contains a partition key, the last component is just the partition key column. For a compound primary, the last component is the last clustering column in the key. Cheers! [UPDATE] The issue with your query is that you haven't specified all the columns in the primary. As the error states, there are parts of the primary key missing namely id and address. You need to specify the partition key you are updating plus all the clustering columns to identify the row in the partition. The valid query is: UPDATE poc SET status = ? WHERE id = ? AND address = ? AND name = ? AND age IN (...); 12 comments Share 10 |1000 Up to 8 attachments (including images) can be used with a maximum of 1.0 MiB each and 10.0 MiB total. mishra.anurag643_153409 avatar image mishra.anurag643_153409 commented · I am clear with concepts explained above , my question is more specific related to update command for multi rows with IN operator when there is compound primary key .can you please illustrate with one example for update multiple rows when primary key is compound primary key . 0 Likes 0 · Erick Ramirez avatar image Erick Ramirez ♦♦ mishra.anurag643_153409 commented · I'm not sure which bit is unclear. Can you post the link to the document you were referring to? 0 Likes 0 · Erick Ramirez avatar image Erick Ramirez ♦♦ mishra.anurag643_153409 commented · I've updated my answer to take into account the sample schema and query you provided. Cheers! 0 Likes 0 ·
{ "url": "https://community.datastax.com:443/questions/9667/updating-multiple-rows-in-cassandra.html", "source_domain": "community.datastax.com:443", "snapshot_id": "crawl=CC-MAIN-2022-40", "warc_metadata": { "Content-Length": "161288", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:45FKDCYHTWWDXPUEO7DCSOPDI3DMKVRI", "WARC-Concurrent-To": "<urn:uuid:fb32300f-c78b-453f-ad96-313accc0f7e7>", "WARC-Date": "2022-10-04T16:55:16Z", "WARC-IP-Address": "34.200.198.167", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:DATVDES635PUNM7MDM2DQTWVTLXIXQ3E", "WARC-Record-ID": "<urn:uuid:4d72dc8d-0aee-4ab1-bcce-51e7cc75ac40>", "WARC-Target-URI": "https://community.datastax.com:443/questions/9667/updating-multiple-rows-in-cassandra.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:43016d49-a5f5-47a4-94f1-de074067f412>" }, "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-72\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 9, 10, 47, 94, 95, 170, 171, 399, 400, 560, 561, 708, 709, 746, 747, 769, 770, 800, 812, 830, 845, 859, 879, 896, 939, 987, 1024, 1072, 1121, 1169, 1217, 1265, 1313, 1314, 1331, 1332, 1386, 1387, 1395, 1396, 1517, 1521, 1530, 1531, 1633, 1634, 1643, 1644, 1671, 1711, 1712, 1746, 1747, 1799, 1829, 1899, 1900, 1924, 1925, 1944, 1945, 1969, 1970, 1994, 1995, 2027, 2028, 2049, 2050, 2092, 2138, 2139, 2338, 2339, 2523, 2524, 2649, 2650, 2670, 2671, 2682, 2699, 2761, 2779, 2788, 2789, 2891, 2892, 2965, 2966, 3243, 3244, 3256, 3336, 3337, 3433, 3434, 3446, 3526, 3527, 3621, 3622 ], "line_end_idx": [ 9, 10, 47, 94, 95, 170, 171, 399, 400, 560, 561, 708, 709, 746, 747, 769, 770, 800, 812, 830, 845, 859, 879, 896, 939, 987, 1024, 1072, 1121, 1169, 1217, 1265, 1313, 1314, 1331, 1332, 1386, 1387, 1395, 1396, 1517, 1521, 1530, 1531, 1633, 1634, 1643, 1644, 1671, 1711, 1712, 1746, 1747, 1799, 1829, 1899, 1900, 1924, 1925, 1944, 1945, 1969, 1970, 1994, 1995, 2027, 2028, 2049, 2050, 2092, 2138, 2139, 2338, 2339, 2523, 2524, 2649, 2650, 2670, 2671, 2682, 2699, 2761, 2779, 2788, 2789, 2891, 2892, 2965, 2966, 3243, 3244, 3256, 3336, 3337, 3433, 3434, 3446, 3526, 3527, 3621, 3622, 3633 ] }
{ "red_pajama_v2": { "ccnet_original_length": 3633, "ccnet_original_nlines": 102, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.26960110664367676, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.08115542680025101, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.2654745578765869, "rps_doc_frac_unique_words": 0.36964285373687744, "rps_doc_mean_word_length": 4.719642639160156, "rps_doc_num_sentences": 37, "rps_doc_symbol_to_word_ratio": 0.0027510300278663635, "rps_doc_unigram_entropy": 4.886025905609131, "rps_doc_word_count": 560, "rps_doc_frac_chars_dupe_10grams": 0.15588347613811493, "rps_doc_frac_chars_dupe_5grams": 0.18577374517917633, "rps_doc_frac_chars_dupe_6grams": 0.1691259890794754, "rps_doc_frac_chars_dupe_7grams": 0.15588347613811493, "rps_doc_frac_chars_dupe_8grams": 0.15588347613811493, "rps_doc_frac_chars_dupe_9grams": 0.15588347613811493, "rps_doc_frac_chars_top_2gram": 0.07188800722360611, "rps_doc_frac_chars_top_3gram": 0.024214910343289375, "rps_doc_frac_chars_top_4gram": 0.017026109620928764, "rps_doc_books_importance": -377.05279541015625, "rps_doc_books_importance_length_correction": -377.05279541015625, "rps_doc_openwebtext_importance": -213.4602813720703, "rps_doc_openwebtext_importance_length_correction": -213.4602813720703, "rps_doc_wikipedia_importance": -181.6254119873047, "rps_doc_wikipedia_importance_length_correction": -181.6254119873047 }, "fasttext": { "dclm": 0.6116604804992676, "english": 0.819730818271637, "fineweb_edu_approx": 1.9924522638320923, "eai_general_math": 0.363932728767395, "eai_open_web_math": 0.18017441034317017, "eai_web_code": 0.5368891954421997 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.746", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
7,623,673,301,559,631,000
PR  CentOSのネットワーク経由でのインストールが終わったら,ホーム・サーバー上でメール・サービスを稼働させよう。今回は,携帯電話にメールを転送したり,Web画面でメールを見たりできるようにする。  前回は,今となっては旧型の携帯ノートPC「ThinkPad s30」に,Linuxディストリビューションの「CentOS」をネットワーク・インストールして,ホーム・サーバーの“土台”を構築した。今回は,ホーム・サーバー上で動かすサーバー・アプリケーションとして,メール・サービスを導入してみよう。  自宅で利用するメール・サービスは,インターネット・プロバイダが提供するものを使っている場合が多いだろう。プロバイダのサーバーから直接メーラー(メール・クライアント)でメールを送受信する形態だ。  ところが,ホーム・サーバー上でメール・サービスを稼働させると,プロバイダで契約しているメールをフィルタリングしたり,携帯電話に転送したり,Webメールを稼働できたりする。今回は,これらのサービスを実現してみよう。 CentOSのバージョン4.4が登場  本題に入る前に,ここで使用するCentOS 4.4について触れておきたい(注:2007年6月20日現在,既にCentOS5,およびCentOS4.5が公開されている。関連記事1関連記事2を参照)。  バージョン4.4は,ThinkPad s30に導入したCentOS 4.3の新版である。これから導入するのであれば,前回と同じ手順で新版をインストールしよう。  既にバージョン4.3をインストールしていれば,yumコマンドを使って簡単にアップデートできる。 # yum update # yum upgrade  バージョン4.4になって,一部のサーバー・アプリケーションの設定ファイルのフォーマットが変更されている。今回から,バージョン4.4の利用を前提に説明する。 メール・サーバーを構築する  ホーム・サーバーでメール・サービスを稼働させれば,次に挙げるようなことを実現できる。 ・スパムを退治する  「メール最大の悩みはスパム」という読者は少なくないはずだ。そこでスパム・フィルタを活用してスパム・メールを排除しよう。 ・携帯電話などにメールを転送する  携帯電話でのパケット通信の定額化やメール・サービスの無料化を追い風に,携帯電話をより一層活用するユーザーが増えている。ここでは,プロバイダあてに届いたメールを携帯電話に転送する。 ・別のネットワークから閲覧する  プロバイダのメール・サービスは,セキュリティ上の配慮から,外部ネットワークからのメール閲覧を許可していないケースが多い。そこで,別のネットワーク環境からメールを閲覧できるよう,Webメールを稼働する。  今回は,この3点を実現する。そのために,必要なのは図1にあるようなシステムだ。簡単に説明すると,まずプロバイダのメール・サーバーから「Fetchmail」でメールを受信する。サーバーに置くメール・サーバーには「Postfix」を利用する。CentOSは標準のメール・サーバーとして「sendmail」を採用するが,設定や管理が簡単なPostfixを利用する。 図1●今回作成するシステムのメールの流れ 図1●今回作成するシステムのメールの流れ Fetchmailがプロバイダのメール・サーバーからのメールを受信する。 [画像のクリックで拡大表示]  次に,「Procmail」とスパム・フィルタの「SpamAssassin」「bsfilter」を組み合わせて,スパム・メールを排除する。携帯電話への転送は,Procmailが行う。最後に,IMAPサーバーの「Dovecot」を稼働し,Webメーラー・ソフト「Squirrelmail」を使って,Webブラウザからメールが見られるようにする。 Postfixのインストールと設定  図1のシステムで核になるのはPostfixである。Postfixから導入していこう。  PostfixとProcmail,デフォルト(初期設定)のメール・サーバーを切り替える「system-switch-mail」をまとめてインストールする。  なお,サーバーを構築する作業は,すべて管理者権限で行う。 # yum install system-switch-mail postfix procmail  インストールができたら,system-switch-mailコマンドを実行し,デフォルトのメール・サーバーをPostfixに変更する(写真1)。 写真1●デフォルトのメール・サーバーをPostfixに切り替える 写真1●デフォルトのメール・サーバーをPostfixに切り替える 矢印キーで「Postfix」を選択し,Tabキーでカーソルを「Ok」ボタンに合わせてスペース・キーを押す。  続いて,Postfixの設定を行う。/etc/postfix/main.cfファイルをテキスト・エディタで開き,図2に示す行を変更する。main.cfの設定項目は多いが,今回のように自宅のLAN内で利用するなら,初期設定から変更すべき個所は少ない。 ……# myhostname = bigbird2.localnet.mda.or.jp …… inet_interfaces = all …… mydestination = $myhostname, localhost.$mydomain, localhost …… home_mailbox = Maildir/ …… mailbox_command = /usr/bin/procmail …… mynetworks = 192.168.1.0/24, 127.0.0.0/8 …… 図2●/etc/postfix/main.cfファイルの変更例  「myhostname」には,通常,このサーバーのFQDNを記述するが,LAN内には正式なFQDNが与えられていない。したがって,コメントアウトする。  「home_mailbox」の右辺は,メールをスプールする「Maildir/」ディレクトリを指定する。後述するIMAPサーバーのDovecotが利用するディレクトリだ。  「mailbox_command」の右辺には,Procmailを指定しておく。  「mynetwork」の右辺には,このメール・サーバーを利用するホストのIPアドレスを設定する。もし,このPostfixにメールをリレーさせない(ローカル配信のみ利用)のなら,「127.0.0.0/8」を設定しておくだけでよい。リレーをさせるのなら,図2のようにLANのIPアドレスもカンマ区切りで設定しておこう。  以上を編集してmain.cfファイルを保存する。そしてホーム・ディレクトリにメール・スプール用のMaildirディレクトリを作成する。 # mkdir /home/yoneda/Maildir # chmod 700 /home/yoneda/Maildir # chown -R yoneda:yoneda /home/yoneda/Maildir  上記はユーザー名「yoneda」の例だ。メールを利用するすべてのアカウントについて上記のようにMaildirを作成しておく。  以上を実行したら,最後にPostfixを再起動する。 # /etc/init.d/postfix restart スパム・フィルタの設定  スパム・フィルタは,万全とは言えないまでも,スパムの被害を減らすのに役に立つ。UNIX系では,SpamAssassinが広く利用されている。  SpamAssassinは,キーワードなどを指定したルールによるスパム検出に加えて,学習機能を持つ「ベイジアン・フィルタ」による検出機能も備える。ただし,SpamAssassinでも検出できないスパムもある。そこで今回はスパム・フィルタをもう一つ加えて,スパム検出の精度を上げることにする。  追加するのは,Rubyで記述された国産のスパム・フィルタ「bsfilter」だ。検出方法にはベイジアン・フィルタを使用,優れた日本語のトークン解析機能を持つ。筆者が使用した印象では,日本語のスパム・メールの検出精度は,SpamAssassinよりもbsfilterの方が高い。  SpamAssassinはCentOSのパッケージに含まれており,yumコマンドでインストールできる。 # yum install spamassassin  一方,bsfilterはCentOSのパッケージとしては提供されていない。前述したように,bsfilterはRubyを使用するため,先にインストールしておく。 # yum install ruby  次に,bsfilterのバイナリ・アーカイブを入手する。2006年9月上旬時点では,バージョン1.0.14が最新だった。バイナリ・アーカイブである「bsfilter-1.0.14.tgz」を次の公式サイトから入手する。 ■bsfilter http://bsfilter.org/  入手できたら,次のコマンドで展開しよう。 # tar xvzf bsfilter-1.0.14.tgz  bsfilter-1.0.14ディレクトリに展開されるので,Rubyスクリプト(UNIX向け)を/usr/local/bin/の下にコピーすれば,bsfilterを利用できる。 # cp bsfilter-1.0.14/bsfilter/bsfilter /usr/local/bin/  最後に,Procmailのシステム共通設定ファイル/etc/procmailrcを図3のように設定する。 PATH=/bin:/usr/bin MAILDIR=$HOME/Maildir DEFAULT=$MAILDIR/ LOGFILE=$MAILDIR/procmail.log LOCKFILE=$HOME/.lockmail :0fw |/usr/bin/spamc :0 fw | /usr/local/bin/bsfilter --pipe --insert-flag --insert-probability 図3●/etc/procmailrcファイルを編集する  これで,受信したすべてのメールはスパム・フィルタのSpamAssassinとbsfilterのチェックを受けるようになる。 DovecotとSquirrelmailの設定  続いて,IMAPサーバーのDovecotを導入し,Webメーラー・ソフトのSquirrelmailを設定しよう。  まず,Dovecotをインストールする。 # yum install dovecot  Dovecotの設定ファイルは,/etc/dovecot.confである。サーバーをLAN内で設置する場合であれば,テキスト・エディタで「protocols」から始まる行を次のように書き換えるだけだ。 protocols = imap  これでDovecotをIMAPサーバーとして稼働できる。設定を変えたら再起動しておこう。 # /etc/init.d/dovecot restart  続いてSquirrelmailを設定する。Squirrelmailは,Webブラウザからメールを見られるようにするため,HTTPサーバー(Apache HTTP Server)とPHPも必要である。そこで,まとめてインストールしよう。 # yum install httpd php squirrelmail  インストールできたら,正しく動作しているか,調べてみよう。  まずは,ドキュメント・ルートの/var/www/htmlディレクトリに,次の内容のファイルを「phpinfo.php」という名前で保存する。  次に,Webブラウザで次のURLにアクセスする。 http://localhost/phpinfo.php  これで,写真2のような表示が出れば,正しくインストールされている。もし表示されない場合は,Webサーバーを再起動してみよう。 写真2●テスト・ファイルphpinfo.phpを表示したところ 写真2●テスト・ファイルphpinfo.phpを表示したところ [画像のクリックで拡大表示] # /etc/init.d/httpd restart  PHPの動作が確認できたら,Squirrelmailの設定に移ろう。カレント・ディレクトリを/usr/share/squirrelmail/configに変更し,このディレクトリにあるconf.plを実行しよう。 # cd /usr/share/squirrelmail/config# ./conf.pl  すると写真3の設定メニューが現れる。まず,「C」を入力して,カラー・モードをオフにする。コンソールの文字が見えない場合があるからだ。続いて,「2」として「Server Settings」を選択しよう。ここで「A」と入力してIMAPサーバーの設定を変更する(写真4)。 写真3●Squirrelmailの設定メニュー 写真3●Squirrelmailの設定メニュー [画像のクリックで拡大表示] 写真4●IMAP Serverの設定を変更する 写真4●IMAP Serverの設定を変更する [画像のクリックで拡大表示]  写真4では,「Server software」を「other」に,「Delimiter」(フォルダの区切り文字)を「.」(ピリオド)に換えておく。そのほかの設定についても,写真4と同じになっているかを確認する。  これでOKだ。最後に「S」と入力して設定を保存してから,「Q」と入力して設定メニューを終了させる。 設定を終わったら,次のURLをWebブラウザに入力する。 http://localhost/webmail  設定が正しくできていれば,ログイン画面が表示されるはずだ。サーバーに登録されたユーザー名とパスワードを入力すればログインできる(写真5)。 タイトル 写真5●Squirrelmailにログインした  写真5は,筆者が使用しているため,既にフォルダがいくつか設定されている。初期状態では受信箱(INBOXフォルダ),ゴミ箱(Trashフォルダ),送信済みフォルダ(Sentフォルダ)しか見えない。後述するスパム処理を行うために必要な「Junk」というフォルダを,画面上部の「フォルダ」というリンクをクリックして作成する。  なお,今回設置したIMAPサーバーは,ThunderbirdといったIMAPをサポートするメーラーでも利用できる。使い慣れたメール・クライアントでも試してみよう。 ユーザー別の設定を行う  以上でサーバー側の設定は完了した。続いて各ユーザーの設定を行う。  まずは,管理者権限から,実際にメールを利用するユーザー・アカウントに切り替える。  次に,スパム・メールを処理するProcmailを設定する。ホーム・ディレクトリに,p.88の図4を参考にした「.procmailrc」というファイルを作成する。.(ピリオド)から始まるため,隠しファイルとして見えないことがある。設定を変更して見てほしい。 図4●~/.procmailrcの例 図4●~/.procmailrcの例  図4の設定例では,次の条件を満たすメールが,Junkフォルダに移動する。 ・ホーム・ディレクトリにある.spammer_fromファイルに 記述されている送信元からのメール ・SpamAssassinでスパムと判定されたメール・bsfilterで スパムと判定されたメール  なお,IMAPフォルダはMaildirディレクトリにあり,ピリオドが区切り文字として使用されている。IMAP上でのJunkフォルダは,「~/Maildir/.Junk」と指定する必要があるので注意してほしい。  次に,既にスパムの送信元と分かっているメール・アドレスを,ホーム・ディレクトリ以下に作成する「.spammer_from」ファイル内に,改行区切りで次のように列記しておく。 [email protected]@spammer.org……  これで,記述されているアドレスからのスパム・メールは,無条件でJunkフォルダに移動する。  次は,携帯電話へのメール転送の設定だ。携帯電話は大きなサイズのメールを扱えないことが多い。例では10000バイト以下のメールに限定した。また,HTMLメールも携帯電話では扱えないことがあるため,転送しないように設定した。バイト数などは,携帯電話の仕様やキャリアに応じて調節しよう。 プロバイダからのメール受信  次に,インターネット・プロバイダのメール・サーバーからメールを受信する設定を施す。受信には,Fetchmailを利用する。既にインストールされているので,設定するだけだ。  メールを利用する一般ユーザーのアカウントでホーム・ディレクトリに「.fetchmailrc」というファイルを作成し,図5のように記述しよう。「poll」の横にインターネット・プロバイダのメール・サーバーのホスト名またはIPアドレスを記述する。「user」と「pass」には,それぞれユーザー名とパスワードを設定する。 図5●~/.fetchmailrcの例 図5●~/.fetchmailrcの例  最後は定期実行するために,「cron」にFetchmailを登録する。cronの設定は,次のようにコマンドを実行すると,個人用の設定ファイル(crontab)がGNOMEエディタで開かれる。 $ EDITOR=gedit crontab -e  設定例を図6に示す。 # 15分おきにメールをプロバイダからメールを受信 */15 * * * * /usr/bin/fetchmail -s >/dev/null 2>&1 # 午前2時にJunkフォルダの既読メールをスパムと学習(spamassassin) 0 2 * * * /usr/bin/sa-learn --spam --dir $HOME/Maildir/.Junk/cur/ >/dev/null 2>&1 # 午前3時にINBOXフォルダの既読メールを非スパムと学習(spamassassin) 0 3 * * * /usr/bin/sa-learn --ham --dir $HOME/Maildir/.INBOX/cur/ >/dev/null 2>&1 # 午前4時にJunkフォルダの既読メールをスパムと学習(bsfilter) 0 4 * * * /usr/local/bin/bsfilter --add-spam $HOME/Maildir/.Junk/cur/* >/dev/null 2>&1 # 午前5時にINBOXフォルダの既読メールを非スパムと学習(bsfilter) 0 5 * * * /usr/local/bin/bsfilter --add-clean $HOME/Maildir/.INBOX/cur/* >/dev/null 2>&1 # 午前5時30分にbsfilterのスパム・データベースをアップデート 30 5 * * * /usr/local/bin/bsfilter --update >/dev/null 2>&1 図6●crontabの設定例  図6の設定では,プロバイダのメールを15分おきに受信する。午前2時以降の深夜には,自動的にSpamAssassinとbsfilterの学習プロセスを起動して,ベイジアン・フィルタの精度を向上させる。  その際は,Junkフォルダの既読メール(Dovecotでは,フォルダ内のcur以下に既読メールが格納される)をスパムと学習する。同時に,INBOXフォルダの既読メールを非スパムとして学習する。これで,bsfilterでスパムと判定されたが,SpamAssassinでは非スパムと判定されたメール,あるいは逆の場合もスパムとして学習できる。  これで,ThnkPad s30を使ったメール・サーバーを構築できた。プロバイダのメール・アカウントを使いつつ,転送やスパム処理を自前で行うだけで,かなり便利に使えるようになったはずだ。  次回はWebサーバーなど定番のサーバー・アプリケーションをセットアップする。
{ "url": "https://xtech.nikkei.com/it/article/COLUMN/20070611/274348/", "source_domain": "xtech.nikkei.com", "snapshot_id": "crawl=CC-MAIN-2020-10", "warc_metadata": { "Content-Length": "104295", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:UQQRTFS6DN3YP26REXYR4OUCY6MNUH6B", "WARC-Concurrent-To": "<urn:uuid:e6da327f-8462-4847-bfbb-725f0e4d6949>", "WARC-Date": "2020-02-29T07:26:59Z", "WARC-IP-Address": "54.64.138.104", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:DVVELTX3K2G5RWMAWAHXID2ZRWWEVJFD", "WARC-Record-ID": "<urn:uuid:b56ad8b8-47d1-4e3e-90bc-91c988105458>", "WARC-Target-URI": "https://xtech.nikkei.com/it/article/COLUMN/20070611/274348/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:ae750407-288a-4afd-964d-a049f4877544>" }, "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-109.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, 3, 4, 103, 104, 254, 255, 353, 354, 462, 463, 482, 483, 583, 584, 665, 666, 715, 716, 729, 743, 744, 823, 824, 838, 839, 883, 884, 894, 895, 956, 957, 974, 975, 1066, 1067, 1083, 1084, 1186, 1187, 1368, 1369, 1390, 1411, 1448, 1463, 1464, 1636, 1637, 1655, 1656, 1700, 1701, 1780, 1781, 1811, 1812, 1862, 1863, 1937, 1938, 1971, 2004, 2058, 2059, 2185, 2186, 2231, 2234, 2256, 2259, 2319, 2322, 2346, 2349, 2385, 2388, 2429, 2432, 2464, 2465, 2542, 2543, 2629, 2630, 2671, 2672, 2831, 2832, 2901, 2902, 2931, 2964, 3010, 3011, 3075, 3076, 3104, 3105, 3135, 3136, 3148, 3149, 3221, 3222, 3369, 3370, 3510, 3511, 3564, 3565, 3592, 3593, 3674, 3675, 3694, 3695, 3806, 3807, 3817, 3838, 3839, 3861, 3862, 3893, 3894, 3984, 3985, 4040, 4041, 4095, 4096, 4097, 4116, 4138, 4156, 4186, 4211, 4212, 4217, 4233, 4234, 4240, 4308, 4336, 4337, 4400, 4401, 4425, 4426, 4484, 4485, 4507, 4508, 4530, 4531, 4633, 4634, 4651, 4652, 4698, 4699, 4729, 4730, 4849, 4850, 4887, 4888, 4919, 4920, 4992, 4993, 5019, 5020, 5049, 5050, 5114, 5115, 5147, 5179, 5194, 5195, 5223, 5224, 5332, 5333, 5380, 5381, 5516, 5517, 5541, 5565, 5580, 5581, 5605, 5629, 5644, 5645, 5752, 5753, 5833, 5834, 5859, 5860, 5931, 5932, 5937, 5961, 5962, 6123, 6124, 6207, 6208, 6220, 6221, 6255, 6256, 6298, 6299, 6428, 6429, 6448, 6467, 6468, 6506, 6507, 6540, 6557, 6594, 6607, 6608, 6714, 6715, 6803, 6804, 6841, 6842, 6889, 6890, 7032, 7033, 7047, 7048, 7135, 7136, 7296, 7297, 7317, 7337, 7338, 7435, 7436, 7462, 7463, 7475, 7476, 7502, 7553, 7554, 7597, 7625, 7680, 7725, 7753, 7808, 7809, 7848, 7882, 7936, 7977, 8011, 8067, 8068, 8105, 8165, 8180, 8181, 8282, 8283, 8454, 8455, 8549, 8550 ], "line_end_idx": [ 3, 4, 103, 104, 254, 255, 353, 354, 462, 463, 482, 483, 583, 584, 665, 666, 715, 716, 729, 743, 744, 823, 824, 838, 839, 883, 884, 894, 895, 956, 957, 974, 975, 1066, 1067, 1083, 1084, 1186, 1187, 1368, 1369, 1390, 1411, 1448, 1463, 1464, 1636, 1637, 1655, 1656, 1700, 1701, 1780, 1781, 1811, 1812, 1862, 1863, 1937, 1938, 1971, 2004, 2058, 2059, 2185, 2186, 2231, 2234, 2256, 2259, 2319, 2322, 2346, 2349, 2385, 2388, 2429, 2432, 2464, 2465, 2542, 2543, 2629, 2630, 2671, 2672, 2831, 2832, 2901, 2902, 2931, 2964, 3010, 3011, 3075, 3076, 3104, 3105, 3135, 3136, 3148, 3149, 3221, 3222, 3369, 3370, 3510, 3511, 3564, 3565, 3592, 3593, 3674, 3675, 3694, 3695, 3806, 3807, 3817, 3838, 3839, 3861, 3862, 3893, 3894, 3984, 3985, 4040, 4041, 4095, 4096, 4097, 4116, 4138, 4156, 4186, 4211, 4212, 4217, 4233, 4234, 4240, 4308, 4336, 4337, 4400, 4401, 4425, 4426, 4484, 4485, 4507, 4508, 4530, 4531, 4633, 4634, 4651, 4652, 4698, 4699, 4729, 4730, 4849, 4850, 4887, 4888, 4919, 4920, 4992, 4993, 5019, 5020, 5049, 5050, 5114, 5115, 5147, 5179, 5194, 5195, 5223, 5224, 5332, 5333, 5380, 5381, 5516, 5517, 5541, 5565, 5580, 5581, 5605, 5629, 5644, 5645, 5752, 5753, 5833, 5834, 5859, 5860, 5931, 5932, 5937, 5961, 5962, 6123, 6124, 6207, 6208, 6220, 6221, 6255, 6256, 6298, 6299, 6428, 6429, 6448, 6467, 6468, 6506, 6507, 6540, 6557, 6594, 6607, 6608, 6714, 6715, 6803, 6804, 6841, 6842, 6889, 6890, 7032, 7033, 7047, 7048, 7135, 7136, 7296, 7297, 7317, 7337, 7338, 7435, 7436, 7462, 7463, 7475, 7476, 7502, 7553, 7554, 7597, 7625, 7680, 7725, 7753, 7808, 7809, 7848, 7882, 7936, 7977, 8011, 8067, 8068, 8105, 8165, 8180, 8181, 8282, 8283, 8454, 8455, 8549, 8550, 8589 ] }
{ "red_pajama_v2": { "ccnet_original_length": 8589, "ccnet_original_nlines": 282, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.010296789929270744, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.029073290526866913, "rps_doc_frac_lines_end_with_ellipsis": 0.02473497949540615, "rps_doc_frac_no_alph_words": 0.742580235004425, "rps_doc_frac_unique_words": 0.7876448035240173, "rps_doc_mean_word_length": 31.532817840576172, "rps_doc_num_sentences": 71, "rps_doc_symbol_to_word_ratio": 0.024227740243077278, "rps_doc_unigram_entropy": 5.15792989730835, "rps_doc_word_count": 259, "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.006611980032175779, "rps_doc_frac_chars_top_3gram": 0.006611980032175779, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -770.8783569335938, "rps_doc_books_importance_length_correction": -770.8783569335938, "rps_doc_openwebtext_importance": -376.80908203125, "rps_doc_openwebtext_importance_length_correction": -376.80908203125, "rps_doc_wikipedia_importance": -335.1065673828125, "rps_doc_wikipedia_importance_length_correction": -335.1065673828125 }, "fasttext": { "dclm": 0.9845900535583496, "english": 0.00009239000064553693, "fineweb_edu_approx": 1.7140460014343262, "eai_general_math": 0.5331390500068665, "eai_open_web_math": 0.02151579037308693, "eai_web_code": 0.17211884260177612 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.442", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
4,316,287,651,191,930,400
PDA View Full Version : Get URL Bar and Tab Bar in Same Row like IE9 in Firefox razorsedge 04-22-2011, 11:51 PM The most impressive thing in Microsoft's latest web browser IE9 is its minimal and clean interface. Many people like how the URL bar and Tab bar are shown in a single row saving space and giving a sleek look to the browser. In this tutorial, we'll learn how to get the same look in Mozilla Firefox? First you'll need to install the add-ons given in following tutorial: viewtopic.php?f=108&t=8915 ([Only registered and activated users can see links]) After that, follow these simple steps to get Tab bar and URL bar in same row: 1. Right-click on toolbar and select Customize. 2. Now drag-n-drop back/forward buttons, URL bar or addressbar, Searchbox (if you installed Omnibar, it'll be already moved along with URL bar), Stop/Refresh buttons to Tab Bar. 42012 3. Close Customize window and right-click on toolbar and deselect "Navigation Toolbar". 4. Now install "Stylish" add-on. When its installed, click on its icon in Add-on Bar and select "Write new style -> Blank style" option. It'll open a new window. Type any desired name like "IE Interface" in Name box and paste following code in big text area: #urlbar-container { max-width: 600px !important; min-width: 100px !important; } 42013 NOTE: Here 600 is the maximum size of URL bar and 100 is the minimum size. You can change them according to your requirements. 5. That's it. Click on Save button and you'll get URL bar and Tab bar in same row similar to IE9. 42014 You can resize URL bar. Just click on the blank space between URL bar and Tabs and move the cursor to left or right.
{ "url": "http://virtualcustoms.net/archive/index.php/t-33096.html", "source_domain": "virtualcustoms.net", "snapshot_id": "crawl=CC-MAIN-2013-20", "warc_metadata": { "Content-Length": "4940", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:OOU3XUHVBDFY4JUYOSTE65C24SA5W5PD", "WARC-Concurrent-To": "<urn:uuid:f0c6c59c-2be7-4d32-b9e8-208f51fb1514>", "WARC-Date": "2013-05-20T09:12:06Z", "WARC-IP-Address": "184.95.49.147", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:GJBUR5LABP72WYPXPAWRBAJOP435CXVY", "WARC-Record-ID": "<urn:uuid:af1b7748-02bd-4bb9-b5a6-11d72688f05f>", "WARC-Target-URI": "http://virtualcustoms.net/archive/index.php/t-33096.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:7416b047-abb0-47b5-b120-f975463efa10>" }, "warc_info": "robots: classic\r\nhostname: ip-10-60-113-184.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-20\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Spring 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }
{ "line_start_idx": [ 0, 1, 5, 6, 82, 83, 84, 85, 96, 117, 341, 342, 417, 418, 569, 570, 648, 649, 697, 698, 876, 877, 883, 884, 972, 973, 1232, 1233, 1234, 1254, 1283, 1312, 1314, 1315, 1321, 1322, 1449, 1450, 1548, 1549, 1555, 1556 ], "line_end_idx": [ 1, 5, 6, 82, 83, 84, 85, 96, 117, 341, 342, 417, 418, 569, 570, 648, 649, 697, 698, 876, 877, 883, 884, 972, 973, 1232, 1233, 1234, 1254, 1283, 1312, 1314, 1315, 1321, 1322, 1449, 1450, 1548, 1549, 1555, 1556, 1672 ] }
{ "red_pajama_v2": { "ccnet_original_length": 1672, "ccnet_original_nlines": 41, "rps_doc_curly_bracket": 0.0011961699929088354, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2915601134300232, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.040920719504356384, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.24808183312416077, "rps_doc_frac_unique_words": 0.5633803009986877, "rps_doc_mean_word_length": 4.507042407989502, "rps_doc_num_sentences": 24, "rps_doc_symbol_to_word_ratio": 0.0025575400795787573, "rps_doc_unigram_entropy": 4.700302600860596, "rps_doc_word_count": 284, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.05390625074505806, "rps_doc_frac_chars_dupe_6grams": 0.04218750074505806, "rps_doc_frac_chars_dupe_7grams": 0.04218750074505806, "rps_doc_frac_chars_dupe_8grams": 0.04218750074505806, "rps_doc_frac_chars_dupe_9grams": 0.04218750074505806, "rps_doc_frac_chars_top_2gram": 0.04218750074505806, "rps_doc_frac_chars_top_3gram": 0.03515625, "rps_doc_frac_chars_top_4gram": 0.02812499925494194, "rps_doc_books_importance": -180.99085998535156, "rps_doc_books_importance_length_correction": -167.88485717773438, "rps_doc_openwebtext_importance": -88.18059539794922, "rps_doc_openwebtext_importance_length_correction": -88.18059539794922, "rps_doc_wikipedia_importance": -55.450408935546875, "rps_doc_wikipedia_importance_length_correction": -44.3779296875 }, "fasttext": { "dclm": 0.02775586023926735, "english": 0.8057263493537903, "fineweb_edu_approx": 1.3374463319778442, "eai_general_math": 0.07962912321090698, "eai_open_web_math": 0.1264227032661438, "eai_web_code": 0.05744088068604469 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.436", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
-1,623,316,577,281,803,300
GENERATE BACKUPSET (Generate a backup set of Backup-Archive Client data) Use this command to generate a backup set for a Backup-Archive Client node. A backup set is a collection of a Backup-Archive Client's active backed up data, which is stored and managed as a single object, on specific media, in server storage. Although you can create a backup set for any client node, a backup set can be used only by a Backup-Archive Client. Restriction: A backup set in deduplication format has that designation as a result of a GENERATE BACKUPSET command with at least one of the following specifications: • Includes a node at Backup-Archive Client Version 6.1.x (at least V6.1.0 but less than V6.2.0). • Includes a node that has one or mode nodes that are authorized to act as a proxy. At least one of those proxy nodes is at Backup-Archive Client V6.1.x. Backup sets in the deduplication format can be restored only by the V6.1.2 or later Backup-Archive Client. Backup-Archive Clients before V6.1.2 cannot restore from a backup set that is in the deduplication format. A backup set in the distributed deduplication format has that designation as a result of a GENERATE BACKUPSET command with at least one of the following specifications: • Includes a node at Backup-Archive Client level V6.2.0 or later. • Includes a node that has one or mode nodes that are authorized to act as a proxy. At least one of those proxy nodes is at Backup-Archive Client V6.2.0. Backup sets in the distributed deduplication format can be restored only by the V6.2.0 or later Backup-Archive Client. Restriction: You cannot generate a backup set with files that were backed up to IBM Spectrum® Protect using NDMP. However, you can create a backup set with files that were backed up using NetApp SnapShot Difference. The server creates copies of active versions of a client's backed up objects that are within the one-or-more file spaces specified with this command. The server then consolidates them onto sequential media. Currently, the backup object types that are supported for backup sets include directories and files only. The backup-archive client node can restore its backup set from the server and from the media to which the backup set was written. This command generates a background process that can be canceled with the CANCEL PROCESS command. If the background process created by this command is canceled, the media might not contain a complete backup set. You can use the QUERY PROCESS command to show information about the background process that is created by this command. Tip: When IBM Spectrum Protect generates a backup set, you can improve performance if the primary storage pools containing the client data are collocated. If a primary storage pool is collocated, client node data is likely to be on fewer tape volumes than it would be if the storage pool were not collocated. With collocation, less time is spent searching database entries, and fewer mount operations are required. Privilege class To issue this command, you must have system privilege or policy privilege for the domain to which the client node is assigned. Syntax Read syntax diagramSkip visual syntax diagramGENerate BACKUPSET ,node__namenode_group_name backup_set_name_prefix*,file_space_nameDEVclass=device_class_name SCRatch=YesSCRatch=YesNoVOLumes=,volume_namesRETention=365RETention=daysNOLimitDESCription=descriptionWait=NoWait=NoYesNAMEType=SERVERNAMEType=SERVERUNIcodeFSIDCODEType=BOTHCODEType=UNIcodeNONUNIcodeBOTHPITDate=current_datePITDate=datePITTime=current_timePITTime=timeDATAType=FILEDATAType=,FILEIMAGEALLTOC=PreferredTOC=NoPreferredYesTOCMGmtclass=class_nameALLOWSHREDdable=NoALLOWSHREDdable=NoYes Parameters node_name or node_group_name (Required) Specifies the name of the client node and node groups whose data is contained in the backup set. To specify multiple node names and node group names, separate the names with commas and no intervening spaces. You can use wildcard characters with node names but not with node group names. When multiple node names are specified, the server generates a backup set for each node and places all of the backup sets together on a single set of output volumes. backup_set_name_prefix (Required) Specifies the name of the backup set for the client node. The maximum length of the name is 30 characters. When you select a name, IBM Spectrum Protect adds a suffix to construct your backup set name. For example, if you name your backup set mybackupset, IBM Spectrum Protect adds a unique number such as 3099 to the name. The backup set name is then identified to IBM Spectrum Protect as mybackupset.3099. To later show information about this backup set, you can include a wildcard with the name, such as mybackupset.* or specify the fully qualified name, such as mybackupset.3099. When multiple node names or node group names are specified, the server generates a backup set for each node or node group and places all the backup sets on a single set of output volumes. Each backup set is given the same fully qualified name consisting of the backup_set_name_prefix and a suffix determined by the server. file_space_name Specifies the names of one or more file spaces that contain the data to be included in the backup set. This parameter is optional. The file space name that you specify can contain wildcard characters. You can specify more than one file space by separating the names with commas and no intervening spaces. If you do not specify a file space, data from all the client nodes backed-up and active file spaces is included in the backup set. For a server that has clients with support for Unicode-enabled file spaces, you can enter either a file space name or a file space ID (FSID). If you enter a file space name, you might need to have the server convert the file space name that you enter. For example, you might need to have the server convert the name that you enter from the server's code page to Unicode. See the NAMETYPE parameter for details. If you do not specify a file space name, or specify only a single wildcard character for the name, you can use the CODETYPE parameter to limit the operation to Unicode file spaces or to non-Unicode file spaces. DEVclass (Required) Specifies the name of the device class for the volumes to which the backup set is written. The maximum length of the name is 30 characters. Restriction: You cannot specify a device class with a device type of NAS or CENTERA. SCRatch Specifies whether to use scratch volumes for the backup set. If you include a list of volumes using the VOLUMES parameter, the server uses scratch volumes only if the data cannot be contained in the volumes you specify. The default is SCRATCH=YES. The values are: YES Specifies to use scratch volumes for the backup set. NO Specifies not to use scratch volumes for the backup set. VOLumes Specifies the names of one or more volumes that will contain the backup set. This parameter is optional. You can specify more than one volume by separating each volume with a comma, with no intervening spaces. If you do not specify this parameter, scratch volumes are used for the backup set. RETention Specifies the number of days to retain the backup set on the server. You can specify an integer from 0 to 30000. The default is 365 days. The values are: days Specifies the number of days to retain the backup set on the server. NOLimit Specifies that the backup set should be retained on the server indefinitely. If you specify NOLIMIT, the server retains the volumes containing the backup set forever, unless a user or administrator deletes the volumes from server storage. DESCription Specifies the description to associate with the backup set. This parameter is optional. The maximum length of the description is 255 characters. Enclose the description in quotation marks if it contains any blank characters. Wait Specifies whether to wait for the server to complete processing this command in the foreground. This parameter is optional. The default is NO. The values are: Yes Specifies the command processes in the foreground. Messages that are created are not displayed until the command completes processing. You cannot specify WAIT=YES from the server console. No Specifies that the command processes in the background. Use the QUERY PROCESS command to monitor the background processing of this command. NAMEType Specify how you want the server to interpret the file space names that you enter. This parameter is useful when the server has clients with support for Unicode-enabled file spaces. You can use this parameter for IBM Spectrum Protect clients using Windows, NetWare, or Macintosh OS X operating systems. Use this parameter only when you enter a partly or fully qualified file space name. The default value is SERVER. Possible values are: SERVER The server uses the server's code page to interpret the file space names. UNIcode The server converts the file space name that is entered from the server code page to the UTF-8 code page. The success of the conversion depends on the actual characters in the name and the server's code page. Conversion can fail if the string includes characters that are not available in the server code page, or if the server has a problem accessing system conversion routines. FSID The server interprets the file space names as their file space IDs (FSIDs). Important: Use care when specifying this parameter if multiple node names are also specified. Different nodes might use the same file space ID for different file spaces, or different file space IDs for the same file space name. Therefore, specifying a file space ID as the file space names can result in the wrong data being written to the backup set for some nodes. CODEType Specify what type of file spaces are to be included in the operation. The default is BOTH, meaning that file spaces are included regardless of code page type. Use this parameter only when you enter a single wildcard character for the file space name or when you do not specify any file space names. Possible values are: UNIcode Include only file spaces that are in Unicode. NONUNIcode Include only file spaces that are not in Unicode. BOTH Include file spaces regardless of code page type. PITDate Specifies that files that were active on the specified date and that are still stored on the IBM Spectrum Protect server are to be included in the backup set, even if they are inactive at the time you issue the command. This parameter is optional. The default is the date on which the GENERATE BACKUPSET command is run. You can specify the date using one of the following values: Value Description Example MM/DD/YYYY A specific date 09/15/1998 TODAY The current date TODAY TODAY-daysor-days The current date minus days specified TODAY-7 or -7. To include files that were active a week ago, specify PITDATE=TODAY-7 or PITDATE=-7 EOLM (End Of Last Month) The last day of the previous month. EOLM EOLM-days The last day of the previous month minus days specified. EOLM-1 To include files that were active a day before the last day of the previous month. BOTM (Beginning Of This Month) The first day of the current month. BOTM BOTM+days The first day of the current month, plus days specified. BOTM+9 To include files that were active on the 10th day of the current month. PITTime Specifies that files that were active on the specified time and that are still stored on the IBM Spectrum Protect server are to be included in the backup set, even if they are inactive at the time you issue the command. This parameter is optional. IF a PITDate was specified, the default is midnight (00:00:00); otherwise the default is the time at which the GENERATE BACKUPSET command is started. You can specify the time using one of the following values: Value Description Example HH:MM:SS A specific time on the specified PIT date 12:33:28 NOW The current date on the specified PIT date NOW NOW+HH:MM or +HH:MM The current time plus hours and minutes on the specified PIT date NOW+03:00 or +03:00 If you issue this command at 9:00 with PITTIME=NOW+03:00 or PITTIME=+03:00. IBM Spectrum Protect includes files that were active at 12:00 on the PIT date. DATAType Specifies that backup sets containing the specified types of data that are to be generated. This parameter is optional. The default is that file level backup sets are to be generated. To specify multiple data types, separate data types with commas and no intervening spaces. The server generates a backup set for each data type and places all the backup sets on a single set of output volumes. Each backup set is given the same fully qualified name consisting of the backup_set_name_prefix and a suffix determined by the server. However, each backup set has a different data type, as shown by the QUERY BACKUPSET command. Possible values are: ALL Specifies that backup sets for all types of data (file level, image, and application) that have been backed up on the server are to be generated. FILE Specifies that a file level backup set is to be generated. File level backup sets contain files and directories that are backed up by the backup client. If no files or directories have been backed up by the backup client, a file level backup set is not generated. This is the default. IMAGE Specifies that an image backup set is to be generated. Image backup sets contain images that are created by the backup client BACKUP IMAGE command. Image backup sets are generated only if an image has been backed up by the backup client. TOC Specifies whether a table of contents (TOC) is saved for each file level backup set. Tables of contents are always saved for backup sets containing image or application data. The TOC parameter is ignored when generating image and application backup sets. A table of contents will always be generated for image and application backup sets. Consider the following in determining whether you want to save a table of contents: • If a table of contents is saved for a backup set, you can use the IBM Spectrum Protect web backup-archive client to examine the entire file system tree and choose files and directories to restore. To create a table of contents, you must define the TOCDESTINATION attribute in the backup copy group for the management class that is specified by the TOCMGMTCLASS parameter. Creating a table of contents requires additional processing, storage pool space, and possibly a mount point during the backup set operation. • If a table of contents is not saved for a backup set, you can still restore individual files or directory trees using the backup-archive client RESTORE BACKUPSET command, if you know the fully qualified name of each file or directory to be restored. To display the contents of backup sets, you can also use the QUERY BACKUPSETCONTENTS command. This parameter is optional. Possible values are: No Specifies that table of contents information is not saved for file level backup sets. Preferred Specifies that table of contents information should be saved for file level backup sets. This is the default. However, a backup set does not fail just because an error occurs during creation of the table of contents. Yes Specifies that table of contents information must be saved for each file level backup set. A backup set fails if an error occurs during creation of the table of contents. TOCMGmtclass Specifies the name of the management class to which the table of contents should be bound. If you do not specify a management class, the table of contents is bound to the default management class for the policy domain to which the node is assigned. In this case, creation of a table of contents requires that you define the TOCDESTINATION attribute in the backup copy group for the specified management class. ALLOWSHREDdable Specifies whether data from a storage pool that enforces shredding is included in the backup set. This parameter is optional. Possible values are: No Specifies that data from a storage pool that enforces shredding is not included in the backup set. This is the default. Yes Specifies that data from a storage pool that enforces shredding can be included in the backup set. The data on the backup set media will not be shredded. Example: Generate a backup set for a file space Generate a backup set of a file space that is called /srvr that belongs to client node JANE. Name the backup set PERS_DATA and retain it for 75 days. Specify that volumes VOL1 and VOL2 contain the data for the backup set. The volumes are to be read by a device that is assigned to the AGADM device class. Include a description. generate backupset jane pers_data /srvr devclass=agadm retention=75 volumes=vol1,vol2 description="area 51 base image" Example: Generate a backup set of a Unicode-enabled file space Generate a backup set of the Unicode-enabled file space, \\joe\c$, that belongs to client node JOE. Name the backup set JOES_DATA. Specify that volume VOL1 contain the data for the backup set. The volume is to be read by a device that is assigned to the AGADM device class. Have the server convert the \\joe\c$ file space name from the server code page to the UTF-8 code page. generate backupset joe joes_data \\joe\c$ devclass=agadm volumes=vol1 nametype=unicode Related commands Table 1. Commands related to GENERATE BACKUPSET Command Description CANCEL PROCESS Cancels a background server process. COPY ACTIVEDATA Copies active backup data. DEFINE COPYGROUP Defines a copy group for backup or archive processing within a specified management class. DEFINE NODEGROUP Defines a group of nodes. DEFINE NODEGROUPMEMBER Adds a client node to a node group. DEFINE BACKUPSET Defines a previously generated backup set to a server. DELETE BACKUPSET Deletes a backup set. DELETE NODEGROUP Deletes a node group. DELETE NODEGROUPMEMBER Deletes a client node from a node group. QUERY BACKUPSET Displays backup sets. GENERATE BACKUPSETTOC Generates a table of contents for a backup set. QUERY NODEGROUP Displays information about node groups. QUERY BACKUPSETCONTENTS Displays contents contained in backup sets. UPDATE BACKUPSET Updates a retention value associated with a backup set. UPDATE COPYGROUP Changes one or more attributes of a copy group. UPDATE NODEGROUP Updates the description of a node group.
{ "url": "https://www.ibm.com/docs/en/spectrum-protect/8.1.10?topic=gc-generate-backupset-generate-backup-set-backup-archive-client-data", "source_domain": "www.ibm.com", "snapshot_id": "crawl=CC-MAIN-2021-17", "warc_metadata": { "Content-Length": "130802", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:44YP7U6SPAITIAJ75WEH2IUHYHYUZZQG", "WARC-Concurrent-To": "<urn:uuid:4f1942ca-cfac-4c15-8393-3b9a325af594>", "WARC-Date": "2021-04-19T10:46:30Z", "WARC-IP-Address": "104.68.247.188", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:WE4AYLAARH55RG5UZFHX36CMSY42Q6ER", "WARC-Record-ID": "<urn:uuid:75a8d2d7-ccbc-4c43-8c0b-f51bb7e12a59>", "WARC-Target-URI": "https://www.ibm.com/docs/en/spectrum-protect/8.1.10?topic=gc-generate-backupset-generate-backup-set-backup-archive-client-data", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:6dad28fc-a553-490b-a96b-daf82dd044ed>" }, "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-90.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, 73, 74, 433, 434, 600, 699, 855, 1069, 1238, 1306, 1462, 1581, 1797, 1798, 2111, 2112, 2242, 2243, 2575, 2576, 2991, 2992, 3008, 3009, 3136, 3137, 3144, 3145, 3698, 3699, 3710, 3711, 3751, 4204, 4238, 4345, 4346, 4822, 4823, 5146, 5147, 5163, 5599, 5600, 6222, 6223, 6243, 6383, 6468, 6476, 6740, 6744, 6797, 6800, 6857, 6865, 7075, 7076, 7159, 7160, 7170, 7324, 7329, 7398, 7406, 7483, 7484, 7646, 7647, 7659, 7884, 7889, 8048, 8052, 8240, 8243, 8383, 8392, 8694, 8695, 8829, 8830, 8837, 8911, 8919, 9299, 9304, 9380, 9747, 9756, 10076, 10084, 10130, 10141, 10191, 10196, 10246, 10254, 10634, 10660, 10698, 10727, 10798, 10799, 10883, 10884, 10950, 11024, 11025, 11108, 11109, 11181, 11255, 11256, 11328, 11329, 11337, 11795, 11821, 11881, 11932, 12038, 12039, 12194, 12195, 12204, 12479, 12480, 12848, 12849, 12853, 12999, 13004, 13289, 13295, 13533, 13537, 13876, 13960, 14477, 14731, 14825, 14826, 14875, 14876, 14879, 14965, 14975, 15192, 15196, 15367, 15380, 15790, 15806, 15953, 15956, 16076, 16080, 16234, 16235, 16283, 16284, 16612, 16668, 16700, 16733, 16734, 16797, 16798, 17175, 17232, 17263, 17264, 17281, 17282, 17330, 17350, 17402, 17445, 17553, 17596, 17655, 17727, 17766, 17805, 17869, 17907, 17977, 18033, 18101, 18174, 18239 ], "line_end_idx": [ 73, 74, 433, 434, 600, 699, 855, 1069, 1238, 1306, 1462, 1581, 1797, 1798, 2111, 2112, 2242, 2243, 2575, 2576, 2991, 2992, 3008, 3009, 3136, 3137, 3144, 3145, 3698, 3699, 3710, 3711, 3751, 4204, 4238, 4345, 4346, 4822, 4823, 5146, 5147, 5163, 5599, 5600, 6222, 6223, 6243, 6383, 6468, 6476, 6740, 6744, 6797, 6800, 6857, 6865, 7075, 7076, 7159, 7160, 7170, 7324, 7329, 7398, 7406, 7483, 7484, 7646, 7647, 7659, 7884, 7889, 8048, 8052, 8240, 8243, 8383, 8392, 8694, 8695, 8829, 8830, 8837, 8911, 8919, 9299, 9304, 9380, 9747, 9756, 10076, 10084, 10130, 10141, 10191, 10196, 10246, 10254, 10634, 10660, 10698, 10727, 10798, 10799, 10883, 10884, 10950, 11024, 11025, 11108, 11109, 11181, 11255, 11256, 11328, 11329, 11337, 11795, 11821, 11881, 11932, 12038, 12039, 12194, 12195, 12204, 12479, 12480, 12848, 12849, 12853, 12999, 13004, 13289, 13295, 13533, 13537, 13876, 13960, 14477, 14731, 14825, 14826, 14875, 14876, 14879, 14965, 14975, 15192, 15196, 15367, 15380, 15790, 15806, 15953, 15956, 16076, 16080, 16234, 16235, 16283, 16284, 16612, 16668, 16700, 16733, 16734, 16797, 16798, 17175, 17232, 17263, 17264, 17281, 17282, 17330, 17350, 17402, 17445, 17553, 17596, 17655, 17727, 17766, 17805, 17869, 17907, 17977, 18033, 18101, 18174, 18239, 18296 ] }
{ "red_pajama_v2": { "ccnet_original_length": 18296, "ccnet_original_nlines": 192, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.37699317932128906, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04755124822258949, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.13638952374458313, "rps_doc_frac_unique_words": 0.1658831387758255, "rps_doc_mean_word_length": 4.970449924468994, "rps_doc_num_sentences": 199, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.132481098175049, "rps_doc_word_count": 2978, "rps_doc_frac_chars_dupe_10grams": 0.1404539942741394, "rps_doc_frac_chars_dupe_5grams": 0.3781245946884155, "rps_doc_frac_chars_dupe_6grams": 0.3285366892814636, "rps_doc_frac_chars_dupe_7grams": 0.25908660888671875, "rps_doc_frac_chars_dupe_8grams": 0.21395756304264069, "rps_doc_frac_chars_dupe_9grams": 0.17612485587596893, "rps_doc_frac_chars_top_2gram": 0.041345760226249695, "rps_doc_frac_chars_top_3gram": 0.023510340601205826, "rps_doc_frac_chars_top_4gram": 0.013984600082039833, "rps_doc_books_importance": -1400.6885986328125, "rps_doc_books_importance_length_correction": -1400.6885986328125, "rps_doc_openwebtext_importance": -856.9664916992188, "rps_doc_openwebtext_importance_length_correction": -856.9664916992188, "rps_doc_wikipedia_importance": -503.9678955078125, "rps_doc_wikipedia_importance_length_correction": -503.9678955078125 }, "fasttext": { "dclm": 0.12434626370668411, "english": 0.8280108571052551, "fineweb_edu_approx": 2.377671241760254, "eai_general_math": 0.9459603428840637, "eai_open_web_math": 0.48392146825790405, "eai_web_code": 0.9235115051269531 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.74", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.678", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }
ece34605c058195ed03b4d393ef1a36c
-1,873,686,731,696,046,000
通过 Spark R 操作 Hive 作为数据工程师,我日常用的主力语言是R,HiveQL,Java与Scala。R是非常适合做数据清洗的脚本语言,并且有非常好用的服务端IDE——RStudio Server;而用户日志主要储存在hive中,因此用HiveQL写job也是日常工作之一;当然R的执行效率确实不靠谱,因此还需要Java(Elasticsearch,Hadoop的原生语言)与Scala(Spark的原生语言)的帮助。 R和python一样也是一个很好的胶水语言,在搜索引擎的实战中,我就是用R来完成了ES集群索引的全量/增量更新操作。既然是一瓶胶水,你很难不希望它粘合上越来越多的东西。对于一个有处女座倾向的双鱼座,因为RHive的安装和配置太复杂而一直没法把R和Hive粘合起来是我长期以来的苦恼。最近要用Spark的Mlib做文本分类工作于是开始重新鼓捣Spark,没想到歪打正着地发现用Spark的R语言api可以操作Hive,搞通之后真是感到Awesome as fuck! 一、编译安装带有hive与R的Spark 官网上预编译好的spark都是不带hive支持的,因此只能自己从源码重新编译(在这里要感谢spark老司机同事的指点)。 # 从官网下载源码包 wget http://mirrors.hust.edu.cn/apache/spark/spark-1.6.1/spark-1.6.1.tgz # 解压 tar zxvf spark-1.6.1.tgz # 为编译R的支持做准备 spark-1.6.1/R/install-dev.sh # 编译安装带有hive与R的spark spark-1.6.1/make-distribution.sh --name hadoop2.5 --skip-java-test --tgz -Psparkr -Pyarn -Dhadoop.version=2.5.0 -Dscala-2.10.4 -Phive -Phive-thriftserver # 把编译好的包解压到自己习惯的目录(参考elasticsearch放在/usr/share/目录下) tar zxvf spark-1.6.1/spark-1.6.1-bin-hadoop2.5.tgz mv spark-1.6.1/spark-1.6.1-bin-hadoop2.5 /usr/share/ 二、环境配置 环境配置可以直接参考之前的文章CentOS 6.7 hadoop free版本Spark 1.6安装与使用,此外要添加一下spark-defaults.conf这个配置文件,以使得hive能够被顺利连接上: # vim $SPARK_HOME/conf/spark-defaults.conf spark.yarn.jar=hdfs://n1:8020/user/spark/share/lib/spark-assembly-1.6.1-hadoop2.5.0.jar spark.driver.extraLibraryPath=/opt/cloudera/parcels/CDH-5.3.0-1.cdh5.3.0.p0.30/lib/hadoop/lib/native spark.executor.extraLibraryPath=/opt/cloudera/parcels/CDH-5.3.0-1.cdh5.3.0.p0.30/lib/hadoop/lib/native # 注:需要把$SPARK_HOME/lib/spark-assembly-1.6.1-hadoop2.5.0.jar这个文件放到hdfs相应的目录下 好吧,这一步也是完全按照同事之前的经验整理的,还没有深入研究到底是如何生效的,但重要的是先用起来…… 三、读写hive实例 直接上代码: Sys.setenv(SPARK_HOME = "/usr/share/spark-1.6.1-bin-hadoop2.5", HADOOP_CONF_DIR="/opt/cloudera/parcels/CDH/lib/hadoop/etc/hadoop") library(SparkR, lib.loc = c(file.path(Sys.getenv("SPARK_HOME"), "R", "lib"))) sc <- sparkR.init(master = "yarn-client", appName = "test") hiveContext <- sparkRHive.init(sc) # 读取数据 results <- sql(hiveContext, "select * from dd_b_ec_e46_clickmodel where dt=20150601") head(results) # 写入数据 saveAsTable(results, "tmp_test") 这里需要注意的是: • 如果运行R的用户不是hdfs管理员用户的话,可以把运行R的用户添加到可访问hdfs的用户组里 • 另外加上HADOOP_USER_NAME=”hdfs”这个环境变量(假设hive的所有者是hdfs)就可以进行写表操作了 总结 大致看了一遍Spark R api后,还是略感失望的,因为发现Spark当前对R的支持主要就是集中在dataframe部分,连最基本的map和reduce操作都没有,看来也只是把R当成数据清洗的工具了。不知不觉中砸了两周的时间在Spark上,接下俩得抖擞精神做一下业务需求了,然后就是硬刚Scala和Mlib! 发表评论 电子邮件地址不会被公开。 必填项已用*标注
{ "url": "http://logos.name/archives/620", "source_domain": "logos.name", "snapshot_id": "crawl=CC-MAIN-2018-51", "warc_metadata": { "Content-Length": "22568", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:VHMOBC3ACHLGVUPAZT6FFY3TRXHXSGWC", "WARC-Concurrent-To": "<urn:uuid:6675d6d7-9d4c-41e3-9f46-344dc16fe12c>", "WARC-Date": "2018-12-15T05:02:20Z", "WARC-IP-Address": "172.105.214.176", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:UGZCLF5UYYL5ORZIIGGXC6Y4Y6IUH5ZJ", "WARC-Record-ID": "<urn:uuid:f2e83725-48b3-466e-ba98-5429e3ea58af>", "WARC-Target-URI": "http://logos.name/archives/620", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e062ebfc-45b0-48bc-bf9d-61566115978a>" }, "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-152-235-249.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, 19, 20, 217, 218, 451, 452, 473, 474, 535, 536, 547, 620, 621, 626, 651, 652, 665, 694, 695, 716, 870, 871, 923, 974, 1027, 1028, 1035, 1036, 1140, 1141, 1184, 1185, 1273, 1374, 1477, 1478, 1554, 1555, 1606, 1607, 1618, 1619, 1626, 1627, 1758, 1836, 1837, 1897, 1932, 1933, 1940, 2026, 2040, 2041, 2048, 2081, 2082, 2092, 2093, 2144, 2209, 2210, 2213, 2214, 2370, 2371, 2376, 2377 ], "line_end_idx": [ 19, 20, 217, 218, 451, 452, 473, 474, 535, 536, 547, 620, 621, 626, 651, 652, 665, 694, 695, 716, 870, 871, 923, 974, 1027, 1028, 1035, 1036, 1140, 1141, 1184, 1185, 1273, 1374, 1477, 1478, 1554, 1555, 1606, 1607, 1618, 1619, 1626, 1627, 1758, 1836, 1837, 1897, 1932, 1933, 1940, 2026, 2040, 2041, 2048, 2081, 2082, 2092, 2093, 2144, 2209, 2210, 2213, 2214, 2370, 2371, 2376, 2377, 2398 ] }
{ "red_pajama_v2": { "ccnet_original_length": 2398, "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.011513159610331059, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.032894741743803024, "rps_doc_frac_lines_end_with_ellipsis": 0.01449275016784668, "rps_doc_frac_no_alph_words": 0.6513158082962036, "rps_doc_frac_unique_words": 0.9468085169792175, "rps_doc_mean_word_length": 21.13829803466797, "rps_doc_num_sentences": 78, "rps_doc_symbol_to_word_ratio": 0.018092110753059387, "rps_doc_unigram_entropy": 4.4639892578125, "rps_doc_word_count": 94, "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.007045799866318703, "rps_doc_frac_chars_top_3gram": 0, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -295.8155822753906, "rps_doc_books_importance_length_correction": -295.8155822753906, "rps_doc_openwebtext_importance": -131.7386932373047, "rps_doc_openwebtext_importance_length_correction": -131.7386932373047, "rps_doc_wikipedia_importance": -146.56838989257812, "rps_doc_wikipedia_importance_length_correction": -146.56838989257812 }, "fasttext": { "dclm": 0.6413363814353943, "english": 0.05149269849061966, "fineweb_edu_approx": 2.7453131675720215, "eai_general_math": 0.9255566596984863, "eai_open_web_math": 0.08152008056640625, "eai_web_code": 0.6743390560150146 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.445", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-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" } } }
ece34605c058195ed03b4d393ef1a36c
7,200,436,996,003,164,000
Prev: 6CEC Up: Map Next: 6CFF 6CEE: Get the x-coordinate range within which a character can see or be seen Used by the routines at 6D62 and 6D7D. Returns with C and B holding the lower and upper x-coordinates of the range within which the target character can see or be seen. This routine is called with H holding either (a) the character number of a teacher (to determine where kids must be in order to get lines), or (b) the character number of a kid (to determine where a teacher must be in order to give lines). Input H Target character's number 6CEE LD L,$02 Point HL at byte 0x02 of the character's buffer 6CF0 LD D,(HL) D=character's y-coordinate 6CF1 DEC L L=0x01 6CF2 LD E,(HL) E=character's x-coordinate 6CF3 LD C,$00 Prepare a lower limit of 0 in case E<10 6CF5 LD A,E A=X (character's x-coordinate) 6CF6 SUB $0A 6CF8 JR C,$6CFB 6CFA LD C,A C=max(0, X-10) (lower limit of the range) 6CFB ADD A,$14 6CFD LD B,A B=X+10 (upper limit of the range) 6CFE RET Prev: 6CEC Up: Map Next: 6CFF
{ "url": "https://skoolkit.ca/disassemblies/back_to_skool/hex/asm/6CEE.html", "source_domain": "skoolkit.ca", "snapshot_id": "crawl=CC-MAIN-2021-49", "warc_metadata": { "Content-Length": "4895", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:H6KF25J7EDAAHGPCAVIZFM667C5DHF2A", "WARC-Concurrent-To": "<urn:uuid:12f86a45-ece0-4f33-95ef-76ee0ac2f569>", "WARC-Date": "2021-12-04T01:57:37Z", "WARC-IP-Address": "66.33.221.53", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:XIJAHHEHZFEZDAG7INFZKUKD43LPHJ6Y", "WARC-Record-ID": "<urn:uuid:8b9c8ce6-b940-431a-955e-bc7c3e15b016>", "WARC-Target-URI": "https://skoolkit.ca/disassemblies/back_to_skool/hex/asm/6CEE.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e0283265-494e-42c7-b9cc-99d89b8ff12d>" }, "warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-67\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, 30, 107, 516, 522, 550, 612, 654, 672, 714, 768, 811, 824, 840, 894, 909, 955, 964 ], "line_end_idx": [ 30, 107, 516, 522, 550, 612, 654, 672, 714, 768, 811, 824, 840, 894, 909, 955, 964, 993 ] }
{ "red_pajama_v2": { "ccnet_original_length": 993, "ccnet_original_nlines": 17, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.271375447511673, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.23420074582099915, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.24163569509983063, "rps_doc_frac_unique_words": 0.562841534614563, "rps_doc_mean_word_length": 4.076502799987793, "rps_doc_num_sentences": 4, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.413802146911621, "rps_doc_word_count": 183, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.21447721123695374, "rps_doc_frac_chars_dupe_6grams": 0.11796247214078903, "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.026809649541974068, "rps_doc_frac_chars_top_3gram": 0.040214478969573975, "rps_doc_frac_chars_top_4gram": 0.03485254943370819, "rps_doc_books_importance": -132.78518676757812, "rps_doc_books_importance_length_correction": -132.78518676757812, "rps_doc_openwebtext_importance": -61.64445114135742, "rps_doc_openwebtext_importance_length_correction": -47.60016632080078, "rps_doc_wikipedia_importance": -54.338165283203125, "rps_doc_wikipedia_importance_length_correction": -54.338165283203125 }, "fasttext": { "dclm": 0.03993291035294533, "english": 0.8514819145202637, "fineweb_edu_approx": 3.191028594970703, "eai_general_math": 0.4523516893386841, "eai_open_web_math": 0.6260101199150085, "eai_web_code": 0.8873333930969238 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "794.8", "labels": { "level_1": "Arts", "level_2": "Amusements and Recreation", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "3", "label": "Academic Writing" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
2,613,979,615,982,279,000
(Photo credit: patries71 photo stream Flickr) Several years ago, the Easter Bunny brought my youngest daughter a pet rabbit. She immediately jumped on the Internet to learn about care and feeding. One site told her that rabbits were social animals and that they should be kept warm and dry in the house, preferably in the kitchen where they could participate in more social activity. Another claimed the breed was derived from wild stock that lived in northern climates. They thrived in cold temperatures and should be kept outside all winter. This was her first lesson in finding the wheat for the chaff. We are social primates and have a strong propensity to grapple for hierarchical position (stature) inside a troop, even if that troop is a virtual one on the Internet. Most Internet debates would be better described as pissing matches between two males. Neither will ever cede the argument but that isn’t the point. The point is to convince the audience. There are three primary layers of credibility in a typical Internet debate: 1. The guy who makes claims without ever providing links to reliable sources. 2. The guy who makes claims and provides an occasional link to a vested interest website (like the Association for the Promotion of Cigarettes). 3. The guy who makes claims and provides multiple links to peer reviewed science journals and respected sources of journalism. Speed-read past number one. He is the chaff amongst the wheat. People will say the damnedest things from behind the safety and anonymity of their firewalls. Most if not everything this person says has the potential to be complete bullshit. Grist thanks its sponsors. Become one. You will not know that guy #2 is simply passing along vested interest talking points and Internet urban legends unless you follow at least some of his links back to their sources. Take everything this guy says with a huge grain of salt. It is likely that he makes a living from one of those vested interests. We are all susceptible to a phenomenon known as subconscious rationalization bias. “It is difficult to get a man to understand something when his salary depends upon his not understanding it.”–Upton Sinclair. Lies come in many flavors. Self-deception is very real and very common. We are all susceptible to it to varying degrees. Once you believe what you are saying is true, you can’t really be called a liar. Most televangelists fall in this category. That is what the scientific method tries to do–short-circuit the tendency to self-deceive. It is important to follow links and give them at least a cursory glance because people will sometimes provide links with headlines that appear to support their case just to make themselves look more legitimate, assuming most people don’t follow links anyway, which is true. It’s amazing how often people will provide links to articles that upon closer inspection actually hurt their argument. Right click on links and open them in new tabs to check later. Grist thanks its sponsors. Become one. Guy #3 may be wrong in the end but has the highest probability of being correct. He has done his homework and has actually read and evaluated the sources found at the end of his links. It helps with his credibility score if it turns out he is motivated by something other than his paycheck. Zeroing in on the highest probability argument isn’t very difficult if you follow these rules and assuming you have a choice. Most Internet debates are just a couple of baboons arguing and neither one have a clue. It is extremely rare to find truly knowledgeable individuals going at each other. When you find two guys throwing links at one another you have no choice but to follow the links and evaluate them. I think it was Linen who said, “A lie told often enough becomes truth.” As a nation we recently witnessed this phenomenon when the Bush administration managed to convince most Americans that Iraq was involved with the 9/11 terrorist attack. It actually works. Politicians from both sides of the aisle use this technique to great effect. It can work in a debate as well. Watch for the guy who repeats the same points over and over even after they have been exposed as false. Calling your opponent a shill for big whatever tends to backfire badly when it turns out he is in no way affiliated with big whatever. On the other hand, it can be very effective if you can prove your opponent actually is a shill for big whatever. Ignore all further comments from guys who have made accusations without evidence. Once a guy slips into the ad hominem attack mode, skip over all comments he makes from that point on. Guys are emboldened to say things on the Internet they would never dream of saying to a dude sitting on the next bar stool. Be wary of the strawman argument. This is where you insinuate your opponent said something absurd or blatantly false or just plain stupid and and tear him apart for it (even though he never did). Or you can just fabricate easy to knock down arguments out of thin air without attributing them to anyone. The Internet is an unprecedented media for the exchange of information and ideas but you have to learn to find the wheat for the chaff. Reader support helps sustain our work. Donate today to keep our climate news free.
{ "url": "https://grist.org/article/internet-debate-101/", "source_domain": "grist.org", "snapshot_id": "CC-MAIN-2024-26", "warc_metadata": { "Content-Length": "183078", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:Y2O7MJPPM4HICXVZIQ5GQTJC2MJ3JQSN", "WARC-Concurrent-To": "<urn:uuid:1c10a258-86e3-425d-a21e-431eb2e2e6d1>", "WARC-Date": "2024-06-13T07:32:27Z", "WARC-IP-Address": "192.0.66.120", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:ED4WC2GWKDY5NL3V7WKW7B36UG234J2K", "WARC-Record-ID": "<urn:uuid:40558308-ca2e-4f6e-a05c-be0dc7254e94>", "WARC-Target-URI": "https://grist.org/article/internet-debate-101/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:978219da-292e-4144-b5b7-60f829311d05>" }, "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-228\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, 606, 607, 923, 924, 1039, 1040, 1120, 1267, 1396, 1397, 1637, 1638, 1677, 1678, 2070, 2071, 2197, 2198, 2534, 2535, 2991, 2992, 3031, 3032, 3323, 3324, 3735, 3736, 4210, 4211, 4541, 4542, 4768, 4769, 5072, 5073, 5209, 5210 ], "line_end_idx": [ 606, 607, 923, 924, 1039, 1040, 1120, 1267, 1396, 1397, 1637, 1638, 1677, 1678, 2070, 2071, 2197, 2198, 2534, 2535, 2991, 2992, 3031, 3032, 3323, 3324, 3735, 3736, 4210, 4211, 4541, 4542, 4768, 4769, 5072, 5073, 5209, 5210, 5292 ] }
{ "red_pajama_v2": { "ccnet_original_length": 5292, "ccnet_original_nlines": 38, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 2, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.48231828212738037, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0019646401051431894, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.1001964583992958, "rps_doc_frac_unique_words": 0.4840834140777588, "rps_doc_mean_word_length": 4.686059474945068, "rps_doc_num_sentences": 63, "rps_doc_symbol_to_word_ratio": 0.0019646401051431894, "rps_doc_unigram_entropy": 5.541576385498047, "rps_doc_word_count": 911, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.06840009242296219, "rps_doc_frac_chars_dupe_6grams": 0.029046619310975075, "rps_doc_frac_chars_dupe_7grams": 0.014523309655487537, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.0070274099707603455, "rps_doc_frac_chars_top_3gram": 0.00843289028853178, "rps_doc_frac_chars_top_4gram": 0.00983836967498064, "rps_doc_books_importance": -461.6830749511719, "rps_doc_books_importance_length_correction": -461.6830749511719, "rps_doc_openwebtext_importance": -292.68536376953125, "rps_doc_openwebtext_importance_length_correction": -292.68536376953125, "rps_doc_wikipedia_importance": -174.35789489746094, "rps_doc_wikipedia_importance_length_correction": -174.35789489746094 }, "fasttext": { "dclm": 0.11320716142654419, "english": 0.9716066718101501, "fineweb_edu_approx": 2.0018155574798584, "eai_general_math": 0.16136175394058228, "eai_open_web_math": 0.2643846273422241, "eai_web_code": 0.015390340238809586 } }
{ "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": "153.42", "labels": { "level_1": "Philosophy and psychology", "level_2": "Psychology", "level_3": "Thought and thinking" } } }, "bloom_cognitive_process": { "primary": { "code": "5", "label": "Evaluate" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "1", "label": "News/Editorial" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-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": "16", "label": "Personal Blog" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
-3,482,146,461,449,789,000
Uploaded image for project: 'Cassandra' 1. Cassandra 2. CASSANDRA-6888 Store whether a counter sstable still use some local/remote shards in the sstable metadata XMLWordPrintableJSON Details • Improvement • Status: Resolved • Normal • Resolution: Fixed • 2.1 beta2 • None • None Description CASSANDRA-6504 has made so we don't distinguish different type of shard in counters. Yet, even though we don't generate those local/remote type of shards, those won't disappear just by running upgradesstable, they need to be compacted away (and even then, they really only disappear if there has been a new update on the counter post-6504). But we want to get rid of those ultimately, since they make things like CASSANDRA-6506 less optimal. Now, even though the final step of that remain to be discussed, the first step is probably to keep track of whether such shard still exist in the system or not. That part is simple, we can just store a boolean in the SSTableMetadata to say whether or not said sstable still has at least one Cell using such old shard type. Attachments Issue Links Activity People aleksey Aleksey Yeschenko slebresne Sylvain Lebresne Aleksey Yeschenko Marcus Eriksson Votes: 0 Vote for this issue Watchers: 3 Start watching this issue Dates Created: Updated: Resolved:
{ "url": "https://issues.apache.org/jira/browse/CASSANDRA-6888", "source_domain": "issues.apache.org", "snapshot_id": "CC-MAIN-2024-38", "warc_metadata": { "Content-Length": "83729", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:SDKIHP7MACIGSBO3UPPMKFZNBFDEDJCN", "WARC-Concurrent-To": "<urn:uuid:0590803b-e065-4302-b9b5-ffa49adcf9d3>", "WARC-Date": "2024-09-17T05:47:03Z", "WARC-IP-Address": "168.119.33.54", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:L5F6NB2R3RE7OIWM5CO5BT2EVMTE44OL", "WARC-Record-ID": "<urn:uuid:166e0d23-0eb5-4953-8266-7ff608c0d095>", "WARC-Target-URI": "https://issues.apache.org/jira/browse/CASSANDRA-6888", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:4f17016a-23e0-4dde-9bf1-5f549cc90908>" }, "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-228\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, 40, 55, 75, 76, 167, 168, 193, 194, 202, 203, 221, 244, 257, 281, 297, 308, 319, 320, 336, 337, 684, 685, 1115, 1116, 1134, 1135, 1155, 1156, 1175, 1176, 1195, 1196, 1236, 1277, 1309, 1339, 1360, 1396, 1420, 1462, 1463, 1483, 1484, 1509, 1534 ], "line_end_idx": [ 40, 55, 75, 76, 167, 168, 193, 194, 202, 203, 221, 244, 257, 281, 297, 308, 319, 320, 336, 337, 684, 685, 1115, 1116, 1134, 1135, 1155, 1156, 1175, 1176, 1195, 1196, 1236, 1277, 1309, 1339, 1360, 1396, 1420, 1462, 1463, 1483, 1484, 1509, 1534, 1559 ] }
{ "red_pajama_v2": { "ccnet_original_length": 1559, "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.3897637724876404, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.011811019852757454, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.20866142213344574, "rps_doc_frac_unique_words": 0.6634615659713745, "rps_doc_mean_word_length": 4.995192527770996, "rps_doc_num_sentences": 9, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.7595624923706055, "rps_doc_word_count": 208, "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.014436960220336914, "rps_doc_frac_chars_top_3gram": 0, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -99.94873809814453, "rps_doc_books_importance_length_correction": -87.46562957763672, "rps_doc_openwebtext_importance": -68.93497467041016, "rps_doc_openwebtext_importance_length_correction": -68.93497467041016, "rps_doc_wikipedia_importance": -48.28797912597656, "rps_doc_wikipedia_importance_length_correction": -34.58265686035156 }, "fasttext": { "dclm": 0.07232481241226196, "english": 0.9213859438896179, "fineweb_edu_approx": 1.7786569595336914, "eai_general_math": 0.0421256385743618, "eai_open_web_math": 0.3288481831550598, "eai_web_code": 0.004958389792591333 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.74", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.678", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
2,307,299,174,210,706,400
Welcome to the Linux Foundation Forum! why linux instead of windows 7? Options hi guys, ok so my question is, why chose linux instead of win7? ok so ive google it and readed some of the topics and the main reason is: faster. more secure/safe when thinking about virus and stuff. more free software. linux is free. win7= compatible drivers. softwares is comfotable easy to get around couse its probably the operat system you used most or only. its more user friendly games running comfortable ive listed about some things good, and nothing negativ, but my question is... why linux? im about 19 years old, im using my computer to download movies and play game's for mostly, and used windows all my life, so there is like nothing for me to worry about without one ting! <<<<<<<<VIRUS>>>>>>>>>> so yes virus is a problem, but there are also virus on ubuntu, but not that much. so linux have some compatible problems with videocards and network cards and some other hardware's, and its also not compatible with alot of game's like teso or world of warcraft or oblivion, or the olds games, so why could i choose linux over win7? the way i want to make this tread is mostly not for my self, but to find a good reasons why could people choose linux. i know there is all kind of ways around the system, and a lot of different linux os. but if you could get ur grandma or ur mommy to use this os, why could they choose it? so this is the question i mean people could get read about, and see the negativ and posetiv sides about, so il let you come with some arguments now. thanks you for answering and your compassion. Comments • arochester arochester Posts: 368 Options 1) http://www.whylinuxisbetter.net/ 2) More and more games are becoming available through Steam. Currently 500? http://store.steampowered.com/ There have been a few available through Wine. http://appdb.winehq.org/ Then there is PlayOnLinux http://www.playonlinux.com/en/supported_apps-1-0.html Then there are commercial (as in PAY) programs such as Cedega. http://www.cedegawiki.net/w/index.php?title=Category:Games&pagefrom=A 3) You don't need to have Windows 7 OR Linux. You can have Windows 7 AND Linux with Dual Booting. YOU CAN HAVE BOTH! http://www.dedoimedo.com/computers/dual-boot-windows-7-ubuntu.html • mondrago2 mondrago2 Posts: 4 Options im running two operation on this laptop, but i was like thinking of bringing this for other people, why could they install linux, but switching betwin more operation system can be alot of stress and installing it virtual may use a lot of memory and process when you are gaming and listening to music at the same time, but its a good point you have there, you can install many games as the link you sended, but i was installing spotify, on my ubuntu, i guess its the same thing on mint? this world be hard way to add trusted repositories for my grandma or any other famelies that may not be that smart, if they world like to watch netflix or something. i installed netflix on ubuntu and it wasnt really that confortable at all, there was some lagging, and late picture. working fine in win7, but world games act like the netflix do, will it not be that compatible like it is in win7? Categories Upcoming Training
{ "url": "https://forum.linuxfoundation.org/discussion/8350/why-linux-instead-of-windows-7", "source_domain": "forum.linuxfoundation.org", "snapshot_id": "CC-MAIN-2024-18", "warc_metadata": { "Content-Length": "306403", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:LOUKIBW7HNLN7STPSBHKODYN6XXI4FKO", "WARC-Concurrent-To": "<urn:uuid:970f670f-499d-487e-afc6-5ccc2fe40f5f>", "WARC-Date": "2024-04-22T05:26:05Z", "WARC-IP-Address": "162.159.128.79", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:VESVWPRXE6CKHXN6QI2XH2BR5TJJEFVH", "WARC-Record-ID": "<urn:uuid:2616681b-a9a4-4d36-a2a5-8290189ca66d>", "WARC-Target-URI": "https://forum.linuxfoundation.org/discussion/8350/why-linux-instead-of-windows-7", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:519568fc-2ecb-447a-8e5c-12608127cd28>" }, "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-47\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, 39, 40, 72, 73, 81, 82, 146, 147, 221, 222, 230, 231, 285, 286, 306, 307, 322, 323, 329, 330, 350, 351, 375, 376, 455, 456, 479, 480, 506, 507, 585, 586, 597, 598, 689, 690, 809, 810, 892, 893, 993, 994, 1144, 1145, 1264, 1265, 1350, 1351, 1437, 1438, 1587, 1588, 1634, 1635, 1644, 1645, 1660, 1686, 1698, 1738, 1739, 1850, 1851, 1901, 1930, 1931, 1961, 2019, 2020, 2087, 2161, 2162, 2283, 2354, 2368, 2391, 2403, 2813, 2814, 2898, 3068, 3069, 3212, 3213, 3309, 3310, 3321, 3322 ], "line_end_idx": [ 39, 40, 72, 73, 81, 82, 146, 147, 221, 222, 230, 231, 285, 286, 306, 307, 322, 323, 329, 330, 350, 351, 375, 376, 455, 456, 479, 480, 506, 507, 585, 586, 597, 598, 689, 690, 809, 810, 892, 893, 993, 994, 1144, 1145, 1264, 1265, 1350, 1351, 1437, 1438, 1587, 1588, 1634, 1635, 1644, 1645, 1660, 1686, 1698, 1738, 1739, 1850, 1851, 1901, 1930, 1931, 1961, 2019, 2020, 2087, 2161, 2162, 2283, 2354, 2368, 2391, 2403, 2813, 2814, 2898, 3068, 3069, 3212, 3213, 3309, 3310, 3321, 3322, 3339 ] }
{ "red_pajama_v2": { "ccnet_original_length": 3339, "ccnet_original_nlines": 88, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4488636255264282, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.012784089893102646, "rps_doc_frac_lines_end_with_ellipsis": 0.011235959827899933, "rps_doc_frac_no_alph_words": 0.1875, "rps_doc_frac_unique_words": 0.45036765933036804, "rps_doc_mean_word_length": 4.650735378265381, "rps_doc_num_sentences": 47, "rps_doc_symbol_to_word_ratio": 0.0014204500475898385, "rps_doc_unigram_entropy": 5.096055030822754, "rps_doc_word_count": 544, "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.012648220174014568, "rps_doc_frac_chars_top_3gram": 0.011067190207540989, "rps_doc_frac_chars_top_4gram": 0.011857709847390652, "rps_doc_books_importance": -375.4766540527344, "rps_doc_books_importance_length_correction": -375.4766540527344, "rps_doc_openwebtext_importance": -235.88815307617188, "rps_doc_openwebtext_importance_length_correction": -235.88815307617188, "rps_doc_wikipedia_importance": -190.5145263671875, "rps_doc_wikipedia_importance_length_correction": -190.5145263671875 }, "fasttext": { "dclm": 0.2715998888015747, "english": 0.9261463284492493, "fineweb_edu_approx": 1.3212693929672241, "eai_general_math": 0.4965025782585144, "eai_open_web_math": 0.3073919415473938, "eai_web_code": 0.1115182563662529 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.456", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.02", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "5", "label": "Evaluate" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "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": "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" } } }
ece34605c058195ed03b4d393ef1a36c
5,356,386,052,669,181,000
Sign up × Database Administrators Stack Exchange is a question and answer site for database professionals who wish to improve their database skills and learn from others in the community. It's 100% free, no registration required. I have some kind of bug leaving lock on table in application that is connecting to Progress OpenEdge Database. Because of the lock I'm not able to test what app is doing wrong there (since I can't test it more than once because of lock and lock seems to last for very long). Is there a way to remove all locks from table? share|improve this question      Can you please give some more information? Is this an application you are developing? – Martin Sjöberg Dec 7 '11 at 9:09      @Martin It is a bug in application. However I don't really need to remove the lock in application, I'll be happy with any kind of trick that will do that outside of it... Be it some SQL or ABL or something else (and that's why I didn't asked it on some other stachexchange)... I just need removal of lock to be able to test app in effective way. – korda Dec 7 '11 at 9:22 2 Answers 2 You can use locking hints to select from tables that have locks on them. select * from tblUser with (NOLOCK) ; This is ok practice with adhoc sql. Note Don't use in productioncode without reading and understanding documentation fully. If you want to kill blocking processes: http://www.kodyaz.com/articles/identify-kill-blocking-sql-server-processes.aspx share|improve this answer      What I need is removal of current locks... Application does some inserts and updates. Selects aren't issue at all. When something goes wrong (and currently it goes almost every time) locks are left on table or rows (even if code I'm working on should close all transactions and connections in case of failure). I'm afraid I need to test it multiple times before I will find cause of the problem and with locks left on table I simply can't... – korda Dec 7 '11 at 10:51      Process blocking db is dead but the lock remains for some time... – korda Dec 8 '11 at 12:28 The only way to "remove" locks from a OE db is for 1. the transaction to go to completion (and all buffers are re-read NO-LOCK or go out of scope), 2. the client to crash, or 3. the db to go down. There's no programmatic way to clear the locks generated by a client session. 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://dba.stackexchange.com/questions/8872/progress-openedge-how-to-remove-lock-from-table", "source_domain": "dba.stackexchange.com", "snapshot_id": "crawl=CC-MAIN-2015-48", "warc_metadata": { "Content-Length": "76302", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:XEU4NVZZ6N4KRI464JP622BCIFPKAMTI", "WARC-Concurrent-To": "<urn:uuid:c1649d56-5730-4ff1-928d-36f51c810a18>", "WARC-Date": "2015-11-28T16:44:18Z", "WARC-IP-Address": "104.16.117.182", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:CN5MF5KSGBBHAVJDN3YDVMGQBPXGKHUT", "WARC-Record-ID": "<urn:uuid:b9377ab4-1687-4104-a981-db7c9b570737>", "WARC-Target-URI": "http://dba.stackexchange.com/questions/8872/progress-openedge-how-to-remove-lock-from-table", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:ef23523c-1a18-4725-8c61-711863ea3a1a>" }, "warc_info": "robots: classic\r\nhostname: ip-10-71-132-137.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for Nov 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }
{ "line_start_idx": [ 0, 10, 230, 231, 506, 507, 554, 555, 583, 588, 709, 714, 1086, 1087, 1099, 1100, 1173, 1174, 1212, 1213, 1249, 1250, 1338, 1339, 1459, 1460, 1486, 1491, 1960, 1965, 2058, 2059, 2110, 2111, 2210, 2239, 2263, 2264, 2342, 2343, 2369, 2370, 2382, 2383, 2385, 2393, 2394, 2472, 2473 ], "line_end_idx": [ 10, 230, 231, 506, 507, 554, 555, 583, 588, 709, 714, 1086, 1087, 1099, 1100, 1173, 1174, 1212, 1213, 1249, 1250, 1338, 1339, 1459, 1460, 1486, 1491, 1960, 1965, 2058, 2059, 2110, 2111, 2210, 2239, 2263, 2264, 2342, 2343, 2369, 2370, 2382, 2383, 2385, 2393, 2394, 2472, 2473, 2563 ] }
{ "red_pajama_v2": { "ccnet_original_length": 2563, "ccnet_original_nlines": 48, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4123893678188324, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03362831845879555, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.20000000298023224, "rps_doc_frac_unique_words": 0.49438202381134033, "rps_doc_mean_word_length": 4.426966190338135, "rps_doc_num_sentences": 31, "rps_doc_symbol_to_word_ratio": 0.008849560283124447, "rps_doc_unigram_entropy": 5.031242370605469, "rps_doc_word_count": 445, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.014213199727237225, "rps_doc_frac_chars_dupe_6grams": 0.014213199727237225, "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.00812183041125536, "rps_doc_frac_chars_top_3gram": 0.009137059561908245, "rps_doc_frac_chars_top_4gram": 0.012182739563286304, "rps_doc_books_importance": -305.79132080078125, "rps_doc_books_importance_length_correction": -305.79132080078125, "rps_doc_openwebtext_importance": -174.1045379638672, "rps_doc_openwebtext_importance_length_correction": -174.1045379638672, "rps_doc_wikipedia_importance": -119.30864715576172, "rps_doc_wikipedia_importance_length_correction": -119.30864715576172 }, "fasttext": { "dclm": 0.15884310007095337, "english": 0.9347826242446899, "fineweb_edu_approx": 0.9938367009162903, "eai_general_math": 0.0007506600231863558, "eai_open_web_math": 0.0728754997253418, "eai_web_code": 0.00019103000522591174 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.74", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "1", "label": "Leftover HTML" } }, "missing_content": { "primary": { "code": "2", "label": "Click Here References" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
-1,959,039,794,628,564,000
[Echarts可视化] 二.php和ajax连接数据库实现动态数据可视化 版权声明:本文为博主原创文章,转载请注明CSDN博客源地址!共同学习,一起进步~ https://blog.csdn.net/Eastmount/article/details/72847067 前一篇文章 "[Echarts可视化] 一.入门篇之简单绘制中国地图和贵州地区" 主要是通过Echarts可视化介绍入门知识、中国地图和贵州地区各省份的数据分析,其中贵州地图才是它的核心内容。 这篇文章主要结合PHP、MySQL、JQuery和Ajax从数据库中获取数据,动态的显示值,这是实现真正可视化的技术入,可以应用于实际的项目中。基础性文章,希望对您有所帮助,如果文章中存在不足之处,还请海涵~ 参考文章:ECharts, PHP, MySQL, Ajax, JQuery 实现前后端数据可视化           echarts+php+mysql 绘图实例 - 谦一           PHP+echarts读取地图数据 该篇文章代码下载地址: 一. 回顾Echarts绘制直方图 Echarts官网地址:http://echarts.baidu.com/index.html 注意:基础知识参考前一篇文章,这篇文章主要是代码为主,整个流程都是详细的。同时发现,准备写这篇文章的时候,“纯臻”大神也写了篇类似的,但依然有不同的地方可能对你有所帮助。 Echarts代码 test01.html <!DOCTYPE html> <html> <head> <meta charset="utf-8"> <title>ECharts</title> <!-- 引入 echarts.js --> <script src="echarts.min.js"></script> </head> <body> <!-- 为ECharts准备一个具备大小(宽高)的Dom --> <div id="main" style="width: 600px;height:400px;"></div> <script type="text/javascript"> // 基于准备好的dom,初始化echarts实例 var myChart = echarts.init(document.getElementById('main')); // 指定图表的配置项和数据 var option = { title: { text: 'ECharts 入门示例' }, tooltip: {}, legend: { data:['数量'] }, xAxis: { data: ["贵阳市","遵义市","凯里市","六盘水市","都匀市","毕节市"] }, yAxis: {}, series: [{ name: '数量', type: 'bar', data: [5, 20, 36, 10, 10, 20] }] }; // 使用刚指定的配置项和数据显示图表。 myChart.setOption(option); </script> </body> </html> 运行结果如下图所示: 二. 创建数据库 创建数据库hcpmanage,再创建表guizhou,包括序号、地名、数量三个字段。 如下所示: SQL语句对应的代码: -- ---------------------------- -- Table structure for `guizhou` -- ---------------------------- DROP TABLE IF EXISTS `guizhou`; CREATE TABLE `guizhou` ( `id` int(11) NOT NULL AUTO_INCREMENT, `place` varchar(20) COLLATE utf8_unicode_ci DEFAULT NULL, `num` int(11) DEFAULT NULL, PRIMARY KEY (`id`) ) ENGINE=InnoDB AUTO_INCREMENT=7 DEFAULT CHARSET=utf8 COLLATE=utf8_unicode_ci; -- ---------------------------- -- Records of guizhou -- ---------------------------- INSERT INTO `guizhou` VALUES ('1', '贵阳市', '5'); INSERT INTO `guizhou` VALUES ('2', '遵义市', '20'); INSERT INTO `guizhou` VALUES ('3', '凯里市', '36'); INSERT INTO `guizhou` VALUES ('4', '六盘水市', '10'); INSERT INTO `guizhou` VALUES ('5', '都匀市', '10'); INSERT INTO `guizhou` VALUES ('6', '毕节市', '20'); 三. PHP连接数据库及Json传值 PHP连接数据库的核心代码大家非常熟悉了,下面这段代码简单包括了Json取值。 sql.php文件: <?php //PHP连接数据库 header("content-type:text/json;charset=utf-8"); //链接数据库 $con = mysql_connect("localhost", "root", "123456"); if (!$con) { die('Could not connect database: ' . mysql_error()); } //选择数据库 $db_selected = mysql_select_db("hcpmanage", $con); if (!$db_selected) { die ("Can\'t use yxz : " . mysql_error()); } //执行MySQL查询-设置UTF8格式 mysql_query("SET NAMES utf8"); //查询学生信息 $sql = "SELECT * FROM `guizhou` "; $result = mysql_query($sql,$con); //定义变量json存储值 $data=""; $array= array(); class GuiZhou{ public $id; public $place; public $num; } while ($row = mysql_fetch_row($result)) { list($id,$place,$num) = $row; /* echo $id.' '; echo $place.' '; echo $num; echo '<br >'; */ $gz = new GuiZhou(); $gz->id = $id; $gz->place = $place; $gz->num = $num; //数组赋值 $array[] = $gz; } $data = json_encode($array); echo $data; //{"id":"1","place":"\u8d35\u9633\u5e02","num":"5"} ?> 核心代码,通过array数组获取Guizhou类中的值,该值是读取数据库并且赋值给实例gz的,再调用json_encode($array)进行格式转换。输出结果如下所示,也可以Json只获取两个值。 注意访问地址为:http://localhost:8080/20170224YXZ/sql.php,文件放到Apache的htdocs目录下。所有文件如下图所示: 四. Ajax动态实现Echarts可视化 test02.html代码如下: <!DOCTYPE html> <html> <head> <meta charset="utf-8"> <title>ECharts</title> <!-- 引入 echarts.js --> <script src="echarts.min.js"></script> <script src="jquery-1.9.1.min.js"></script> </head> <body> <!-- 为ECharts准备一个具备大小(宽高)的Dom --> <div id="main" style="width: 600px;height:400px;"></div> <script type="text/javascript"> // 基于准备好的dom,初始化echarts实例 var myChart = echarts.init(document.getElementById('main')); // 初始化两个数组,盛装从数据库中获取到的数据 var places=[], nums=[]; function TestAjax(){ $.ajax({ type: "post", async: false, //异步执行 url: "sql.php", //SQL数据库文件 data: {}, //发送给数据库的数据 dataType: "json", //json类型 success: function(result) { if (result) { for (var i = 0; i < result.length; i++) { places.push(result[i].place); nums.push(result[i].num); console.log(result[i].place); console.log(result[i].num); } } } }) return places, nums; } //执行异步请求 TestAjax(); // 指定图表的配置项和数据 var option = { title: { text: 'ECharts+Ajax+MySQL+PHP' }, tooltip: { show : true }, legend: { data:['数量'] }, xAxis: [{ //data: ["贵阳市","遵义市","凯里市","六盘水市","都匀市","毕节市"] type : 'category', data : places }], yAxis: { type : 'value' }, series: [{ name : "数量", type : "bar", data : nums }] }; // 使用刚指定的配置项和数据显示图表。 myChart.setOption(option); </script> <marquee>Eastmount 璋 love 娜!!!</marquee> </body> </html> 运行结果如下图所示,这是动态调用的可视化结果。 其中Ajax核心代码为: var places=[], nums=[]; function TestAjax(){ $.ajax({ type: "post", async: false, //异步执行 url: "sql.php", //SQL数据库文件 data: {}, //发送给数据库的数据 dataType: "json", //json类型 success: function(result) { if (result) { for (var i = 0; i < result.length; i++) { places.push(result[i].place); nums.push(result[i].num); console.log(result[i].place); console.log(result[i].num); } } } }) return places, nums; } //执行异步请求 TestAjax(); 同时,浏览器中检查元素可以对Ajax的值进行测试输出,调用console.log函数。 如下图所示: 数据动态变化,数据库变了,可视化图也变化: 五. 难点及注意事项 初学的同学可能会遇到一下几个问题: 1.其中Echarts和JQuery需要导入的,即:     <script src="echarts.min.js"></script>     <script src="jquery-1.9.1.min.js"></script> 2.Echarts使用的方法请大家学习前一篇文章和官网文章,这里不再叙述。 3.PHP文件需要header("content-type:text/json;charset=utf-8");声明Json格式,同时Ajax也需要设置dataType: "json"。 4.声明的Ajax函数需要执行,对应代码中的TestAjax(),否则只是定义未执行。 5.如果Ajax报错 [object Object],如下图所示: 这需要Json格式一致,而我的错误是因为在PHP文件中增加了个注释导致无值,百度都无法解决,头都弄大了,所以写代码需要仔细。 6.最后动态数据是通过变量实现的,即ages替换以前的 [5, 20, 36, 10, 10, 20]。             series : [ {                    name : "num",                    type : "bar",                    data : ages             }] 最后希望这篇文章对你有所帮助,尤其是对Echarts可视化感兴趣的同学,同样Java、C#、Python相关网站的原理一样,代码也会上传。最近心情真的好低落,哎!有时间写日记总结下吧。         稳坐珠江夜游船,翻转长隆水世界。         笑谈粤广风流人,宁负天下不负卿 哎!总是心事重重,自己真的有太多的不足和需要成长的地方,以前总会知足,现在也会。哎!为人处世真需要一辈子去学习,且写且珍惜吧,传递正能量。 (By:Eastmount 2017-06-02 中午2点  http://blog.csdn.net/eastmount/ ) 阅读更多 换一批 没有更多推荐了,返回首页
{ "url": "https://blog.csdn.net/eastmount/article/details/72847067", "source_domain": "blog.csdn.net", "snapshot_id": "crawl=CC-MAIN-2018-47", "warc_metadata": { "Content-Length": "201834", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:3HKZN5UQ3YH6LE4FXUQ4VSAQB4XA6O25", "WARC-Concurrent-To": "<urn:uuid:a8344d87-98eb-4d7e-a1da-72b3286187f7>", "WARC-Date": "2018-11-20T12:02:49Z", "WARC-IP-Address": "39.96.132.69", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:NEEBVNTPH4Y7GBK37V5UNDMCSECSLALR", "WARC-Record-ID": "<urn:uuid:3c020c81-f887-4d6f-af5d-b2bdebb57a79>", "WARC-Target-URI": "https://blog.csdn.net/eastmount/article/details/72847067", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3062a38b-4ed4-4e4d-b9a4-b10c1c00f311>" }, "warc_info": "isPartOf: CC-MAIN-2018-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-164-158-228.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, 38, 39, 137, 234, 339, 340, 341, 391, 429, 457, 458, 470, 471, 472, 473, 474, 492, 493, 541, 627, 649, 650, 666, 673, 680, 707, 734, 761, 804, 812, 819, 857, 918, 954, 988, 1057, 1058, 1081, 1104, 1125, 1162, 1177, 1202, 1224, 1252, 1267, 1288, 1349, 1364, 1387, 1410, 1438, 1467, 1513, 1528, 1539, 1540, 1569, 1604, 1618, 1626, 1634, 1645, 1646, 1647, 1648, 1657, 1658, 1701, 1707, 1708, 1709, 1721, 1722, 1754, 1787, 1819, 1851, 1876, 1916, 1976, 2006, 2027, 2106, 2107, 2139, 2161, 2193, 2241, 2290, 2339, 2389, 2438, 2487, 2488, 2489, 2508, 2509, 2549, 2560, 2561, 2567, 2580, 2629, 2638, 2693, 2706, 2710, 2766, 2770, 2771, 2780, 2833, 2854, 2858, 2905, 2909, 2910, 2932, 2966, 2967, 2977, 3013, 3049, 3050, 3065, 3076, 3094, 3110, 3124, 3144, 3162, 3165, 3166, 3207, 3211, 3246, 3250, 3257, 3273, 3292, 3305, 3321, 3326, 3349, 3366, 3389, 3408, 3409, 3418, 3436, 3439, 3440, 3470, 3483, 3536, 3537, 3540, 3640, 3641, 3642, 3724, 3725, 3726, 3727, 3728, 3750, 3751, 3768, 3769, 3785, 3792, 3799, 3826, 3853, 3880, 3923, 3971, 3979, 3986, 4024, 4085, 4121, 4155, 4224, 4257, 4289, 4318, 4339, 4369, 4410, 4455, 4501, 4544, 4588, 4622, 4688, 4746, 4800, 4858, 4914, 4940, 4962, 4980, 4995, 5028, 5038, 5039, 5056, 5076, 5077, 5100, 5123, 5144, 5191, 5206, 5229, 5257, 5272, 5294, 5322, 5337, 5359, 5422, 5457, 5487, 5503, 5524, 5555, 5570, 5593, 5622, 5652, 5680, 5695, 5706, 5707, 5736, 5771, 5785, 5830, 5838, 5846, 5870, 5871, 5872, 5885, 5886, 5915, 5944, 5965, 5995, 6036, 6081, 6127, 6170, 6214, 6248, 6314, 6372, 6426, 6484, 6540, 6566, 6588, 6606, 6621, 6654, 6664, 6681, 6702, 6746, 6753, 6754, 6755, 6777, 6778, 6779, 6780, 6781, 6782, 6793, 6794, 6812, 6813, 6840, 6883, 6931, 6932, 6970, 6971, 7065, 7066, 7110, 7111, 7145, 7146, 7147, 7148, 7211, 7212, 7213, 7214, 7267, 7292, 7325, 7358, 7389, 7404, 7405, 7406, 7407, 7500, 7525, 7549, 7550, 7620, 7621, 7686, 7687, 7692, 7696, 7697 ], "line_end_idx": [ 38, 39, 137, 234, 339, 340, 341, 391, 429, 457, 458, 470, 471, 472, 473, 474, 492, 493, 541, 627, 649, 650, 666, 673, 680, 707, 734, 761, 804, 812, 819, 857, 918, 954, 988, 1057, 1058, 1081, 1104, 1125, 1162, 1177, 1202, 1224, 1252, 1267, 1288, 1349, 1364, 1387, 1410, 1438, 1467, 1513, 1528, 1539, 1540, 1569, 1604, 1618, 1626, 1634, 1645, 1646, 1647, 1648, 1657, 1658, 1701, 1707, 1708, 1709, 1721, 1722, 1754, 1787, 1819, 1851, 1876, 1916, 1976, 2006, 2027, 2106, 2107, 2139, 2161, 2193, 2241, 2290, 2339, 2389, 2438, 2487, 2488, 2489, 2508, 2509, 2549, 2560, 2561, 2567, 2580, 2629, 2638, 2693, 2706, 2710, 2766, 2770, 2771, 2780, 2833, 2854, 2858, 2905, 2909, 2910, 2932, 2966, 2967, 2977, 3013, 3049, 3050, 3065, 3076, 3094, 3110, 3124, 3144, 3162, 3165, 3166, 3207, 3211, 3246, 3250, 3257, 3273, 3292, 3305, 3321, 3326, 3349, 3366, 3389, 3408, 3409, 3418, 3436, 3439, 3440, 3470, 3483, 3536, 3537, 3540, 3640, 3641, 3642, 3724, 3725, 3726, 3727, 3728, 3750, 3751, 3768, 3769, 3785, 3792, 3799, 3826, 3853, 3880, 3923, 3971, 3979, 3986, 4024, 4085, 4121, 4155, 4224, 4257, 4289, 4318, 4339, 4369, 4410, 4455, 4501, 4544, 4588, 4622, 4688, 4746, 4800, 4858, 4914, 4940, 4962, 4980, 4995, 5028, 5038, 5039, 5056, 5076, 5077, 5100, 5123, 5144, 5191, 5206, 5229, 5257, 5272, 5294, 5322, 5337, 5359, 5422, 5457, 5487, 5503, 5524, 5555, 5570, 5593, 5622, 5652, 5680, 5695, 5706, 5707, 5736, 5771, 5785, 5830, 5838, 5846, 5870, 5871, 5872, 5885, 5886, 5915, 5944, 5965, 5995, 6036, 6081, 6127, 6170, 6214, 6248, 6314, 6372, 6426, 6484, 6540, 6566, 6588, 6606, 6621, 6654, 6664, 6681, 6702, 6746, 6753, 6754, 6755, 6777, 6778, 6779, 6780, 6781, 6782, 6793, 6794, 6812, 6813, 6840, 6883, 6931, 6932, 6970, 6971, 7065, 7066, 7110, 7111, 7145, 7146, 7147, 7148, 7211, 7212, 7213, 7214, 7267, 7292, 7325, 7358, 7389, 7404, 7405, 7406, 7407, 7500, 7525, 7549, 7550, 7620, 7621, 7686, 7687, 7692, 7696, 7697, 7709 ] }
{ "red_pajama_v2": { "ccnet_original_length": 7709, "ccnet_original_nlines": 323, "rps_doc_curly_bracket": 0.00830197986215353, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.02083333022892475, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0384114608168602, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.6484375, "rps_doc_frac_unique_words": 0.5395033955574036, "rps_doc_mean_word_length": 9.343114852905273, "rps_doc_num_sentences": 85, "rps_doc_symbol_to_word_ratio": 0.0006510399980470538, "rps_doc_unigram_entropy": 5.217372894287109, "rps_doc_word_count": 443, "rps_doc_frac_chars_dupe_10grams": 0.2503020167350769, "rps_doc_frac_chars_dupe_5grams": 0.311186283826828, "rps_doc_frac_chars_dupe_6grams": 0.2614158093929291, "rps_doc_frac_chars_dupe_7grams": 0.2503020167350769, "rps_doc_frac_chars_dupe_8grams": 0.2503020167350769, "rps_doc_frac_chars_dupe_9grams": 0.2503020167350769, "rps_doc_frac_chars_top_2gram": 0.014496260322630405, "rps_doc_frac_chars_top_3gram": 0.024643629789352417, "rps_doc_frac_chars_top_4gram": 0.033341389149427414, "rps_doc_books_importance": -767.9107666015625, "rps_doc_books_importance_length_correction": -767.9107666015625, "rps_doc_openwebtext_importance": -467.7549743652344, "rps_doc_openwebtext_importance_length_correction": -467.7549743652344, "rps_doc_wikipedia_importance": -346.5107116699219, "rps_doc_wikipedia_importance_length_correction": -346.5107116699219 }, "fasttext": { "dclm": 0.8228165507316589, "english": 0.0583585686981678, "fineweb_edu_approx": 2.7629501819610596, "eai_general_math": 0.0014926199801266193, "eai_open_web_math": 0.23396891355514526, "eai_web_code": 0.9999411106109619 } }
{ "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.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": "1", "label": "Factual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
-7,413,566,123,172,616,000
This is a general function to create Rap objects from scratch and solve them to generate solutions. rap( pus, species, spaces = NULL, formulation = c("unreliable", "reliable")[1], solve = TRUE, ... ) Arguments pus sp::SpatialPolygons() object representing planning units. species raster::raster() object with species distribution data. spaces list of raster::raster() objects. Each elements denotes the spatial distribution for each space. Defaults to NULL. formulation character to indicate if the "unreliable" or "reliable" formulation should be used to generate prioritizations. Defaults to "unreliable". solve logical should solutions be generated? ... arguments are passed to GurobiOpts(), make.RapData(), and RapReliableOpts() or RapUnreliableOpts() functions. Value RapSolved() object if solve is TRUE, otherwise an RapUnsolved() is returned. Note Type vignette("raptr") to see the package vignette for a tutorial. See also
{ "url": "http://jeffrey-hanson.com/raptr/reference/rap.html", "source_domain": "jeffrey-hanson.com", "snapshot_id": "crawl=CC-MAIN-2020-45", "warc_metadata": { "Content-Length": "9655", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:7ELBIMKXUGKTG2FLH5DTSZFMFYOAHDPF", "WARC-Concurrent-To": "<urn:uuid:e744de91-7dc9-4bfb-9e24-6dc8e32b313d>", "WARC-Date": "2020-10-29T23:33:19Z", "WARC-IP-Address": "185.199.109.153", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:O72BSOWMB56SVXNXU6BER4G6XYEJMVBQ", "WARC-Record-ID": "<urn:uuid:bbd782f7-27cd-4e1b-86c3-deb5bcfffe03>", "WARC-Target-URI": "http://jeffrey-hanson.com/raptr/reference/rap.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:79b86419-b1e1-4fff-8ae4-352408f3c781>" }, "warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-124.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 100, 101, 106, 113, 124, 141, 189, 205, 211, 213, 214, 224, 225, 229, 230, 288, 289, 297, 298, 354, 355, 362, 363, 478, 479, 491, 492, 630, 631, 637, 638, 677, 678, 682, 683, 793, 794, 800, 801, 878, 879, 884, 885, 952, 953 ], "line_end_idx": [ 100, 101, 106, 113, 124, 141, 189, 205, 211, 213, 214, 224, 225, 229, 230, 288, 289, 297, 298, 354, 355, 362, 363, 478, 479, 491, 492, 630, 631, 637, 638, 677, 678, 682, 683, 793, 794, 800, 801, 878, 879, 884, 885, 952, 953, 961 ] }
{ "red_pajama_v2": { "ccnet_original_length": 961, "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.23428571224212646, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.022857140749692917, "rps_doc_frac_lines_end_with_ellipsis": 0.043478261679410934, "rps_doc_frac_no_alph_words": 0.2857142984867096, "rps_doc_frac_unique_words": 0.6470588445663452, "rps_doc_mean_word_length": 6.142857074737549, "rps_doc_num_sentences": 15, "rps_doc_symbol_to_word_ratio": 0.011428570374846458, "rps_doc_unigram_entropy": 4.19796085357666, "rps_doc_word_count": 119, "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.02735977992415428, "rps_doc_frac_chars_top_3gram": 0, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -66.75289154052734, "rps_doc_books_importance_length_correction": -66.75289154052734, "rps_doc_openwebtext_importance": -34.38174057006836, "rps_doc_openwebtext_importance_length_correction": -20.962459564208984, "rps_doc_wikipedia_importance": -27.33193016052246, "rps_doc_wikipedia_importance_length_correction": -27.33193016052246 }, "fasttext": { "dclm": 0.6965509057044983, "english": 0.6983910799026489, "fineweb_edu_approx": 3.187495470046997, "eai_general_math": 0.9970670938491821, "eai_open_web_math": 0.39157891273498535, "eai_web_code": 0.9999933242797852 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "519.7", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Probabilities; or, Mathematical statistics" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
3,101,861,490,546,812,400
pcntl_setpriority (PHP 5, PHP 7, PHP 8) pcntl_setpriorityÄndert die Priorität eines beliebigen Prozesses Beschreibung pcntl_setpriority(int $priority, ?int $process_id = null, int $mode = PRIO_PROCESS): bool pcntl_setpriority() setzt die Priorität von process_id. Parameter-Liste priority priority ist gewöhnlich ein Wert im Bereich zwischen -20 und 20. Die vorgegebene Priorität ist 0, während ein kleinerer numerischer Wert günstigeres Scheduling hervorruft. Weil die Prioritätsstufen sich zwischen Systemtypen und Kernelversionen unterscheiden können, ist die setpriority(2)-Manpage des Systems bezüglich spezifischer Details zu konsultieren. process_id Falls null, wird die PID des aktuellen Prozesses verwendet. mode Entweder PRIO_PGRP, PRIO_USER, PRIO_PROCESS, PRIO_DARWIN_BG oder PRIO_DARWIN_THREAD. Rückgabewerte Gibt bei Erfolg true zurück. Bei einem Fehler wird false zurückgegeben. Changelog Version Beschreibung 8.0.0 process_id ist jetzt nullable (akzeptiert den null-Wert). Siehe auch • pcntl_getpriority() - Ermittelt die Priorität eines beliebigen Prozesses • pcntl_setpriority() add a note add a note User Contributed Notes 2 notes up 2 t dot stobbe at blackdogdev dot com 17 years ago As for the renice function by leandro dot pereira at gmail dot com, this isn't true.  pcntl_setpriority() doesn't set the nice level of a process, but instead sets the base priority of it.  At first glance this might seem like the same thing, but on a system level, they are actually quite different. In fact, if you're looking to use pcntl_setpriority() to prioritize your process (a tool or a daemon or what-not), I wouldn't recomend using setpriority at all, but renice it instead.  Let the system manage priorities and you'll end up with the results you were looking for. This applies only to POSIX based systems only (as does the function presented by leandro dot pereira at gmail dot com as well). up -1 leandro dot pereira at gmail dot com 18 years ago The following snippet may be used under older versions of PHP to provide similar functionality.  Tested only under Linux. <?php function _pcntl_setpriority($priority, $pid = 0) {         $priority = (int)$priority;         $pid = (int)$pid;         if ( $priority > 20 && $priority < -20) {                 return False;         }         if ( $pid == 0) {                 $pid = getmypid();         }         return system("renice  $priority -p $pid") != false; } ?> To Top
{ "url": "http://docs.php.net/manual/de/function.pcntl-setpriority.php", "source_domain": "docs.php.net", "snapshot_id": "CC-MAIN-2023-50", "warc_metadata": { "Content-Length": "30879", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:C3T3RTXGNAT7LHOA4SJBWXIBSYKOR5GU", "WARC-Concurrent-To": "<urn:uuid:1c0bad0a-109e-44d1-9e14-c807fc9f3302>", "WARC-Date": "2023-12-08T16:15:28Z", "WARC-IP-Address": "109.203.109.170", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:XJ3A5M33OUKV2KT57HTM4CITKCYQNNWS", "WARC-Record-ID": "<urn:uuid:c3551e2f-c33b-48b2-b2c1-c1edef047d57>", "WARC-Target-URI": "http://docs.php.net/manual/de/function.pcntl-setpriority.php", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:f0266768-0d9e-41c6-8f9d-b4a08d2d3a44>" }, "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-56\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, 18, 19, 41, 42, 107, 108, 121, 122, 212, 213, 269, 270, 286, 287, 296, 297, 654, 655, 666, 667, 727, 728, 733, 734, 819, 820, 834, 835, 907, 908, 918, 919, 940, 1004, 1005, 1016, 1017, 1094, 1118, 1119, 1141, 1142, 1173, 1174, 1177, 1179, 1215, 1228, 1529, 1530, 1805, 1806, 1934, 1937, 1940, 1977, 1990, 2112, 2113, 2119, 2168, 2170, 2178, 2206, 2214, 2232, 2233, 2246, 2283, 2306, 2313, 2323, 2336, 2349, 2365, 2384, 2394, 2395, 2410, 2456, 2458, 2459, 2462 ], "line_end_idx": [ 18, 19, 41, 42, 107, 108, 121, 122, 212, 213, 269, 270, 286, 287, 296, 297, 654, 655, 666, 667, 727, 728, 733, 734, 819, 820, 834, 835, 907, 908, 918, 919, 940, 1004, 1005, 1016, 1017, 1094, 1118, 1119, 1141, 1142, 1173, 1174, 1177, 1179, 1215, 1228, 1529, 1530, 1805, 1806, 1934, 1937, 1940, 1977, 1990, 2112, 2113, 2119, 2168, 2170, 2178, 2206, 2214, 2232, 2233, 2246, 2283, 2306, 2313, 2323, 2336, 2349, 2365, 2384, 2394, 2395, 2410, 2456, 2458, 2459, 2462, 2468 ] }
{ "red_pajama_v2": { "ccnet_original_length": 2468, "ccnet_original_nlines": 83, "rps_doc_curly_bracket": 0.0024311200249940157, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.203023761510849, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0280777495354414, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.2894168496131897, "rps_doc_frac_unique_words": 0.6036036014556885, "rps_doc_mean_word_length": 5.549549579620361, "rps_doc_num_sentences": 23, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.0804877281188965, "rps_doc_word_count": 333, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.09090909361839294, "rps_doc_frac_chars_dupe_6grams": 0.05086579918861389, "rps_doc_frac_chars_dupe_7grams": 0.05086579918861389, "rps_doc_frac_chars_dupe_8grams": 0.03463203087449074, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.012987010180950165, "rps_doc_frac_chars_top_3gram": 0.027597399428486824, "rps_doc_frac_chars_top_4gram": 0.030844159424304962, "rps_doc_books_importance": -229.26010131835938, "rps_doc_books_importance_length_correction": -229.26010131835938, "rps_doc_openwebtext_importance": -117.82691955566406, "rps_doc_openwebtext_importance_length_correction": -117.82691955566406, "rps_doc_wikipedia_importance": -100.25848388671875, "rps_doc_wikipedia_importance_length_correction": -100.25848388671875 }, "fasttext": { "dclm": 0.04431002959609032, "english": 0.20364093780517578, "fineweb_edu_approx": 1.8035814762115479, "eai_general_math": 0.02824115939438343, "eai_open_web_math": 0.7449353933334351, "eai_web_code": 0.9993539452552795 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.678", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
-835,589,143,308,460,400
1 I want to know what is there a way for storing equations or formula in a DB column. Below is the table where I am storing the machines details(master table). But the last column is what I am worrying. Columns and values for the table would be id,name,col1,col2,col3,col4,formula 1,mc1,546,459,1.24,3.9,(col1 * col2 * 0.0016)/(col3 * col4) The formula changes for each entry in the table. Currently I am hard-coding the formula's in my program like if(macid == 1) { // apply formula1 } else if(macid == 2) { // apply formula2 } ..... Now if any new machine gets added in the table I need to make changes int the code. So I want to store the formula in the table itself, so that I can provide UI interface to change the formula. How can I achieve this. Plese help. 3 • How badly do formulas vary? Can you add a few more real examples? – peterm Nov 26, 2013 at 6:35 • second machine may have, another formula like, (col1 * 2 * 0.0016)/(col 3 * col4). The problem is when i want to add a new machine to the table and user wants to enter the formula and save it for that from the UI. Now i need to add one more else if in my code. Nov 26, 2013 at 9:06 • See my answer. Dynamic SQL is the only solution I can possibly think of when you potentially have different formulas for every row – peterm Nov 26, 2013 at 9:12 1 Answer 1 1 You can try to leverage dynamic SQL. If you need to get a calculated value for an id DELIMITER $$ CREATE PROCEDURE get_value(IN _id INT) BEGIN SET @sql = NULL; SELECT CONCAT('SELECT ', formula, ' value FROM table1 WHERE id = ', 1) INTO @sql FROM table1 WHERE id = 1; PREPARE stmt FROM @sql; EXECUTE stmt; DEALLOCATE PREPARE stmt; SET @sql = NULL; END$$ DELIMITER ; Note: You can of course use OUT parameter instead of returning the resultset if you want to. Sample usage: CALL get_value(1); Sample output: | VALUE | |-----------------| | 82.916129032258 | Here is how a procedure might look like to get all values calculated by formulas DELIMITER $$ CREATE PROCEDURE get_values() BEGIN SET @sql = NULL; SELECT GROUP_CONCAT(CONCAT( 'SELECT id, ', formula, ' value FROM table1 WHERE id = ', id) ORDER BY id SEPARATOR ' UNION ALL ') INTO @sql FROM table1; PREPARE stmt FROM @sql; EXECUTE stmt; DEALLOCATE PREPARE stmt; SET @sql = NULL; END$$ DELIMITER ; Sample usage: CALL get_value(1); Sample output: | ID | VALUE | |----|-----------------| | 1 | 82.916129032258 | | 2 | 0.0000109375 | Here is SQLFiddle demo for both procedures 1 • Did it help? Do you need more help with your question? – peterm Nov 27, 2013 at 15:42 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://dba.stackexchange.com/questions/53948/store-equations-formula-in-mysql-db-table", "source_domain": "dba.stackexchange.com", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "163933", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:74HVWV5WCYYKGDIPMXVJB4VVOIGSAMDH", "WARC-Concurrent-To": "<urn:uuid:8678cfc5-ca87-4ca5-8d60-33b38a4efafe>", "WARC-Date": "2024-05-22T21:52:48Z", "WARC-IP-Address": "172.64.144.30", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:B3E6JVWR5H6IIZOA4SG4C4R2QIIA5Y7O", "WARC-Record-ID": "<urn:uuid:87ae4f77-1735-4874-814b-9648328bb38b>", "WARC-Target-URI": "https://dba.stackexchange.com/questions/53948/store-equations-formula-in-mysql-db-table", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:bbd5e71f-4c6f-4038-9bbd-75c1d2545360>" }, "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-204\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 2, 3, 204, 205, 247, 248, 284, 344, 345, 454, 455, 472, 491, 515, 534, 542, 543, 737, 738, 774, 775, 777, 847, 860, 885, 1171, 1306, 1319, 1344, 1345, 1356, 1357, 1359, 1360, 1397, 1398, 1446, 1447, 1460, 1499, 1505, 1524, 1525, 1598, 1612, 1628, 1645, 1646, 1672, 1688, 1715, 1734, 1740, 1752, 1753, 1846, 1847, 1861, 1862, 1881, 1882, 1897, 1898, 1918, 1938, 1958, 1959, 2040, 2041, 2054, 2084, 2090, 2109, 2110, 2140, 2206, 2247, 2261, 2278, 2279, 2305, 2321, 2348, 2367, 2373, 2385, 2386, 2400, 2401, 2420, 2421, 2436, 2437, 2462, 2487, 2512, 2537, 2538, 2581, 2582, 2584, 2643, 2656, 2682, 2683, 2695, 2696, 2812, 2813 ], "line_end_idx": [ 2, 3, 204, 205, 247, 248, 284, 344, 345, 454, 455, 472, 491, 515, 534, 542, 543, 737, 738, 774, 775, 777, 847, 860, 885, 1171, 1306, 1319, 1344, 1345, 1356, 1357, 1359, 1360, 1397, 1398, 1446, 1447, 1460, 1499, 1505, 1524, 1525, 1598, 1612, 1628, 1645, 1646, 1672, 1688, 1715, 1734, 1740, 1752, 1753, 1846, 1847, 1861, 1862, 1881, 1882, 1897, 1898, 1918, 1938, 1958, 1959, 2040, 2041, 2054, 2084, 2090, 2109, 2110, 2140, 2206, 2247, 2261, 2278, 2279, 2305, 2321, 2348, 2367, 2373, 2385, 2386, 2400, 2401, 2420, 2421, 2436, 2437, 2462, 2487, 2512, 2537, 2538, 2581, 2582, 2584, 2643, 2656, 2682, 2683, 2695, 2696, 2812, 2813, 2903 ] }
{ "red_pajama_v2": { "ccnet_original_length": 2903, "ccnet_original_nlines": 109, "rps_doc_curly_bracket": 0.001377879991196096, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.28134557604789734, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.11162079870700836, "rps_doc_frac_lines_end_with_ellipsis": 0.009090909734368324, "rps_doc_frac_no_alph_words": 0.32568806409835815, "rps_doc_frac_unique_words": 0.4425162672996521, "rps_doc_mean_word_length": 4.381778717041016, "rps_doc_num_sentences": 29, "rps_doc_symbol_to_word_ratio": 0.0015290499432012439, "rps_doc_unigram_entropy": 4.972100257873535, "rps_doc_word_count": 461, "rps_doc_frac_chars_dupe_10grams": 0.0712871327996254, "rps_doc_frac_chars_dupe_5grams": 0.18366336822509766, "rps_doc_frac_chars_dupe_6grams": 0.15346534550189972, "rps_doc_frac_chars_dupe_7grams": 0.0712871327996254, "rps_doc_frac_chars_dupe_8grams": 0.0712871327996254, "rps_doc_frac_chars_dupe_9grams": 0.0712871327996254, "rps_doc_frac_chars_top_2gram": 0.023762380704283714, "rps_doc_frac_chars_top_3gram": 0.019801979884505272, "rps_doc_frac_chars_top_4gram": 0.016336629167199135, "rps_doc_books_importance": -258.6181945800781, "rps_doc_books_importance_length_correction": -258.6181945800781, "rps_doc_openwebtext_importance": -137.94891357421875, "rps_doc_openwebtext_importance_length_correction": -137.94891357421875, "rps_doc_wikipedia_importance": -108.02490234375, "rps_doc_wikipedia_importance_length_correction": -108.02490234375 }, "fasttext": { "dclm": 0.589958667755127, "english": 0.7174947261810303, "fineweb_edu_approx": 1.235996127128601, "eai_general_math": 0.07246453315019608, "eai_open_web_math": 0.21187764406204224, "eai_web_code": 0.1173972487449646 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.74", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
1,863,492,671,225,966,800
No se puede detectar cuando la llamada saliente se responde en Android Para detectar cuándo se responde una llamada saliente, intenté crear un PhoneStateListener y escuchar los CALL_STATE_RINGING , CALL_STATE_OFFHOOK y CALL_STATE_IDLE de esta pregunta , pero parece que no funciona, como se explica a continuación. Primero, registré el siguiente permiso en el manifiesto: Luego, un BroadcastReceiver llamado OutCallLogger que capta el evento NEW_OUTGOING_CALL cada vez que se realiza una llamada saliente: Luego, mi implementación de OutCallLogger . Configuré un booleano llamado noCallListenerYet para evitar adjuntar un nuevo PhoneStateListener al TelephonyManager cada vez que se invoca onReceive() . public class OutCallLogger extends BroadcastReceiver { private static boolean noCallListenerYet = true; @Override public void onReceive(final Context context, Intent intent) { number = intent.getStringExtra(Intent.EXTRA_PHONE_NUMBER); if (noCallListenerYet) { final TelephonyManager tm = (TelephonyManager) context.getSystemService( Context.TELEPHONY_SERVICE); tm.listen(new PhoneStateListener() { @Override public void onCallStateChanged(int state, String incomingNumber) { switch (state) { case TelephonyManager.CALL_STATE_RINGING: Log.d(This.LOG_TAG, "RINGING"); break; case TelephonyManager.CALL_STATE_OFFHOOK: Log.d(This.LOG_TAG, "OFFHOOK"); break; case TelephonyManager.CALL_STATE_IDLE: Log.d(This.LOG_TAG, "IDLE"); break; default: Log.d(This.LOG_TAG, "Default: " + state); break; } } }, PhoneStateListener.LISTEN_CALL_STATE); noCallListenerYet = false; } } } Ahora, cuando realizo una llamada saliente en mi dispositivo, CALL_STATE_RINGING NUNCA se invoca. Siempre obtengo impresiones de “IDLE” a “OFFHOOK” cuando la otra línea comienza a sonar, nada cuando se responde la llamada, y una impresión de “IDLE” cuando la llamada finaliza. ¿Cómo puedo detectar de manera confiable cuándo se responde una llamada saliente en Android, o eso es posible? Desde Android 5.0, esto es posible para las aplicaciones del sistema. Pero necesitas usar la API oculta de Android. Lo tengo para que funcione así: public class OutCallLogger extends BroadcastReceiver { @Override public void onReceive(Context context, Intent intent) { switch (intent.getIntExtra(TelephonyManager.EXTRA_FOREGROUND_CALL_STATE, -2) { case PreciseCallState.PRECISE_CALL_STATE_IDLE: Log.d(This.LOG_TAG, "IDLE"); break; case PreciseCallState.PRECISE_CALL_STATE_DIALING: Log.d(This.LOG_TAG, "DIALING"); break; case PreciseCallState.PRECISE_CALL_STATE_ALERTING: Log.d(This.LOG_TAG, "ALERTING"); break; case PreciseCallState.PRECISE_CALL_STATE_ACTIVE: Log.d(This.LOG_TAG, "ACTIVE"); break; } } } Puede encontrar todos los estados de llamada posibles en PreciseCallState.java y todos los extras que el bash contiene en TelephonyRegistry.java . Parece que el estado TIMBRE se alcanza solo por las llamadas entrantes. Las llamadas salientes cambian de IDLE a OFFHOOK, por lo que es posible que no sea posible mirar el estado del teléfono. Creo que podría ser posible usar funciones internas, mira esto: ¿qué representan los diferentes estados de llamada en la stack de telefonía de Android? Tal vez intente utilizar CallManager? Consulte http://grepcode.com/file/repository.grepcode.com/java/ext/com.google.android/android/2.3.3_r1/com/android/internal/telephony/CallManager.java . También encontré CallManager.java entre los archivos SDK en mi computadora. El siguiente texto de la página vinculada parece prometedor: Register for getting notifications for change in the Call State Call.State This is called PreciseCallState because the call state is more precise than the Phone.State which can be obtained using the android.telephony.PhoneStateListener Resulting events will have an AsyncResult in Message.obj. AsyncResult.userData will be set to the obj argument here. The h parameter is held only by a weak reference. 1051 1052 public void registerForPreciseCallStateChanged(Handler h, int what, Object obj){ 1053 mPreciseCallStateRegistrants.addUnique(h, what, obj); 1054 } No he intentado codificar nada, así que realmente no sé si puede hacer lo que quieres, pero tengo curiosidad por saberlo. Por favor, preste atención a: tm.listen(new PhoneStateListener() { @Override public void onCallStateChanged(int state, String incomingNumber) { switch (state) { case TelephonyManager.CALL_STATE_RINGING: Log.d(This.LOG_TAG, "RINGING"); break; case TelephonyManager.CALL_STATE_OFFHOOK: Log.d(This.LOG_TAG, "OFFHOOK"); break; case TelephonyManager.CALL_STATE_IDLE: Log.d(This.LOG_TAG, "IDLE"); break; default: Log.d(This.LOG_TAG, "Default: " + state); break; } } }, PhoneStateListener.LISTEN_CALL_STATE); ¿Ves el argumento “incomingNumber”? Sí, ese código solo puede detectar su estado de llamada telefónica cuando hay una llamada entrante a su dispositivo. Podrías hacer lo siguiente … no muy preciso, pero podría hacer el truco: 1. Utiliza el receptor para la acción android.intent.action.NEW_OUTGOING_CALL 2. Cuando se llama al receptor, almacena en alguna parte (por ejemplo, una var estática) el estado NEW_OUTGOIN_CALL y el tiempo en ms cuando esto sucedió (es decir, nueva Fecha (). GetTime ()) 3. Utiliza el otro receptor para android.intent.action.PHONE_STATE y en el mensaje onReceive haz lo siguiente: if (intent.getAction().equals("android.intent.action.PHONE_STATE")) { TelephonyManager telephony = (TelephonyManager) context.getSystemService(Context.TELEPHONY_SERVICE); telephony.listen(new PhoneStateListener() { public void onCallStateChanged(int state, String incomingNumber) { switch(state) { case TelephonyManager.CALL_STATE_IDLE: break; case TelephonyManager.CALL_STATE_OFFHOOK: break; case TelephonyManager.CALL_STATE_RINGING: break; } } }, PhoneStateListener.LISTEN_CALL_STATE); } En el caso CALL_STATE_OFFHOOK, comprueba que el último estado almacenado fue NEW_OUTGOING_CALL y que no más de aprox. Han pasado 10 segundos desde el último cambio de estado. Esto significa que el teléfono inició una llamada hace como máximo 10 segundos y que ahora está en estado de descolgado (es decir, llamada activa) sin pasar por inactivo o sonando. Esto podría significar que la llamada fue respondida. Aquí su respuesta es que ha implementado CallStateListener en OutGoingCallReceiver que es incorrecto. Tienes que implementar CallStateListener en PhoneStateListener También probé esto en mi proyecto anterior, me enfrenté al mismo problema y luego lo resolví como a continuación. Tomé 3 clases como a continuación. 1. AutoCallReceiver: Registre el TelephonyManager con PhoneStateListener.LISTEN_CALL_STATE 2. CallStateListener que escucha tres estados como TelephonyManager.CALL_STATE_IDLE , TelephonyManager.CALL_STATE_OFFHOOK , TelephonyManager.CALL_STATE_RINGING 3.OutGoingCallReceiver que se encarga de la llamada en curso public class OutGoingCallReceiver extends BroadcastReceiver { /* onReceive will execute on out going call */ @Override public void onReceive(Context context, Intent intent) { Toast.makeText(context, "OutGoingCallReceiver", Toast.LENGTH_SHORT).show(); } } public class CallStateListener extends PhoneStateListener { String number=""; // variable for storing incoming/outgoing number Context mContext; // Application Context //Constructor that will accept Application context as argument public CallStateListener(Context context) { mContext=context; } // This function will automatically invoke when call state changed public void onCallStateChanged(int state,String incomingNumber) { boolean end_call_state=false; // this variable when true indicate that call is disconnected switch(state) { case TelephonyManager.CALL_STATE_IDLE: // Handling Call disconnect state after incoming/outgoing call Toast.makeText(mContext, "idle", Toast.LENGTH_SHORT).show(); break; case TelephonyManager.CALL_STATE_OFFHOOK: // Handling outgoing call Toast.makeText(mContext, "OFFHOOK", Toast.LENGTH_SHORT).show(); // saving outgoing call state so that after disconnect idle state can act accordingly break; case TelephonyManager.CALL_STATE_RINGING: Toast.makeText(mContext, "RINGING", Toast.LENGTH_SHORT).show(); break; } } } public class AutoCallReceiver extends BroadcastReceiver { /* onReceive will execute on call state change */ @Override public void onReceive(Context context, Intent intent) { // Instantiating PhoneStateListener CallStateListener phoneListener=new CallStateListener(context); // Instantiating TelephonyManager TelephonyManager telephony = (TelephonyManager) context.getSystemService(Context.TELEPHONY_SERVICE); // Registering the telephony to listen CALL STATE change telephony.listen(phoneListener,PhoneStateListener.LISTEN_CALL_STATE); } }
{ "url": "https://www.dokry.com/15781", "source_domain": "www.dokry.com", "snapshot_id": "crawl=CC-MAIN-2020-10", "warc_metadata": { "Content-Length": "28444", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:SQS4YXSRL73I5DRO23CN3AHBK6HHIYBY", "WARC-Concurrent-To": "<urn:uuid:52c19458-a0bf-42e5-8959-31cf3add57ce>", "WARC-Date": "2020-02-28T11:48:05Z", "WARC-IP-Address": "69.163.34.11", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:TRTXCINRFEQ5WUVNGSGF5U3LTGPDN6VJ", "WARC-Record-ID": "<urn:uuid:1fb52592-cbcc-4cc9-b093-eab0cedcad9d>", "WARC-Target-URI": "https://www.dokry.com/15781", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:ce2404f9-5827-4167-8188-f1325a6349e9>" }, "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, 71, 72, 316, 317, 374, 375, 378, 379, 513, 514, 521, 522, 720, 721, 1589, 1590, 1867, 1868, 1979, 1980, 2096, 2097, 2129, 2130, 2133, 2140, 2698, 2699, 2846, 2847, 3040, 3041, 3193, 3194, 3522, 3523, 4085, 4086, 4208, 4209, 4239, 4240, 4714, 4715, 4868, 4869, 4942, 4943, 5023, 5218, 5331, 5332, 5828, 5829, 6239, 6240, 6405, 6406, 6555, 6556, 6649, 6650, 6812, 6813, 6874, 6875, 7132, 7133, 8185, 8186, 8726, 8727 ], "line_end_idx": [ 71, 72, 316, 317, 374, 375, 378, 379, 513, 514, 521, 522, 720, 721, 1589, 1590, 1867, 1868, 1979, 1980, 2096, 2097, 2129, 2130, 2133, 2140, 2698, 2699, 2846, 2847, 3040, 3041, 3193, 3194, 3522, 3523, 4085, 4086, 4208, 4209, 4239, 4240, 4714, 4715, 4868, 4869, 4942, 4943, 5023, 5218, 5331, 5332, 5828, 5829, 6239, 6240, 6405, 6406, 6555, 6556, 6649, 6650, 6812, 6813, 6874, 6875, 7132, 7133, 8185, 8186, 8726, 8727, 8728 ] }
{ "red_pajama_v2": { "ccnet_original_length": 8728, "ccnet_original_nlines": 72, "rps_doc_curly_bracket": 0.005728689953684807, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.08551371842622757, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.050414811819791794, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.32035738229751587, "rps_doc_frac_unique_words": 0.43586957454681396, "rps_doc_mean_word_length": 7.6413044929504395, "rps_doc_num_sentences": 140, "rps_doc_symbol_to_word_ratio": 0.0006381599814631045, "rps_doc_unigram_entropy": 5.524551868438721, "rps_doc_word_count": 920, "rps_doc_frac_chars_dupe_10grams": 0.10099572688341141, "rps_doc_frac_chars_dupe_5grams": 0.16827881336212158, "rps_doc_frac_chars_dupe_6grams": 0.15462304651737213, "rps_doc_frac_chars_dupe_7grams": 0.12361308932304382, "rps_doc_frac_chars_dupe_8grams": 0.10099572688341141, "rps_doc_frac_chars_dupe_9grams": 0.10099572688341141, "rps_doc_frac_chars_top_2gram": 0.014082499779760838, "rps_doc_frac_chars_top_3gram": 0.015362730249762535, "rps_doc_frac_chars_top_4gram": 0.015362730249762535, "rps_doc_books_importance": -650.45068359375, "rps_doc_books_importance_length_correction": -650.45068359375, "rps_doc_openwebtext_importance": -376.1818542480469, "rps_doc_openwebtext_importance_length_correction": -376.1818542480469, "rps_doc_wikipedia_importance": -263.21759033203125, "rps_doc_wikipedia_importance_length_correction": -263.21759033203125 }, "fasttext": { "dclm": 0.9374322295188904, "english": 0.05658344924449921, "fineweb_edu_approx": 1.4159539937973022, "eai_general_math": 0.00880557019263506, "eai_open_web_math": 0.4060421586036682, "eai_web_code": 0.8814823031425476 } }
{ "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": "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": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
7,100,885,939,401,933,000
Connect with us Internet How To Use A VPN To Improve Your Streaming Experience? A good VPN hides your real IP, accesses the geo-locked content, and helps you watch streaming videos anywhere. mm Published on Virtual Private Network (VPN) Security 1. What Is A Virtual Private Network (VPN)? Your Internet connection is kept private with a VPN. It provides a secure tunnel for your Internet traffic, making it impossible for snoopers to access your personal information or online data. 2. What Are the Benefits of Using a VPN? A VPN creates a secure tunnel for your data when you connect to the Internet. As your data travels between your machine and the VPN server, it is encoded and encrypted. This makes it more difficult for anyone, including hackers and governments, to access and intercept your data. Even when using unprotected public Wi-Fi, you don’t have to worry about privacy leaks. 3. Anonymity on the Internet Your data appears to come from the VPN server rather than your computer when you connect to one. One of the related servers would replace your IP address, which many other individuals may share. Snoopers won’t be able to pinpoint your exact position. VPNs also have no-log policies, so they won’t collect or share your information. 4. Access Content Anywhere You may use a free VPN like iTop VPN to bypass geo-restrictions and gain unrestricted access to any content, no matter where you are. Any social networking app, such as TikTok, WhatsApp, Skype, Instagram, and others, is available as iTop VPN provide over 1800 servers in 100 location. Without being restricted by the government, you can watch, listen to, and visit your favorite videos, music, and websites. iTop VPN 2 5. No bandwidth Restrictions Limitations on bandwidth can be very inconvenient. You may be unable to watch your favorite shows or download large files if you hit your broadband limit. Thankfully, iTop VPN can help you bypass bandwidth limits while surfing, streaming, playing online games, and torrenting. 6. Unblock Streamings In some places, some streaming services are unavailable. Netflix, for example, restricts what users can see based on their geographic region. You can connect to its global servers and access everything you want using iTop VPN. Surprisingly, iTop VPN has dedicated Netflix, BBC iPlayer, Disney+, PUBG, LOL: Wild Rift, and Free Fire servers to provide a faster and more enjoyable streaming and gaming experience. Take Netflix, for example; each country has its own set of shows and movies. Many shows are absent from even the extensive Netflix library in the United States. iTop VPN allows you to access various Netflix libraries to watch movies and TV shows, thanks to its global servers. iTop VPN will enable you to access multiple Netflix libraries to watch movies and TV shows, thanks to its global servers. iTop VPN allows you to access various Netflix libraries to watch movies and TV shows, thanks to its global servers. Even though Netflix has stated that VPN IP addresses will be restricted and that many well-known VPN providers cannot stream Netflix on their servers, iTop VPN will be ready to help you get past this problem and access everything you want. If you sign up for the provider’s paid subscription, you’ll get access to all popular streaming services and regional libraries. Conclusion A good VPN hides your real IP, accesses the geo-locked content, and helps you watch streaming videos anywhere. iTop VPN is one of the best VPNs to provide strong encryption, fast download speeds, and the ability to unblock all popular streaming services worth trying for users. We are an Instructor, Modern Full Stack Web Application Developers, Freelancers, Tech Bloggers, and Technical SEO Experts. We deliver a rich set of software applications for your business needs. Continue Reading Click to comment Leave a Reply Your email address will not be published. Required fields are marked * Gadgets Trail Cam Tactics: Using Technology to Scout Hunting Spots Trail cameras have revolutionized the way we scout for games, offering unparalleled insights into animal behavior and movement patterns. mm Published on The Rise of Trail Cameras If you’re anything like me, you know that hunting isn’t just a hobby; it’s a way of life. And when it comes to bagging that big buck or elusive turkey, preparation is key. That’s where trail cameras come into play. 1. The Rise of Trail Cameras Before we delve into the tactics, let’s take a quick look at the evolution of trail cameras. Gone are the days of manually scouting hunting spots and relying solely on gut instinct. With the advent of trail cameras, hunters now have eyes in the woods 24/7, providing unprecedented access to valuable data. From basic motion-triggered cameras to high-tech models equipped with night vision and cellular connectivity, the options are endless. 2. Why Trail Cameras Matter Imagine this: you’ve got your trusty AR-15 in hand, trekking through the wilderness in search of a game. But without knowing where the animals are, you’re just shooting in the dark (literally and figuratively). That’s where trail cameras come in clutch. By strategically placing these cameras in prime locations, you can gather crucial intel on animal patterns, feeding habits, and travel routes. It’s like having your reconnaissance team in the field. 3. Strategic Placement Now, let’s talk tactics. The key to maximizing the effectiveness of trail cameras lies in their strategic placement. Here are a few tips to keep in mind: 1. Scout the Terrain: Before setting up your cameras, take some time to scout the terrain. Look for natural funnels, bedding areas, and food sources where game is likely to congregate. 2. Cover Scent: Animals have keen senses of smell, so be mindful of your scent when placing trail cameras. Use scent-neutralizing sprays or gloves to minimize your impact on the area. 3. Height and Angle: Position your cameras at the right height and angle for optimal coverage. Aim for a height of around waist to chest level, and angle the camera slightly downward to capture more of the animal’s body. 4. Multiple Angles: For thorough coverage, consider setting up multiple cameras at different angles. This will give you a more comprehensive view of the area and increase your chances of spotting a game. 5. Check Regulations: Before deploying your trail cameras, be sure to familiarize yourself with local hunting regulations. Some areas may have restrictions on camera placement or usage. 4. Maximizing Efficiency Now that your cameras are in place, it’s time to maximize their efficiency. Here are a few additional tips to help you make the most of your trail cam setup: • Regular Maintenance: Check your cameras regularly to ensure they’re functioning properly. Replace batteries, clear debris from the lens, and adjust settings as needed. • Data Analysis: Don’t just collect data—analyze it! Review your trail cam footage regularly to identify patterns and trends. This will help you make informed decisions about when and where to hunt. • Weather Considerations: Keep an eye on the weather forecast when planning your hunts. Rain, wind, and extreme temperatures can impact animal behavior, so adjust your strategy accordingly. • Stealth Mode: To avoid spooking the game, set your cameras to stealth mode whenever possible. This will minimize noise and light emissions, making your setup less intrusive. • Share Information: Trail cameras are a valuable tool, but they’re even more powerful when used in conjunction with other hunters. Share your findings with fellow sportsmen to collaborate and increase your collective success. Trail Cam Tactics Using Technology to Scout Hunting Spots 5. Troubleshooting Tips Even the most advanced trail cameras can encounter issues from time to time. Here are some common problems hunters may face and how to troubleshoot them: • Battery Life: If your trail camera’s battery life seems shorter than expected, try using high-quality batteries or rechargeable batteries designed for outdoor use. Consider using lithium batteries for better performance in extreme temperatures. • Blurry Images: Blurry or out-of-focus images can be frustrating, but they’re often easily remedied. Check the camera’s focus settings and make sure the lens is clean and free of debris. Adjust the camera’s placement or angle if necessary to improve image clarity. • False Triggers: False triggers can waste battery life and fill up your SD card with unnecessary footage. To reduce false triggers, adjust the camera’s sensitivity settings and make sure it’s not being triggered by wind-blown vegetation or other environmental factors. • Camera Malfunctions: If your trail camera stops working or malfunctions, try resetting it to factory settings and updating the firmware, if applicable. If the issue persists, contact the manufacturer for further assistance or consider sending the camera in for repairs. • Memory Card Errors: If your trail camera displays a memory card error, try reformatting the card using the camera’s settings menu. Make sure the card is compatible with the camera and is not damaged or corrupted. Consider using a high-quality, high-capacity SD card to avoid storage issues. • Cellular Connectivity Problems: For trail cameras equipped with cellular capabilities, connectivity issues can sometimes arise. Check the camera’s signal strength and ensure it’s positioned in an area with adequate coverage. If necessary, consider using an external antenna or relocating the camera to improve signal reception. 6. The Ethical Dimension Here are a few points to keep in mind: • Respect for Wildlife: As hunters, it’s our responsibility to respect the animals we pursue. Trail cameras should be used ethically and responsibly, with the welfare of wildlife as a top priority. • Minimize Disturbance: Avoid placing trail cameras in sensitive areas or disturbing wildlife unnecessarily. Minimize your impact on the environment and give animals the space they need to thrive. • Selective Harvesting: Use the data gathered from trail cameras to make informed decisions about which animals to harvest. Focus on harvesting mature, healthy specimens, and avoid targeting vulnerable populations. • Conservation Efforts: Consider using trail cameras as a tool for conservation, not just hunting. Monitoring wildlife populations and gathering data on habitat use can contribute to broader conservation efforts and habitat management initiatives. • Education and Outreach: Take the opportunity to educate other hunters and outdoor enthusiasts about the ethical use of trail cameras. Share best practices and encourage responsible behavior in the field. Conclusion Trail cameras have revolutionized the way we scout for games, offering unparalleled insights into animal behavior and movement patterns. So, grab your gear, set up those trail cameras, and get ready for your best hunting season yet! Continue Reading Advertisement Advertisement Artificial Intelligence (AI)4 days ago WORM-Compliant Storage: Exploring Write Once Read Many (WORM) Functionality Gadgets1 week ago Trail Cam Tactics: Using Technology to Scout Hunting Spots Internet2 weeks ago Mastering the Art of Task Automation in the Modern Office Health & Fitness2 weeks ago 5 Innovative Ways Point-of-Care Diagnostic Devices Revolutionize Healthcare Efficiency Technology4 weeks ago Leveraging Technology In Portable Office Setups For Enhanced Productivity Instagram2 months ago How to Buy Instagram Followers (Guide) Business2 months ago Transforming Goals into Actionable Results Technology2 months ago The Benefits of Using Professional Presentation Design Services Software2 months ago Common Pitfalls to Avoid During the Proof of Concept (POC) Development Process Internet2 months ago Keep It Simple: What to Include and What to Leave Out on Your Personal Site Advertisement Advertisement Trending
{ "url": "https://www.twinztech.com/use-vpn-to-improve-streaming-experience/", "source_domain": "www.twinztech.com", "snapshot_id": "CC-MAIN-2024-10", "warc_metadata": { "Content-Length": "215374", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:GP3GRGYWE4QHAB7VE6H2NP3DY4QV66G6", "WARC-Concurrent-To": "<urn:uuid:7f18e333-86be-4136-803b-cf8a4f66bb69>", "WARC-Date": "2024-02-24T16:07:46Z", "WARC-IP-Address": "198.54.114.232", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:6XJDVGAKYBMUSBYIIZE7VYRG4ILT4AME", "WARC-Record-ID": "<urn:uuid:3dbd4988-ba4c-41f1-89c7-8f76d7a1f402>", "WARC-Target-URI": "https://www.twinztech.com/use-vpn-to-improve-streaming-experience/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:0326d4b8-6e8b-45be-91e1-291b683cd88a>" }, "warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-196\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, 16, 17, 26, 27, 82, 83, 194, 195, 198, 199, 209, 210, 213, 214, 253, 254, 298, 299, 493, 494, 535, 536, 903, 904, 933, 934, 1266, 1267, 1294, 1295, 1703, 1704, 1715, 1716, 1745, 1746, 2023, 2024, 2046, 2047, 2274, 2275, 2536, 2537, 2859, 2860, 2976, 2977, 3217, 3218, 3347, 3348, 3359, 3360, 3638, 3639, 3834, 3835, 3852, 3869, 3870, 3884, 3885, 3956, 3957, 3965, 3966, 4025, 4026, 4163, 4164, 4167, 4168, 4178, 4179, 4182, 4183, 4209, 4210, 4425, 4426, 4455, 4456, 4897, 4898, 4926, 4927, 5380, 5381, 5404, 5405, 5559, 5560, 5747, 5933, 6156, 6362, 6550, 6551, 6576, 6577, 6735, 6736, 6908, 7109, 7301, 7479, 7708, 7709, 7767, 7768, 7792, 7793, 7947, 7948, 8197, 8465, 8737, 9011, 9306, 9638, 9639, 9664, 9665, 9704, 9705, 9905, 10104, 10321, 10571, 10779, 10780, 10791, 10792, 11025, 11026, 11043, 11057, 11071, 11110, 11111, 11187, 11188, 11206, 11207, 11266, 11267, 11287, 11288, 11346, 11347, 11375, 11376, 11463, 11464, 11486, 11487, 11561, 11562, 11584, 11585, 11624, 11625, 11646, 11647, 11690, 11691, 11714, 11715, 11779, 11780, 11801, 11802, 11881, 11882, 11903, 11904, 11980, 11981, 11995, 12009, 12010 ], "line_end_idx": [ 16, 17, 26, 27, 82, 83, 194, 195, 198, 199, 209, 210, 213, 214, 253, 254, 298, 299, 493, 494, 535, 536, 903, 904, 933, 934, 1266, 1267, 1294, 1295, 1703, 1704, 1715, 1716, 1745, 1746, 2023, 2024, 2046, 2047, 2274, 2275, 2536, 2537, 2859, 2860, 2976, 2977, 3217, 3218, 3347, 3348, 3359, 3360, 3638, 3639, 3834, 3835, 3852, 3869, 3870, 3884, 3885, 3956, 3957, 3965, 3966, 4025, 4026, 4163, 4164, 4167, 4168, 4178, 4179, 4182, 4183, 4209, 4210, 4425, 4426, 4455, 4456, 4897, 4898, 4926, 4927, 5380, 5381, 5404, 5405, 5559, 5560, 5747, 5933, 6156, 6362, 6550, 6551, 6576, 6577, 6735, 6736, 6908, 7109, 7301, 7479, 7708, 7709, 7767, 7768, 7792, 7793, 7947, 7948, 8197, 8465, 8737, 9011, 9306, 9638, 9639, 9664, 9665, 9704, 9705, 9905, 10104, 10321, 10571, 10779, 10780, 10791, 10792, 11025, 11026, 11043, 11057, 11071, 11110, 11111, 11187, 11188, 11206, 11207, 11266, 11267, 11287, 11288, 11346, 11347, 11375, 11376, 11463, 11464, 11486, 11487, 11561, 11562, 11584, 11585, 11624, 11625, 11646, 11647, 11690, 11691, 11714, 11715, 11779, 11780, 11801, 11802, 11881, 11882, 11903, 11904, 11980, 11981, 11995, 12009, 12010, 12018 ] }
{ "red_pajama_v2": { "ccnet_original_length": 12018, "ccnet_original_nlines": 182, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3312472105026245, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.021010279655456543, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.15780062973499298, "rps_doc_frac_unique_words": 0.3961558938026428, "rps_doc_mean_word_length": 5.199145793914795, "rps_doc_num_sentences": 119, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.88532829284668, "rps_doc_word_count": 1873, "rps_doc_frac_chars_dupe_10grams": 0.06859724968671799, "rps_doc_frac_chars_dupe_5grams": 0.10772231966257095, "rps_doc_frac_chars_dupe_6grams": 0.0836927518248558, "rps_doc_frac_chars_dupe_7grams": 0.0836927518248558, "rps_doc_frac_chars_dupe_8grams": 0.0836927518248558, "rps_doc_frac_chars_dupe_9grams": 0.0836927518248558, "rps_doc_frac_chars_top_2gram": 0.025877999141812325, "rps_doc_frac_chars_top_3gram": 0.0086260000243783, "rps_doc_frac_chars_top_4gram": 0.007393720094114542, "rps_doc_books_importance": -1020.8600463867188, "rps_doc_books_importance_length_correction": -1020.8600463867188, "rps_doc_openwebtext_importance": -548.414306640625, "rps_doc_openwebtext_importance_length_correction": -548.414306640625, "rps_doc_wikipedia_importance": -400.0794372558594, "rps_doc_wikipedia_importance_length_correction": -400.0794372558594 }, "fasttext": { "dclm": 0.026039419695734978, "english": 0.8930517435073853, "fineweb_edu_approx": 1.9502283334732056, "eai_general_math": 0.0014137000543996692, "eai_open_web_math": 0.07320017367601395, "eai_web_code": 0.00037240999517962337 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.822", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "639.7", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Agriculture", "level_3": "Hunting, Fishing, Trapping, and Fish culture" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "6", "label": "Promotional/Advertisement" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "2", "label": "Click Here References" }, "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" } } }
ece34605c058195ed03b4d393ef1a36c
-4,551,391,295,975,927,000
/[gentoo-x86]/eclass/mount-boot.eclass Gentoo Contents of /eclass/mount-boot.eclass Parent Directory Parent Directory | Revision Log Revision Log Revision 1.18 - (show annotations) (download) Sun Jan 9 03:18:38 2011 UTC (7 years, 2 months ago) by vapier Branch: MAIN Changes since 1.17: +33 -3 lines try to automatically remount/unmount /boot back to its pre-emerge state #348946 by Jaco Kroon 1 # Copyright 1999-2011 Gentoo Foundation 2 # Distributed under the terms of the GNU General Public License v2 3 # $Header: /var/cvsroot/gentoo-x86/eclass/mount-boot.eclass,v 1.17 2009/10/09 20:57:08 vapier Exp $ 4 # 5 # This eclass is really only useful for bootloaders. 6 # 7 # If the live system has a separate /boot partition configured, then this 8 # function tries to ensure that it's mounted in rw mode, exiting with an 9 # error if it cant. It does nothing if /boot isn't a separate partition. 10 # 11 # MAINTAINER: [email protected] 12 13 EXPORT_FUNCTIONS pkg_preinst pkg_postinst pkg_prerm pkg_postrm 14 15 mount-boot_mount_boot_partition() { 16 if [[ -n ${DONT_MOUNT_BOOT} ]] ; then 17 return 18 else 19 elog 20 elog "To avoid automounting and auto(un)installing with /boot," 21 elog "just export the DONT_MOUNT_BOOT variable." 22 elog 23 fi 24 25 # note that /dev/BOOT is in the Gentoo default /etc/fstab file 26 local fstabstate=$(awk '!/^#|^[[:blank:]]+#|^\/dev\/BOOT/ {print $2}' /etc/fstab | egrep "^/boot$" ) 27 local procstate=$(awk '$2 ~ /^\/boot$/ {print $2}' /proc/mounts) 28 local proc_ro=$(awk '{ print $2 " ," $4 "," }' /proc/mounts | sed -n '/\/boot .*,ro,/p') 29 30 if [ -n "${fstabstate}" ] && [ -n "${procstate}" ]; then 31 if [ -n "${proc_ro}" ]; then 32 einfo 33 einfo "Your boot partition, detected as being mounted as /boot, is read-only." 34 einfo "Remounting it in read-write mode ..." 35 einfo 36 mount -o remount,rw /boot 37 if [ "$?" -ne 0 ]; then 38 eerror 39 eerror "Unable to remount in rw mode. Please do it manually!" 40 eerror 41 die "Can't remount in rw mode. Please do it manually!" 42 fi 43 touch /boot/.e.remount 44 else 45 einfo 46 einfo "Your boot partition was detected as being mounted as /boot." 47 einfo "Files will be installed there for ${PN} to function correctly." 48 einfo 49 fi 50 elif [ -n "${fstabstate}" ] && [ -z "${procstate}" ]; then 51 mount /boot -o rw 52 if [ "$?" -eq 0 ]; then 53 einfo 54 einfo "Your boot partition was not mounted as /boot, but portage" 55 einfo "was able to mount it without additional intervention." 56 einfo "Files will be installed there for ${PN} to function correctly." 57 einfo 58 else 59 eerror 60 eerror "Cannot automatically mount your /boot partition." 61 eerror "Your boot partition has to be mounted rw before the installation" 62 eerror "can continue. ${PN} needs to install important files there." 63 eerror 64 die "Please mount your /boot partition manually!" 65 fi 66 touch /boot/.e.mount 67 else 68 einfo 69 einfo "Assuming you do not have a separate /boot partition." 70 einfo 71 fi 72 } 73 74 mount-boot_pkg_preinst() { 75 mount-boot_mount_boot_partition 76 } 77 78 mount-boot_pkg_prerm() { 79 touch "${ROOT}"/boot/.keep 2>/dev/null 80 mount-boot_mount_boot_partition 81 touch "${ROOT}"/boot/.keep 2>/dev/null 82 } 83 84 mount-boot_umount_boot_partition() { 85 if [[ -n ${DONT_MOUNT_BOOT} ]] ; then 86 return 87 fi 88 89 if [ -e /boot/.e.remount ] ; then 90 einfo 91 einfo "Automatically remounting /boot as ro" 92 einfo 93 rm -f /boot/.e.remount 94 mount -o remount,ro /boot 95 elif [ -e /boot/.e.mount ] ; then 96 einfo 97 einfo "Automatically unmounting /boot" 98 einfo 99 rm -f /boot/.e.mount 100 umount /boot 101 fi 102 } 103 104 mount-boot_pkg_postinst() { 105 mount-boot_umount_boot_partition 106 } 107 108 mount-boot_pkg_postrm() { 109 mount-boot_umount_boot_partition 110 }   ViewVC Help Powered by ViewVC 1.1.20  
{ "url": "https://sources.gentoo.org/cgi-bin/viewvc.cgi/gentoo-x86/eclass/mount-boot.eclass?revision=1.18&view=markup&sortby=log", "source_domain": "sources.gentoo.org", "snapshot_id": "crawl=CC-MAIN-2018-13", "warc_metadata": { "Content-Length": "27211", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:KJIUT2USJ4ROMUHB3H7QUATBTUZMHVUW", "WARC-Concurrent-To": "<urn:uuid:ee4a5311-5dc2-43b4-a1a3-15f532310004>", "WARC-Date": "2018-03-23T22:58:20Z", "WARC-IP-Address": "140.211.166.190", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:RD62FHZ5XRJLZHAATUOOVIXGQFHAJXQ3", "WARC-Record-ID": "<urn:uuid:0a718d17-90d1-46c9-92a2-38e6acc7a6fe>", "WARC-Target-URI": "https://sources.gentoo.org/cgi-bin/viewvc.cgi/gentoo-x86/eclass/mount-boot.eclass?revision=1.18&view=markup&sortby=log", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:85874114-c92b-4334-abf0-51539e1f482b>" }, "warc_info": "robots: classic\r\nhostname: ip-10-7-230-53.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-13\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for March 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }
{ "line_start_idx": [ 0, 39, 46, 47, 85, 86, 148, 149, 150, 196, 258, 271, 304, 398, 399, 441, 510, 612, 616, 671, 675, 751, 826, 901, 906, 946, 949, 1015, 1018, 1057, 1098, 1108, 1116, 1124, 1191, 1243, 1251, 1257, 1260, 1326, 1430, 1498, 1590, 1593, 1653, 1685, 1694, 1776, 1824, 1833, 1862, 1889, 1899, 1964, 1974, 2032, 2038, 2064, 2072, 2081, 2152, 2226, 2235, 2241, 2303, 2324, 2351, 2360, 2429, 2494, 2568, 2577, 2585, 2595, 2656, 2733, 2805, 2815, 2868, 2874, 2898, 2906, 2915, 2979, 2988, 2994, 2999, 3002, 3032, 3067, 3072, 3075, 3103, 3145, 3180, 3222, 3227, 3230, 3270, 3311, 3321, 3327, 3330, 3367, 3376, 3424, 3433, 3459, 3488, 3525, 3534, 3576, 3585, 3609, 3626, 3633, 3639, 3643, 3675, 3712, 3718, 3722, 3752, 3789, 3795, 3796, 3810 ], "line_end_idx": [ 39, 46, 47, 85, 86, 148, 149, 150, 196, 258, 271, 304, 398, 399, 441, 510, 612, 616, 671, 675, 751, 826, 901, 906, 946, 949, 1015, 1018, 1057, 1098, 1108, 1116, 1124, 1191, 1243, 1251, 1257, 1260, 1326, 1430, 1498, 1590, 1593, 1653, 1685, 1694, 1776, 1824, 1833, 1862, 1889, 1899, 1964, 1974, 2032, 2038, 2064, 2072, 2081, 2152, 2226, 2235, 2241, 2303, 2324, 2351, 2360, 2429, 2494, 2568, 2577, 2585, 2595, 2656, 2733, 2805, 2815, 2868, 2874, 2898, 2906, 2915, 2979, 2988, 2994, 2999, 3002, 3032, 3067, 3072, 3075, 3103, 3145, 3180, 3222, 3227, 3230, 3270, 3311, 3321, 3327, 3330, 3367, 3376, 3424, 3433, 3459, 3488, 3525, 3534, 3576, 3585, 3609, 3626, 3633, 3639, 3643, 3675, 3712, 3718, 3722, 3752, 3789, 3795, 3796, 3810, 3836 ] }
{ "red_pajama_v2": { "ccnet_original_length": 3836, "ccnet_original_nlines": 126, "rps_doc_curly_bracket": 0.010948910377919674, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.1595744639635086, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01595745049417019, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.4797872304916382, "rps_doc_frac_unique_words": 0.5634058117866516, "rps_doc_mean_word_length": 4.96195650100708, "rps_doc_num_sentences": 47, "rps_doc_symbol_to_word_ratio": 0.01702127978205681, "rps_doc_unigram_entropy": 5.3671956062316895, "rps_doc_word_count": 552, "rps_doc_frac_chars_dupe_10grams": 0.03943045064806938, "rps_doc_frac_chars_dupe_5grams": 0.1022270917892456, "rps_doc_frac_chars_dupe_6grams": 0.0839722529053688, "rps_doc_frac_chars_dupe_7grams": 0.06352683156728745, "rps_doc_frac_chars_dupe_8grams": 0.06352683156728745, "rps_doc_frac_chars_dupe_9grams": 0.03943045064806938, "rps_doc_frac_chars_top_2gram": 0.037970058619976044, "rps_doc_frac_chars_top_3gram": 0.03723986819386482, "rps_doc_frac_chars_top_4gram": 0.02409639023244381, "rps_doc_books_importance": -466.6711120605469, "rps_doc_books_importance_length_correction": -466.6711120605469, "rps_doc_openwebtext_importance": -293.78912353515625, "rps_doc_openwebtext_importance_length_correction": -293.78912353515625, "rps_doc_wikipedia_importance": -217.2583465576172, "rps_doc_wikipedia_importance_length_correction": -217.2583465576172 }, "fasttext": { "dclm": 0.06704246997833252, "english": 0.6226097345352173, "fineweb_edu_approx": 1.2500662803649902, "eai_general_math": 0.0633196234703064, "eai_open_web_math": 0.22208791971206665, "eai_web_code": 0.02039361000061035 } }
{ "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.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": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "6", "label": "Indeterminate" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
5,646,748,382,851,977,000
6 I'm a vb.net guy and have difficulty reading C#. I compiled the C# Dapper to a DLL and use it my app. My main concern is I think I need to modify the source to integrate by default the Transient Fault Handling Framework for SQL Azure in each SQL query. I can add the retry logic on the connection level because it is ont top of dapper, but not at the execute query level which is embedded in drapper class. Anyone has done that yet ? * UPDATE * Does using only ReliableSqlConnection on top of Dapper call will handle a retry logic on the execute non query ? Here is sample code of retry from MS with the transietn fault hanling using Microsoft.Practices.EnterpriseLibrary.WindowsAzure.TransientFaultHandling; using Microsoft.Practices.EnterpriseLibrary.WindowsAzure.TransientFaultHandling.AzureStorage; using Microsoft.Practices.EnterpriseLibrary.WindowsAzure.TransientFaultHandling.SqlAzure; using System.Data; ... using (ReliableSqlConnection conn = new ReliableSqlConnection(connString, retryPolicy)) { conn.Open(); IDbCommand selectCommand = conn.CreateCommand(); selectCommand.CommandText = "UPDATE Application SET [DateUpdated] = getdate()"; // Execute the above query using a retry-aware ExecuteCommand method which // will automatically retry if the query has failed (or connection was // dropped). int recordsAffected = conn.ExecuteCommand(selectCommand, retryPolicy); } Here is the execute part of Dapper code, same name is used but I guess it is a custom execute function private static int ExecuteCommand(IDbConnection cnn, IDbTransaction transaction, string sql, Action<IDbCommand, object> paramReader, object obj, int? commandTimeout, CommandType? commandType) { IDbCommand cmd = null; bool wasClosed = cnn.State == ConnectionState.Closed; try { cmd = SetupCommand(cnn, transaction, sql, paramReader, obj, commandTimeout, commandType); if (wasClosed) cnn.Open(); return cmd.ExecuteNonQuery(); } finally { if (wasClosed) cnn.Close(); if (cmd != null) cmd.Dispose(); } } 5 • I can confirm that I certainly haven't - although personally I would be expecting to implement transient fault handling around dapper rather than inside dapper. – Marc Gravell Mar 13 '13 at 7:44 • Yes but around dapper would be effective for the connection itself, but the logic integrate also ExecuteReaderWithRetry, or NonQuery, etc. The whole with retry at the execute level has to be integrated to dapper if i understand well. – Jérôme Tarere Mar 14 '13 at 17:24 • 1 Yeah but you could just write a "do with retry" extension method... – Marc Gravell Mar 14 '13 at 17:41 • Ok that's where my C# capabilities are too low to do that, and converting to VB.net via regular converter doesn't seems to work on this, do you know a very effective C# to VB.net service ? – Jérôme Tarere Mar 14 '13 at 18:51 • 1 I assume vb supports extension methods. If that is the case, you can write the extension method in your own project in vb. no translation necessary. – Marc Gravell Mar 14 '13 at 20:16 3 I would recommend wrapping the retry around Dapper, preferably by using the RetryPolicy.ExecuteAction method. That way both the OPEN call to the connection and the command itself will be retried using the TFH retry policy: For example: SqlRetryPolicy.ExecuteAction(() => { // Place Dapper ExecuteCommand here: e.g. ExecuteCommand(conn, trans, ... ) }); Your Answer By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy Not the answer you're looking for? Browse other questions tagged or ask your own question.
{ "url": "https://stackoverflow.com/questions/15372188/how-to-implement-sql-azure-transient-fault-handling-framework-for-dapper", "source_domain": "stackoverflow.com", "snapshot_id": "crawl=CC-MAIN-2021-21", "warc_metadata": { "Content-Length": "169213", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:DKUNQWGROLGFZILOYD6C2Z7LTMJTZMLD", "WARC-Concurrent-To": "<urn:uuid:8114ca08-501b-4656-8222-f321f08d219f>", "WARC-Date": "2021-05-09T01:19:56Z", "WARC-IP-Address": "151.101.1.69", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:M3OQHXHD2Q3AVCLJDX344GYHL5XMIL3U", "WARC-Record-ID": "<urn:uuid:93d2e110-ad35-4355-8715-50ca64da0ea9>", "WARC-Target-URI": "https://stackoverflow.com/questions/15372188/how-to-implement-sql-azure-transient-fault-handling-framework-for-dapper", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:6a9a6640-8b3a-47d8-bbd0-ad65a8fd0729>" }, "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-188.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 2, 3, 256, 257, 411, 412, 439, 440, 451, 452, 565, 566, 636, 637, 718, 812, 902, 921, 922, 926, 927, 1015, 1017, 1030, 1031, 1080, 1109, 1163, 1164, 1240, 1312, 1325, 1396, 1397, 1399, 1400, 1503, 1504, 1700, 1706, 1737, 1799, 1811, 1821, 1923, 1962, 2004, 2014, 2030, 2040, 2080, 2124, 2134, 2140, 2142, 2341, 2615, 2621, 2728, 2957, 2963, 3151, 3153, 3154, 3377, 3378, 3391, 3392, 3435, 3445, 3499, 3546, 3558, 3559, 3571, 3572, 3672, 3673 ], "line_end_idx": [ 2, 3, 256, 257, 411, 412, 439, 440, 451, 452, 565, 566, 636, 637, 718, 812, 902, 921, 922, 926, 927, 1015, 1017, 1030, 1031, 1080, 1109, 1163, 1164, 1240, 1312, 1325, 1396, 1397, 1399, 1400, 1503, 1504, 1700, 1706, 1737, 1799, 1811, 1821, 1923, 1962, 2004, 2014, 2030, 2040, 2080, 2124, 2134, 2140, 2142, 2341, 2615, 2621, 2728, 2957, 2963, 3151, 3153, 3154, 3377, 3378, 3391, 3392, 3435, 3445, 3499, 3546, 3558, 3559, 3571, 3572, 3672, 3673, 3763 ] }
{ "red_pajama_v2": { "ccnet_original_length": 3763, "ccnet_original_nlines": 78, "rps_doc_curly_bracket": 0.0026574500370770693, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2847222089767456, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03611110895872116, "rps_doc_frac_lines_end_with_ellipsis": 0.012658230029046535, "rps_doc_frac_no_alph_words": 0.2874999940395355, "rps_doc_frac_unique_words": 0.5120000243186951, "rps_doc_mean_word_length": 5.5960001945495605, "rps_doc_num_sentences": 55, "rps_doc_symbol_to_word_ratio": 0.009722219780087471, "rps_doc_unigram_entropy": 5.189183235168457, "rps_doc_word_count": 500, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.032165829092264175, "rps_doc_frac_chars_dupe_6grams": 0.032165829092264175, "rps_doc_frac_chars_dupe_7grams": 0.032165829092264175, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.007147959899157286, "rps_doc_frac_chars_top_3gram": 0.010007149539887905, "rps_doc_frac_chars_top_4gram": 0.012866330333054066, "rps_doc_books_importance": -336.78076171875, "rps_doc_books_importance_length_correction": -336.78076171875, "rps_doc_openwebtext_importance": -192.65347290039062, "rps_doc_openwebtext_importance_length_correction": -192.65347290039062, "rps_doc_wikipedia_importance": -108.6733169555664, "rps_doc_wikipedia_importance_length_correction": -108.6733169555664 }, "fasttext": { "dclm": 0.19487816095352173, "english": 0.8318631052970886, "fineweb_edu_approx": 1.4357831478118896, "eai_general_math": 0.11703432351350784, "eai_open_web_math": 0.08996731042861938, "eai_web_code": 0.020223919302225113 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.452", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
2,482,054,698,732,979,700
Linear Least Squares Solve linear least-squares problems with bounds or linear constraints Before you begin to solve an optimization problem, you must choose the appropriate approach: problem-based or solver-based. For details, see First Choose Problem-Based or Solver-Based Approach. Linear least-squares solves min||C*x - d||2, possibly with bounds or linear constraints. See Linear Least Squares. For the problem-based approach, create problem variables, and then represent the objective function and constraints in terms of these symbolic variables. For the problem-based steps to take, see Problem-Based Optimization Workflow. To solve the resulting problem, use solve. For the solver-based steps to take, including defining the objective function and constraints, and choosing the appropriate solver, see Solver-Based Optimization Problem Setup. To solve the resulting problem, use lsqlin or, for nonnegative least squares, you can also use lsqnonneg. Functions expand all evaluateEvaluate optimization expression infeasibilityConstraint violation at a point optimproblemCreate optimization problem optimvarCreate optimization variables solveSolve optimization problem or equation problem lsqlinSolve constrained linear least-squares problems lsqnonnegSolve nonnegative linear least-squares problem mldivide, \Solve systems of linear equations Ax = B for x Topics Problem-Based Linear Least Squares Shortest Distance to a Plane Shows how to solve a linear least-squares problem using the problem-based approach. Nonnegative Least-Squares, Problem-Based Shows how to solve a nonnegative linear least-squares problem using the problem-based approach and several solvers. Large-Scale Constrained Linear Least-Squares, Problem-Based Solves an optical deblurring problem using the problem-based approach. Solver-Based Linear Least Squares Optimization App with the lsqlin Solver Example showing the Optimization app and linear least squares. Linear Least Squares with Bound Constraints Example showing the use of bounds in nonlinear least squares. Jacobian Multiply Function with Linear Least Squares Example showing how to save memory in a large structured linear least-squares problem. Large-Scale Constrained Linear Least-Squares, Solver-Based Solves an optical deblurring problem using the solver-based approach. Problem-Based Algorithms Write Objective Function for Problem-Based Least Squares Syntax rules for problem-based least squares. Problem-Based Optimization Algorithms How the optimization functions and objects solve optimization problems. Supported Operations on Optimization Variables and Expressions Lists all available mathematical and indexing operations on optimization variables and expressions. Algorithms and Options Least-Squares (Model Fitting) Algorithms Minimizing a sum of squares in n dimensions with only bound or linear constraints. Optimization Options Reference Explore optimization options.
{ "url": "https://it.mathworks.com/help/optim/linear-least-squares.html?s_tid=CRUX_lftnav", "source_domain": "it.mathworks.com", "snapshot_id": "crawl=CC-MAIN-2019-43", "warc_metadata": { "Content-Length": "70782", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:PZFIXLHMZ5F734UL2JPFPUQ5ZPI3ZD3Z", "WARC-Concurrent-To": "<urn:uuid:0c611914-ffca-49f8-9ae8-cceeb5b2e9de>", "WARC-Date": "2019-10-23T02:25:31Z", "WARC-IP-Address": "104.110.193.39", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:DRTRYUWWKD7RWCAZ23CR74VIR72GDZPT", "WARC-Record-ID": "<urn:uuid:fe882d3f-97fc-45f2-a638-2acf10f89290>", "WARC-Target-URI": "https://it.mathworks.com/help/optim/linear-least-squares.html?s_tid=CRUX_lftnav", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:9dbfb75a-37f7-4eeb-b672-4d33c965a0ef>" }, "warc_info": "isPartOf: CC-MAIN-2019-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-235.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 21, 22, 92, 93, 287, 288, 403, 404, 679, 680, 963, 964, 974, 975, 986, 987, 1028, 1073, 1113, 1151, 1203, 1257, 1313, 1371, 1372, 1379, 1380, 1415, 1416, 1445, 1446, 1530, 1531, 1572, 1573, 1689, 1690, 1750, 1751, 1822, 1823, 1857, 1858, 1898, 1899, 1962, 1963, 2007, 2008, 2070, 2071, 2124, 2125, 2212, 2213, 2272, 2273, 2343, 2344, 2369, 2370, 2427, 2428, 2474, 2475, 2513, 2514, 2586, 2587, 2650, 2651, 2751, 2752, 2775, 2776, 2817, 2818, 2901, 2902, 2933, 2934 ], "line_end_idx": [ 21, 22, 92, 93, 287, 288, 403, 404, 679, 680, 963, 964, 974, 975, 986, 987, 1028, 1073, 1113, 1151, 1203, 1257, 1313, 1371, 1372, 1379, 1380, 1415, 1416, 1445, 1446, 1530, 1531, 1572, 1573, 1689, 1690, 1750, 1751, 1822, 1823, 1857, 1858, 1898, 1899, 1962, 1963, 2007, 2008, 2070, 2071, 2124, 2125, 2212, 2213, 2272, 2273, 2343, 2344, 2369, 2370, 2427, 2428, 2474, 2475, 2513, 2514, 2586, 2587, 2650, 2651, 2751, 2752, 2775, 2776, 2817, 2818, 2901, 2902, 2933, 2934, 2963 ] }
{ "red_pajama_v2": { "ccnet_original_length": 2963, "ccnet_original_nlines": 81, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.24032586812973022, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.004073319956660271, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.16904276609420776, "rps_doc_frac_unique_words": 0.34501346945762634, "rps_doc_mean_word_length": 6.657681941986084, "rps_doc_num_sentences": 21, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.341742515563965, "rps_doc_word_count": 371, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.2089068740606308, "rps_doc_frac_chars_dupe_6grams": 0.13684211671352386, "rps_doc_frac_chars_dupe_7grams": 0.07530363649129868, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.05344130098819733, "rps_doc_frac_chars_top_3gram": 0.051012150943279266, "rps_doc_frac_chars_top_4gram": 0.03279351815581322, "rps_doc_books_importance": -275.01953125, "rps_doc_books_importance_length_correction": -275.01953125, "rps_doc_openwebtext_importance": -134.17953491210938, "rps_doc_openwebtext_importance_length_correction": -134.17953491210938, "rps_doc_wikipedia_importance": -79.33551788330078, "rps_doc_wikipedia_importance_length_correction": -79.33551788330078 }, "fasttext": { "dclm": 0.03310286998748779, "english": 0.8410435318946838, "fineweb_edu_approx": 2.9342739582061768, "eai_general_math": 0.9998701810836792, "eai_open_web_math": 0.5558132529258728, "eai_web_code": 0.9818374514579773 } }
{ "free_decimal_correspondence": { "primary": { "code": "519.6", "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": "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": "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" } } }
ece34605c058195ed03b4d393ef1a36c
3,237,738,748,441,664,000
Microsoft Word Ordner in die Speicherleiste Office-AnwendungenSoftware Ergänzen Sie die Seitenleiste, um sich die Arbeit leichter zu machen. Office-Dateidialog ___ Wenn Sie ein Dokument in Microsoft Office abspeichern, sehen Sie einen Dialog, der mehr oder weniger wie ein Standarddatei-Dialog aussieht. Das ist er aber nicht. Dieser Office-Dateidialog ist weit flexibler. Links finden Sie eine Spalte mit oft genutzten Speicherorten, die Sie dank der Verknüpfungen mit nur einem Klick ansteuern können. Das Tolle am Office-Dateidialog ist, dass Sie eigene Ordner in diese Leiste aufnehmen können. Sie müssen also nicht extra in Eigene Dateien speichern, nur um von dieser Leiste zu profitieren. Ordner aufzunehmen, ist nicht schwer: Wählen Sie zunächst Datei/Speichern unter, um den Dateidialog aufzurufen. Navigieren Sie nun in den Ordner, den Sie in die Leiste aufnehmen möchten. Dann klicken Sie auf den kleinen Button Extras in der Ecke rechts oben und wählen den Eintrag Zu meiner Umgebung hinzufügen. Das Verzeichnis wird umgehend hinzugefügt, ist aber vermutlich nicht sichtbar, weil bei der Standardfenstergröße nur eine begrenzte Anzahl von Icons Platz findet. Verwenden Sie also die Scrollpfeile. Autor: swasi Anklicken um die Biografie des Autors zu lesen  Anklicken um die Biografie des Autors zu verbergen 
{ "url": "http://www.itespresso.de/2007/03/06/microsoft-word-pcpro-7/", "source_domain": "www.itespresso.de", "snapshot_id": "crawl=CC-MAIN-2017-51", "warc_metadata": { "Content-Length": "142583", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:PE7GFP7QEFSNSIIMYKNQYU3ZKOWLYVIX", "WARC-Concurrent-To": "<urn:uuid:00c33738-f099-46fe-9b0c-9c09374902fc>", "WARC-Date": "2017-12-13T21:04:22Z", "WARC-IP-Address": "95.131.143.115", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:X7ZA4CHZAXPJ4MNHSV5T6VPFANA4NBS4", "WARC-Record-ID": "<urn:uuid:1e9288eb-f77f-48a8-bbdb-3853c3e47959>", "WARC-Target-URI": "http://www.itespresso.de/2007/03/06/microsoft-word-pcpro-7/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:145cd4eb-f74d-4c5a-81ab-e6a34b9439f9>" }, "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, 15, 44, 45, 72, 73, 104, 123, 143, 144, 167, 168, 233, 298, 377, 439, 508, 571, 633, 700, 758, 823, 887, 953, 1016, 1081, 1104, 1125, 1144, 1167, 1189, 1212, 1213, 1226 ], "line_end_idx": [ 15, 44, 45, 72, 73, 104, 123, 143, 144, 167, 168, 233, 298, 377, 439, 508, 571, 633, 700, 758, 823, 887, 953, 1016, 1081, 1104, 1125, 1144, 1167, 1189, 1212, 1213, 1226, 1325 ] }
{ "red_pajama_v2": { "ccnet_original_length": 1325, "ccnet_original_nlines": 33, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.043478261679410934, "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.13913042843341827, "rps_doc_frac_unique_words": 0.6197916865348816, "rps_doc_mean_word_length": 5.75, "rps_doc_num_sentences": 13, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.506119728088379, "rps_doc_word_count": 192, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.061594199389219284, "rps_doc_frac_chars_dupe_6grams": 0.061594199389219284, "rps_doc_frac_chars_dupe_7grams": 0.061594199389219284, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.01449275016784668, "rps_doc_frac_chars_top_3gram": 0.025362320244312286, "rps_doc_frac_chars_top_4gram": 0.0416666716337204, "rps_doc_books_importance": -112.99571990966797, "rps_doc_books_importance_length_correction": -112.99571990966797, "rps_doc_openwebtext_importance": -55.55120086669922, "rps_doc_openwebtext_importance_length_correction": -55.55120086669922, "rps_doc_wikipedia_importance": -43.5702018737793, "rps_doc_wikipedia_importance_length_correction": -43.56971740722656 }, "fasttext": { "dclm": 0.9001148343086243, "english": 0.0005128100165165961, "fineweb_edu_approx": 1.5492547750473022, "eai_general_math": 0.0012915099505335093, "eai_open_web_math": 0.636505663394928, "eai_web_code": 0.4041098952293396 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.432", "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": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "1", "label": "No Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
6,408,370,565,186,617,000
Difference between revisions of "Upgrading 3.1 to 3.2" From EPrints Documentation Jump to: navigation, search Line 1: Line 1:   [[Category:Installation]]   [[Category:Installation]] [[Category:How-to]] + [[Category:Howto]]   [[Category:Manual]]   [[Category:Manual]]   == Why must I do this ==   == Why must I do this == Revision as of 17:16, 10 March 2010 Why must I do this This has always been an essential step of upgrading your EPrints repository. However in 3.2 we are making a particularly big deal about it for two reasons: 1. If you do not do it your server will not work 2. It takes several hours to do on large databases What is it doing It is upgrading the database structure to use UTF8 compatible tables rather than the previous latin1 tables. This means even better and more robust multi-lingual support. It is also adding essential configuration files to your EPrints cfg.d folder. Because EPrints now expects utf8 tables and the new cfg.d files it will not run correctly without performing the following upgrade. How do I do it? It's very easy /etc/init.d/httpd stop ./bin/epadmin upgrade <archive_id> /etc/init.d/httpd start Remember ./bin/epadmin upgrade <archive_id> will take serveral hours to run on large repositories because it has to modify every table in the database. On success you should see the message Database flag set to 3.2.1. If you have any problems let us know on EP-Tech. For free support and discussion about EPrints you can sign up to the EP-Tech here: http://mailman.ecs.soton.ac.uk/mailman/listinfo/eprints-tech. Summary • Critical for the successful running of your repo ./bin/epadmin upgrade <archive_id> • This may take some time dependant on the amount of records in your system and number of revisions. • The database will be upgraded to be faster and fully UTF8 compatible. • It is recommended that your web server (apache) is offline. • The final output of the command should be the version number of the database 3.2.1.
{ "url": "http://wiki.eprints.org/w/index.php?title=Upgrading_3.1_to_3.2&diff=prev&oldid=8860", "source_domain": "wiki.eprints.org", "snapshot_id": "crawl=CC-MAIN-2020-16", "warc_metadata": { "Content-Length": "21960", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:Z4CYM6UIY6LX5T2NVHY6PIWLOVZQJ3TM", "WARC-Concurrent-To": "<urn:uuid:f4b17f0e-77bc-410b-a209-851edffe77ea>", "WARC-Date": "2020-04-02T20:16:57Z", "WARC-IP-Address": "46.22.140.106", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:T4CP25CJACKI3AGHWWPY5ESRK37ZKKSL", "WARC-Record-ID": "<urn:uuid:e4bb22c6-257a-4942-8a3b-917759ca6067>", "WARC-Target-URI": "http://wiki.eprints.org/w/index.php?title=Upgrading_3.1_to_3.2&diff=prev&oldid=8860", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:de087ae9-efa5-4187-b9d5-1d34cc284334>" }, "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-212.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, 55, 56, 83, 111, 127, 129, 155, 157, 183, 203, 205, 224, 226, 246, 248, 268, 270, 295, 297, 322, 323, 359, 360, 379, 380, 536, 537, 588, 641, 642, 659, 660, 1041, 1042, 1058, 1059, 1074, 1075, 1098, 1133, 1157, 1158, 1310, 1311, 1377, 1378, 1572, 1573, 1581, 1582, 1635, 1636, 1671, 1672, 1775, 1849, 1913 ], "line_end_idx": [ 55, 56, 83, 111, 127, 129, 155, 157, 183, 203, 205, 224, 226, 246, 248, 268, 270, 295, 297, 322, 323, 359, 360, 379, 380, 536, 537, 588, 641, 642, 659, 660, 1041, 1042, 1058, 1059, 1074, 1075, 1098, 1133, 1157, 1158, 1310, 1311, 1377, 1378, 1572, 1573, 1581, 1582, 1635, 1636, 1671, 1672, 1775, 1849, 1913, 2000 ] }
{ "red_pajama_v2": { "ccnet_original_length": 2000, "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.32499998807907104, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01818181946873665, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.2704545557498932, "rps_doc_frac_unique_words": 0.5439739227294922, "rps_doc_mean_word_length": 4.977198600769043, "rps_doc_num_sentences": 34, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.8068413734436035, "rps_doc_word_count": 307, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.027486909180879593, "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.007853399962186813, "rps_doc_frac_chars_top_3gram": 0.015706809237599373, "rps_doc_frac_chars_top_4gram": 0.01963350921869278, "rps_doc_books_importance": -219.3102569580078, "rps_doc_books_importance_length_correction": -219.3102569580078, "rps_doc_openwebtext_importance": -95.92048645019531, "rps_doc_openwebtext_importance_length_correction": -95.92048645019531, "rps_doc_wikipedia_importance": -74.17325592041016, "rps_doc_wikipedia_importance_length_correction": -74.17325592041016 }, "fasttext": { "dclm": 0.15727615356445312, "english": 0.8801202774047852, "fineweb_edu_approx": 2.002315044403076, "eai_general_math": 0.16673463582992554, "eai_open_web_math": 0.41488116979599, "eai_web_code": 0.00009370000043418258 } }
{ "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": "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": "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" } } }
ece34605c058195ed03b4d393ef1a36c
-2,792,101,796,381,452,000
Languages and Scripting Showing results for  Search instead for  Do you mean  shell script for tracking processes SOLVED Go to Solution Super Advisor shell script for tracking processes Dear Sirs, We are running an application on hpux11i and it runs 2 processes. I want to know the shell script which can send me an email if the processes are stopped running. I am not a seasoned shell scriptor, so your help is appriable. Thanks, Shiv 1 ACCEPTED SOLUTION Highlighted Acclaimed Contributor Acclaimed Contributor Re: shell script for tracking processes Hi Shiv: You could create a 'cron' task for the following. Assume that you want to look for a process called "myproc" and email/page if it isn't running: # [ -z "`UNIX95= ps -C myproc -o pid= -o comm=`" ] && mailx -s "myproc" is not running!" root < /dev/null You could replicate this for you second process too. Regards! ...JRF... 13 REPLIES Highlighted Acclaimed Contributor Acclaimed Contributor Re: shell script for tracking processes Hi Shiv: You could create a 'cron' task for the following. Assume that you want to look for a process called "myproc" and email/page if it isn't running: # [ -z "`UNIX95= ps -C myproc -o pid= -o comm=`" ] && mailx -s "myproc" is not running!" root < /dev/null You could replicate this for you second process too. Regards! ...JRF... Honored Contributor Honored Contributor Re: shell script for tracking processes hi, for critical processes, you can also include the coding for the processes to restart also. of course, you should identified all possible scenarios that can cause your processes to stop.. kind regards yogeeraj No person was ever honoured for what he received. Honour has been the reward for what he gave (clavin coolidge) Honored Contributor Honored Contributor Re: shell script for tracking processes Hi Shiv, You can just use ps -ae |grep -i "process_name" and if [ $? >0 ] mailx -s "Process_name not running" -Arun "A ship in the harbor is safe, but that is not what ships are built for" Honored Contributor Honored Contributor Re: shell script for tracking processes Do you want to run it in continous manner or only one time? One time: ps -ef | grep -i | mailx -s "Process Info" ID -- Muthu Easy to suggest when don't know about the problem! Honored Contributor Honored Contributor Re: shell script for tracking processes To use for all process requirement: #!/bin/ksh PROCESS_NAME= SLEEP_TIME=60 # 1 minute while [[ 1 ]] do ps -ef | grep -qi "${PROCESS_NAME}" | mailx -s "Process @ $(date)" ID sleep ${SLEEP_TIME} done # END exit 0 -- Muthu Easy to suggest when don't know about the problem! Esteemed Contributor Esteemed Contributor Re: shell script for tracking processes Hi Shiv, something like this PROCESS_COUNT=$(ps -fu <script user> | grep <script_name> | grep -v grep) case $PROCESS_COUNT in 0) TITLE= echo "ERR: <script_name is not running"|mailx -s $TITLE ;; 1) #OK ;; *) TITLE= echo "ERR: more than 1 process is running"|mailx -s $TITLE ;; esac HTH, Art Honored Contributor Honored Contributor Re: shell script for tracking processes James' script is the preferred method as it does not use grep to find a process. grep and ps can make a lot of mistakes since grep does not limit it's comparison to a specific field. However, all scripts that monitor the system to provide notifications will cause big email problems if they do not stop or slow down once the notification has been sent. You can put James' 1-liner into a loop that runs until a notification is made: #!/usr/bin/sh set -u export PATH=/usr/bin # $1 is the process to monitor if [ $# -lt 1 ] then echo "need MYPROC" exit 1 fi MYPROC=$1 SYSADM=root # replace root with another email addr MONSECS=30 RETRYSECS=3600 while : do MYSTATUS="$(UNIX95= $MYPROC -o pid= -o comm=)" if [ -z "$MYPROC" ] then mailx -s "$MYPROC is not running!" $SYSADM sleep $RETRYSECS fi sleep $MONSECS done Now start the script in the background and it will run forever, but will provide the email warning once (within 30 seconds) of the failure, and then repeat the message every hour until the process is fixed. Honored Contributor Honored Contributor Re: shell script for tracking processes Whoops, some text is missing on the MYSTATUS line. It should read: MYSTATUS="$(UNIX95= ps -C $MYPROC -o pid= -o comm=)" Frequent Advisor Re: shell script for tracking processes Hello, I am also interesting in this. But i find that $MYSTATUS is always null. What might i be doing wrong? I presume the script is supposed to be "-z $MYSTATUS" rather than $MYPROC. I am aware of UNIX95 but ps -C.... is always null... :-( this would be most useful! Honored Contributor Honored Contributor Re: shell script for tracking processes The -C option provides an exact process name match. So if you were looking for /usr/bin/vi, the command would be: UNIX95= ps -f -C vi and to store the results of the ps search: MYSTATUS=$(UNIX95= ps -f -C vi) echo $MYSTATUS Be sure you do not put a pathname (ie, -C /usr/bin/vi) because that is not the process name. The process name is just the last part of a pathname. Valued Contributor Valued Contributor Re: shell script for tracking processes Hi, check it out also # ps -efx | grep to see all parameters of a process running, very useful with java processes. Pablo share share share Exalted Contributor Exalted Contributor Re: shell script for tracking processes Shiv, I agree with Bill. JRF's script is the most elegant and efficient because it does it all on one line. Note: Do not set the UNIX95 variable by default in /etc/profile, .profile or other profiles, unless you create a special user for this. A VERY common gotcha is setting this variable by default. It interferes with SD/UX when you sh a patch depot, it triggers checksum failures. I will admit that I fell victim to this very mistake some years ago. SEP Steven E Protter Owner of ISN Corporation http://isnamerica.com http://hpuxconsulting.com Sponsor: http://hpux.ws Twitter: http://twitter.com/hpuxlinux Founder http://newdatacloud.com Frequent Advisor Re: shell script for tracking processes Hi, This is great. I have got this working now. We have a stupid electronic invoicing system that send out emails. but it dies if it looses connection to the smtp server even for a second. don't ask why it can't wait..... p poor code.... anyway, I think i will run this in a start up script and monitor the process. Thanks for the warning on UNIX95. i think i will just run this as root, but set the variable in the script. many thanks:-D
{ "url": "http://community.hpe.com/t5/Languages-and-Scripting/shell-script-for-tracking-processes/m-p/3719733", "source_domain": "community.hpe.com", "snapshot_id": "crawl=CC-MAIN-2016-18", "warc_metadata": { "Content-Length": "383481", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:JOJTAGKFIK7SG3QLOKB2W3WL2SQ26KUM", "WARC-Concurrent-To": "<urn:uuid:26837de6-47f5-4514-861d-b95afc4e3fae>", "WARC-Date": "2016-04-29T11:07:15Z", "WARC-IP-Address": "208.74.205.44", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:2AA764NA4BLLYAOKPUMDPKXNIA2PHJWK", "WARC-Record-ID": "<urn:uuid:71257c02-2d1c-400e-bb78-b9294fb19f7b>", "WARC-Target-URI": "http://community.hpe.com/t5/Languages-and-Scripting/shell-script-for-tracking-processes/m-p/3719733", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:4f712a3d-a830-4062-a45f-dc49f5185240>" }, "warc_info": "robots: classic\r\nhostname: ip-10-239-7-51.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }
{ "line_start_idx": [ 0, 24, 45, 65, 78, 79, 115, 116, 123, 138, 152, 153, 189, 190, 201, 202, 268, 269, 366, 367, 430, 431, 439, 444, 464, 476, 520, 521, 561, 562, 571, 572, 717, 718, 824, 825, 878, 879, 888, 889, 899, 900, 911, 923, 967, 968, 1008, 1009, 1018, 1019, 1164, 1165, 1271, 1272, 1325, 1326, 1335, 1336, 1346, 1347, 1387, 1388, 1428, 1429, 1433, 1434, 1525, 1526, 1622, 1623, 1636, 1645, 1757, 1797, 1798, 1838, 1839, 1848, 1849, 1950, 1951, 1957, 2030, 2070, 2071, 2111, 2112, 2172, 2173, 2183, 2184, 2230, 2231, 2234, 2240, 2291, 2331, 2332, 2372, 2373, 2409, 2410, 2421, 2435, 2460, 2461, 2475, 2478, 2479, 2549, 2550, 2570, 2571, 2576, 2577, 2583, 2590, 2591, 2594, 2600, 2651, 2693, 2694, 2734, 2735, 2744, 2764, 2838, 2861, 2871, 2927, 2930, 2937, 2940, 2950, 3009, 3012, 3017, 3018, 3023, 3027, 3067, 3068, 3108, 3109, 3292, 3293, 3542, 3543, 3557, 3564, 3585, 3616, 3632, 3637, 3656, 3663, 3666, 3667, 3677, 3728, 3739, 3754, 3755, 3756, 3764, 3767, 3814, 3834, 3839, 3882, 3899, 3902, 3917, 3922, 3923, 4130, 4170, 4171, 4211, 4212, 4279, 4280, 4333, 4350, 4351, 4391, 4392, 4399, 4400, 4473, 4474, 4503, 4504, 4579, 4580, 4637, 4638, 4665, 4705, 4706, 4746, 4747, 4861, 4862, 4882, 4883, 4926, 4927, 4959, 4974, 4975, 5122, 5160, 5161, 5201, 5202, 5206, 5207, 5225, 5226, 5243, 5244, 5288, 5289, 5322, 5323, 5324, 5330, 5348, 5388, 5389, 5429, 5430, 5436, 5437, 5539, 5540, 5546, 5676, 5677, 5818, 5819, 5888, 5889, 5893, 5910, 5935, 5957, 5983, 6007, 6045, 6077, 6094, 6095, 6135, 6136, 6140, 6141, 6375, 6376, 6562, 6563 ], "line_end_idx": [ 24, 45, 65, 78, 79, 115, 116, 123, 138, 152, 153, 189, 190, 201, 202, 268, 269, 366, 367, 430, 431, 439, 444, 464, 476, 520, 521, 561, 562, 571, 572, 717, 718, 824, 825, 878, 879, 888, 889, 899, 900, 911, 923, 967, 968, 1008, 1009, 1018, 1019, 1164, 1165, 1271, 1272, 1325, 1326, 1335, 1336, 1346, 1347, 1387, 1388, 1428, 1429, 1433, 1434, 1525, 1526, 1622, 1623, 1636, 1645, 1757, 1797, 1798, 1838, 1839, 1848, 1849, 1950, 1951, 1957, 2030, 2070, 2071, 2111, 2112, 2172, 2173, 2183, 2184, 2230, 2231, 2234, 2240, 2291, 2331, 2332, 2372, 2373, 2409, 2410, 2421, 2435, 2460, 2461, 2475, 2478, 2479, 2549, 2550, 2570, 2571, 2576, 2577, 2583, 2590, 2591, 2594, 2600, 2651, 2693, 2694, 2734, 2735, 2744, 2764, 2838, 2861, 2871, 2927, 2930, 2937, 2940, 2950, 3009, 3012, 3017, 3018, 3023, 3027, 3067, 3068, 3108, 3109, 3292, 3293, 3542, 3543, 3557, 3564, 3585, 3616, 3632, 3637, 3656, 3663, 3666, 3667, 3677, 3728, 3739, 3754, 3755, 3756, 3764, 3767, 3814, 3834, 3839, 3882, 3899, 3902, 3917, 3922, 3923, 4130, 4170, 4171, 4211, 4212, 4279, 4280, 4333, 4350, 4351, 4391, 4392, 4399, 4400, 4473, 4474, 4503, 4504, 4579, 4580, 4637, 4638, 4665, 4705, 4706, 4746, 4747, 4861, 4862, 4882, 4883, 4926, 4927, 4959, 4974, 4975, 5122, 5160, 5161, 5201, 5202, 5206, 5207, 5225, 5226, 5243, 5244, 5288, 5289, 5322, 5323, 5324, 5330, 5348, 5388, 5389, 5429, 5430, 5436, 5437, 5539, 5540, 5546, 5676, 5677, 5818, 5819, 5888, 5889, 5893, 5910, 5935, 5957, 5983, 6007, 6045, 6077, 6094, 6095, 6135, 6136, 6140, 6141, 6375, 6376, 6562, 6563, 6577 ] }
{ "red_pajama_v2": { "ccnet_original_length": 6577, "ccnet_original_nlines": 262, "rps_doc_curly_bracket": 0.0006081800092943013, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.318497896194458, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.05632822960615158, "rps_doc_frac_lines_end_with_ellipsis": 0.011406839825212955, "rps_doc_frac_no_alph_words": 0.244784414768219, "rps_doc_frac_unique_words": 0.3648393154144287, "rps_doc_mean_word_length": 4.681474685668945, "rps_doc_num_sentences": 61, "rps_doc_symbol_to_word_ratio": 0.013212800025939941, "rps_doc_unigram_entropy": 5.327150821685791, "rps_doc_word_count": 1058, "rps_doc_frac_chars_dupe_10grams": 0.24470017850399017, "rps_doc_frac_chars_dupe_5grams": 0.31677770614624023, "rps_doc_frac_chars_dupe_6grams": 0.30123159289360046, "rps_doc_frac_chars_dupe_7grams": 0.2963860332965851, "rps_doc_frac_chars_dupe_8grams": 0.28346458077430725, "rps_doc_frac_chars_dupe_9grams": 0.2547950744628906, "rps_doc_frac_chars_top_2gram": 0.03775490075349808, "rps_doc_frac_chars_top_3gram": 0.0452251210808754, "rps_doc_frac_chars_top_4gram": 0.07106804102659225, "rps_doc_books_importance": -607.5277099609375, "rps_doc_books_importance_length_correction": -607.5277099609375, "rps_doc_openwebtext_importance": -366.7351379394531, "rps_doc_openwebtext_importance_length_correction": -366.7351379394531, "rps_doc_wikipedia_importance": -262.0865478515625, "rps_doc_wikipedia_importance_length_correction": -262.0865478515625 }, "fasttext": { "dclm": 0.03401821851730347, "english": 0.861193835735321, "fineweb_edu_approx": 1.4354861974716187, "eai_general_math": 0.2948225736618042, "eai_open_web_math": 0.11645585298538208, "eai_web_code": 0.02918088063597679 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.445", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.678", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "3", "label": "Incoherent Flow" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
-5,771,044,863,584,328,000
linux-nfs.vger.kernel.org archive mirror help / color / mirror / Atom feed [PATCH v1 00/61] Update NFSD XDR functions 2020-11-13 15:03 UTC (9+ messages) ` [PATCH v1 01/61] NFSD: Fix returned READDIR offset cookie ` [PATCH v1 02/61] SUNRPC: Add xdr_set_scratch_page() and xdr_reset_scratch_buffer() ` [PATCH v1 03/61] SUNRPC: Prepare for xdr_stream-style decoding on the server-side ` [PATCH v1 04/61] NFSD: Add common helpers to decode void args and encode void results ` [PATCH v1 05/61] NFSD: Replace the internals of the READ_BUF() macro ` [PATCH v1 06/61] NFSD: Replace READ* macros in nfsd4_decode_access() ` [PATCH v1 08/61] NFSD: Replace READ* macros in nfsd4_decode_commit() ` [PATCH v1 09/61] NFSD: Replace READ* macros in nfsd4_decode_create() Adventures in NFS re-exporting 2020-11-13 14:50 UTC (13+ messages) [PATCH v3 00/11] Add RDMA support to the pNFS file+flexfiles data channels 2020-11-13 12:48 UTC (14+ messages) ` [PATCH v3 01/11] SUNRPC: xprt_load_transport() needs to support the netid "rdma6" ` [PATCH v3 02/11] SUNRPC: Close a race with transport setup and module put ` [PATCH v3 03/11] SUNRPC: Add a helper to return the transport identifier given a netid ` [PATCH v3 04/11] NFS: Switch mount code to use xprt_find_transport_ident() ` [PATCH v3 05/11] SUNRPC: Remove unused function xprt_load_transport() ` [PATCH v3 06/11] NFSv4/pNFS: Use connections to a DS that are all of the same protocol family ` [PATCH v3 07/11] pNFS: Add helpers for allocation/free of struct nfs4_pnfs_ds_addr ` [PATCH v3 08/11] NFSv4/pNFS: Store the transport type in " ` [PATCH v3 09/11] pNFS/flexfiles: Fix up layoutstats reporting for non-TCP transports ` [PATCH v3 10/11] SUNRPC: Fix up open coded kmemdup_nul() ` [PATCH v3 11/11] pNFS: Clean up open coded xdr string decoding [PATCH v5 00/22] Readdir enhancements 2020-11-13 11:09 UTC (35+ messages) ` [PATCH v5 01/22] NFS: Remove unnecessary inode locking in nfs_llseek_dir() ` [PATCH v5 02/22] NFS: Remove unnecessary inode lock in nfs_fsync_dir() ` [PATCH v5 03/22] NFSv4.2: condition READDIR's mask for security label based on LSM state ` [PATCH v5 04/22] NFS: Ensure contents of struct nfs_open_dir_context are consistent ` [PATCH v5 05/22] NFS: Clean up readdir struct nfs_cache_array ` [PATCH v5 06/22] NFS: Clean up nfs_readdir_page_filler() ` [PATCH v5 07/22] NFS: Clean up directory array handling ` [PATCH v5 08/22] NFS: Don't discard readdir results ` [PATCH v5 09/22] NFS: Remove unnecessary kmap in nfs_readdir_xdr_to_array() ` [PATCH v5 10/22] NFS: Replace kmap() with kmap_atomic() in nfs_readdir_search_array() ` [PATCH v5 11/22] NFS: Simplify struct nfs_cache_array_entry ` [PATCH v5 12/22] NFS: Support larger readdir buffers ` [PATCH v5 13/22] NFS: More readdir cleanups ` [PATCH v5 14/22] NFS: nfs_do_filldir() does not return a value ` [PATCH v5 15/22] NFS: Reduce readdir stack usage ` [PATCH v5 16/22] NFS: Cleanup to remove nfs_readdir_descriptor_t typedef ` [PATCH v5 17/22] NFS: Allow the NFS generic code to pass in a verifier to readdir ` [PATCH v5 18/22] NFS: Handle NFS4ERR_NOT_SAME and NFSERR_BADCOOKIE from readdir calls ` [PATCH v5 19/22] NFS: Improve handling of directory verifiers ` [PATCH v5 20/22] NFS: Optimisations for monotonically increasing readdir cookies ` [PATCH v5 21/22] NFS: Reduce number of RPC calls when doing uncached readdir ` [PATCH v5 22/22] NFS: Do uncached readdir when we're seeking a cookie in an empty page cache [GIT PULL] Please pull NFS Client Bugfixes for Linux 5.10-rc4 2020-11-12 22:11 UTC (2+ messages) [PATCH v1] svcrdma: Catch another Reply chunk overflow case 2020-11-12 21:55 UTC [RFC][PATCH 00/18] crypto: Add generic Kerberos library 2020-11-12 21:09 UTC (28+ messages) ` [PATCH 01/18] crypto/krb5: Implement Kerberos crypto core ` [PATCH 02/18] crypto/krb5: Add some constants out of sunrpc headers ` [PATCH 03/18] crypto/krb5: Provide infrastructure and key derivation ` [PATCH 04/18] crypto/krb5: Implement the Kerberos5 rfc3961 " ` [PATCH 05/18] crypto/krb5: Implement the Kerberos5 rfc3961 encrypt and decrypt functions ` [PATCH 06/18] crypto/krb5: Implement the Kerberos5 rfc3961 get_mic and verify_mic ` [PATCH 07/18] crypto/krb5: Implement the AES enctypes from rfc3962 ` [PATCH 08/18] crypto/krb5: Implement crypto self-testing ` [PATCH 09/18] crypto/krb5: Implement the AES enctypes from rfc8009 ` [PATCH 10/18] crypto/krb5: Implement the AES encrypt/decrypt " ` [PATCH 11/18] crypto/krb5: Add the AES self-testing data " ` [PATCH 12/18] crypto/krb5: Implement the Camellia enctypes from rfc6803 ` [PATCH 13/18] rxrpc: Add the security index for yfs-rxgk ` [PATCH 14/18] rxrpc: Add YFS RxGK (GSSAPI) security class ` [PATCH 15/18] rxrpc: rxgk: Provide infrastructure and key derivation ` [PATCH 16/18] rxrpc: rxgk: Implement the yfs-rxgk security class (GSSAPI) ` [PATCH 17/18] rxrpc: rxgk: Implement connection rekeying ` [PATCH 18/18] rxgk: Support OpenAFS's rxgk implementation [PATCH] lockd: don't use interval-based rebinding over TCP 2020-11-12 21:04 UTC (2+ messages) [PATCH] SUNRPC: Fix oops in the rpc_xdr_buf event class 2020-11-12 21:03 UTC (4+ messages) kernel oops in generic/013 on an rdma mount (over either soft roce or iwarp) 2020-11-12 20:48 UTC (13+ messages) [PATCH v1 0/4] NFSD tracepoint clean-ups for v5.11 2020-11-12 19:46 UTC (7+ messages) ` [PATCH v1 1/4] SUNRPC: Move the svc_xdr_recvfrom() tracepoint ` [PATCH v1 2/4] NFSD: Clean up the show_nf_may macro ` [PATCH v1 3/4] NFSD: Remove extra "0x" in tracepoint format specifier ` [PATCH v1 4/4] NFSD: Add SPDX header for fs/nfsd/trace.c Bug 209399 - Can't unmount bind-mounted NFS mounts with "Stale file handle" 2020-11-12 17:01 UTC [PATCH] NFSv4.2: fix failure to unregister shrinker 2020-11-12 14:07 UTC (3+ messages) [PATCH v5 0/2] NFS: Fix interaction between fs_context and user namespaces 2020-11-12 10:09 UTC (3+ messages) ` [PATCH v5 1/2] NFS: NFSv2/NFSv3: Use cred from fs_context during mount ` [PATCH v5 2/2] NFSv4: Refactor to use user namespaces for nfs4idmap [PATCH v4 0/2] NFS: Fix interaction between fs_context and user namespaces 2020-11-12 0:42 UTC (9+ messages) [PATCH v4 1/1] NFSv4.2: Fix NFS4ERR_STALE error when doing inter server copy 2020-11-11 23:02 UTC (15+ messages) [PATCH v4 00/21] Readdir enhancements 2020-11-11 20:11 UTC (31+ messages) ` [PATCH v4 01/21] NFS: Remove unnecessary inode locking in nfs_llseek_dir() ` [PATCH v4 02/21] NFS: Remove unnecessary inode lock in nfs_fsync_dir() ` [PATCH v4 03/21] NFS: Ensure contents of struct nfs_open_dir_context are consistent ` [PATCH v4 04/21] NFS: Clean up readdir struct nfs_cache_array ` [PATCH v4 05/21] NFS: Clean up nfs_readdir_page_filler() ` [PATCH v4 06/21] NFS: Clean up directory array handling ` [PATCH v4 07/21] NFS: Don't discard readdir results ` [PATCH v4 08/21] NFS: Remove unnecessary kmap in nfs_readdir_xdr_to_array() ` [PATCH v4 09/21] NFS: Replace kmap() with kmap_atomic() in nfs_readdir_search_array() ` [PATCH v4 10/21] NFS: Simplify struct nfs_cache_array_entry ` [PATCH v4 11/21] NFS: Support larger readdir buffers ` [PATCH v4 12/21] NFS: More readdir cleanups ` [PATCH v4 13/21] NFS: nfs_do_filldir() does not return a value ` [PATCH v4 14/21] NFS: Reduce readdir stack usage ` [PATCH v4 15/21] NFS: Cleanup to remove nfs_readdir_descriptor_t typedef ` [PATCH v4 16/21] NFS: Allow the NFS generic code to pass in a verifier to readdir ` [PATCH v4 17/21] NFS: Handle NFS4ERR_NOT_SAME and NFSERR_BADCOOKIE from readdir calls ` [PATCH v4 18/21] NFS: Improve handling of directory verifiers ` [PATCH v4 19/21] NFS: Optimisations for monotonically increasing readdir cookies ` [PATCH v4 20/21] NFS: Reduce number of RPC calls when doing uncached readdir ` [PATCH v4 21/21] NFS: Do uncached readdir when we're seeking a cookie in an empty page cache Corporate and Personal Loan * 2020-11-11 8:31 UTC [PATCH] fs/nfsd: remove unused NFSDDBG_FACILITY to tame gcc 2020-11-11 5:52 UTC (4+ messages) ` [kbuild-all] " [PATCH] NFSD: Fix 5 seconds delay when doing inter server copy 2020-11-11 0:40 UTC [PATCH] nfs-v4client.target: NFSv4 only client target 2020-11-10 19:41 UTC (2+ messages) [PATCH 0/3 V2] Enable config.d directory to be processed 2020-11-10 19:41 UTC (2+ messages) [nfs:testing 31/31] fs/nfs/pnfs_nfs.c:1088:22: error: passing argument 1 of 'kmemdup_nul' from incompatible pointer type 2020-11-10 19:19 UTC [PATCH 0/3] Add RDMA support to the pNFS file+flexfiles data channels 2020-11-10 16:26 UTC (5+ messages) ` [PATCH 1/3] SUNRPC: xprt_load_transport() needs to support the netid "rdma6" ` [PATCH 2/3] NFSv4/pNFS: Use connections to a DS that are all of the same protocol family ` [PATCH 3/3] NFSv4/pNFS: Store the transport type in struct nfs4_pnfs_ds_addr question about labeled NFS+rfc7569+selinux 2020-11-10 15:35 UTC (3+ messages) ` [nfsv4] " [PATCH RFC] SUNRPC: Use zero-copy to perform socket send operations 2020-11-10 14:49 UTC (10+ messages) Subject: [RFC] clang tooling cleanups 2020-11-10 13:12 UTC (3+ messages) [PATCH RFC PKS/PMEM 00/58] PMEM: Introduce stray write protection for PMEM 2020-11-10 8:48 UTC (5+ messages) ` [PATCH RFC PKS/PMEM 05/58] kmap: Introduce k[un]map_thread Last NFSD update breaks nfsv4.2 copy_file_range 2020-11-10 4:18 UTC [PATCH v2 0/5] Add RDMA support to the pNFS file+flexfiles data channels 2020-11-09 22:06 UTC (8+ messages) ` [PATCH v2 1/5] SUNRPC: xprt_load_transport() needs to support the netid "rdma6" ` [PATCH v2 2/5] NFSv4/pNFS: Use connections to a DS that are all of the same protocol family ` [PATCH v2 3/5] NFSv4/pNFS: Store the transport type in struct nfs4_pnfs_ds_addr ` [PATCH v2 4/5] pNFS/flexfiles: Fix up layoutstats reporting for non-TCP transports ` [PATCH v2 5/5] pNFS: Clean up open coded kmemdup_nul() [GIT PULL] nfsd 5.10 fixes 2020-11-09 20:45 UTC (2+ messages) [PATCH v1 00/13] xprtrdma tracepoint cleanup 2020-11-09 19:40 UTC (14+ messages) ` [PATCH v1 01/13] xprtrdma: Replace dprintk call sites in ERR_CHUNK path ` [PATCH v1 02/13] xprtrdma: Introduce Receive completion IDs ` [PATCH v1 03/13] xprtrdma: Introduce Send " ` [PATCH v1 04/13] xprtrdma: Introduce FRWR " ` [PATCH v1 05/13] xprtrdma: Clean up trace_xprtrdma_post_linv ` [PATCH v1 06/13] xprtrdma: Clean up reply parsing error tracepoints ` [PATCH v1 07/13] xprtrdma: Clean up tracepoints in the reply path ` [PATCH v1 08/13] xprtrdma: Clean up xprtrdma callback tracepoints ` [PATCH v1 09/13] xprtrdma: Clean up trace_xprtrdma_nomrs() ` [PATCH v1 10/13] xprtrdma: Display the task ID when reporting MR events ` [PATCH v1 11/13] xprtrdma: Trace unmap_sync calls ` [PATCH v1 12/13] xprtrdma: Move rpcrdma_mr_put() ` [PATCH v1 13/13] xprtrdma: Micro-optimize MR DMA-unmapping page: | | latest This is a public inbox, see mirroring instructions for how to clone and mirror all data and code used for this inbox; as well as URLs for NNTP newsgroup(s).
{ "url": "https://lore.kernel.org/linux-nfs/?t=20201113150315", "source_domain": "lore.kernel.org", "snapshot_id": "crawl=CC-MAIN-2021-43", "warc_metadata": { "Content-Length": "23770", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:TVXVIGFYXIYF4F7BVJCZJHQZLWV3ERPP", "WARC-Concurrent-To": "<urn:uuid:786e8e89-282e-492c-b687-b7ffbb292ce1>", "WARC-Date": "2021-10-26T13:13:07Z", "WARC-IP-Address": "139.178.84.217", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:JWVOIY5ZSDX55DSJIVAU7JYQTFUFC3DK", "WARC-Record-ID": "<urn:uuid:c552a521-b500-409a-bd3a-f35e4e289df5>", "WARC-Target-URI": "https://lore.kernel.org/linux-nfs/?t=20201113150315", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:f811ee2b-ff62-422d-a39e-5ce93a1894c4>" }, "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-13\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, 41, 76, 119, 156, 216, 301, 385, 473, 544, 615, 686, 757, 758, 789, 827, 828, 903, 941, 1025, 1103, 1196, 1279, 1359, 1465, 1562, 1637, 1740, 1817, 1902, 1903, 1941, 1979, 2056, 2131, 2226, 2318, 2390, 2459, 2529, 2597, 2691, 2797, 2879, 2956, 3026, 3117, 3196, 3301, 3417, 3539, 3639, 3760, 3879, 4016, 4017, 4079, 4116, 4117, 4177, 4200, 4201, 4257, 4295, 4355, 4425, 4496, 4559, 4650, 4734, 4803, 4862, 4931, 4996, 5057, 5131, 5190, 5250, 5321, 5397, 5456, 5516, 5517, 5576, 5613, 5614, 5670, 5707, 5708, 5785, 5823, 5824, 5875, 5912, 5976, 6030, 6102, 6161, 6162, 6238, 6261, 6262, 6314, 6351, 6352, 6427, 6464, 6537, 6607, 6608, 6683, 6720, 6721, 6798, 6836, 6837, 6875, 6913, 6990, 7065, 7155, 7225, 7292, 7360, 7426, 7518, 7622, 7702, 7777, 7845, 7934, 8011, 8114, 8228, 8348, 8446, 8565, 8682, 8817, 8818, 8848, 8871, 8872, 8932, 8969, 8990, 8991, 9054, 9077, 9078, 9132, 9169, 9170, 9227, 9264, 9265, 9386, 9409, 9410, 9480, 9517, 9596, 9689, 9772, 9773, 9816, 9853, 9869, 9870, 9938, 9976, 9977, 10015, 10052, 10053, 10128, 10165, 10226, 10227, 10275, 10298, 10299, 10372, 10409, 10491, 10587, 10673, 10764, 10829, 10830, 10857, 10894, 10895, 10940, 10978, 11052, 11114, 11160, 11206, 11269, 11339, 11407, 11475, 11536, 11610, 11662, 11713, 11774, 11775, 11794, 11795, 11846, 11913 ], "line_end_idx": [ 41, 76, 119, 156, 216, 301, 385, 473, 544, 615, 686, 757, 758, 789, 827, 828, 903, 941, 1025, 1103, 1196, 1279, 1359, 1465, 1562, 1637, 1740, 1817, 1902, 1903, 1941, 1979, 2056, 2131, 2226, 2318, 2390, 2459, 2529, 2597, 2691, 2797, 2879, 2956, 3026, 3117, 3196, 3301, 3417, 3539, 3639, 3760, 3879, 4016, 4017, 4079, 4116, 4117, 4177, 4200, 4201, 4257, 4295, 4355, 4425, 4496, 4559, 4650, 4734, 4803, 4862, 4931, 4996, 5057, 5131, 5190, 5250, 5321, 5397, 5456, 5516, 5517, 5576, 5613, 5614, 5670, 5707, 5708, 5785, 5823, 5824, 5875, 5912, 5976, 6030, 6102, 6161, 6162, 6238, 6261, 6262, 6314, 6351, 6352, 6427, 6464, 6537, 6607, 6608, 6683, 6720, 6721, 6798, 6836, 6837, 6875, 6913, 6990, 7065, 7155, 7225, 7292, 7360, 7426, 7518, 7622, 7702, 7777, 7845, 7934, 8011, 8114, 8228, 8348, 8446, 8565, 8682, 8817, 8818, 8848, 8871, 8872, 8932, 8969, 8990, 8991, 9054, 9077, 9078, 9132, 9169, 9170, 9227, 9264, 9265, 9386, 9409, 9410, 9480, 9517, 9596, 9689, 9772, 9773, 9816, 9853, 9869, 9870, 9938, 9976, 9977, 10015, 10052, 10053, 10128, 10165, 10226, 10227, 10275, 10298, 10299, 10372, 10409, 10491, 10587, 10673, 10764, 10829, 10830, 10857, 10894, 10895, 10940, 10978, 11052, 11114, 11160, 11206, 11269, 11339, 11407, 11475, 11536, 11610, 11662, 11713, 11774, 11775, 11794, 11795, 11846, 11913, 11951 ] }
{ "red_pajama_v2": { "ccnet_original_length": 11951, "ccnet_original_nlines": 212, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.09166067838668823, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.10603882372379303, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.5068296194076538, "rps_doc_frac_unique_words": 0.3641161024570465, "rps_doc_mean_word_length": 5.314643859863281, "rps_doc_num_sentences": 15, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.471480846405029, "rps_doc_word_count": 1516, "rps_doc_frac_chars_dupe_10grams": 0.08166810870170593, "rps_doc_frac_chars_dupe_5grams": 0.42149683833122253, "rps_doc_frac_chars_dupe_6grams": 0.35310909152030945, "rps_doc_frac_chars_dupe_7grams": 0.29700881242752075, "rps_doc_frac_chars_dupe_8grams": 0.2416532188653946, "rps_doc_frac_chars_dupe_9grams": 0.1656944304704666, "rps_doc_frac_chars_top_2gram": 0.02519547939300537, "rps_doc_frac_chars_top_3gram": 0.0191138107329607, "rps_doc_frac_chars_top_4gram": 0.0124115701764822, "rps_doc_books_importance": -1264.9466552734375, "rps_doc_books_importance_length_correction": -1264.9466552734375, "rps_doc_openwebtext_importance": -826.8204345703125, "rps_doc_openwebtext_importance_length_correction": -826.8204345703125, "rps_doc_wikipedia_importance": -572.4255981445312, "rps_doc_wikipedia_importance_length_correction": -572.4255981445312 }, "fasttext": { "dclm": 0.036881331354379654, "english": 0.6391257643699646, "fineweb_edu_approx": 1.646762728691101, "eai_general_math": 0.007343770004808903, "eai_open_web_math": 0.04279249906539917, "eai_web_code": 0.00805205013602972 } }
{ "free_decimal_correspondence": { "primary": { "code": "004.678", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "005.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": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "5", "label": "Social/Forum" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "6", "label": "Content Listing" } }, "reasoning_depth": { "primary": { "code": "4", "label": "Advanced 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": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "5", "label": "Indeterminate" } } }
ece34605c058195ed03b4d393ef1a36c
2,786,734,903,028,892,000
9 Replies Latest reply on Jul 5, 2020 7:21 PM by vols11 HTML Access Report HainesFGL Lurker I need  to find which users are connecting using HTML access (using web browser).  I believe it's always "Blast" using SSL/443 tunnel.  I'm pretty sure it's logged on security server or connection server.  Looking for the easiest way to extract it and create a report.  For example, from 6/1/20 - 6/30/20 These 458 users connected to vdi using HTML access. • 1. Re: HTML Access Report RoderikdeBlock Hot Shot You could give it a try using PowerCLI:   Connect-HVServer -Server <Your HV Server> $ViewAPI = $global:DefaultHVServers[0].ExtensionData $query_service = New-Object "Vmware.Hv.QueryServiceService" $query = New-Object "Vmware.Hv.QueryDefinition" $query.queryEntityType = 'SessionLocalSummaryView' $Sessions = $query_service.QueryService_Query($ViewAPI,$query) $Sessions.Results.Namesdata   This will give you the following output.     • 2. Re: HTML Access Report HainesFGL Lurker Hi Roderik, This is great stuff and working very well I'm including output from the PowerCli below.  My question is where exactly is this coming from?  Right now I'm pointing to our security server and I'm getting good data output <below>.  Is there a way to include the date and time the session started?   Connect-HVServer : There was no endpoint listening at https://securityserver.domain.com/view-vlsi/sdk that could accept the message. This is often caused by an incorrect address or SOAP action. See InnerException, if present, for more details. At C:\Documents\Scripts\HorizonClientConnectionType.ps1:1 char:1 + Connect-HVServer -Server securitysecury.domain.com + ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~     + CategoryInfo          : NotSpecified: (:) [Connect-HVServer], Exception     + FullyQualifiedErrorId : System.Exception,VMware.VimAutomation.HorizonView.Commands.Cmdlets.ConnectHVServer     One line of sample output using Export-CSV   "domain.com\\TUser","C1-COMPUTER-254","c1-computer-254.domain.com","7.8.0","c1_pool_o64","Windows 10","AUTOMATED","VIEW_COMPOSER",,"d17c390e-f2d3-6530-ca91-3a57a264bbae","htmlaccess","10.10.10.32","10-10-10-32-Edge","5.0.0","view.domain.com","10.10.10.230","External"   Thank you for your help and suggestion on this.  Very helpful. • 3. Re: HTML Access Report Mickeybyte Hot Shot Hi,   The connect-HVServer should connect to a Horizon Connection server. I don't think a security server will work.   Regards, Michiel • 4. Re: HTML Access Report HainesFGL Lurker What is the source of the data output?  I can't tell from the PowerCli...  How can I include the session date & time?   Odd thing is that I coonected to security server and got the error above, then several hundred lines of output. • 5. Re: HTML Access Report Shreyskar Expert VMware Employees You can pull this information from horizon helpdesk plugin Or through DEM script .Please check Re: what OS is connecting to my VDI environment? • 6. Re: HTML Access Report RoderikdeBlock Hot Shot This will include date and time and gives the output as shown.     Connect-HVServer -Server <Your HV Server> $ViewAPI = $global:DefaultHVServers[0].ExtensionData $query_service = New-Object "Vmware.Hv.QueryServiceService" $query = New-Object "Vmware.Hv.QueryDefinition" $query.queryEntityType = 'SessionLocalSummaryView' $Sessions = $query_service.QueryService_Query($ViewAPI,$query) $results = $Sessions.Results | ? {$_.Namesdata.ClientType -like "htmlaccess"} foreach ($session in $results) {$session | select @{N='UserName';E={$Session.Namesdata.UserName}},@{N='ClientType';E={$Session.Namesdata.ClientType}},@{N='StartTime';E={$Session.SessionData.StartTime}} }     2020-06-30_08-13-05.png • 7. Re: HTML Access Report HainesFGL Lurker Roderik, This is great!  Thank you!  Using PowerCli for Horizon has been very challenging considering there are only just a few cmdlets.  I'm about to try your latest update to the script.  I'm still curious where this data is being pulled from?  Is it stored in the ADAM DB?  Ideally, in addition to including the date/timestamp, I would like to be able to query this data from a specific time period.  For example from 6/25/20 - 6/30/20.  Is this history stored somewhere?   Thank you again for your help on this!  Great stuff. • 8. Re: HTML Access Report RoderikdeBlock Hot Shot Unfortunately this is realtime data. You can create scheduled tasks to collect and filter the data or could go for the suggestions of Shreyskar. • 9. Re: HTML Access Report vols11 Novice Hi Haines   I see that your users connect to your Horizon environment through HTML. We are also considering giving this option to our users and would appreciate your advise on this in terms of support and user feedback
{ "url": "https://communities.vmware.com/message/2966432", "source_domain": "communities.vmware.com", "snapshot_id": "crawl=CC-MAIN-2020-29", "warc_metadata": { "Content-Length": "135955", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:CEGQNNHPZKFFMVY3FVK27UKKYKY4ZO2C", "WARC-Concurrent-To": "<urn:uuid:7d69db69-77fe-46f3-a714-f34f1c04c38d>", "WARC-Date": "2020-07-08T23:57:59Z", "WARC-IP-Address": "23.195.64.37", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:43ETQ2SLS6EKZEDO4TVV72CFLB34HGNA", "WARC-Record-ID": "<urn:uuid:f2ac7a7f-a2df-4ecf-9f2b-ccd162724ded>", "WARC-Target-URI": "https://communities.vmware.com/message/2966432", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:fac7ad50-1acb-424c-8ec0-50965659b8ae>" }, "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, 60, 61, 84, 85, 106, 107, 470, 471, 507, 541, 542, 592, 593, 605, 606, 658, 669, 732, 802, 860, 921, 994, 1005, 1043, 1054, 1055, 1067, 1068, 1119, 1120, 1132, 1133, 1145, 1146, 1184, 1213, 1214, 1532, 1533, 1547, 1548, 1720, 1721, 1817, 1818, 1895, 1896, 1961, 1962, 2023, 2024, 2114, 2115, 2240, 2241, 2255, 2256, 2270, 2271, 2326, 2327, 2341, 2342, 2622, 2623, 2637, 2638, 2713, 2714, 2754, 2788, 2789, 2807, 2808, 2824, 2825, 2950, 2951, 2967, 2968, 2991, 2992, 3014, 3015, 3057, 3090, 3091, 3225, 3226, 3244, 3245, 3373, 3374, 3418, 3453, 3488, 3489, 3651, 3652, 3698, 3742, 3743, 3826, 3827, 3849, 3850, 3872, 3873, 3935, 3956, 3977, 4050, 4130, 4198, 4269, 4352, 4373, 4394, 4493, 4514, 4565, 4758, 4779, 4780, 4802, 4803, 4825, 4826, 4870, 4871, 4919, 4958, 4959, 5456, 5457, 5481, 5482, 5557, 5558, 5608, 5656, 5657, 5826, 5827, 5879, 5919, 5920, 5956, 5957, 5985, 5986 ], "line_end_idx": [ 60, 61, 84, 85, 106, 107, 470, 471, 507, 541, 542, 592, 593, 605, 606, 658, 669, 732, 802, 860, 921, 994, 1005, 1043, 1054, 1055, 1067, 1068, 1119, 1120, 1132, 1133, 1145, 1146, 1184, 1213, 1214, 1532, 1533, 1547, 1548, 1720, 1721, 1817, 1818, 1895, 1896, 1961, 1962, 2023, 2024, 2114, 2115, 2240, 2241, 2255, 2256, 2270, 2271, 2326, 2327, 2341, 2342, 2622, 2623, 2637, 2638, 2713, 2714, 2754, 2788, 2789, 2807, 2808, 2824, 2825, 2950, 2951, 2967, 2968, 2991, 2992, 3014, 3015, 3057, 3090, 3091, 3225, 3226, 3244, 3245, 3373, 3374, 3418, 3453, 3488, 3489, 3651, 3652, 3698, 3742, 3743, 3826, 3827, 3849, 3850, 3872, 3873, 3935, 3956, 3977, 4050, 4130, 4198, 4269, 4352, 4373, 4394, 4493, 4514, 4565, 4758, 4779, 4780, 4802, 4803, 4825, 4826, 4870, 4871, 4919, 4958, 4959, 5456, 5457, 5481, 5482, 5557, 5558, 5608, 5656, 5657, 5826, 5827, 5879, 5919, 5920, 5956, 5957, 5985, 5986, 6218 ] }
{ "red_pajama_v2": { "ccnet_original_length": 6218, "ccnet_original_nlines": 151, "rps_doc_curly_bracket": 0.0025731700006872416, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.21984435617923737, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.047665368765592575, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.3570038974285126, "rps_doc_frac_unique_words": 0.4564102590084076, "rps_doc_mean_word_length": 6.162393093109131, "rps_doc_num_sentences": 101, "rps_doc_symbol_to_word_ratio": 0.0009727600263431668, "rps_doc_unigram_entropy": 5.15773868560791, "rps_doc_word_count": 585, "rps_doc_frac_chars_dupe_10grams": 0.14036060869693756, "rps_doc_frac_chars_dupe_5grams": 0.2088765650987625, "rps_doc_frac_chars_dupe_6grams": 0.2002773880958557, "rps_doc_frac_chars_dupe_7grams": 0.17281553149223328, "rps_doc_frac_chars_dupe_8grams": 0.14036060869693756, "rps_doc_frac_chars_dupe_9grams": 0.14036060869693756, "rps_doc_frac_chars_top_2gram": 0.03328710049390793, "rps_doc_frac_chars_top_3gram": 0.04438279941678047, "rps_doc_frac_chars_top_4gram": 0.04493758827447891, "rps_doc_books_importance": -423.5779113769531, "rps_doc_books_importance_length_correction": -423.5779113769531, "rps_doc_openwebtext_importance": -290.8608093261719, "rps_doc_openwebtext_importance_length_correction": -290.8608093261719, "rps_doc_wikipedia_importance": -169.6024627685547, "rps_doc_wikipedia_importance_length_correction": -169.6024627685547 }, "fasttext": { "dclm": 0.028449829667806625, "english": 0.7201250195503235, "fineweb_edu_approx": 1.5521492958068848, "eai_general_math": 0.018501099199056625, "eai_open_web_math": 0.31173574924468994, "eai_web_code": 0.0006174399750307202 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.445", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.028", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "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": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }
ece34605c058195ed03b4d393ef1a36c
7,558,110,053,981,782,000
exif_read_data (PHP 4 >= 4.2.0, PHP 5, PHP 7, PHP 8) exif_read_dataLee las cabeceras EXIF desde un JPEG o un TIFF Descripción exif_read_data(     string $filename,     string $sections = null,     bool $arrays = false,     bool $thumbnail = false ): array exif_read_data() lee las cabeceras EXIF desde un archivo de imagen JPEG o TIFF. De esta forma se puede leer los meta-datos generados por cámaras digitales. Las cabeceras EXIF tienden a estar presentes en imágenes JPEG/TIFF generadas por cámaras digitales, pero desafortunadamente cada fabricante de cámaras digitales tiene una idea diferente de cómo etiquetar sus imágenes, por lo que no siempre se puede contar con que una cabecera Exif específica esté presente. Height y Width son computados de la misma forma que lo hace getimagesize() por lo que sus valores no deben ser parte de ninguna cabecera devuelta. También, html es una cadena de texto de alto/ancho para usar dentro de un HTML normal. Cuando una cabecera Exif contiene una nota de Copyright, puede contener ella misma dos valores. Como la solución es inconsistente en el estándar Exif 2.10, la sección COMPUTED devolverá las dos entradas Copyright.Photographer y Copyright.Editor mientras que las secciones IFD0 contienen la matriz de bytes con el carácter NULL que divide ambas entradas. O sólo la primera entrada si el tipo de información era erróneo (el comportamiento normal de Exif). COMPUTED también contendrá la entrada Copyright que es la cadena del copyright original, o una lista separada por comas del copyright de la fotografía y del editor. La etiqueta UserComment tiene el mismo problema que la etiqueta Copyright. Puede almacenar dos valores. El primero es el que usa la codificación, y el segundo es el valor mismo. Por lo que si la sección IFD sólo contiene la codificación o una matriz de bytes, la sección COMPUTED almacenará la dos entradas UserCommentEncoding y UserComment. La entrada UserComment está disponible en ambos casos por lo que se debería usar con preferencia al valor de la sección IFD0. exif_read_data() también valida las etiquetas de información EXIF según la especifiación EXIF (» http://exif.org/Exif2-2.PDF, página 20). Nota: Windows Me/XP pueden borrar las cabeceras Exif cuando se conecta una cámara. Parámetros filename El nombre de la imagen que se va a leer. No puede ser una URL. sections Es una lista separada por comas de las secciones que necesitan estar presentes en el archivo para producir un array resultante. Si no se puede encontrar ninguna sección el valor devuelto es false. FILE FileName, FileSize, FileDateTime, SectionsFound COMPUTED html, Width, Height, IsColor, y más si están disponibles. Height y Width son computados de la misma forma que lo hace getimagesize() por lo que sus valores no deben ser parte de ninguna cabecera devuelta. También, html es una cadena de texto de alto/ancho para usar dentro de un HTML normal. ANY_TAG Cualquier información que tenga una Etiqueta, p.ej., IFD0, EXIF, ... IFD0 Toda la información etiquetada de IFD0. En archivos de imagen normales, ésto contiene el tamaño de la imagen y así sucesivamente. THUMBNAIL Se supone que un archivo contiene una miniatura si tiene un segundo IFD. Toda la información etiquetada acerca de la miniatura embebida es almacenada en esta sección. COMMENT Cabeceras de comentarios de imágenes JPEG. EXIF La sección EXIF es una subsección de IFD0. Contiene información más detallada sobre la imagen. La mayoría de estas entradas están relacionadas con la cámara digital. arrays Especifica si cada sección se convierte o no en una matriz. sections COMPUTED, THUMBNAIL, y COMMENT siempre se convierten en matrices ya que pueden contener valores cuyos nombres entran en conflicto con otras secciones. thumbnail Cuando se establece a true se lee la miniatura misma. Si no, sólo se lee la información etiquetada. Valores devueltos Devuelve un array asociativo donde los índices de la matriz son los nombres de las cabeceras y los valores de la matriz son los valores asociados con esas cabeceras. Si no se puede devolver información, exif_read_data() devolverá false. Historial de cambios Versión Descripción 4.3.0 Se puede leer toda la información IFD embebida incluidas matrices (devueltas como tales). También, el tamaño de una miniatura embebida es devuelto en una submatriz THUMBNAIL, y puede devolver miniaturas en formato TIFF. Además, ya no hay una longitud máxima para los valores devueltos (no mientras el límite de memoria haya sido alcanzado) 4.3.0 Si PHP tiene soporte para mbstring, el comentario de usuario puede cambiar automáticamente de codificación. También, si el comentario de usuario utiliza la codificación Unicode o JIS, esta codificación será cambiada automáticamente según la configuración inicial de exif en php.ini 4.3.0 Si la imagen contiene cualquier información IFD0, entonces COMPUTED contiene la entrada ByteOrderMotorola la cuál es 0 para el orden de byte little-endian (intel) y 1 para el orden de byte big-endian (motorola). También, COMPUTED y UserComment ya no contienen la primera entrada de copyright si el tipo de información era erróneo. Ejemplos Ejemplo #1 Ejemplo de exif_read_data() <?php echo "prueba1.jpg:<br />\n"; $exif = exif_read_data('pruebas/prueba1.jpg', 'IFD0'); echo $exif===false ? "No se encontró información de cabecera.<br />\n" : "La imagen contiene cabeceras<br />\n"; $exif = exif_read_data('pruebas/prueba2.jpg', 0, true); echo "prueba2.jpg:<br />\n"; foreach ( $exif as $clave => $sección) { foreach ( $sección as $nombre => $valor) { echo "$clave.$nombre: $valor<br />\n"; } } ?> La primera llamada falla ya que la imagen no tiene información de cabecera. El resultado del ejemplo sería algo similar a: test1.jpg: No header data found. test2.jpg: FILE.FileName: test2.jpg FILE.FileDateTime: 1017666176 FILE.FileSize: 1240 FILE.FileType: 2 FILE.SectionsFound: ANY_TAG, IFD0, THUMBNAIL, COMMENT COMPUTED.html: width="1" height="1" COMPUTED.Height: 1 COMPUTED.Width: 1 COMPUTED.IsColor: 1 COMPUTED.ByteOrderMotorola: 1 COMPUTED.UserComment: Exif test image. COMPUTED.UserCommentEncoding: ASCII COMPUTED.Copyright: Photo (c) M.Boerger, Edited by M.Boerger. COMPUTED.Copyright.Photographer: Photo (c) M.Boerger COMPUTED.Copyright.Editor: Edited by M.Boerger. IFD0.Copyright: Photo (c) M.Boerger IFD0.UserComment: ASCII THUMBNAIL.JPEGInterchangeFormat: 134 THUMBNAIL.JPEGInterchangeFormatLength: 523 COMMENT.0: Comment #1. COMMENT.1: Comment #2. COMMENT.2: Comment #3end THUMBNAIL.JPEGInterchangeFormat: 134 THUMBNAIL.Thumbnail.Height: 1 THUMBNAIL.Thumbnail.Height: 1 Ver también add a note User Contributed Notes 18 notes up 84 chadsmith729 at gmail dot com 11 years ago When the new update came out from Apple for iOS6 it provided the ability for iPad, iPod, and iPhones to be able to upload files from the device through Safari. Obviously this will open up an array of implementations where at one point it was just not possible. The issue comes when a photo is uploaded it will be dependent on the location of the "button" when the photo was taken. Imagine if you will that you have your iPhone turned with the button at the top and you take a photo. The photo when uploaded to your server might be "upside down". The following code will ensure that all uploaded photos will be oriented correctly upon upload: <?php $image = imagecreatefromstring(file_get_contents($_FILES['image_upload']['tmp_name'])); $exif = exif_read_data($_FILES['image_upload']['tmp_name']); if(!empty( $exif['Orientation'])) { switch( $exif['Orientation']) { case 8: $image = imagerotate($image,90,0); break; case 3: $image = imagerotate($image,180,0); break; case 6: $image = imagerotate($image,-90,0); break; } } // $image now contains a resource with the image oriented correctly ?> What you do with the image resource from there is entirely up to you. I hope that this helps you identify and orient any image that's uploaded from an iPad, iPhone, or iPod. Orientation for the photo is the key to knowing how to rotate it correctly. up 4 Tim 4 years ago The following code: <?php $data = exif_read_data('foo.jpg'); var_dump($data['Keywords']); ?> produces string(15) "???????????????" Adding <?php ini_set ('exif.decode_unicode_motorola', 'UCS-2LE'); ?> before the call to exif_red_data produces string(15) "landscape;;field" up 7 darkain at darkain dot com 15 years ago I wanted some quick and easy functions for computing the shutter speed and f-stop. I couldn't find any anywhere, so I made some. It took some research : <?php function exif_get_float($value) { $pos = strpos($value, '/'); if ( $pos === false) return (float) $value; $a = (float) substr($value, 0, $pos); $b = (float) substr($value, $pos+1); return ( $b == 0) ? ($a) : ($a / $b); } function exif_get_shutter(&$exif) { if (!isset( $exif['ShutterSpeedValue'])) return false; $apex = exif_get_float($exif['ShutterSpeedValue']); $shutter = pow(2, -$apex); if ( $shutter == 0) return false; if ( $shutter >= 1) return round($shutter) . 's'; return '1/' . round(1 / $shutter) . 's'; } function exif_get_fstop(&$exif) { if (!isset( $exif['ApertureValue'])) return false; $apex = exif_get_float($exif['ApertureValue']); $fstop = pow(2, $apex/2); if ( $fstop == 0) return false; return 'f/' . round($fstop,1); } ?> up 2 omerg at lucidcode dot com dot tr 5 years ago The example provided for displaying exif array content is not working in recent version because not all entry values are of array type. This is an alternative echo loop: <?php echo "test1.jpg:<br />\n"; $exif = exif_read_data('tests/test1.jpg', 'IFD0'); echo $exif===false ? "No header data found.<br />\n" : "Image contains headers<br />\n"; $exif = exif_read_data('tests/test2.jpg', 0, true); echo "test2.jpg:<br />\n"; foreach ( $exif as $key => $section) { if (! is_array ($section)) { echo "$key: $section<br />\n"; } else { foreach ( $section as $name => $val) { echo "$key.$name: $val<br />\n"; } } } ?> up 8 drpain at webster dot org dot za 12 years ago Please note that when resizing images with GD and most image processing scripts or applications you will loose the EXIF information. What I did as a workaround is book this information into MySQL before I re-size images. <?php // This function is used to determine the camera details for a specific image. It returns an array with the parameters. function cameraUsed($imagePath) { // Check if the variable is set and if the file itself exists before continuing if ((isset($imagePath)) and (file_exists($imagePath))) { // There are 2 arrays which contains the information we are after, so it's easier to state them both $exif_ifd0 = read_exif_data($imagePath ,'IFD0' ,0); $exif_exif = read_exif_data($imagePath ,'EXIF' ,0); //error control $notFound = "Unavailable"; // Make if (@array_key_exists('Make', $exif_ifd0)) { $camMake = $exif_ifd0['Make']; } else { $camMake = $notFound; } // Model if (@array_key_exists('Model', $exif_ifd0)) { $camModel = $exif_ifd0['Model']; } else { $camModel = $notFound; } // Exposure if (@array_key_exists('ExposureTime', $exif_ifd0)) { $camExposure = $exif_ifd0['ExposureTime']; } else { $camExposure = $notFound; } // Aperture if (@array_key_exists('ApertureFNumber', $exif_ifd0['COMPUTED'])) { $camAperture = $exif_ifd0['COMPUTED']['ApertureFNumber']; } else { $camAperture = $notFound; } // Date if (@array_key_exists('DateTime', $exif_ifd0)) { $camDate = $exif_ifd0['DateTime']; } else { $camDate = $notFound; } // ISO if (@array_key_exists('ISOSpeedRatings',$exif_exif)) { $camIso = $exif_exif['ISOSpeedRatings']; } else { $camIso = $notFound; } $return = array(); $return['make'] = $camMake; $return['model'] = $camModel; $return['exposure'] = $camExposure; $return['aperture'] = $camAperture; $return['date'] = $camDate; $return['iso'] = $camIso; return $return; } else { return false; } } ?> An example of it's use follows: <?php $camera = cameraUsed("/img/myphoto.jpg"); echo "Camera Used: " . $camera['make'] . " " . $camera['model'] . "<br />"; echo "Exposure Time: " . $camera['exposure'] . "<br />"; echo "Aperture: " . $camera['aperture'] . "<br />"; echo "ISO: " . $camera['iso'] . "<br />"; echo "Date Taken: " . $camera['date'] . "<br />"; ?> Will display the following, depending on the data: Camera Used: SONY DSC-S930 Exposure Time: 1/400 Aperture: f/4.3 ISO: 100 Date Taken: 2010:12:10 18:18:45 If the image has been re-sized and the information is no longer available then you should receive the following when echoing the same: Camera Used: Unavailable Exposure Time: Unavailable Aperture: Unavailable ISO: Unavailable Date Taken: Unavailable Some cameras do not capture all the information, for instance Blackberry phones do not record an aperture, or iso and you will get Unavailable for those fields. I hope you find this helpful. up 2 mafo at mafo removethis dot sk 16 years ago some cameras (most higher models) have position senzor (gyroskope?) and taking-position is wrote in EXIF, here is simple script for automatic rotating images <?php $exif = exif_read_data($filename); $ort = $exif['IFD0']['Orientation']; switch( $ort) { case 1: // nothing break; case 2: // horizontal flip $image->flipImage($public,1); break; case 3: // 180 rotate left $image->rotateImage($public,180); break; case 4: // vertical flip $image->flipImage($public,2); break; case 5: // vertical flip + 90 rotate right $image->flipImage($public, 2); $image->rotateImage($public, -90); break; case 6: // 90 rotate right $image->rotateImage($public, -90); break; case 7: // horizontal flip + 90 rotate right $image->flipImage($public,1); $image->rotateImage($public, -90); break; case 8: // 90 rotate left $image->rotateImage($public, 90); break; } ?> $image->rotateImage() is inspired by example of http://php.net/manual/en/function.imagerotate.php $image->flipImage() is inspired by http://php.net/manual/en/function.imagecopy.php#42803 (thank you) up 0 service at tianex dot com 4 months ago this error happens when get jpeg file exif information exif_read_data(): Error reading from file: got=x3FFA(=16378) != itemlen-2=x4325(=17189) up 0 TNTcode 6 years ago <?php // auto rotates an image file based on exif data from camera // if destination file is specified then it saves file there, otherwise it will display it to user // note that images already at normal orientation are skipped (when exif data Orientation = 1) if(!function_exists("gd_auto_rotate")){ function gd_auto_rotate($original_file, $destination_file=NULL){ $original_extension = strtolower(pathinfo($original_file, PATHINFO_EXTENSION)); if(isset( $destination_file) and $destination_file!=''){ $destination_extension = strtolower(pathinfo($destination_file, PATHINFO_EXTENSION)); } // try to auto-rotate image by gd if needed (before editing it) // by imagemagik it has an easy option if(function_exists("exif_read_data")){ $exif_data = exif_read_data($original_file); $exif_orientation = $exif_data['Orientation']; // value 1 = normal ?! skip it ?! if($exif_orientation=='3' or $exif_orientation=='6' or $exif_orientation=='8'){ $new_angle[3] = 180; $new_angle[6] = -90; $new_angle[8] = 90; // load the image if($original_extension == "jpg" or $original_extension == "jpeg"){ $original_image = imagecreatefromjpeg($original_file); } if( $original_extension == "gif"){ $original_image = imagecreatefromgif($original_file); } if( $original_extension == "png"){ $original_image = imagecreatefrompng($original_file); } $rotated_image = imagerotate($original_image, $new_angle[$exif_orientation], 0); // if no destination file is set, then show the image if(!$destination_file){ header('Content-type: image/jpeg'); imagejpeg($rotated_image, NULL, 100); } // save the smaller image FILE if destination file given if($destination_extension == "jpg" or $destination_extension=="jpeg"){ imagejpeg($rotated_image, $destination_file,100); } if( $destination_extension == "gif"){ imagegif($rotated_image, $destination_file); } if( $destination_extension == "png"){ imagepng($rotated_image, $destination_file,9); } imagedestroy($original_image); imagedestroy($rotated_image); } } } } ?> up 0 b at asdflolinternet dot de 8 years ago Problem with "S�o�m�e� �T�e�x�t��" on value(s), exif[IFD0][Title] for example, when they were edited trough windows right click properties and then got read with the read_exif_data() function. try: $exif_['IFD0']['Title']=mb_convert_encoding($exif_['IFD0']['Title'],"auto","byte2le"); works on UTF-8 and so. // // outputs all available character encodings and prints on screen // foreach(mb_list_encodings() as $chr) // {$test[$chr]=mb_convert_encoding($image[IFD0][Title],'auto',$chr);} // exit(print_r($test)); // up 0 Eion Robb 8 years ago I was needing to use exif_read_data() to read out the orientation flag, only to find that the webhost didn't have the exif extension available for use. Instead, I hacked up a regex that worked fairly well as a replacement <?php $orientation = 1; if ( function_exists('exif_read_data')) { $exif = exif_read_data($filename); if (isset( $exif['Orientation'])) $orientation = $exif['Orientation']; } else if ( preg_match('@\x12\x01\x03\x00\x01\x00\x00\x00(.)\x00\x00\x00@', file_get_contents($filename), $matches)) { $orientation = ord($matches[1]); } ?> up 0 Clive dot Moore at ma-design dot com 10 years ago Following up on darkain at darkain dot com script for grabbing the ShutterSpeedValue from exif data... @http://php.net/manual/en/function.exif-read-data.php I have found that the option shown for ShutterSppedValue, can also be ExposureTime in the exif data. Also the code as written provides a WRONG return, as the return is always 1 so you get 1/1sec. Here is corrected code, or a version that corrects what is obviously not working after 5 years since it was originally developed:: Here is the updated version for:: $exif[ExposureTime] function exif_get_float($value) { $pos = strpos($value, '/'); if ($pos === false) return (float) $value; $a = (float) substr($value, 0, $pos); $b = (float) substr($value, $pos+1); return ($b == 0) ? ($a) : ($a / $b); }; function exif_get_exposureTime(&$exif) { if (!isset($exif['ExposureTime'])) return false; $apex = exif_get_float($exif['ExposureTime']); $shutter = 1/$apex; // above 1 sec exposure time:: if ($shutter <= 1) return round($apex) . ' seconds'; return '1/' . round(1 / $apex) . 'sec'; }; up 0 hoangvu4000 at gmail dot com 10 years ago This is function, resize image and don't rotates images have exif info PHP must be enabled: extension=php_mbstring.dll extension=php_exif.dll <?php function CreateThumbnail($pic,$thumb,$thumbwidth, $quality = 100) { $im1=ImageCreateFromJPEG($pic); //if(function_exists("exif_read_data")){ $exif = exif_read_data($pic); if(!empty( $exif['Orientation'])) { switch( $exif['Orientation']) { case 8: $im1 = imagerotate($im1,90,0); break; case 3: $im1 = imagerotate($im1,180,0); break; case 6: $im1 = imagerotate($im1,-90,0); break; } } //} $info = @getimagesize($pic); $width = $info[0]; $w2=ImageSx($im1); $h2=ImageSy($im1); $w1 = ($thumbwidth <= $info[0]) ? $thumbwidth : $info[0] ; $h1=floor($h2*($w1/$w2)); $im2=imagecreatetruecolor($w1,$h1); imagecopyresampled ($im2,$im1,0,0,0,0,$w1,$h1,$w2,$h2); $path=addslashes($thumb); ImageJPEG($im2,$path,$quality); ImageDestroy($im1); ImageDestroy($im2); } ?> up 0 michael [at[ thisiswilson [dot[ com 15 years ago From - darkain at darkain dot com 's example. If all the data is from the same image - simply <?php $exif_data = exif_read_data ( $_FILES['photo'] $emake =$exif_data['Make']; $emodel = $exif_data['Model']; $eexposuretime = $exif_data['ExposureTime']; $efnumber = $exif_data['FNumber']; $eiso = $exif_data['ISOSpeedRatings']; $edate = $exif_data['DateTime']; ?> will work, I tried using the PEL library, and while pretty cool, I can't for the life understand how to call some things, this is simpler if your system is pretty basic or if you're in a rush. If you have time, try playing with PEL. It's not maintained at the moment though.. http://pel.sourceforge.net/ up 0 Anonymous 17 years ago When reading EXIF information from the 'WINXP' group, you may need to change used encoding from the default "ISO-8859-15" to "UTF-8". This can be done in php.ini or in your code: <?php ini_set ('exif.encode_unicode', 'UTF-8'); $exif = exif_read_data('TEST.JPG', 0, true); echo $exif['WINXP']['Title']; ?> Useful documentation about EXIF: http://www.sno.phy.queensu.ca/~phil/exiftool/TagNames/EXIF.html See also comments next to XPTitle and XPAuthor. up -1 iam at thatguy dot co dot za 10 years ago I posted the original version of the function, but after using it for a while I discovered I didn't do enough error checking. I have re-factored it somewhat, and it now returns an empty array should it not be able to read the image's exif. If it is able to, it will return the details it was able to retrieve. And this should be without error. I am suppressing errors, because if you pass it images which cannot parse, you will get a warning. <?php # Modified Version of cameraUsed, no longer returns date. public function cameraUsed($imagePath) { # The default empty return $return = array( 'make' => "", 'model' => "", 'exposure' => "", 'aperture' => "", 'iso' => "" ); // Check if the variable is set and if the file itself exists before continuing if ((isset($imagePath)) AND (file_exists($imagePath))) { // There are 2 arrays which contains the information we are after, so it's easier to state them both $exif_ifd0 = @read_exif_data($imagePath ,'IFD0' ,0); $exif_exif = @read_exif_data($imagePath ,'EXIF' ,0); # Ensure that we actually got some information if (($exif_ifd0 !== false) AND ($exif_exif !== false)) { // Make if (@array_key_exists('Make', $exif_ifd0)) { $return['make'] = $exif_ifd0['Make']; } // Model if (@array_key_exists('Model', $exif_ifd0)) { $return['model'] = $exif_ifd0['Model']; } // Exposure if (@array_key_exists('ExposureTime', $exif_ifd0)) { $return['exposure'] = $exif_ifd0['ExposureTime']; } // Aperture if (@array_key_exists('ApertureFNumber', $exif_ifd0['COMPUTED'])) { $return['aperture'] = $exif_ifd0['COMPUTED']['ApertureFNumber']; } // ISO if (@array_key_exists('ISOSpeedRatings',$exif_exif)) { $return['iso'] = $exif_exif['ISOSpeedRatings']; } } } # Return either an empty array, or the details which we were able to extrapolate. return $return; } ?> up -2 lincolnzsilva at gmail dot com 15 years ago Get some EXIFs fields (easy way): <?php $exif_make = exif_read_data ( $_FILES['photo']['tmp_name'] ,'IFD0' ,0 ); $emake = $exif_make['Make']; $exif_model = exif_read_data ( $_FILES['photo']['tmp_name'] ,'IFD0' ,0 ); $emodel = $exif_model['Model']; $exif_exposuretime = exif_read_data ( $_FILES['photo']['tmp_name'] ,'EXIF' ,0 ); $eexposuretime = $exif_exposuretime['ExposureTime']; $exif_fnumber = exif_read_data ( $_FILES['photo']['tmp_name'] ,'EXIF' ,0 ); $efnumber = $exif_fnumber['FNumber']; $exif_iso = exif_read_data ( $_FILES['photo']['tmp_name'] ,'EXIF' ,0 ); $eiso = $exif_iso['ISOSpeedRatings']; $exif_date = exif_read_data ( $_FILES['photo']['tmp_name'] ,'IFD0' ,0 ); $edate = $exif_date['DateTime']; ?> up -2 wdierkes at 5dollarwhitebox dot org 16 years ago Using the exif methods to read WINXP data returns unexpected results unless both exif and mbstring are compiled statically. Please reference the following bug reports: Bug #31980 Bug #23105 Specifically, the last comment on #23105: "[8 Apr 2003 4:26pm UTC] [email protected] This cannot be fixed due to the fact that mbstring has been removed from PHP core (it has been 'unbundled') and the rest of core files and other extensions cannot use mbstring functionality when it is compiled as a shared library (dll). " If exif is compiled statically (--enable-exif) and mbstring compiled as a DSO module (--enable-mbstring=shared) then exif_read_data may only return a single character rather than the entire string. Compiling both exif and mbstring statically (--enable-exif --enable-mbstring) resolves the issue. up -5 kurt at mandella dot biz 11 years ago Photos processed in Picasa often contain garbage data in the "MAKERNOTE" section and under EXIF.MakerNote, (UTF8) like: [MakerNote] => r0~Þæ"î2OÔy  e §…b! ) ) EI "ÐÓ #s &0{ 'Û (å -Ð`ÿÿ@ÿÿÿìE è€Ýÿÿ  ÿÿÿÿÿÿx "ú»Dóÿ H ?.}BúIMG:DIGITAL IXUS 100 IS JPEGFirmware Version 1.00s›xÇØÿÿÿ–l¥ÿÿÿ  ØÌÌxŒ ÿÿÌÌŸãÿÿÿ¼Ž(½ (½T‹U’‹d–~Ø“¥ÿÿÿ ÀÿœªãjáÀpgaXfaWb[Te« 8ú5:Áð-3åÿÿ5»ÿ ‹;ßÊ Š €à€` ¸ ddîÿîÿîÿîÿîÿîÿ ÿÿŠ1—Ïàôɿ׬gªiï This can't be written to Blob in MySql. The following code removes the garbage tags. $exif = exif_read_data($process_photo, 0, 'EXIF'); if($exif['IFD0']['Software'] == "Picasa"){ foreach ($exif as $key => $section){ if($key != "MAKERNOTE"){ foreach ($section as $name => $val){ if($name != 'MakerNote'){ $exifA[$key][$name] = $val; } } $exifB[$key] = $exifA[$key]; } } $serialized_exif = serialize ($exifB); }else{ $serialized_exif = serialize ($exif); } To Top
{ "url": "https://www.php.net/manual/es/function.exif-read-data.php", "source_domain": "www.php.net", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "115157", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:W3V3LCGYCWC7CL3UH63WITHNAQI5MHHT", "WARC-Concurrent-To": "<urn:uuid:b5ac295f-6c3e-40d4-913b-6fda412b372f>", "WARC-Date": "2024-05-18T11:32:47Z", "WARC-IP-Address": "185.85.0.29", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:V7BYPFAQRJXSTKNZG7Q5DZJEEVFIP3IO", "WARC-Record-ID": "<urn:uuid:6f861a24-4a5e-4934-9788-b31bef3c9784>", "WARC-Target-URI": "https://www.php.net/manual/es/function.exif-read-data.php", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:00b791a0-4933-4192-ae9f-7ace786625fa>" }, "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-241\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, 15, 16, 54, 55, 116, 117, 129, 130, 146, 168, 197, 223, 251, 260, 261, 417, 418, 726, 727, 961, 962, 1581, 1582, 2050, 2051, 2189, 2190, 2196, 2197, 2274, 2275, 2286, 2287, 2296, 2297, 2360, 2361, 2370, 2371, 2568, 2569, 2622, 2923, 3000, 3135, 3312, 3363, 3534, 3535, 3542, 3543, 3763, 3764, 3774, 3775, 3875, 3876, 3894, 3895, 4132, 4133, 4154, 4155, 4175, 4521, 4809, 5146, 5147, 5156, 5157, 5196, 5197, 5203, 5232, 5287, 5292, 5400, 5401, 5457, 5462, 5486, 5496, 5527, 5537, 5570, 5575, 5609, 5611, 5613, 5616, 5617, 5693, 5694, 5741, 5742, 5753, 5775, 5786, 5811, 5841, 5861, 5878, 5932, 5968, 5987, 6005, 6025, 6055, 6094, 6130, 6192, 6245, 6293, 6329, 6353, 6390, 6433, 6456, 6479, 6504, 6541, 6571, 6601, 6602, 6614, 6615, 6626, 6627, 6659, 6660, 6663, 6666, 6696, 6709, 6970, 6971, 7256, 7257, 7353, 7359, 7366, 7447, 7508, 7519, 7544, 7552, 7576, 7581, 7584, 7619, 7626, 7631, 7634, 7670, 7677, 7682, 7685, 7721, 7728, 7730, 7732, 7800, 7803, 7804, 7874, 7875, 8055, 8058, 8060, 8064, 8076, 8096, 8102, 8108, 8137, 8166, 8169, 8207, 8208, 8215, 8221, 8229, 8274, 8277, 8319, 8349, 8352, 8354, 8381, 8394, 8547, 8548, 8554, 8588, 8616, 8621, 8660, 8698, 8735, 8744, 8773, 8775, 8776, 8785, 8812, 8824, 8867, 8919, 8946, 8951, 8980, 8985, 9030, 9037, 9071, 9073, 9074, 9083, 9108, 9120, 9159, 9207, 9233, 9238, 9265, 9272, 9296, 9298, 9301, 9304, 9306, 9340, 9352, 9488, 9489, 9523, 9524, 9530, 9557, 9608, 9613, 9697, 9698, 9750, 9755, 9777, 9787, 9816, 9817, 9823, 9846, 9851, 9877, 9886, 9896, 9925, 9930, 9958, 9960, 9962, 9963, 9965, 9968, 9971, 9973, 10006, 10019, 10240, 10241, 10247, 10248, 10368, 10402, 10403, 10483, 10540, 10541, 10642, 10694, 10746, 10747, 10763, 10790, 10791, 10799, 10844, 10875, 10884, 10908, 10909, 10918, 10964, 10997, 11006, 11031, 11032, 11044, 11097, 11140, 11149, 11177, 11178, 11190, 11258, 11316, 11325, 11353, 11354, 11362, 11411, 11446, 11455, 11479, 11480, 11487, 11542, 11583, 11592, 11615, 11616, 11635, 11663, 11693, 11729, 11765, 11793, 11819, 11826, 11835, 11836, 11845, 11852, 11859, 11861, 11863, 11864, 11867, 11868, 11900, 11901, 11907, 11908, 11916, 11950, 11955, 12026, 12031, 12083, 12088, 12135, 12140, 12177, 12182, 12227, 12228, 12231, 12232, 12283, 12284, 12311, 12332, 12348, 12357, 12389, 12390, 12525, 12526, 12551, 12578, 12600, 12617, 12641, 12642, 12803, 12804, 12834, 12837, 12839, 12870, 12883, 13041, 13042, 13048, 13054, 13083, 13120, 13128, 13134, 13136, 13141, 13155, 13162, 13163, 13168, 13190, 13220, 13227, 13228, 13233, 13255, 13289, 13296, 13297, 13302, 13322, 13352, 13359, 13360, 13365, 13403, 13434, 13469, 13476, 13477, 13482, 13504, 13539, 13546, 13547, 13552, 13592, 13622, 13657, 13664, 13665, 13670, 13691, 13725, 13732, 13734, 13735, 13738, 13739, 13837, 13938, 13941, 13943, 13969, 13982, 14037, 14038, 14126, 14129, 14131, 14139, 14151, 14157, 14158, 14219, 14318, 14413, 14414, 14454, 14463, 14519, 14520, 14600, 14610, 14657, 14743, 14745, 14746, 14810, 14849, 14888, 14889, 14934, 14981, 14982, 15016, 15017, 15097, 15098, 15119, 15140, 15160, 15161, 15179, 15246, 15301, 15303, 15307, 15338, 15392, 15394, 15398, 15429, 15483, 15485, 15486, 15567, 15568, 15622, 15646, 15682, 15720, 15722, 15723, 15780, 15851, 15901, 15903, 15907, 15941, 15986, 15988, 15992, 16026, 16073, 16075, 16076, 16107, 16137, 16138, 16140, 16142, 16144, 16146, 16147, 16150, 16153, 16155, 16183, 16195, 16388, 16393, 16394, 16481, 16482, 16505, 16506, 16509, 16575, 16615, 16686, 16711, 16714, 16717, 16719, 16729, 16741, 16963, 16964, 16970, 16983, 16988, 16993, 17030, 17065, 17076, 17099, 17136, 17148, 17255, 17288, 17290, 17293, 17296, 17298, 17335, 17348, 17451, 17505, 17506, 17607, 17608, 17703, 17704, 17835, 17836, 17890, 17891, 17925, 17953, 17996, 18034, 18071, 18108, 18111, 18112, 18153, 18202, 18249, 18269, 18300, 18353, 18354, 18394, 18397, 18400, 18402, 18431, 18444, 18515, 18516, 18537, 18564, 18587, 18588, 18594, 18660, 18662, 18663, 18695, 18696, 18737, 18767, 18778, 18803, 18811, 18835, 18840, 18843, 18874, 18881, 18886, 18889, 18921, 18928, 18933, 18936, 18968, 18975, 18977, 18979, 18983, 19012, 19013, 19032, 19033, 19052, 19071, 19130, 19131, 19157, 19193, 19194, 19250, 19276, 19308, 19328, 19348, 19350, 19353, 19356, 19358, 19394, 19407, 19453, 19454, 19502, 19503, 19509, 19520, 19556, 19557, 19585, 19616, 19661, 19696, 19735, 19768, 19771, 19772, 20048, 20049, 20077, 20080, 20082, 20092, 20105, 20284, 20285, 20291, 20299, 20333, 20334, 20379, 20384, 20409, 20412, 20413, 20446, 20510, 20558, 20561, 20564, 20593, 20606, 20732, 20733, 20951, 20952, 21051, 21052, 21058, 21059, 21117, 21156, 21158, 21185, 21202, 21216, 21231, 21249, 21267, 21279, 21282, 21283, 21363, 21418, 21420, 21521, 21574, 21627, 21628, 21675, 21730, 21732, 21740, 21783, 21785, 21823, 21825, 21826, 21835, 21879, 21881, 21921, 21923, 21924, 21936, 21987, 21989, 22039, 22041, 22042, 22054, 22120, 22122, 22187, 22189, 22190, 22197, 22250, 22252, 22300, 22302, 22304, 22306, 22307, 22389, 22405, 22407, 22408, 22411, 22414, 22417, 22448, 22461, 22495, 22496, 22502, 22513, 22575, 22604, 22605, 22679, 22711, 22712, 22793, 22846, 22847, 22923, 22961, 22962, 23034, 23072, 23073, 23146, 23179, 23182, 23185, 23188, 23224, 23237, 23405, 23406, 23417, 23428, 23429, 23430, 23472, 23473, 23512, 23513, 23750, 23752, 23753, 23951, 23952, 24050, 24053, 24056, 24081, 24094, 24214, 24215, 24323, 24590, 24689, 24708, 24709, 24794, 24795, 24846, 24847, 24890, 24891, 24928, 24929, 24954, 24991, 25017, 25045, 25047, 25049, 25078, 25080, 25082, 25121, 25128, 25166, 25168 ], "line_end_idx": [ 15, 16, 54, 55, 116, 117, 129, 130, 146, 168, 197, 223, 251, 260, 261, 417, 418, 726, 727, 961, 962, 1581, 1582, 2050, 2051, 2189, 2190, 2196, 2197, 2274, 2275, 2286, 2287, 2296, 2297, 2360, 2361, 2370, 2371, 2568, 2569, 2622, 2923, 3000, 3135, 3312, 3363, 3534, 3535, 3542, 3543, 3763, 3764, 3774, 3775, 3875, 3876, 3894, 3895, 4132, 4133, 4154, 4155, 4175, 4521, 4809, 5146, 5147, 5156, 5157, 5196, 5197, 5203, 5232, 5287, 5292, 5400, 5401, 5457, 5462, 5486, 5496, 5527, 5537, 5570, 5575, 5609, 5611, 5613, 5616, 5617, 5693, 5694, 5741, 5742, 5753, 5775, 5786, 5811, 5841, 5861, 5878, 5932, 5968, 5987, 6005, 6025, 6055, 6094, 6130, 6192, 6245, 6293, 6329, 6353, 6390, 6433, 6456, 6479, 6504, 6541, 6571, 6601, 6602, 6614, 6615, 6626, 6627, 6659, 6660, 6663, 6666, 6696, 6709, 6970, 6971, 7256, 7257, 7353, 7359, 7366, 7447, 7508, 7519, 7544, 7552, 7576, 7581, 7584, 7619, 7626, 7631, 7634, 7670, 7677, 7682, 7685, 7721, 7728, 7730, 7732, 7800, 7803, 7804, 7874, 7875, 8055, 8058, 8060, 8064, 8076, 8096, 8102, 8108, 8137, 8166, 8169, 8207, 8208, 8215, 8221, 8229, 8274, 8277, 8319, 8349, 8352, 8354, 8381, 8394, 8547, 8548, 8554, 8588, 8616, 8621, 8660, 8698, 8735, 8744, 8773, 8775, 8776, 8785, 8812, 8824, 8867, 8919, 8946, 8951, 8980, 8985, 9030, 9037, 9071, 9073, 9074, 9083, 9108, 9120, 9159, 9207, 9233, 9238, 9265, 9272, 9296, 9298, 9301, 9304, 9306, 9340, 9352, 9488, 9489, 9523, 9524, 9530, 9557, 9608, 9613, 9697, 9698, 9750, 9755, 9777, 9787, 9816, 9817, 9823, 9846, 9851, 9877, 9886, 9896, 9925, 9930, 9958, 9960, 9962, 9963, 9965, 9968, 9971, 9973, 10006, 10019, 10240, 10241, 10247, 10248, 10368, 10402, 10403, 10483, 10540, 10541, 10642, 10694, 10746, 10747, 10763, 10790, 10791, 10799, 10844, 10875, 10884, 10908, 10909, 10918, 10964, 10997, 11006, 11031, 11032, 11044, 11097, 11140, 11149, 11177, 11178, 11190, 11258, 11316, 11325, 11353, 11354, 11362, 11411, 11446, 11455, 11479, 11480, 11487, 11542, 11583, 11592, 11615, 11616, 11635, 11663, 11693, 11729, 11765, 11793, 11819, 11826, 11835, 11836, 11845, 11852, 11859, 11861, 11863, 11864, 11867, 11868, 11900, 11901, 11907, 11908, 11916, 11950, 11955, 12026, 12031, 12083, 12088, 12135, 12140, 12177, 12182, 12227, 12228, 12231, 12232, 12283, 12284, 12311, 12332, 12348, 12357, 12389, 12390, 12525, 12526, 12551, 12578, 12600, 12617, 12641, 12642, 12803, 12804, 12834, 12837, 12839, 12870, 12883, 13041, 13042, 13048, 13054, 13083, 13120, 13128, 13134, 13136, 13141, 13155, 13162, 13163, 13168, 13190, 13220, 13227, 13228, 13233, 13255, 13289, 13296, 13297, 13302, 13322, 13352, 13359, 13360, 13365, 13403, 13434, 13469, 13476, 13477, 13482, 13504, 13539, 13546, 13547, 13552, 13592, 13622, 13657, 13664, 13665, 13670, 13691, 13725, 13732, 13734, 13735, 13738, 13739, 13837, 13938, 13941, 13943, 13969, 13982, 14037, 14038, 14126, 14129, 14131, 14139, 14151, 14157, 14158, 14219, 14318, 14413, 14414, 14454, 14463, 14519, 14520, 14600, 14610, 14657, 14743, 14745, 14746, 14810, 14849, 14888, 14889, 14934, 14981, 14982, 15016, 15017, 15097, 15098, 15119, 15140, 15160, 15161, 15179, 15246, 15301, 15303, 15307, 15338, 15392, 15394, 15398, 15429, 15483, 15485, 15486, 15567, 15568, 15622, 15646, 15682, 15720, 15722, 15723, 15780, 15851, 15901, 15903, 15907, 15941, 15986, 15988, 15992, 16026, 16073, 16075, 16076, 16107, 16137, 16138, 16140, 16142, 16144, 16146, 16147, 16150, 16153, 16155, 16183, 16195, 16388, 16393, 16394, 16481, 16482, 16505, 16506, 16509, 16575, 16615, 16686, 16711, 16714, 16717, 16719, 16729, 16741, 16963, 16964, 16970, 16983, 16988, 16993, 17030, 17065, 17076, 17099, 17136, 17148, 17255, 17288, 17290, 17293, 17296, 17298, 17335, 17348, 17451, 17505, 17506, 17607, 17608, 17703, 17704, 17835, 17836, 17890, 17891, 17925, 17953, 17996, 18034, 18071, 18108, 18111, 18112, 18153, 18202, 18249, 18269, 18300, 18353, 18354, 18394, 18397, 18400, 18402, 18431, 18444, 18515, 18516, 18537, 18564, 18587, 18588, 18594, 18660, 18662, 18663, 18695, 18696, 18737, 18767, 18778, 18803, 18811, 18835, 18840, 18843, 18874, 18881, 18886, 18889, 18921, 18928, 18933, 18936, 18968, 18975, 18977, 18979, 18983, 19012, 19013, 19032, 19033, 19052, 19071, 19130, 19131, 19157, 19193, 19194, 19250, 19276, 19308, 19328, 19348, 19350, 19353, 19356, 19358, 19394, 19407, 19453, 19454, 19502, 19503, 19509, 19520, 19556, 19557, 19585, 19616, 19661, 19696, 19735, 19768, 19771, 19772, 20048, 20049, 20077, 20080, 20082, 20092, 20105, 20284, 20285, 20291, 20299, 20333, 20334, 20379, 20384, 20409, 20412, 20413, 20446, 20510, 20558, 20561, 20564, 20593, 20606, 20732, 20733, 20951, 20952, 21051, 21052, 21058, 21059, 21117, 21156, 21158, 21185, 21202, 21216, 21231, 21249, 21267, 21279, 21282, 21283, 21363, 21418, 21420, 21521, 21574, 21627, 21628, 21675, 21730, 21732, 21740, 21783, 21785, 21823, 21825, 21826, 21835, 21879, 21881, 21921, 21923, 21924, 21936, 21987, 21989, 22039, 22041, 22042, 22054, 22120, 22122, 22187, 22189, 22190, 22197, 22250, 22252, 22300, 22302, 22304, 22306, 22307, 22389, 22405, 22407, 22408, 22411, 22414, 22417, 22448, 22461, 22495, 22496, 22502, 22513, 22575, 22604, 22605, 22679, 22711, 22712, 22793, 22846, 22847, 22923, 22961, 22962, 23034, 23072, 23073, 23146, 23179, 23182, 23185, 23188, 23224, 23237, 23405, 23406, 23417, 23428, 23429, 23430, 23472, 23473, 23512, 23513, 23750, 23752, 23753, 23951, 23952, 24050, 24053, 24056, 24081, 24094, 24214, 24215, 24323, 24590, 24689, 24708, 24709, 24794, 24795, 24846, 24847, 24890, 24891, 24928, 24929, 24954, 24991, 25017, 25045, 25047, 25049, 25078, 25080, 25082, 25121, 25128, 25166, 25168, 25174 ] }
{ "red_pajama_v2": { "ccnet_original_length": 25174, "ccnet_original_nlines": 834, "rps_doc_curly_bracket": 0.005005159880965948, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.14868398010730743, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03660450130701065, "rps_doc_frac_lines_end_with_ellipsis": 0.002395210089161992, "rps_doc_frac_no_alph_words": 0.4178141951560974, "rps_doc_frac_unique_words": 0.3608923852443695, "rps_doc_mean_word_length": 6.062007904052734, "rps_doc_num_sentences": 260, "rps_doc_symbol_to_word_ratio": 0.0027889099437743425, "rps_doc_unigram_entropy": 6.329547882080078, "rps_doc_word_count": 3048, "rps_doc_frac_chars_dupe_10grams": 0.0606159009039402, "rps_doc_frac_chars_dupe_5grams": 0.09059911966323853, "rps_doc_frac_chars_dupe_6grams": 0.06938356161117554, "rps_doc_frac_chars_dupe_7grams": 0.0641879066824913, "rps_doc_frac_chars_dupe_8grams": 0.0606159009039402, "rps_doc_frac_chars_dupe_9grams": 0.0606159009039402, "rps_doc_frac_chars_top_2gram": 0.007360499817878008, "rps_doc_frac_chars_top_3gram": 0.0021648500114679337, "rps_doc_frac_chars_top_4gram": 0.0021107299253344536, "rps_doc_books_importance": -2706.193359375, "rps_doc_books_importance_length_correction": -2706.193359375, "rps_doc_openwebtext_importance": -1594.880859375, "rps_doc_openwebtext_importance_length_correction": -1594.880859375, "rps_doc_wikipedia_importance": -750.4448852539062, "rps_doc_wikipedia_importance_length_correction": -750.4448852539062 }, "fasttext": { "dclm": 0.8156965374946594, "english": 0.23785953223705292, "fineweb_edu_approx": 2.3398187160491943, "eai_general_math": 0.15720534324645996, "eai_open_web_math": 0.5050457119941711, "eai_web_code": 0.4925152063369751 } }
{ "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": "681.36", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Handicraft and Occupations", "level_3": "Clocks and watches and Scientific apparatus and instruments" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
-672,411,853,548,415,900
Skip to content How to Build a Multi-Tenant App with Custom Domains Using Next.js In this guide, you'll learn how to build a full-stack multi-tenant application by using the Platforms Starter Kit and the following technologies: If you already have an existing project and only want to see the steps for multi-tenancy, skip ahead to steps 4 and 5. Also, the code for this app can be found here. We’ll be using the Platforms Starter Kit to kickstart our Next.js project. First, open up your terminal and navigate and run the following: npx create-next-app --example https://github.com/vercel/platforms/tree/main platforms This will create a new folder in your current directory called platforms. Then, you can navigate into the folder, install the dependencies, and launch the app: cd platforms && npm i && npm run dev The new application has the following structure: pages └───api └───app │ │ index.tsx │ │ login.tsx │ │ settings.tsx │ │ │ └───post │ │ │ ... │ │ │ └───site │ │ ... │ └───home │ │ index.tsx │ └───_sites │ │ │ [site] │ │ │ index.tsx │ │ │ [slug].tsx Aside from the /api folder, there are 3 main folders in the /pages directory: • /app: All routes for the app subdomain (app.example.com), where users can customize their individual content pages. • /home: All routes for the landing page (example.com). • /_sites: All routes for all user content pages (e.g. john.example.com, kate.example.com). These folders contain the basic app structure for a multi-tenant app. However, only the /home route works for now. Let’s continue by adding our database. Note: Don't forget to convert the .env.example file that’s located at the root of the repo into a .env file – it'll come in handy later. 1. Prerequisite: You need to have the PlanetScale CLI installed 2. Create a new account with PlanetScale. 3. Using the PlanetScale CLI, create a new database called platforms. pscale db create platforms 4. Next, connect to the database branch: pscale connect platforms main --port 3309 5. In a different terminal window, use the db push command to push the schema defined in prisma/schema.prisma: npx prisma db push 6. Now that the initial schema has been added, promote your main branch to production: pscale branch promote platforms main 7. You've just provisioned your database! Now, when you go to app.localhost:3000, you should see the following screen: 8. To push additional schema changes to your database, follow the instructions from PlanetScale on Prisma Migrations. 9. Don't forget to get your production MySQL DATABASE_URL from your Planetscale database – you'll need it for when you deploy your app to Vercel later. You can do that by following this guide. Note that your DATABASE_URL should be in the following format: mysql://<USERNAME>:<PASSWORD>@<HOST>/<DATABASE>?sslaccept=strict Now, let’s add authentication to allow users to create accounts, add new sites, and add custom domains. We will use the next-auth library for authentication. This example is preconfigured to use GitHub OAuth. All user data is stored in your PlanetScale database, based on the Prisma schema defined. To set up GitHub for authentication: 1. Go to Developer Settings on GitHub. 2. Click on "New GitHub App". 3. Name your GitHub App. In our example, we'll call it "Platforms Starter Kit (dev)". 4. Add your homepage URL (or a placeholder, if you don't have a website yet). 5. For the "Callback URL" field, put http://app.localhost:3000. Since GitHub only allows one callback URL per app, we have to create separate apps for localhost and production (hence the "dev" name in step 3). 6. If the "Active" field under "Webhook" is checked, uncheck it. Now, click on "Create Github App". 7. Once your app is created, you should see the following screen. Click on "Generate a new client secret": 8. Copy the client secret you generated and paste it under the GITHUB_SECRET value in your .env file: 9. Copy the Client ID and paste it under the GITHUB_ID value in your .env file: You're all set! You can now go back to the app login page and log in with GitHub. Vercel Edge Functions give you the benefits of static with the power of dynamic. Inside this template, we use Middleware to create flexible rewrite rules. First, navigate to the _middleware.js file at the root of your /pages folder. Inside this file, we have set up rewrite rules to map each subdomain/custom domain to their dynamic routes in /pages. You’ll need to replace all instances of vercel.pub with your own domain to configure rewrites correctly. If you don't have a custom domain, you can add the .vercel.app domain that your project was assigned and use that as your custom domain. Next, we’ll be deploying the repo to Vercel. Note that this is not the final step since we’ll still need to configure the feature for adding custom domains in the next step. 1. First, create a new Github repository and push your local changes. 2. Deploy it to Vercel. Ensure you add all Environment Variables in your .env file to Vercel during the import process. • Ensure you create another GitHub App for production environment as well, and then add the production callback URL as an Environment Variable. It should be in the following format: https://app.<YOURDOMAIN.COM>/api/auth/callback/github. • Fill in the SECRET token in the .env file and add that as an Environment Variable. • Add the production DATABASE_URL you retrieved in step 2 as an Environment Variable. 3. In your Vercel project, add your root domain & wildcard domain. • When adding your custom domain, ignore the recommended step to "add the www. version of your domain and redirect your root domain to it" – just add the root domain. • To set up wildcard domains, you'll need to add the domain using the Nameservers method (as opposed to the recommended A records method). We’ll use the Vercel API to add custom domains to your project and assign it to the user's account: 1. Get your AUTH_BEARER_TOKEN from your Vercel Accounts Settings page under Tokens. Add that value to your .env file under the AUTH_BEARER_TOKEN key. 2. Get the VERCEL_PROJECT_ID for your project from https://vercel.com/<TEAM_OR_USER_NAME>/<PROJECT_SLUG>/settings. It should be in the format prj_xxxxxx... 3. If you're deploying your project under a team account, you'll also need to get your VERCEL_TEAM_ID – this can be found at https://vercel.com/teams/<TEAM_SLUG>/settings 4. We’ve set up a few API routes to help you handle custom domains: 1. /api/add-domain: Add domains to your Vercel project using this endpoint whenever a user adds it on your platform. This returns 3 possible outcomes: 1. Status code 403: The domain is already owned by another team but you can still request delegation from the team and add it. 2. Status code 409: The domain is already being used by a different project. You can’t add it unless the domain is removed from the project. 3. Status code 200: The domain is successfully added. 2. /api/check-domain: Checks if a domain has been successfully configured for your project. Returns two possible values: 1. true: domain has been configured successfully 2. false: domain has not been configured correctly 3. /api/request-delegation: If a domain is owned by another team, you can use this endpoint to request delegation from the team and add it. Caveat: we are actively working on improving our domain delegation process and it’s likely that there won’t be the need for this endpoint in the future 4. /api/remove-domain: Removes domains from your Vercel project using this endpoint whenever a user removes it from your platform. Note: The /api/add-domain endpoint only adds the root domain. If you want to add the www. subdomain and redirect it to the root, you'll have to perform an additional API call. Here are some supplementary code snippets that might be required to build Platforms on Vercel: Avoid [Cumulative Layout Shift](</docs/concepts/analytics/web-vitals#cumulative-layout-shift-(cls)) (CLS) from the native Twitter embed by using our static tweets implementation (supports image, video, gif, poll, retweets, quote retweets, and more). You'll need a Twitter auth bearer token, which you'll paste into the TWITTER_AUTH_TOKEN field in your .env file. Here's how you can get a Twitter auth bearer token. Cloudinary is used to handle image uploads. Here’s the reusable component we created and here’s the code we used to generate a blurhash from the uploaded images. You'll need a Cloudinary cloud account (cloudName) and a Cloudinary upload preset (uploadPreset). Here's how you can get those variables set up. In this guide, you learned how to build a full-stack multi-tenant application by using the Platforms Starter Kit. From blogging platforms to low-code tools, this starter kit can be a starter kit for a number of different types of applications, we’re excited to see what you build! If you run into any issues or have any questions about this guide, feel free to raise them on GitHub or drop them in the Next.js Discord. Couldn't find the guide you need?
{ "url": "https://vercel.com/guides/nextjs-multi-tenant-application", "source_domain": "vercel.com", "snapshot_id": "crawl=CC-MAIN-2022-40", "warc_metadata": { "Content-Length": "82715", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:3KC3372WTEJAL6VNBDPXSXQ3BTOJZFZV", "WARC-Concurrent-To": "<urn:uuid:fb979928-50fb-4071-9956-8514b3cfd25a>", "WARC-Date": "2022-10-05T18:49:21Z", "WARC-IP-Address": "76.76.21.22", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:IK5X3X223A6HARMNEJJJQ6OYZOLSQIEV", "WARC-Record-ID": "<urn:uuid:8bbb2e54-f54b-423a-8cbb-fa2d691d98da>", "WARC-Target-URI": "https://vercel.com/guides/nextjs-multi-tenant-application", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3521c4b6-602f-4353-81c4-9cdf1ca7b7e4>" }, "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-70\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 16, 17, 83, 84, 230, 231, 397, 398, 473, 474, 539, 540, 626, 627, 787, 788, 825, 826, 875, 876, 882, 890, 898, 916, 934, 955, 961, 974, 990, 996, 1009, 1025, 1027, 1036, 1054, 1056, 1067, 1077, 1092, 1118, 1145, 1146, 1224, 1225, 1345, 1403, 1497, 1498, 1652, 1653, 1790, 1791, 1857, 1858, 1902, 1903, 1975, 1976, 2007, 2012, 2055, 2056, 2102, 2107, 2220, 2221, 2244, 2249, 2338, 2339, 2380, 2385, 2506, 2507, 2627, 2628, 2886, 2887, 2956, 2961, 2962, 3066, 3067, 3262, 3263, 3300, 3301, 3342, 3343, 3375, 3376, 3464, 3465, 3545, 3546, 3758, 3759, 3861, 3862, 3971, 3972, 4076, 4077, 4159, 4160, 4242, 4243, 4398, 4399, 4595, 4596, 4838, 4839, 5013, 5014, 5086, 5208, 5449, 5538, 5628, 5697, 5868, 6011, 6012, 6112, 6113, 6265, 6423, 6596, 6666, 6821, 6954, 7101, 7161, 7286, 7341, 7398, 7694, 7829, 7830, 8006, 8007, 8102, 8103, 8353, 8354, 8519, 8520, 8682, 8683, 8828, 8829, 9110, 9111, 9249, 9250 ], "line_end_idx": [ 16, 17, 83, 84, 230, 231, 397, 398, 473, 474, 539, 540, 626, 627, 787, 788, 825, 826, 875, 876, 882, 890, 898, 916, 934, 955, 961, 974, 990, 996, 1009, 1025, 1027, 1036, 1054, 1056, 1067, 1077, 1092, 1118, 1145, 1146, 1224, 1225, 1345, 1403, 1497, 1498, 1652, 1653, 1790, 1791, 1857, 1858, 1902, 1903, 1975, 1976, 2007, 2012, 2055, 2056, 2102, 2107, 2220, 2221, 2244, 2249, 2338, 2339, 2380, 2385, 2506, 2507, 2627, 2628, 2886, 2887, 2956, 2961, 2962, 3066, 3067, 3262, 3263, 3300, 3301, 3342, 3343, 3375, 3376, 3464, 3465, 3545, 3546, 3758, 3759, 3861, 3862, 3971, 3972, 4076, 4077, 4159, 4160, 4242, 4243, 4398, 4399, 4595, 4596, 4838, 4839, 5013, 5014, 5086, 5208, 5449, 5538, 5628, 5697, 5868, 6011, 6012, 6112, 6113, 6265, 6423, 6596, 6666, 6821, 6954, 7101, 7161, 7286, 7341, 7398, 7694, 7829, 7830, 8006, 8007, 8102, 8103, 8353, 8354, 8519, 8520, 8682, 8683, 8828, 8829, 9110, 9111, 9249, 9250, 9283 ] }
{ "red_pajama_v2": { "ccnet_original_length": 9283, "ccnet_original_nlines": 156, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3370221257209778, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.016096580773591995, "rps_doc_frac_lines_end_with_ellipsis": 0.019108280539512634, "rps_doc_frac_no_alph_words": 0.24195170402526855, "rps_doc_frac_unique_words": 0.3038749098777771, "rps_doc_mean_word_length": 4.802855014801025, "rps_doc_num_sentences": 154, "rps_doc_symbol_to_word_ratio": 0.002012070035561919, "rps_doc_unigram_entropy": 5.391913890838623, "rps_doc_word_count": 1471, "rps_doc_frac_chars_dupe_10grams": 0.020099079236388206, "rps_doc_frac_chars_dupe_5grams": 0.09596603363752365, "rps_doc_frac_chars_dupe_6grams": 0.06001415103673935, "rps_doc_frac_chars_dupe_7grams": 0.04359519109129906, "rps_doc_frac_chars_dupe_8grams": 0.04359519109129906, "rps_doc_frac_chars_dupe_9grams": 0.03340410068631172, "rps_doc_frac_chars_top_2gram": 0.0053786300122737885, "rps_doc_frac_chars_top_3gram": 0.003821660066023469, "rps_doc_frac_chars_top_4gram": 0.007360230199992657, "rps_doc_books_importance": -879.7664794921875, "rps_doc_books_importance_length_correction": -879.7664794921875, "rps_doc_openwebtext_importance": -561.947265625, "rps_doc_openwebtext_importance_length_correction": -561.947265625, "rps_doc_wikipedia_importance": -433.73138427734375, "rps_doc_wikipedia_importance_length_correction": -433.73138427734375 }, "fasttext": { "dclm": 0.37657660245895386, "english": 0.8384495973587036, "fineweb_edu_approx": 1.6563355922698975, "eai_general_math": 0.34631645679473877, "eai_open_web_math": 0.1350691318511963, "eai_web_code": 0.6024441123008728 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.0285", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
331,960,791,703,687,100
preloader Docker Enterprise 2.1 na DigitalOcean – Parte III Na primeira parte desta série, nós vimos como fazer um setup do novo cluster Docker Enterprise 2.1 na DigitalOcean com o Terraform e Ansible. Na segunda parte, nós configuramos o Docker Enterprise para provisionar automaticamente blocos de volumes e load balancers na DigitalOcean. Neste artigo, iremos discutir algumas maneiras de resolver os endpoints HTTPS e certificados. O que você precisa Tenha certeza de ter completado a primeira e a segunda parte desta série. Além disso, seu shell precisa estar configurado para conectar com o cluster remotamente (executando o script do pacote de cliente “env.sh”). Nós também precisaremos do DigitalOcean CLI (Interface de Linha de Comando), conhecido como doctl. Sobre a integração do DigitalOcean LetsEncrypt O processo é simples, quase reduzido a poucos cliques de mouse, se o maior nível do domínio envolvido (mycompany.com) é controlado pela própria DigitalOcean. Estes passos descrevem como criar um certificado “wildcard” com LetsEncrypt e como configurar o load balancer da DigitalOcean para endpoints HTTPS. Ambas as coisas podem ser feitas automaticamente pela DigitalOcean, como está descrito neste artigo. No meu caso, o domínio de nível mais alto pertence a AWS, onde um subdomain foi definido e delegado a DigitalOcean. A integração da DigitalOcean LetsEncrypt não funciona neste cenário. Então aqui vamos nós! Passo 1: Certificado Wildcard Na parte I nós criamos um certificado HTTPS para o hostname do Docker UCP antes da instalação do UCP. Isto foi muito simples: nós executamos um Certbot para cada host que possui o hostname “ucp.devops.mycompany.com”, que é o workflow natural para o protocolo de Certbot ACME. Nós não podemos fazer isso de novo, porque as portas necessárias estão ocupadas neste momento. Porém, sem desespero! Temos uma solução alternativa. Tendo o controle do DNS (possuindo um domínio/subdomínio na DigitalOcean), você pode gerar os certificados com os servidores Certbot de uma maneira diferente. Importante: abra um novo shell para isso – nós iremos executar este comando na sua engine Docker local, então nós precisamos de um shell que não está executando o pacote de scripts do UCP (“env.sh”). Os certificados serão escritos para uma pasta “letsencrypt” no atual diretório. O comando abaixo vai dizer ao servidor Certbot para usar o DNS challenge (lembre-se de usar o domínio e e-mail de antes): docker run --rm -ti \ -v $(pwd)/letsencrypt:/etc/letsencrypt \ certbot/certbot certonly --agree-tos \ -d "*.apps.devops.mycompany.com" \ --preferred-challenges=dns --manual \ [email protected] Responda “YES” para a primeira pergunta e espere uma mensagem parecida com a que está abaixo: - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Please deploy a DNS TXT record under the name _acme-challenge.apps.devops.mycompany.com with the following value: NjeNlv9Gxcz...............JxTOgHjqzM Before continuing, verify the record is deployed. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Press Enter to Continue Não pressione <Enter> ainda! Agora você precisa editar o seu domínio na DigitalOcean (“Networking/Domains/<your domain>”), selecione “TXT” e crie uma nova entrada de nome “_acme-challenge.apps” com o valor informado no Certbot: Depois que esse registro TXT for criado manualmente, você poderá inserir o nome do domínio. A saída será algo como isto: Waiting for verification... Cleaning up challenges IMPORTANT NOTES: - Congratulations! Your certificate and chain have been saved at: /etc/letsencrypt/live/apps.devops.mycompany.com/fullchain.pem Your key file has been saved at: /etc/letsencrypt/live/apps.devops.mycompany.com/privkey.pem ... Veja o conteúdo da pasta “letsencrypt/live”: tem uma nova pasta “apps.devops.mycompany.com” contendo o certificado para o domínio wildcard. Você pode usar o Certbot de novo para verificar os certificados recebidos: docker run --rm -ti \ -v $(pwd)/letsencrypt:/etc/letsencrypt \ certbot/certbot certificates A sua saída deve conter isto: ... Found the following certs: Certificate Name: apps.devops.mycompany.com Domains: *.apps.devops.mycompany.com Expiry Date: 2019-02-19 06:31:15+00:00 (VALID: 89 days) Certificate Path: /etc/letsencrypt/live/apps.devops.mycompany.com/fullchain.pem Private Key Path: /etc/letsencrypt/live/apps.devops.mycompany.com/privkey.pem ... O quão legal isso é? Lembre-se nós temos um load balancer funcionando para este mesmo wildcard do domínio. Parece que nós temos duas opções agora: • Use o próprio load balancer para endpoints HTTPS (o cluster funciona apenas HTTP) • O load balance passa todo o tráfego HTTPS para o cluster (o cluster faz o endpoint HTTPS)   Passo 2: O Load Balancer faz HTTPS A primeira etapa é mudar manualmente o load balancer da DigitalOcean que nós acabamos de criar para resolver endpoints HTTPS sozinho (i.e. nenhum tráfego HTTPS entra no cluster). Vamos fazer o certificado criado no nosso passo anterior disponível para a DigitalOcean. A ferramenta que irá fazer este trabalho é o doctl (ferramenta de linha de comando da DigitalOcean) : doctl compute certificate create \ --private-key-path letsencrypt/live/apps.devops.mycompany.com/privkey.pem \ --certificate-chain-path ./letsencrypt/live/apps.devops.mycompany.com/fullchain.pem \ --leaf-certificate-path ./letsencrypt/live/apps.devops.mycompany.com/fullchain.pem \ --name apps-devops Se o doctl não estiver disponível, você pode carregar o certificado manualmente. Na DigitalOcean procure por “Account/Security/Certificates”, clique em “Add certificate” e depois clique em “Custom”: Isto é um pouco chato, mas você terá que copiar e colar o conteúdo dos arquivos de certificados em “letsencrypt/live/apps.devops.mycompany.com”: • Name: apps-devops • Certificate: cole o conteúdo do arquivo “fullchain.pem” • Private Key: cole o conteúdo do arquivo “privkey.pem” • Certificate chain: cole o conteúdo do arquivo ”fullchain.pem” Salve este certificado! Agora vamos usar isto no load balancer que já possuímos. Importante: você nunca deveria ter que perder tempo com o load balancer manualmente, do modo como estamos fazendo. Lembre-se: este load balancer foi criado automaticamente pelo CCM. Se ele precisar ser reconfigurado, o CCM deverá ser usado para isso. Não se preocupe, nós vamos ver isso mais tarde. Abaixo “Manage/Networking/Load balancers/ <your load balancer>/Settings” mude a atual regra de encaminhamento para a porta 443 para que ela resolva endpoints HTTPS com o certificado que nós fornecemos. Também o encaminhamento para a porta 443 precisa ser o mesmo da porta 80 (32919 na imagem abaixo, certamente outra coisa no seu caso). Salve as mudanças e teste elas com dois comandos curl que devem ter resultados similares: curl http://cafe.apps.devops.mycompany.com Server address: 192.168.175.76:80 Server name: coffee-7dbb5795f6-k7ffn Date: 21/Nov/2018:11:01:37 +0000 URI: / Request ID: 7a57d37fa0a90858961bc16d91fbb641 curl https://cafe.apps.devops.mycompany.com Server address: 192.168.175.75:80 Server name: coffee-7dbb5795f6-zsngr Date: 21/Nov/2018:11:02:24 +0000 URI: / Request ID: ed77771e9f05531ad3357e4ef7da57ec Note o mesmo comportamento com a outra aplicação: curl http://tea.apps.devops.mycompany.com Server address: 192.168.175.77:80 Server name: tea-7d57856c44-qdrm2 Date: 21/Nov/2018:11:04:00 +0000 URI: / Request ID: fb867646ed2ea3b7c769826ac70c9fa4 curl https://tea.apps.devops.mycompany.com Server address: 192.168.175.79:80 Server name: tea-7d57856c44-dshh4 Date: 21/Nov/2018:11:04:06 +0000 URI: / Request ID: 82caf8dfa72002f8d98e24ac0f96d4b5 Agora que entendemos como o load balancer deveria ser configurado, vamos fazer isso de forma apropriada (via CCM). Nós iremos aprender como fazer o deploy de um controlador ingress que automaticamente configura o load balancer da DigitalOcean, o qual resolve endpoints HTTPs sozinho como mostramos acima. Primeiro vamos remover o atual controlador ingress que fizemos deploy na parte II usando o helm (utilize o shell configurado para alcançar o cluster): helm delete my-nginx Isto deleta o controlador ingress e o load balancer controlado pela DigitalOcean. Nós iremos recriar o controlador ingress em um caminho que o CCM reconheça as configurações para o load balancer externo do cloud provider. Você irá precisar do id do certificado que criamos antes. Você pode sempre usar doctl para coletar isso: doctl compute certificate list [-t "YOUR-DO-TOKEN-HERE"] ID Name (...) 9e844bb7-..............-8312c3ff4edc apps-devops (...) O comando abaixo irá instalar o mesmo controlador ingress, mas com as anotações apropriadas para o CCM desta vez (você precisa trocar o id do certificado): helm install stable/nginx-ingress \ --name my-nginx \ --set rbac.create=true \ --namespace nginx-ingress \ --set controller.service.annotations."service\.beta\.kubernetes\.io/do-loadbalancer-protocol"="http" \ --set controller.service.annotations."service\.beta\.kubernetes\.io/do-loadbalancer-algorithm"="round_robin" \ --set controller.service.annotations."service\.beta\.kubernetes\.io/do-loadbalancer-tls-ports"="443" \ --set controller.service.annotations."service\.beta\.kubernetes\.io/do-loadbalancer-certificate-id"="9e844bb7-.........-8312c3ff4edc" \ --set controller.service.annotations."service\.beta\.kubernetes\.io/do-loadbalancer-healthcheck-path"="/healthz" \ --set controller.service.annotations."service\.beta\.kubernetes\.io/do-loadbalancer-redirect-http-to-https"="true" \ --set controller.service.targetPorts.https="http" Em resumo, as anotações que configuramos acima tomam conta das configurações do load balancer: • HTTPS endpoints (certificados e portas) • Heathcheck dos caminhos • Redirecionadores de requisições de HTTP para HTTPS • Simples HTTP entre load balancer e cluster (ou seja, nenhum HTTPS endpoint para o para o próprio cluster) • Redirecionamento de HTTP para HTTPS Espere no site da DigitalOcean até que o load balancer seja criado (isso leva um tempo). Muito importante: Se o endereço IP do load balancer mudou desde o nosso valor anterior (tem uma grande chance de que isso tenha acontecido) você tem que atualizar sua entrada DNS “*.apps” sobre o seu domínio para usar o novo endereço. curl https://cafe.apps.devops.mycompany.com Server address: 192.168.175.96:80 Server name: coffee-7dbb5795f6-62k9d Date: 22/Nov/2018:15:45:03 +0000 URI: / Request ID: a0d1e0a56a540630fbc3de08217e1e4b Muito melhor! Você também pode testar o redirecionamento HTTP para HTTPS: curl -L http://cafe.apps.devops.mycompany.com Server address: 192.168.175.95:80 Server name: coffee-7dbb5795f6-v9s7g Date: 22/Nov/2018:15:48:42 +0000 URI: / Request ID: 3377f89127b46d44605127471abad958 Cuidado: é possível que a atualização da entrada de DNS para o domínio wildcard não atinja o atual servidor DNS imediatamente. Neste caso, ambos os comandos acima falharão e você ficará preso. Felizmente, tem uma forma de contornarmos utilizando o curl sem confiar na resolução do nome. Por exemplo: curl -LH "Host: cafe.apps.devops.mycompany.com" <load-balancer-ip> Passo 3: O Load Balancer faz requisições HTTPS Alguns podem argumentar que passar tráfego HTTP através do load balancer para o cluster é um pouco inseguro. Então, iremos tentar uma abordagem diferente para endpoint HTTPS: desta forma permitiremos o cluster mesmo sem o endpoint e assim o load balancer apenas encaminha os pacotes às cegas. Primeiro nós temos que fazer o deploy do Secret contendo o certificado no cluster. Você pode editar o arquivo “cafe/cafe-secret.yaml” para aceitar o certificado e sua chave: O valor do “tls.crt” é o conteúdo do “fullchain.pem” na codificação Base64: base64 -i letsencrypt/live/apps.devops.mycompany.com/fullchain.pem O valor “tls.key” é o conteúdo de “privkey.pem” na codificação Base64: base64 -i letsencrypt/live/apps.devops.mycompany.com/privkey.pem Deploy o Secret no cluster: kubectl apply -f cafe/cafe-secret.yaml secret "cafe-secret" created Nós devemos agora remover ambos os controladores ingress e recursos ingress que já foram criados nos passos anteriores deste artigo: helm delete --purge my-nginx release "my-nginx" deleted kubectl delete -f cafe/cafe-ingress-http.yaml ingress.extensions "cafe-ingress" deleted Agora, nós devemos fazer o deploy do novo recurso ingress que define endpoints TLS (HTTPS) para as aplicações web que já foram criadas: kubectl apply -f cafe/cafe-ingress.yaml ingress.extensions "cafe-ingress" created Truque: compare ambos os arquivos “cafe-ingress-http.yaml” e “cafe-ingress.yaml” para entender as diferenças (especialmente as terminações dos endpoints TLS). Finalmente, vamos fazer o deploy do controlador ingress (e também do novo load balancer) que define as requisições HTTPS: helm install stable/nginx-ingress \ --name my-nginx \ --set rbac.create=true \ --namespace nginx-ingress \ --set controller.service.annotations."service\.beta\.kubernetes\.io/do-loadbalancer-protocol"="http" \ --set controller.service.annotations."service\.beta\.kubernetes\.io/do-loadbalancer-algorithm"="round_robin" \ --set controller.service.annotations."service\.beta\.kubernetes\.io/do-loadbalancer-tls-ports"="443" \ --set controller.service.annotations."service\.beta\.kubernetes\.io/do-loadbalancer-healthcheck-path"="/healthz" \ --set controller.service.annotations."service\.beta\.kubernetes\.io/do-loadbalancer-redirect-http-to-https"="true" \ --set controller.service.annotations."service\.beta\.kubernetes\.io/do-loadbalancer-tls-passthrough"="true" Depois de algum tempo, o load balancer da DigitalOcean estará on-line e configurado corretamente com a passagem HTTPS: Mais uma vez, o endereço IP externo do load balancer pode mudar, neste caso você terá que fazer um update da entrada do DNS no seu domínio “*apps”. Você pode testar sua aplicação web da mesma forma como fizemos anteriormente: curl https://cafe.apps.devops.mycompany.com Server address: 192.168.175.95:80 Server name: coffee-7dbb5795f6-v9s7g Date: 22/Nov/2018:19:55:27 +0000 URI: / Request ID: 572cb18edc38b0176c9d79f779f8d8a0 Se o nome da resolução do DNS continuar apontando para o endereço DNS anterior, você pode sempre contornar da forma como discutimos anteriormente: curl -LH "Host: cafe.apps.devops.mycompany.com" <load-balancer-ip> Conclusão: Uma vez que fazemos o deploy com as configurações e anotações apropriadas, o controlador ingress e o resultado do load balancer devem durar pra sempre. Todos os outros recursos podem ir e vir (pod, Services e deployments). Esta série de artigos demonstra de forma fácil e transparente como o Docker Enterprise pode funcionar na cloud da DigitalOcean. Kubernetes não precisa ser um pesadelo, nem você deveria desistir do Swarm mode apenas porque todos estão pulando da ponte. Divirta-se com o Docker Enterprise na DigitalOcean! Tradução: Thor Salgado – Estagiário Vertigo Tecnologia e  Docker Enthusiast Revisão: Rubens Freitas – Gerente de Infraestrutura Vertigo Tecnologia Quer uma demonstração ao vivo do Docker? Fale com nossos especialistas!   Preencha o formulário para conversar com os nossos especialistas e saber como esses métodos podem ajudar a sua empresa chegar ao sucesso. Se você ama tecnologia e gosta de se manter atualizado, inscreva-se no nosso blog! Você também pode se interessar por... contato Vamos bater um papo? Estamos aqui para te ajudar_
{ "url": "https://vertigo.com.br/do-docker-enterprise-parte-3/", "source_domain": "vertigo.com.br", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "161960", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:JAXLVLPVEXLQMNKYV7F3DO2MAJNX3XZO", "WARC-Concurrent-To": "<urn:uuid:e3afa6b8-4492-4be9-9ee6-3cd84dfcae33>", "WARC-Date": "2024-05-21T09:40:12Z", "WARC-IP-Address": "137.184.0.246", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:E4K65GX3KSPYUFQPPAEQURVWMERKOWE7", "WARC-Record-ID": "<urn:uuid:04579bf4-ae38-43e9-87a6-29a11e0d6008>", "WARC-Target-URI": "https://vertigo.com.br/do-docker-enterprise-parte-3/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:0282668d-7972-4270-9a99-63435d4c80ef>" }, "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-253\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, 10, 11, 61, 62, 204, 205, 345, 346, 440, 441, 460, 461, 676, 677, 776, 777, 824, 825, 1232, 1233, 1418, 1419, 1441, 1442, 1472, 1473, 1749, 1750, 2057, 2058, 2338, 2339, 2461, 2462, 2484, 2527, 2568, 2605, 2645, 2673, 2674, 2768, 2769, 2837, 2883, 2951, 2988, 3038, 3106, 3130, 3131, 3359, 3360, 3481, 3482, 3510, 3533, 3550, 3617, 3682, 3718, 3781, 3785, 3786, 3926, 3927, 4002, 4003, 4025, 4068, 4099, 4100, 4130, 4131, 4135, 4162, 4208, 4249, 4309, 4393, 4475, 4479, 4480, 4501, 4502, 4588, 4589, 4629, 4630, 4716, 4810, 4811, 4813, 4814, 4849, 4850, 5029, 5030, 5221, 5222, 5257, 5335, 5423, 5510, 5531, 5532, 5731, 5732, 5877, 5878, 5900, 5960, 6018, 6084, 6085, 6109, 6110, 6167, 6168, 6467, 6468, 6805, 6806, 6896, 6897, 6940, 6974, 7011, 7044, 7051, 7096, 7140, 7174, 7211, 7244, 7251, 7296, 7297, 7347, 7348, 7390, 7424, 7458, 7491, 7498, 7543, 7586, 7620, 7654, 7687, 7694, 7739, 7740, 8045, 8046, 8197, 8198, 8219, 8220, 8302, 8303, 8548, 8549, 8606, 8657, 8715, 8716, 8872, 8873, 8909, 8929, 8956, 8986, 9091, 9204, 9309, 9447, 9564, 9683, 9735, 9736, 9831, 9832, 9876, 9904, 9959, 10069, 10109, 10110, 10199, 10200, 10435, 10436, 10480, 10514, 10551, 10584, 10591, 10636, 10637, 10711, 10712, 10758, 10792, 10829, 10862, 10869, 10914, 10915, 11108, 11109, 11216, 11217, 11284, 11285, 11332, 11333, 11626, 11627, 11801, 11802, 11878, 11879, 11946, 11947, 12018, 12019, 12084, 12085, 12113, 12114, 12153, 12182, 12183, 12316, 12317, 12346, 12373, 12419, 12461, 12462, 12598, 12599, 12639, 12681, 12682, 12841, 12842, 12964, 12965, 13001, 13021, 13048, 13078, 13183, 13296, 13401, 13518, 13637, 13747, 13748, 13867, 13868, 14016, 14017, 14095, 14096, 14140, 14174, 14211, 14244, 14251, 14296, 14297, 14444, 14445, 14512, 14513, 14524, 14525, 14748, 14749, 15001, 15002, 15054, 15055, 15131, 15132, 15203, 15204, 15205, 15246, 15247, 15278, 15279, 15281, 15282, 15420, 15421, 15504, 15542, 15550, 15551, 15572 ], "line_end_idx": [ 10, 11, 61, 62, 204, 205, 345, 346, 440, 441, 460, 461, 676, 677, 776, 777, 824, 825, 1232, 1233, 1418, 1419, 1441, 1442, 1472, 1473, 1749, 1750, 2057, 2058, 2338, 2339, 2461, 2462, 2484, 2527, 2568, 2605, 2645, 2673, 2674, 2768, 2769, 2837, 2883, 2951, 2988, 3038, 3106, 3130, 3131, 3359, 3360, 3481, 3482, 3510, 3533, 3550, 3617, 3682, 3718, 3781, 3785, 3786, 3926, 3927, 4002, 4003, 4025, 4068, 4099, 4100, 4130, 4131, 4135, 4162, 4208, 4249, 4309, 4393, 4475, 4479, 4480, 4501, 4502, 4588, 4589, 4629, 4630, 4716, 4810, 4811, 4813, 4814, 4849, 4850, 5029, 5030, 5221, 5222, 5257, 5335, 5423, 5510, 5531, 5532, 5731, 5732, 5877, 5878, 5900, 5960, 6018, 6084, 6085, 6109, 6110, 6167, 6168, 6467, 6468, 6805, 6806, 6896, 6897, 6940, 6974, 7011, 7044, 7051, 7096, 7140, 7174, 7211, 7244, 7251, 7296, 7297, 7347, 7348, 7390, 7424, 7458, 7491, 7498, 7543, 7586, 7620, 7654, 7687, 7694, 7739, 7740, 8045, 8046, 8197, 8198, 8219, 8220, 8302, 8303, 8548, 8549, 8606, 8657, 8715, 8716, 8872, 8873, 8909, 8929, 8956, 8986, 9091, 9204, 9309, 9447, 9564, 9683, 9735, 9736, 9831, 9832, 9876, 9904, 9959, 10069, 10109, 10110, 10199, 10200, 10435, 10436, 10480, 10514, 10551, 10584, 10591, 10636, 10637, 10711, 10712, 10758, 10792, 10829, 10862, 10869, 10914, 10915, 11108, 11109, 11216, 11217, 11284, 11285, 11332, 11333, 11626, 11627, 11801, 11802, 11878, 11879, 11946, 11947, 12018, 12019, 12084, 12085, 12113, 12114, 12153, 12182, 12183, 12316, 12317, 12346, 12373, 12419, 12461, 12462, 12598, 12599, 12639, 12681, 12682, 12841, 12842, 12964, 12965, 13001, 13021, 13048, 13078, 13183, 13296, 13401, 13518, 13637, 13747, 13748, 13867, 13868, 14016, 14017, 14095, 14096, 14140, 14174, 14211, 14244, 14251, 14296, 14297, 14444, 14445, 14512, 14513, 14524, 14525, 14748, 14749, 15001, 15002, 15054, 15055, 15131, 15132, 15203, 15204, 15205, 15246, 15247, 15278, 15279, 15281, 15282, 15420, 15421, 15504, 15542, 15550, 15551, 15572, 15600 ] }
{ "red_pajama_v2": { "ccnet_original_length": 15600, "ccnet_original_nlines": 304, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.10524719208478928, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.02942069061100483, "rps_doc_frac_lines_end_with_ellipsis": 0.01639343984425068, "rps_doc_frac_no_alph_words": 0.3254473805427551, "rps_doc_frac_unique_words": 0.36714211106300354, "rps_doc_mean_word_length": 6.561014175415039, "rps_doc_num_sentences": 296, "rps_doc_symbol_to_word_ratio": 0.0057628098875284195, "rps_doc_unigram_entropy": 5.820016860961914, "rps_doc_word_count": 1893, "rps_doc_frac_chars_dupe_10grams": 0.052657000720500946, "rps_doc_frac_chars_dupe_5grams": 0.1405797153711319, "rps_doc_frac_chars_dupe_6grams": 0.07149758189916611, "rps_doc_frac_chars_dupe_7grams": 0.07149758189916611, "rps_doc_frac_chars_dupe_8grams": 0.052657000720500946, "rps_doc_frac_chars_dupe_9grams": 0.052657000720500946, "rps_doc_frac_chars_top_2gram": 0.02222222089767456, "rps_doc_frac_chars_top_3gram": 0.012560389935970306, "rps_doc_frac_chars_top_4gram": 0.009017709642648697, "rps_doc_books_importance": -1444.468994140625, "rps_doc_books_importance_length_correction": -1444.468994140625, "rps_doc_openwebtext_importance": -867.2540893554688, "rps_doc_openwebtext_importance_length_correction": -867.2540893554688, "rps_doc_wikipedia_importance": -608.9330444335938, "rps_doc_wikipedia_importance_length_correction": -608.9330444335938 }, "fasttext": { "dclm": 0.17052537202835083, "english": 0.03561390936374664, "fineweb_edu_approx": 2.0073068141937256, "eai_general_math": 0.0006091599934734404, "eai_open_web_math": 0.24677973985671997, "eai_web_code": 0.5170505046844482 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.445", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-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" } } }
ece34605c058195ed03b4d393ef1a36c
-1,451,947,701,301,922,000
Phone Number Lookup How Twilio Lookup makes a difference in your business Having the correct data is only half the battle. You need accuracy and speed to implement phone intelligence into your business logic. Lookup gives you the tools you need to do just that. Guidelines 1. Install the UChat App from the AppStore 2. Enter your Twilio Account SID and TOKEN 3. In your flow builder, select the Action step and select the "Phone Number Lookup" action under "Integration" block 4. Select an action "Lookup Carrier" or "Lookup Caller" 5. Enter the Phone Number 6. Assign the custom fields in Response Mapping 7. Run the flow Author Twilio [email protected] https://www.twilio.com/lookup Application reviewed by UChat Before publishing app, UChat Review Team makes sure that: 1. The app can be installed via installation link 2. The app doesn't capture unnecessary data 3. All app actions are accessible inside flow builder 4. App actions work in accordance with their title and description 5. App settings capture enough information to make the app work 6. All external sources that impact the app's actions performance are configured properly Try UChat for Free Building a bot is easy, fun, and proven to get results By using UChat, you agree to our Cookie Policy.
{ "url": "https://www.uchat.com.au/apps/ed013eeb130b52de3c42e0d6db904f49", "source_domain": "www.uchat.com.au", "snapshot_id": "crawl=CC-MAIN-2021-31", "warc_metadata": { "Content-Length": "20913", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:BM5S5VZZRABXGL3ZH435DIW4YHO46J6P", "WARC-Concurrent-To": "<urn:uuid:0d83b363-4d6a-44c0-ac83-1048e8cc2907>", "WARC-Date": "2021-07-28T08:19:15Z", "WARC-IP-Address": "104.21.80.70", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:YMBOEY7AFREO3OVTBXCZHZXMHSPAKL6H", "WARC-Record-ID": "<urn:uuid:187381ac-3f6d-4373-ada5-c25644104d53>", "WARC-Target-URI": "https://www.uchat.com.au/apps/ed013eeb130b52de3c42e0d6db904f49", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:2a156bd8-65d6-4fdf-a43d-f7196bad5425>" }, "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-15.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, 20, 21, 22, 76, 77, 265, 266, 267, 278, 279, 324, 325, 370, 371, 491, 492, 550, 551, 579, 580, 630, 631, 649, 650, 657, 658, 665, 666, 684, 685, 715, 716, 746, 747, 805, 857, 903, 959, 1028, 1094, 1186, 1187, 1206, 1207, 1262, 1263 ], "line_end_idx": [ 20, 21, 22, 76, 77, 265, 266, 267, 278, 279, 324, 325, 370, 371, 491, 492, 550, 551, 579, 580, 630, 631, 649, 650, 657, 658, 665, 666, 684, 685, 715, 716, 746, 747, 805, 857, 903, 959, 1028, 1094, 1186, 1187, 1206, 1207, 1262, 1263, 1310 ] }
{ "red_pajama_v2": { "ccnet_original_length": 1310, "ccnet_original_nlines": 46, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.26377952098846436, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.007874020375311375, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.20472441613674164, "rps_doc_frac_unique_words": 0.6076555252075195, "rps_doc_mean_word_length": 4.851674556732178, "rps_doc_num_sentences": 19, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.576469898223877, "rps_doc_word_count": 209, "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.03254437819123268, "rps_doc_frac_chars_top_3gram": 0.033530570566654205, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -84.11259460449219, "rps_doc_books_importance_length_correction": -84.11259460449219, "rps_doc_openwebtext_importance": -53.184234619140625, "rps_doc_openwebtext_importance_length_correction": -53.184234619140625, "rps_doc_wikipedia_importance": -21.97992706298828, "rps_doc_wikipedia_importance_length_correction": -21.979894638061523 }, "fasttext": { "dclm": 0.49836045503616333, "english": 0.8719416856765747, "fineweb_edu_approx": 1.0944716930389404, "eai_general_math": 0.0019307699985802174, "eai_open_web_math": 0.015613679774105549, "eai_web_code": 0.002498629968613386 } }
{ "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.401", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Business", "level_3": "Management" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "6", "label": "Promotional/Advertisement" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "17", "label": "Product Page" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "1", "label": "No Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "6", "label": "Not Applicable/Indeterminate" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
5,322,602,026,525,674,000
Broadcast delay From Wikipedia, the free encyclopedia   (Redirected from Seven-second delay) Jump to navigation Jump to search Many US radio talk shows use broadcast delay to avoid FCC penalties In radio and television, broadcast delay is an intentional delay when broadcasting live material, technically referred to as a deferred live. Such a delay may be to prevent mistakes or unacceptable content from being broadcast. Longer delays lasting several hours can also be introduced so that the material is aired at a later scheduled time (such as the prime time hours) to maximize viewership. Tape delays lasting several hours can also be edited down to remove filler material or to trim a broadcast to the network's desired run time for a broadcast slot, but this is not always the case. Usage[edit] A short delay is often used to prevent profanity, bloopers, nudity, or other undesirable material from making it to air, including more mundane problems, such as technical malfunctions (an anchor's lapel microphone goes dead). In that instance, it is often referred to as a "seven-second delay" or "profanity delay". Longer delays, however, may also be introduced, often to allow a show to air at the same time for the local market as is sometimes done with nationally broadcast programs in countries with multiple time zones. Considered as time shifting, that is often achieved by a "tape delay", using a video tape recorder, modern digital video recorders, or other similar technology. Tape delay may also refer to the process of broadcasting an event at a later scheduled time because a scheduling conflict prevents a live telecast, or a broadcaster seeks to maximize ratings by airing an event in a certain timeslot. That can also be done because of time constraints of certain portions, usually those that do not affect the outcome of the show, are edited out, or the availability of hosts or other key production staff only at certain times of the day, and it is generally applicable for cable television programs. In countries that span multiple time zones and have influential domestic eastern regions, such as Australia, Canada, Mexico and the United States, television networks usually delay the entirety of their schedule for stations in the west, so prime time programming can be time shifted to air in local primetime hours to improve accessibility and viewership. Although Mexico and Canada have now regularly televised their live programs in real time simultaneously across all of their territories, in the U.S., "east" feeds usually target the Eastern and Central time zones, while "west" feeds are usually oriented towards the Pacific time zone. As a result, until today, many live programs, such as music and talent competition shows, are usually tape delayed for the western half of the country and aired as-live (although they may include edits to streamline the broadcast or resolve technical faults). Australian network television schedule is largely patterned from the U.S. format. In countries that span multiple time zones and are the most populous in their western or central regions, like Brazil, Russia and Indonesia, all television schedules nationwide are simultaneous with their broadcast sources, enabling full nationwide live telecasts regardless of time zones (although Russia conducts separate live primetime newscast versions for each range of time zones in that country). The continents of Europe and Africa, which both fall in the same range of time zones, are receptive to each other's live telecasts, while most of Asia from India eastwards, which includes China alongside the most populous time zone in the world, also receive simultaneous live telecasts within those cluster of regions. International tape delays of live global events, intended by major television networks, dominated world television until the early 2010s. For example, during the Sydney Olympics in 2000 and the Beijing Olympics in 2008, daytime events were occurring at early morning hours in the Americas, Africa, and Europe but were aired in the afternoon and evening hours live entirely in Asia, Australia, and Oceania. That made some broadcasters show high-profile events twice (live and then rebroadcast during prime time), but others withheld the same event to be broadcast solely during prime time. Often, tape-delaying of those events would mean editing them down for time considerations, highlighting what the broadcaster feels are the most interesting portions of the event, or advertising, resulting to reduced desired TV coverage for the given multiple sporting events. However, since many live events became available via social media in the late 2000s, tape delays have become increasingly irrelevant because of live television's resurgence as a broadcast format. Since the mid-2010s, several high-profile entertainment programs with huge live global audiences like the Academy Awards, Primetime Emmy Awards and Grammy Awards, yearly specials like the Miss Universe and Miss World pageants, and major sporting events like the Olympic Games, FIFA World Cup and the National Football League's Super Bowl, air to totality live on both television and the internet virtually all across the world's time zones in and out of their countries of origin, with mandated prime time rebroadcasts (featuring edits as desired by broadcasters) for regions that previously and solely relied on delayed telecasts on prime time among these otherwise live events. History[edit] The radio station WKAP in Allentown, Pennsylvania, introduced a tape delay system consisting of an external playback head, which was spaced far enough away from the record head to produce a six-second delay.[1] A system of rollers guided the tape over the playback head before it wound up on the take up reel. This system was introduced in 1952, when WKAP started a talk show called Open Mic. It is believed that this was the first time a telephone call-in show was broadcast with the telephone conversation "live" on the air. The FCC rules at the time prohibited the broadcasting of a live telephone conversation. However, there was no rule prohibiting a taped playback of a telephone call, provided that a "beep" tone was heard by the caller every 15 seconds so that the caller knew he was being recorded. The six-second delay constituted a "taped" telephone conversation, thus complying with FCC regulations, that being a legal fiction. The broadcast profanity delay was invented by C. Frank Cordaro (July 13, 1919 – February 20, 1997), who was Chief Engineer of WKAP during the 1950s and early 1960s. Ogden Davies, then-General Manager of WKAP, assigned Cordaro the task of developing a device whereby profanity during a "live" conversation could be deleted by the radio talk show host before it was broadcast. This new device was to be used on the Open Mic radio talk show. The device Cordaro developed was the first tape delay system. WKAP was one of several stations owned by the Rahal brothers of West Virginia (later Rahal Communications). First tested and used at WKAP, this tape system for broadcast profanity delay was then installed at the other Rahal-owned radio stations. From the Rahal brothers' stations, the broadcast profanity delay went into common usage throughout the US.[citation needed] John Nebel, who began a pioneering radio talk show in New York City in 1954, was one of the early users of a tape delay system that was invented by his engineer, Russell Tinklepaugh.[2] Another announcer who was said to use a tape-delay was talk show pioneer Jerry Williams at WMEX in Boston in the late 1950s. Computerized delay[edit] Eventide BD600 Broadcast Delay In 1977, the capacity of RAM (random-access memory) had reached 16 kilobits per chip, enough to think about using computerized digital audio means to create a sufficient delay for content deletion. By storing audio digitally, it was possible to move a "virtual tape head" along recorded audio. Eventide, Inc. created the first digital broadcast delay for this purpose. The device (known colloquially as a "dump box") had a large "DUMP"/"DELAY DUMP" button that would bring the delay to zero, thus removing unwanted segments. In addition to this convenience, it would also "rebuild" the delay time by unnoticeably lengthening the normal pauses in spoken material. Thus, a minute or so later, the broadcaster would again have full delay, often leaving the listener unaware that material had been deleted. In modern systems, a profanity delay can be a software module manually operated by a broadcast technician that puts a short delay (usually, 30 seconds) into the broadcast of live content. This gives the broadcaster time to censor the audio (and video) feed. This can be accomplished by cutting directly to a non-delayed feed, essentially jumping past the undesired moment (something that can be quite jarring to a viewer or listener). In other cases, dedicated hardware units similar to the original digital unit but with improved quality and editing capability can be used. These products can even "build up" delay with difficult program material such as music. Alternatively, a bleep noise or other substitute sound can be inserted. This is more difficult to do with live content, however, and more often appears on recorded material. See also[edit] References[edit] 1. ^ Elly, Wally (2006-09-20). "In local radio, change is common - with one exception". The Morning Call. Retrieved 2016-08-16. 2. ^ Tom Tiede. "Talk-Jockey Jimmy Hits the Air". Portsmouth (NH) Times, March 4, 1977, p. 4. External links[edit]
{ "url": "https://www.technetiumha383.xyz/", "source_domain": "www.technetiumha383.xyz", "snapshot_id": "crawl=CC-MAIN-2021-25", "warc_metadata": { "Content-Length": "71307", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:4AKMOR5B5VZ2A3OYX2FFEQNDZRLOPKAL", "WARC-Concurrent-To": "<urn:uuid:76d8a08e-a6b1-4a7b-a2c9-0852d195bbba>", "WARC-Date": "2021-06-12T18:53:24Z", "WARC-IP-Address": "94.130.24.246", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:AXK7LNLIVXXELYA7TQS5WC5UAOHXVUNW", "WARC-Record-ID": "<urn:uuid:f18ce1cc-00bf-4723-a07e-816367a80829>", "WARC-Target-URI": "https://www.technetiumha383.xyz/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:0e4bb081-de30-453e-a570-61de95c3297d>" }, "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-243.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, 16, 17, 55, 94, 128, 196, 197, 791, 792, 804, 805, 1493, 1494, 2027, 2028, 3012, 3013, 3737, 3738, 4603, 4604, 5480, 5481, 5495, 5496, 6436, 6437, 7308, 7309, 7620, 7621, 7646, 7647, 7678, 7679, 8482, 8483, 9320, 9321, 9336, 9337, 9354, 9355, 9485, 9581, 9582 ], "line_end_idx": [ 16, 17, 55, 94, 128, 196, 197, 791, 792, 804, 805, 1493, 1494, 2027, 2028, 3012, 3013, 3737, 3738, 4603, 4604, 5480, 5481, 5495, 5496, 6436, 6437, 7308, 7309, 7620, 7621, 7646, 7647, 7678, 7679, 8482, 8483, 9320, 9321, 9336, 9337, 9354, 9355, 9485, 9581, 9582, 9602 ] }
{ "red_pajama_v2": { "ccnet_original_length": 9602, "ccnet_original_nlines": 46, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 1, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.36303991079330444, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.014762169681489468, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.16019682586193085, "rps_doc_frac_unique_words": 0.404199481010437, "rps_doc_mean_word_length": 5.093832015991211, "rps_doc_num_sentences": 68, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.6712236404418945, "rps_doc_word_count": 1524, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.02421743981540203, "rps_doc_frac_chars_dupe_6grams": 0.01880715973675251, "rps_doc_frac_chars_dupe_7grams": 0.01880715973675251, "rps_doc_frac_chars_dupe_8grams": 0.01004766020923853, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.009274760261178017, "rps_doc_frac_chars_top_3gram": 0.003478039987385273, "rps_doc_frac_chars_top_4gram": 0.0033492199145257473, "rps_doc_books_importance": -768.601806640625, "rps_doc_books_importance_length_correction": -768.601806640625, "rps_doc_openwebtext_importance": -439.3028869628906, "rps_doc_openwebtext_importance_length_correction": -439.3028869628906, "rps_doc_wikipedia_importance": -268.372802734375, "rps_doc_wikipedia_importance_length_correction": -268.372802734375 }, "fasttext": { "dclm": 0.704207718372345, "english": 0.9620252251625061, "fineweb_edu_approx": 2.7412121295928955, "eai_general_math": 0.16057616472244263, "eai_open_web_math": 0.22755932807922363, "eai_web_code": 0.05177164077758789 } }
{ "free_decimal_correspondence": { "primary": { "code": "004.0285", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "384.4", "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": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
-8,145,917,525,335,677,000
Helping people with computers... one answer at a time. Putting files on your desktop isn't a good idea in general. While it can cause a few technical problems, there are certainly more efficient ways to organize your computer. Recently, I was told that the desktop is great for some things and storing videos isn't one of them. "It can mess things up" is the reason I was given. I've stored videos less than 32 MB and then eventually put a folder to collect those. The folder is now up to 3.8 GB. This isn't a shortcut, but an actual file. I can't say I've noticed any real issues - yet, but why wait? Please, I'm curious: is this true or false? In this excerpt from Answercast #79, I look at some of the ramifications of storing large files (or any files) on your desktop. Putting files on your desktop Ultimately, the bottom line is false. But before we go running down that path... it's a slightly slippery one. What we have to differentiate between are technical issues, which are actually very few, and personal issues which are probably more prevalent. A clean computer desktop My preference is to keep an incredibly clean desktop. My thinking is that the desktop is usually hidden and what I want to access is typically more quickly accessed if I put it on a menu or a sub-menu in the Start menu. So, I actually am an advocate for very clean desktop. I typically have only two icons on the desktop and I rarely even use those. The alternate, of course, is that lots of people have these incredibly cluttered desktops with all sorts of things on them. And you know what? Ultimately, that's OK. It doesn't really cause a technical problem per se. What it does do of course is it makes things difficult to find, at least in my experience - and it does actually cause things to get backed up or affected in ways that you're not really expecting. But again it's usually very, very benign. Desktop is a folder Ultimately, the thing that most people don't realize is that the desktop is really nothing more than a folder itself. It's a folder that has this unique property that whatever you put in the folder displays on the screen. So, if you drop a shortcut on your desktop, then that shortcut is going to show up on your screen. By "dropping it on your desktop," I mean you drop it in the desktop folder if you find it with Windows Explorer. Having lots of files on the desktop? Like I said... it's personal preference. I find it very cluttered; I find it difficult to use. But the number of files, the types of files, the sizes of files doesn't really matter. Organizing your computer The way that things were more or less intended to work is the you would put things (like your documents) in a folder called My Documents. You'd put your videos in a folder called My Videos perhaps within My Documents (and that's obviously not being displayed on your screen, on your desktop.) You could put shortcuts on your desktop - which are very small files that act as references to the files located elsewhere on your machine. That also keeps the desktop itself fairly lightweight and displaying more quickly. But ultimately it's really a matter of personal preference. Cluttered desktops may be slow The only technical thing that I think of, for people who have a lot of things on their desktop, is literally the amount of time it takes to display the desktop and display all those icons. In the worst-case scenario, the operating system has to go through and read every single file that has an icon on the desktop to determine what the icon should be. If you've got lots and lots of icons, lots and lots of things on your desktop, that can take some time. But ultimately, the short answer is no, it shouldn't be an issue. It's a matter of personal preference. It's not the way that I would do it - but it's up to you. (Transcript lightly edited for readability.) Article C6141 - December 16, 2012 « » Share this article with your friends: Share this article on Facebook Tweet this article Email a link to this article Leo Leo A. Notenboom has been playing with computers since he was required to take a programming class in 1976. An 18 year career as a programmer at Microsoft soon followed. After "retiring" in 2001, Leo started Ask Leo! in 2003 as a place for answers to common computer and technical questions. More about Leo. Not what you needed? 12 Comments Charles December 17, 2012 3:07 AM One thing that could possibly cause a slow down is having a lot of large image files (jpgs, gifs, etc.) on the desktop and having Explorer set to view them as thumbnails instead of icons. I know this causes XP to slow to a crawl, and I assume 7 and 8 would be similar. Bob December 17, 2012 8:40 AM The only thing I can think of, is going back to a time when user data was stored within the 'windows' directories. Sinse the OS continually scanned these places, there would be a notable decrease in performance as it had to process more and more data (hense the recommendation at the time to move the user data to a seperate drive letter). I have no idea if this still rings true. I keep my personal data on removeable storage for other reasons. John December 18, 2012 9:53 AM I also like my desktop clean, but there is one situation when I keep files 'on' the desktop - making presentations. I typically prepare more PowerPoint’s, spreadsheets, .jpg's and videos ready than I will use in a presentation, put them on the desktop. I can then dynamically adjust as needed. Audiences seem to tolerate launching files from the desktop during a presentation, but chafe at seeing them launched from Explorer, or worse, searched for while they wait. Dan December 18, 2012 11:34 AM At work, I keep all my current project files on my desktop. I have a two monitor system, and keep them all on my left monitor. When I finish project, then I collect all the files and put them away in my closed project file. Sometimes the file might only be a shortcut to the folder the application I am working on puts them. I used to have more on my desktop, but the quick launch toolbar and Pin to Start Menu got rid of that need. My display screens are so big it does seem a waste to not use territory it gives me. I have room for 798 icons on my desktop (not that I would ever do that) Mary Ann December 18, 2012 5:41 PM Do bookmarked sites or articles take up memory or cause the computer to slow down? I'm in the stone age with XP. snert December 18, 2012 7:21 PM I use my desktop as a file directory, of sorts. I can see what I need to use at a glance and access anything with a doubleclick. I have them sorted by jobs - video stuff top center, games down left, this 'n' that centered, malware guardians down right. Cluttered? No, not according to me. It's MY desktop and I'll decorate it as I damned well please. (You should see my physical desk) Each to their own. Steve Costello December 19, 2012 6:35 AM I have a lot of items saved to my desktop. But, since XP, I hide the desktop, and then use the desktop toolbar. I know it works the same through Windows 7, but have not used Windows 8, so I don't know if it works the same. Matthew Ball December 19, 2012 9:34 AM I thought desktop files would become part of your "Profile". And the larger your "Profile", the slower the computer would run...I have always just create folders on C (outside of my profile) and then created shortcuts to those folder. Mark J December 19, 2012 9:37 AM @Mary Ann Bookmarks and shortcuts take up just an insignificant amount of disk space. TheRube December 21, 2012 3:51 PM I have ABSOLUTELY nothing on the desktop. This is so I can admiringly look at my wonderful Background Theme! I store all of my Stuff in a temporary folder under My Documents; then I redistribute the stuff into other appropriate folders. I REALLY Hate a Messy Desktop!!! Thanks for Listening. TR Mitch MacKay December 23, 2012 4:52 AM I can't see the desktop for the icons. Being a writer I click most of them every day, shuttle those into My Documents when I'm done doing whatever if they're considered contemporary. If permanent headings such as Google Chrome, Windows Live Mail and the like they stay there. As said, it's my party and I'll sigh if I want to. Jan D December 25, 2012 4:50 AM Here is what I do. I prefer my desktop to keep current active projects located, be it word files that need to be finished, something I just downloaded that still needs to be installed or whatever until they can be "relegated" to their respective folders in my profile, e.g. Downloads and the like. On top of this, I located my SkyDrive folder to the same location as my Desktop folder, thereby assuring the most recent changes are immediately reflected online (given an Internet connection obviously). This might even outshine Leo's famous method of overnight backups (sorry Leo :->) since everything is duplicated in the blink of an eye (i.e. the things on my Desktop). And of course, having a lot of documents on your desktop can easily be taken care of by making extra desktop folders. Comments on this entry are closed. If you have a question, start by using the search box up at the top of the page - there's a very good chance that your question has already been answered on Ask Leo!. If you don't find your answer, head out to http://askleo.com/ask to ask your question.
{ "url": "http://ask-leo.com/are_there_problems_if_you_put_too_many_large_files_on_your_desktop.html", "source_domain": "ask-leo.com", "snapshot_id": "crawl=CC-MAIN-2017-47", "warc_metadata": { "Content-Length": "28643", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:ZBRQOVLAYPAZBVEUXBVGJSQDQVIFUB3D", "WARC-Concurrent-To": "<urn:uuid:7fd3dddf-6782-4597-be15-1a2c10619793>", "WARC-Date": "2017-11-22T13:22:33Z", "WARC-IP-Address": "67.225.161.116", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:IDIR336GJHIMU6M24MWIJ5KQ6OR2Q6EJ", "WARC-Record-ID": "<urn:uuid:35006fc1-89c1-4a8e-ae03-eced495a02e6>", "WARC-Target-URI": "http://ask-leo.com/are_there_problems_if_you_put_too_many_large_files_on_your_desktop.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:cd29264e-ea85-47d7-94a8-56cf1e7086a4>" }, "warc_info": "robots: classic\r\nhostname: ip-10-113-216-17.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-47\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for November 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }
{ "line_start_idx": [ 0, 55, 56, 228, 229, 648, 649, 777, 778, 808, 809, 920, 921, 1065, 1066, 1091, 1092, 1366, 1367, 1443, 1444, 1901, 1902, 1922, 1923, 2041, 2042, 2146, 2147, 2359, 2360, 2579, 2580, 2605, 2606, 2744, 2745, 2900, 2901, 3124, 3125, 3185, 3186, 3217, 3218, 3407, 3408, 3676, 3677, 3839, 3840, 3885, 3886, 3924, 3925, 3963, 3964, 4043, 4355, 4356, 4377, 4378, 4390, 4398, 4424, 4425, 4694, 4695, 4699, 4725, 4726, 5066, 5172, 5173, 5178, 5204, 5205, 5499, 5671, 5672, 5676, 5703, 5704, 6294, 6295, 6304, 6330, 6331, 6444, 6445, 6451, 6477, 6478, 6882, 6883, 6898, 6924, 6925, 6968, 6969, 7038, 7039, 7150, 7151, 7164, 7190, 7191, 7426, 7427, 7434, 7460, 7461, 7471, 7547, 7548, 7556, 7582, 7583, 7692, 7820, 7821, 7854, 7855, 7877, 7878, 7881, 7882, 7895, 7921, 7922, 8249, 8250, 8256, 8282, 8283, 9072, 9073, 9108, 9109, 9276, 9277 ], "line_end_idx": [ 55, 56, 228, 229, 648, 649, 777, 778, 808, 809, 920, 921, 1065, 1066, 1091, 1092, 1366, 1367, 1443, 1444, 1901, 1902, 1922, 1923, 2041, 2042, 2146, 2147, 2359, 2360, 2579, 2580, 2605, 2606, 2744, 2745, 2900, 2901, 3124, 3125, 3185, 3186, 3217, 3218, 3407, 3408, 3676, 3677, 3839, 3840, 3885, 3886, 3924, 3925, 3963, 3964, 4043, 4355, 4356, 4377, 4378, 4390, 4398, 4424, 4425, 4694, 4695, 4699, 4725, 4726, 5066, 5172, 5173, 5178, 5204, 5205, 5499, 5671, 5672, 5676, 5703, 5704, 6294, 6295, 6304, 6330, 6331, 6444, 6445, 6451, 6477, 6478, 6882, 6883, 6898, 6924, 6925, 6968, 6969, 7038, 7039, 7150, 7151, 7164, 7190, 7191, 7426, 7427, 7434, 7460, 7461, 7471, 7547, 7548, 7556, 7582, 7583, 7692, 7820, 7821, 7854, 7855, 7877, 7878, 7881, 7882, 7895, 7921, 7922, 8249, 8250, 8256, 8282, 8283, 9072, 9073, 9108, 9109, 9276, 9277, 9363 ] }
{ "red_pajama_v2": { "ccnet_original_length": 9363, "ccnet_original_nlines": 140, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4383561611175537, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.045009780675172806, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.17563600838184357, "rps_doc_frac_unique_words": 0.34515365958213806, "rps_doc_mean_word_length": 4.30555534362793, "rps_doc_num_sentences": 111, "rps_doc_symbol_to_word_ratio": 0.0024461799766868353, "rps_doc_unigram_entropy": 5.560317516326904, "rps_doc_word_count": 1692, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.023884689435362816, "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.023335620760917664, "rps_doc_frac_chars_top_3gram": 0.016060400754213333, "rps_doc_frac_chars_top_4gram": 0.007412489969283342, "rps_doc_books_importance": -950.8655395507812, "rps_doc_books_importance_length_correction": -950.8655395507812, "rps_doc_openwebtext_importance": -546.3037109375, "rps_doc_openwebtext_importance_length_correction": -546.3037109375, "rps_doc_wikipedia_importance": -427.01007080078125, "rps_doc_wikipedia_importance_length_correction": -427.01007080078125 }, "fasttext": { "dclm": 0.14051026105880737, "english": 0.9688449501991272, "fineweb_edu_approx": 1.520484447479248, "eai_general_math": 0.29279130697250366, "eai_open_web_math": 0.2130454182624817, "eai_web_code": 0.06521719694137573 } }
{ "free_decimal_correspondence": { "primary": { "code": "004.6", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "005.457", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "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": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
7,579,343,215,796,209,000
tag:blogger.com,1999:blog-20371078469630358462016-12-10T02:36:49.407-08:00Michal Budzynskicode blah blah...MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-7748750817547847482013-07-10T08:30:00.000-07:002013-09-25T04:25:26.170-07:00onGameStart strikes back!<a href="http://3.bp.blogspot.com/-P86Bn8A0Yr0/Ud1z2dPDJ2I/AAAAAAAAAXU/QfGffsOswd0/s1600/ogs-post.jpg" imageanchor="1" ><img border="0" src="http://3.bp.blogspot.com/-P86Bn8A0Yr0/Ud1z2dPDJ2I/AAAAAAAAAXU/QfGffsOswd0/s320/ogs-post.jpg" style="width:200px;float:left;margin: 10px;"/></a>It's already kind of tradition that September is HTML5 Gamedev month in Europe. Since 2011, when <a href="http://ongamestart.com/2011">first onGameStart</a> took place, we've hosted events for more than 900 game developers, designers as well as business and marketing teams. With more than 60 talks, 25 hours of workshops and 1200 liters of alcohol during the parties (so far), <a href="http://ongamestart.com">onGameStart</a> is the most important web gaming event in the world. This year (September 18-20) we will try to push it even further. We have just updated our website, and announced new speakers in our lineup. This year's edition is a unique opportunity to meet big names from the industry, like:<br/><ul><li><a href="http://ongamestart.com/#speakers-doob">Mrdoob</a> - creator of the most popular WebGL framework, <a href="https://github.com/mrdoob/three.js">THREEJS</a>.</li><li><a href="http://ongamestart.com/#speakers-collin">Collin Hover</a> - author of <a href="http://collinhover.github.io/kaiopua/">Kaiopua engine</a> and our last website (<a href="http://ongamestart.us/">onGameStartUS</a>). If you never heard of him - check his <a href="https://vimeo.com/65545063">talk from the last oGS</a>.</li><li><a href="http://ongamestart.com/#speakers-remi">Rémi Papillié</a> - from <a href="http://www.ubi.com">Ubisoft</a>, will teach us about console game dev tricks that could be useful in WebGL games</li><li><a href="http://ongamestart.com/#speakers-ivan">Ivan Popelyshev</a> - creator of <a href="http://bombermine.com/#/">Bombermine</a>, the game that was in <a href="http://www.netmagazine.com/features/top-10-html5-games-2012">Top10 of HTML5 games in 2012 on NetMag</a>. He will share his secrets about developing MMO game with canvas & Websockets</li><li><a href="http://ongamestart.com/#speakers-jasmine">Jasmine Kent</a> - formerly worked for Sega, author of <a href="http://triggerrally.com/">Trigger Rally</a>, a WebGL racing game</li><li><a href="http://ongamestart.com/#speakers-jan">Jan Krutisch</a> - will make some noise with Web Audio API (finally!)</li><li><a href="http://ongamestart.com/#speakers-yuri">Yuri Dobronravin</a> - will teach us how to run our HTML5 games with native-like performance on Windows Phone and Android, like he did with his <a href="http://www.windowsphone.com/en-us/store/app/cannons-and-soldiers/047c90f9-2958-4c0b-bcc4-7685fceb6563">Cannons & Soldiers</a></li><li><a href="http://ongamestart.com/#agenda-fullAgenda">and others, check our agenda</a></li></ul> Besides the conference, on the day before we organize fullday workshops in small groups (up to 10 persons). This year you'll be able to learn how to <a href="http://ongamestart.com/#agenda-playcanvasWorkshop">create a 3D game using PlayCanvas</a> (check <a href="http://ongamestart.com/#speakers-will">Will Eastcott</a>'s Playcanvas <a href="https://vimeo.com/53698798">presentation from last year</a> if you never heard of it before) and <a href="http://ongamestart.com/#agenda-playcanvasWorkshop">how to create game graphics</a> (and outstanding <a href="http://esotericsoftware.com/">skeletal animation with tool called Spine</a>!) if you have no artistic skills together with onGameStart veteran, <a href="http://ongamestart.com/#speakers-robert">Robert Podgórski</a>. <br/>If you still haven't decided if you want to attend, check videos from previous onGameStarts:<br/>2011:<br/><iframe src="http://player.vimeo.com/video/29885788?title=0&amp;byline=0&amp;portrait=0&amp;color=ffffff" width="500" height="281" frameborder="0" webkitAllowFullScreen mozallowfullscreen allowFullScreen></iframe><br/>2012:<br/><iframe src="http://player.vimeo.com/video/51584343" width="500" height="281" frameborder="0" webkitAllowFullScreen mozallowfullscreen allowFullScreen></iframe><br/>And all the talks in here: <a href="https://vimeo.com/channels/ogs">2011</a>, <a href="https://vimeo.com/ongamestart">2012+oGSUS</a>.<br/><br/>For more details visit our <a href="http://onGameStart.com">site</a>, <a href="https://www.facebook.com/onGameStart">Facebook</a>, <a href="https://twitter.com/ongamestart">Twiter</a> and <a href="http://lanyrd.com/2013/ogs13/">Lanyrd</a>. See you there!MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-48075162447816549342013-04-07T18:59:00.000-07:002013-04-07T21:48:10.497-07:00JavaScript: The less known parts. DOM Mutations.'<i>JavaScript: The less known parts</i>' chapters:<br/>1. <a href="http://michalbe.blogspot.com/2013/03/javascript-less-known-parts-bitwise.html">Bitwise Operators</a><br/>2. <a href="http://michalbe.blogspot.com/2013/03/javascript-less-known-parts-storage.html">Storage</a><br/>3. <a href="http://michalbe.blogspot.com/2013/04/javascript-less-known-parts-dom.html">Dom Mutations</a></br><br/> <a href="http://3.bp.blogspot.com/-qGVX-BlXz3U/UWIYOpjl0aI/AAAAAAAAAV8/av5sLNQmjvg/s1600/tmo2.jpg" imageanchor="1" ><img border="0" src="http://3.bp.blogspot.com/-qGVX-BlXz3U/UWIYOpjl0aI/AAAAAAAAAV8/av5sLNQmjvg/s1600/tmo2.jpg" style="float:left;width:300px;margin-right:10px;"/></a>At the beginning of last May, so not even a year ago, there was quite a buzz around a blogpost by <a href="https://twitter.com/davidwalshblog">David Walsh</a> about detecting DOM Node insertions with JavaScript and CSS Animations. In the article, David explained that even if <a href="https://developer.mozilla.org/en-US/docs/DOM/Mutation_events">Mutation Events</a> are deprecated, we are not powerless in detecting DOM modifications in our JavaScript code - using simple hack (and since we are web developers, we love hacks and we use tons of them every day), we can attach very short (0.001s in the given example) animation to every element that will be added to to DOM Tree, and then listen to the <i>animationstart</i> event. The animation will be to short to notice it, so the event will fire almost immediately after DOM modification. Full post is still online, you can find it in here - <a href="http://davidwalsh.name/detect-node-insertion">Detect DOM Node Insertions with JavaScript and CSS Animations</a>. Great, but is it the only way to detect node changes in JavaScript? Fortunately - it's not. Say hello to the <a href="https://developer.mozilla.org/en-US/docs/DOM/MutationObserver">MutationObserver</a>.<br/><br/>About three days after David's article, <a href="http://canuckistani.ca/">Jeff Griffiths</a> presented MutationObserver on <a href="https://hacks.mozilla.org">MozHacks</a> in an article called <a href="https://hacks.mozilla.org/2012/05/dom-mutationobserver-reacting-to-dom-changes-without-killing-browser-performance/">DOM MutationObserver – reacting to DOM changes without killing browser performance</a>. In just a few words, <i>MutationObserver provides developers a way to react to changes in a DOM. It is designed as a replacement for Mutation Events defined in the DOM3 Events specification.</i> It's way simpler and more efficient to use native browser's API than hundreds of hacks - we are creating more dynamic webapps all the time, so <i>it seems natural that we would welcome the ability to listen for changes in the DOM and react to them.</i> <br/><br/>Below, I've reimplemented the demo from David's blogpost from CSS Animations to MutationObserver. You can find the original example here: <a href="http://davidwalsh.name/demo/detect-node-insertion.php">Detect code insertion</a>. <iframe width="100%" height="520" src="http://jsfiddle.net/michalbe/bNCS9/embedded/" allowfullscreen="allowfullscreen" frameborder="0"></iframe><br/><br/>Unfortunately, MutationObserver is still a fresh feature, and it isn't supported everywhere - we can use it in only in Chrome (Desktop) & Firefox (Desktop & Android) so far: <a href="http://3.bp.blogspot.com/-690Hhcyvpto/UWIih8EzewI/AAAAAAAAAWM/gV45Vxtfzbo/s1600/Screen+Shot+2013-04-08+at+03.50.34.png" imageanchor="1" ><img border="0" src="http://3.bp.blogspot.com/-690Hhcyvpto/UWIih8EzewI/AAAAAAAAAWM/gV45Vxtfzbo/s1600/Screen+Shot+2013-04-08+at+03.50.34.png" /></a><a href="http://4.bp.blogspot.com/-S_gob8Sa98M/UWIih2VDHHI/AAAAAAAAAWQ/QYiI0sBT0r4/s1600/Screen+Shot+2013-04-08+at+03.50.41.png" imageanchor="1" ><img border="0" src="http://4.bp.blogspot.com/-S_gob8Sa98M/UWIih2VDHHI/AAAAAAAAAWQ/QYiI0sBT0r4/s1600/Screen+Shot+2013-04-08+at+03.50.41.png" /></a><br/><h4>MutationObserver resources</h4>DOM Mutation Observers & The Mutation Summary Library <iframe width="570" height="405" src="http://www.youtube.com/embed/eRZ4pO0gVWw" frameborder="0" allowfullscreen></iframe><br/><a href="http://code.google.com/p/mutation-summary/">Mutation Summary</a><br/><a href="https://developer.mozilla.org/en-US/docs/DOM/MutationObserver">MutationObserver on MDN</a><br/><a href="https://dvcs.w3.org/hg/domcore/raw-file/tip/Overview.html#mutation-observers">MutationObserver DOM4 Spec</a><br/><a href="http://updates.html5rocks.com/2012/02/Detect-DOM-changes-with-Mutation-Observers">Detect DOM changes with Mutation Observers - HTML5Rocks</a><br/><a href="https://hacks.mozilla.org/2012/05/dom-mutationobserver-reacting-to-dom-changes-without-killing-browser-performance/">DOM MutationObserver – reacting to DOM changes without killing browser performance.</a><br/><br/>Do you find this kind of API useful? Do you know any other hacks related to DOM manipulation listeners? Comment here or catch me on <a href="https://twitter.com/michalbe">Twitter (@michalbe)</a>.MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-30960360008982742612013-03-31T16:44:00.000-07:002013-04-07T19:00:17.086-07:00JavaScript: The less known parts. Storage.'<i>JavaScript: The less known parts</i>' chapters:<br/>1. <a href="http://michalbe.blogspot.com/2013/03/javascript-less-known-parts-bitwise.html">Bitwise Operators</a><br/>2. <a href="http://michalbe.blogspot.com/2013/03/javascript-less-known-parts-storage.html">Storage</a><br/>3. <a href="http://michalbe.blogspot.com/2013/04/javascript-less-known-parts-dom.html">Dom Mutations</a></br><br/> Client side storage is almost as old as Internet itself. Back in the days we used cookies for this, but since Firefox 2 & Safari 4 browsers support DOM Storage techniques. We are probably all familiar with <a href="https://developer.mozilla.org/en-US/docs/IndexedDB">IndexedDB</a> or deprecated <a href="http://html5doctor.com/introducing-web-sql-databases/">WebSQL</a>. Both of them are widely supported in almost all of the newest browsers:<br/><a href="http://3.bp.blogspot.com/-GovhqJ3BqMw/UU-1LrRpS9I/AAAAAAAAAVI/UIgrLSoHLlg/s1600/Screen+Shot+2013-03-25+at+03.21.49.png" imageanchor="1" ><img border="0" src="http://3.bp.blogspot.com/-GovhqJ3BqMw/UU-1LrRpS9I/AAAAAAAAAVI/UIgrLSoHLlg/s320/Screen+Shot+2013-03-25+at+03.21.49.png" /></a><br/><a href="http://3.bp.blogspot.com/-umo8z3PGMEI/UU-1hof12KI/AAAAAAAAAVQ/GGmKpkbUvQ0/s1600/Screen+Shot+2013-03-25+at+03.21.37.png" imageanchor="1" ><img border="0" src="http://3.bp.blogspot.com/-umo8z3PGMEI/UU-1hof12KI/AAAAAAAAAVQ/GGmKpkbUvQ0/s320/Screen+Shot+2013-03-25+at+03.21.37.png" /></a><br/><h4> localStorage </h4>Thats not all - we also have well known localStorage & sessionStorage key/value client storage system. We can simply save the value in one window: <iframe width="100%" height="300" src="http://jsfiddle.net/michalbe/Xwnyg/embedded/" allowfullscreen="allowfullscreen" frameborder="0"></iframe><br/>And load it in another: <iframe width="100%" height="300" src="http://jsfiddle.net/michalbe/j8PYX/embedded/" allowfullscreen="allowfullscreen" frameborder="0"></iframe><br/><br/>The advantage of local/session storage over IndexedDB is that we can listen to an event that fires when something has changed - we can for instance propagate those changes to all the browser cards or iframes in our application. Choose the 'result' tab in the next fiddle, go back to the first one and save something using the form. <iframe width="100%" height="300" src="http://jsfiddle.net/michalbe/YETSK/embedded/" allowfullscreen="allowfullscreen" frameborder="0"></iframe><br/>It's helpful also in IndexedDB based apps - for example <a href="http://pouchdb.com/">PouchDB</a> made by <a href="https://twitter.com/daleharvey/">Dale Harvey</a> use localStorage events with IndexedDB data to keep everything up to date everywhere. <br/><br/><h4> window.name storage </h4>We can also use <i>window.name</i> property to store data on the client side. This ancient method allows us to read and write data across pages and domains, even from outside the current origin. According to Wikipedia [<a href="http://en.wikipedia.org/wiki/HTTP_cookie#window.name">HTTP COOKIE</a>] we can store up to 32MB there (according to <a href="http://my.safaribooksonline.com/book/programming/javascript/9780470344729/client-side-data-and-persistence/storage_using_window.name">some sources</a> its even around 60MB). It's also accessible even before <i>domready</i> event. And even if it's not really cleaver idea in times of tabbed browsing (every new tab starts with empty <i>window.name</i>), it's still used as a fallback in for older browsers. More on <i>window.name</i> storage:<br/><a href="http://ajaxian.com/archives/whats-in-a-windowname">Ajaxian: What’s in a window.name?</a><br/><a href="http://www.sitepoint.com/cookieless-javascript-session-variables/">Cookie-less Session Variables in JavaScript</a><br/><a href="http://www.thomasfrank.se/sessionvars.html">Session variables without cookies</a><br/><a href="http://code.google.com/p/sessionstorage/">HTML5 sessionStorage for "every" browsers</a><br/><br/>See you next Monday in the 3rd part of <i>Javascript: The less known parts</i>. <a href="https://twitter.com/michalbe">Follow me on Twitter</a> and stay informed about next parts! MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-73017012438474692962013-03-27T18:11:00.003-07:002013-03-27T18:11:59.349-07:00My TV Shows listI've updated the list of all the TV Shows I've watched since February 2008. So far it's 48 shows, 3295 episodes in total, what gives 1854 hours and 12 minutes (around 77 full days and nights). If you know anything I should watch, and it's not on a list (or 'Shows to consider' list), please fork my repo and update my proposals. You can also vote for other series in the 'proposals' part. <br/><br/>Github repo: <a href="https://github.com/michalbe/tv-series">michalbe/tv-series</a><br/>Rendered list: <a href="http://michalbe.github.com/tv-series/">gh-pages/tv-series</a><br/><a href="http://1.bp.blogspot.com/-QjW-iP7c3mc/UVOYkJgkzvI/AAAAAAAAAVg/8STAI8IIzvI/s1600/logotyo.png" imageanchor="1" ><img border="0" src="http://1.bp.blogspot.com/-QjW-iP7c3mc/UVOYkJgkzvI/AAAAAAAAAVg/8STAI8IIzvI/s320/logotyo.png" /></a>MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-59574267809341962972013-03-24T04:05:00.000-07:002013-04-07T19:00:09.043-07:00JavaScript: The less known parts. Bitwise Operators.'<i>JavaScript: The less known parts</i>' chapters:<br/>1. <a href="http://michalbe.blogspot.com/2013/03/javascript-less-known-parts-bitwise.html">Bitwise Operators</a><br/>2. <a href="http://michalbe.blogspot.com/2013/03/javascript-less-known-parts-storage.html">Storage</a><br/>3. <a href="http://michalbe.blogspot.com/2013/04/javascript-less-known-parts-dom.html">Dom Mutations</a></br><br/> <a href="http://images.virtualdesign.pl/images/7777js-tlkp.jpg" imageanchor="1" ><img border="0" src="http://images.virtualdesign.pl/images/7777js-tlkp.jpg" style="float:left;margin-right:10px;margin-bottom: 5px;margin-top:5px;width:250px;border:1px solid #000;"/></a>Most of us probably use JavaScript every day - in my case it's building a <a href="http://www.mozilla.org/firefoxos/">mobile operating system</a> in my daily job, preparing <a href="https://twitter.com/DanPTurner/status/274025385128259587">crazy and ridiculous demos</a> for various conferences or run personal projects in my free time (mostly <a href="https://twitter.com/sex2poule/status/291823186876715009/photo/1">games</a>). But even with years of experience (probably because the language itself is full of weird quirks and unintuitive patterns), from time to time I'm still getting surprised with new crazy hacks, techniques or workarounds. I want to put most of those things in one place and publish one every Monday - for last couple of years I wasn't really active on the blog, it's time to change this. First - bitwise hacking.<br/><br/> <h2 style="clear:both;"><br/>Bitwise operators</h2> Most of us know know that there are some bitwise operators in JS. Every number has it's own binary representation, used by those operators. To check dec number's binary value, we use <i>.toString()</i> method with base argument - '2' for binary:<br/><iframe style="width: 100%; height: 200px" src="http://jsfiddle.net/michalbe/L56k3/embedded/" allowfullscreen="allowfullscreen" frameborder="0"></iframe> <br/><br/>There are seven different bitwise operators. Assuming that variable <i>a</i> is equal to 5, and <i>b</i> is 13, those are actions and results of their operations:<br/><iframe style="width: 100%; height: 730px" src="http://jsfiddle.net/michalbe/ZQXA9/embedded/" allowfullscreen="allowfullscreen" frameborder="0"></iframe> <br/><br/>Sometime we even use <i>Bitwise OR </i>as equivalent of <i>Math.floor()</i>:<br/><iframe style="width: 100%; height: 125px" src="http://jsfiddle.net/michalbe/dDUGh/1/embedded/" allowfullscreen="allowfullscreen" frameborder="0"></iframe> <br/><br/>It has the same effect as double NOT operator (my favorite rounding solution since I first heard about it on <a href="http://varjs.com/">Damian Wielgosik's workshop</a> couple of years ago).<br/><iframe style="width: 100%; height: 120px" src="http://jsfiddle.net/michalbe/XK6xN/embedded/" allowfullscreen="allowfullscreen" frameborder="0"></iframe> <br/><br/>What about other real life examples of bit chaking? For instance, we can convert colors from RGA to Hex format:<br/><iframe width="100%" height="300" src="http://jsfiddle.net/michalbe/pEpeM/embedded/" allowfullscreen="allowfullscreen" frameborder="0"></iframe> <br/><br/>We can also simply check which number in a pair is smaller (like Math.min) or bigger (Math.max):<br/><iframe style="width: 100%; height: 300px" src="http://jsfiddle.net/michalbe/t9Nfm/1/embedded/" allowfullscreen="allowfullscreen" frameborder="0"></iframe> <br/><br/>Of course since Math library is really well optimized nowadays, using those hacks doesn't make any sense. But what about variables swap? Most common solution is to create a temporary variable to achieve that, what is not really efficient. It's simpler to use bit operations here:<br/><iframe width="100%" height="300" src="http://jsfiddle.net/michalbe/Xuv69/embedded/" allowfullscreen="allowfullscreen" frameborder="0"></iframe> <br/><br/>Even with 'Pythonish' variable swap introduced in JavaScript 1.7, bitwise solution is the fastest way to achieve that. <br/>JSPerf test [<a href="http://jsperf.com/binswapwars">here</a>]:<br/><a href="http://1.bp.blogspot.com/-Z5pwlg5XDeM/UQXQ43DO6JI/AAAAAAAAAUk/cGj9Exf2A1Q/s1600/swap.jpg" imageanchor="1"><img border="0" width="430" src="http://1.bp.blogspot.com/-Z5pwlg5XDeM/UQXQ43DO6JI/AAAAAAAAAUk/cGj9Exf2A1Q/s320/swap.jpg" /></a> <br/><br/>Great place to learn more bit-tricks to make your JS app: <a href="http://graphics.stanford.edu/~seander/bithacks.html">Sean Eron Anderson's site [Stanford PhD].</a><br/>Do you know and use any more binary tricks in your JavaScript projects? MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-86453147430574387232012-12-05T05:13:00.003-08:002012-12-05T05:14:43.673-08:00onGameStart US, March 2013Since world is just too big for only one HTML5 gaming conference, <a href="http://ongamestart.us">onGameStart comes to North America on March 15 next year</a>. Together with <a href="http://collinhover.com/">Collin Hover</a>, WebGL Wizard and creator of <a href="https://github.com/collinhover/kaiopua">kaiopua game engine</a> and outstanding <a href="http://blackmoondev.com/">BlackMoonDesign</a>, (yes, they are doing also 3D stuff, not only pixelart!) we launched the site last week. Control the astronaut, meet the speakers and explore onGameStart planet & stars. <a href="https://docs.google.com/spreadsheet/viewform?formkey=dEMwZHQtcXp6Mjh0MGhoRnRKTzF3SUE6MQ">Don't forget about our Call for Paper</a> - show us your games, engines, tools or game related services and present them on oGS in New York!<br/><a href="http://onGameStart.us"><img border="0" width="430" width="663" src="http://images.virtualdesign.pl/images/80180ScreenShot2012-12-03at14.02.39.png" /></a>MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-71206506135599867272012-09-24T08:40:00.001-07:002013-03-24T07:30:41.229-07:00Report from the battlefield - onGameStart 2012<div class="separator" style="clear: both; text-align: center;"><a href="http://images.virtualdesign.pl/images/1589aid.png" imageanchor="1" style="clear:right; float:right; margin-left:1em;"><img border="0" src="http://images.virtualdesign.pl/images/1589aid.png" style="width:148px"/></a></div> onGameStart 2012, the second version of the first HTML5 gaming conference ever, is over now. Since last year I completely changed its formula, and even if I was frightened as hell just before the event, it turned out to be wonderful (or most of the attendees were perfect liars who didn't want to hurt my feelings, but I'm quite OK with this:) ). <br/>First of all - I limited number of the attendees to 250 (instead of almost 350 last year). Why? HTML5 Gaming is quite a new movement. Even if it's growing fast, it's still not as popular as, for example, jQuery or Node.js communities. And inviting less attendees definitely helps in meeting interesting people - onGameStart is not a mass event - it's more like a meeting of our elite HTMl5 Gaming caste. Connecting them together (also with sponsors & publishers, not only other developers & designers) is one of the main onGameStart's tasks. Also - according to <a href="http://www.nonblocking.io/2011/10/jsconf-eu-how-to-guide.html">Malte Ubl, organizer of JSConfEU</a>: <blockquote>more people requires executing everything with great precision which is super unlikely for amateurs like us (Professionals can’t do this either, but they don’t care because lots of attendees means lots of money).</blockquote><br/><img border="0" width="430" src="https://fbcdn-sphotos-g-a.akamaihd.net/hphotos-ak-snc6/282262_383833605019031_1874106709_n.jpg" /><br/>Also - onGameStart this year has additional, third, day at the beginning, <a href="https://www.facebook.com/photo.php?fbid=383833605019031&set=a.383832938352431.86765.139639056105155&type=1&theater">just for the workshops</a>. During the three tracks, groups up to 15 people learned how to make 2d platformer game, 3D game using your jQuery skills, or multiplayer pong game in SVG with your Flash resources. I had fantastic feedback from both, attendees and trainers, so I'll probably organize workshops again during next editions. <br/> During this year's <a href="http://front-trends.com">Front Trends</a> Paweł Czerski, one of the organizers, adviced me to shorten speech slot from 45 to 30 minutes. It's enough to inspire the audience with something new. And if the speaker is not good enough to do it, additional 15 minutes won't probably change it. For sure, I will use the same pattern again.<br/>The main keynote this year was prepared by <a href="http://jordanmechner.com">Jordan Mechner</a>, creator of 'Karateka', 'Prince of Persia' or 'The Last Express'. He is not HTML5 game developer. Actually, he has nothing in common with browser games or development at all - his last game was published more than 15 years ago. But he is an icon in the gamedev world, and has indisputable influence on video games. The story Jordan presented was great summary of a journey of a game developer (as he called it - 'From Bedroom to Attic'), and definitely it was best closing talk of a gaming conference I could imagine. I'll do my best to invite other gamedev stars for next editions.<br/><img border="0" width="430" src="http://farm9.staticflickr.com/8453/8007228782_410dc40d65.jpg" /><br/>During my opening talk I appealed to the HTML5 gaming community to stop doing tech demos and try to prove that it's mature enough to create real games. We need games, not demos, so stop doing it and focus on real games. The second big thing I announced <b>was American edition of onGameStart</b> - <a href="http://www.ongamestart.us/">onGameStartUS</a>. It will take place in New York early next year (probably 22nd of March). <a href="https://docs.google.com/spreadsheet/viewform?formkey=dG94UXdDS2ZBVjRrWnlMUUZMWU96M1E6MQ">PreRegister here</a> for the news. And track <a href="http://lanyrd.com/2013/ogsus/">the event on Lanyrd</a>. After the announcement I read a lot of tweets or personal questions about European onGameStart. So to dispel all the doubts - there will be more than one onGameStart next year - one in NY, main edition in Warsaw, and probably one more, but I will announce it later. As I said during my talk - world is too big for just one HTML5 gaming conf (actually I wrote and said that it's 'too small', but It's mostly because I didn't really sleep for about a week). So see you next year in NY, WAW, or any other place I'll bring onGameStart to. Thanks!<br/><img border="0" width="430" src="http://distilleryimage11.s3.amazonaws.com/0bc7d61a02fb11e2984522000a1e9e63_7.jpg" /> MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-17166648324595218102012-05-24T08:41:00.000-07:002012-06-09T07:52:11.078-07:00.getUserMedia puzzle gameDuring my last talks about <a href="http://bly.sk">Blysk</a> I presented couple of new HTML5 features that are quite new, and were implemented only in Flash before. Access to the webcam was one of the most interesting.<br/>VideoPuzzle on <a href="http://webrebels.org/">WebRebels</a>:<br/><a href="http://www.flickr.com/photos/webrebels/7280907460/" title="Michal Budzynski at Web Rebels by webrebels, on Flickr"><img src="http://farm9.staticflickr.com/8146/7280907460_ae6da5359f.jpg" width="430" height="333" alt="Michal Budzynski at Web Rebels"></a>And since learning by playing is always fun, I made a simple puzzle game that uses webcam to display realtime video on the puzzles. To run it you need <a href="https://tools.google.com/dlpage/chromesxs">Chrome Canary</a> with <a href="https://sites.google.com/site/webrtc/running-the-demos">Media Stream enabled</a>.<br/>I was asked to publish it somewhere so you can find the source code on Github: <br/><br/><b><a href="http://github.com/michalbe/VideoPuzzle">.getUserMedia() VideoPuzzle game</a></b><br/> or <a href="http://michalbe.github.com/VideoPuzzle/">try it now here</a><br/><br/><img src="http://images.virtualdesign.pl/images/584594.0M-pixels-sphere-web-camera-with-microphone.jpg" style="width:150px;float:right;margin:5px"/><b>Why doesn't it work in <a href="http://dev.opera.com/articles/view/getusermedia-access-camera-privacy-ui/">Opera with .getUserMedia() support</a>?</b><br/>I was superlazy writing the code (it took me less than hour, it was just techdemo, not the regular, production code). And the easiest way to determine if the pieces was dropped in the right place was to check if the previously added 'data-order' values of the DOM elements (canvas - piece & div - place in which you put the piece) are equal. I took the second element from event.target argument of mouseup event, and since dragged piece has 'pointer-events' set to 'none'. It should allow the event to go through the piece. Not in Opera. I don't know if it's Opera's or all the other vendors, there's nothing in spec about that.MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-86993934725083557712012-05-14T16:53:00.000-07:002012-05-18T15:33:01.030-07:00onGameStart 2012The most important thing in the life adventure is to remember when and how did it start. First impressions, inspirations and simple steps shape the future. <br />My gaming experience started in mid '90 on my XT with Hercules graphic card and amber screen. I was too young (and I lived on the other side of the iron curtain) to remember Apple II or Commodore computers before. One of the first games I remember from my early childhood was <b>'Prince of Persia'</b> made by <b><a href="http://jordanmechner.com/">Jordan Mechner</a></b>. I played it for almost 12 years before I was able to finish it without cheating (I can still remember <i>'prince megahit'</i> password that enables cheat mode). I'm sure that a lot of you had similar experience. <br /><br />What does this have to do with onGameStart? <br /><img src="http://images.virtualdesign.pl/images/16049ogs4.png" width="430" /><br />Earlier this year I tweeted that HTML5 gamedevs are the new generation of game makers, and like every other 'new generation' we reinvent the same patterns or techniques our older friends implemented 30 years ago. There is no better way to learn, than listen to the real experts. <b>That's why Jordan Mechner, creator of Prince of Persia, will share his experience during this year's Main onGameStart Keynote</b>. <br /><br />During two days of the conference it will be also possible to listen to presentations of the biggest, most talented and most respected HTML5 game developers from all over the world. And differently from last year, we will focus on <b>real HTML5 games</b>, <b>tools</b> that could help you write your own game, and wide variety of <b>services</b> for distribution, payments, statistics, and everything you will need to create great game. <b>No more tech demos or examples</b> - we all know that HTML5 has become mature enough, and players don't care about the technology - they want games. And we need those players and those games to prove that Open Web Technologies can compete with any other technology used in game development. <br /><br />First part of confirmed speakers list for this year's edition of the first HTML5 game conference:<br/><b><a href="http://twitter.com/#%21/seb_ly">Seb Lee-Delisle</a></b>, trainer on CreativeJS workshops<br /><b><a href="http://twitter.com/#%21/jerome_etienne">Jerome Etienne</a></b>, creator of learningthreejs.com and tQuery<br /><b><a href="http://twitter.com/#%21/swingpants">Jon Howard</a></b>, responsible for games for kids in BBC<br /><b><a href="http://twitter.com/#%21/mapagella">Andres Pagella</a></b>, creator of Tracy and author of <i>"Making Isometric Social Real-Time Games with HTML5, CSS3, and JavaScript"</i><br /><b><a href="http://twitter.com/#%21/ard">Szymon Pilkowski</a></b>, former senior JS developer in Crytek &amp; Bigpoint<br /><b><a href="http://twitter.com/#%21/blackmoondev">Robert Podgorski</a></b>, boss of Black Moon Dev, one of the best pixel artists ever<br /><b><a href="http://twitter.com/#%21/29a_ch">Jonas Wagner</a></b>, author of great WebGL demos<br />And of course last but not least, <br /><b><a href="http://twitter.com/#%21/jmechner">Jordan Mechner</a></b>, creator of Prince of Persia <br /><br /><img src="http://images.virtualdesign.pl/images/29546ogs3.png" style="float: right; width: 220px; margin-left: 5px; margin-bottom: 5px" />So about 30 seconds ago we have launched our site, <a href="http://ongamestart.com/">onGameStart.com</a>. And because it's all about gaming, we've simply created a game with outstanding graphics by <a href="http://blackmoondev.com/">Robert</a>. Control little astronaut with arrow keys, use space to talk to the speakers (close the window with 'z'), avoid <a href="http://media.tumblr.com/tumblr_lxpncjCigs1qmi6ix.jpg">lasers</a> and spikes, and use keycards to open the door. If you don't want to explore our oGS spaceship, you can simply click on the head of the speaker in the top menu, and you will be teleported to the given speaker - you can still talk with him using space. game was created using <a href="http://twitter.com/#%21/phoboslab">Dominic's</a> <a href="http://impactjs.com">ImpactJS</a> so it should work in most of the browsers. If you happen to find a bug, typo etc, feel free to tweet me about that (<a href="http://twitter.com/michalbe">@michalbe</a>). Enjoy, and stay tuned (<a href="http://lanyrd.com/2012/ogs12/">Lanyrd</a>, <a href="http://www.facebook.com/onGameStart">Facebook</a> & <a href="http://twitter.com/#!/ongamestart">Twitter</a>)! We will announce more speakers and surprises soon.<br/><a href="http://twitter.com/#!/jmechner/status/202518150124802048"><img src="http://images.virtualdesign.pl/images/77471jmechner.png" width="430" /></a>MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-6650628504389621512012-01-17T07:50:00.000-08:002012-01-17T08:03:32.847-08:00MeetJS Summit<a href="https://twitter.com/#!/Goracyi/status/158145027984461824" target="_blank"><img src="http://images.virtualdesign.pl/images/975951qdal2.jpg" style="width:150px;margin:5px;float:right"/></a>Last weekend, during <a href="http://summit.meetjs.pl">MeetJS Summit</a> in Poznań, I gave my first talk this year. It was just another great frontend event organized by Godfather of Polish web conferences, <a href="http://ferrante.pl">Damian Wielgosik</a>, together with <a href="http://poznan.gtug.pl/">Polish GTUG</a>.<br />Since <a href="http://technetnepal.net/blogs/ict/archive/2011/11/15/monetization-of-html5-applications-and-games.aspx">ICT Conference in Kathmandu</a> in November, where I spoke for the last time in 2011 (with simple .ppt slides), something really big happened in a web conferences world. Because of <a href="https://github.com/bartaz/impress.js">impress.js</a>, stunning CSS 3D based presentation framework by <a href="https://twitter.com/#!/bartaz">Bartek Szopka</a>, it became inappropriate to use prehistoric tools like PowerPoint for creating your own slides (It has 600 Github watchers more in two weeks than CoffeeScript in more than 2 years, SIC!). And since I had just couple of days before the event, I used mine & <a href="http://twitter.com/sasklacz">Jakub Siemiątkowski's</a> port of <a href="https://twitter.com/#!/jmechner">Jordan Mechner's</a> Prince of Persia as a base of my presentation. I'm quite satisfied with the result, you can check it <a href="http://vdlabs.com/meetjs/">HERE</a> or just click on the iframe below. It is optimized for my presentation remote so you can change the slides only using PgDown & PgUp. Sometimes it needs to be refreshed, and sometimes it craches, but it's more like a prove of concept, not real life product.<br /><iframe width="440" height="280" src="http://vdlabs.com/meetjs/"></iframe>MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-65689327985527473582011-06-26T08:10:00.000-07:002011-06-26T08:24:13.938-07:00NO_MODIFICATION_ALLOWED_ERR: DOM Exception 7Since <a href="https://github.com/michalbe/mibbu">Mibbu framework</a> supports CSS animations, it's good moment to create version exclusively for mobile devices, without using heavy and hard to render canvas, and with very limited JavaScript DOM interactions - CSS FTW! So I remove about 50% of code from original branch and test it on my Samsung Wave (bada has one of the best mobile browsers ever, so that was my starting point). And it simply doesn't work:<br /><img src="http://img221.imageshack.us/img221/4716/nma.png" width="430" alt="NO_MODIFICATION_ALLOWED_ERR: DOM Exception 7" title="NO_MODIFICATION_ALLOWED_ERR: DOM Exception 7"/><br />After short research I saw that <a href="http://www.google.com/support/forum/p/Chrome/thread?tid=59e8746723622119&hl=pl">Allegro ('Polish Ebay') had the same problem on Desktop Chrome</a> months ago. After couple more hours of reading documentation I found a clue, that Webkit is freaking out if you try to put HTML content into style tag. So I switch <pre name="code" class="js">var cssStyle = document.createElement('style');<br /> cssStyle.innerHTML = 'body { color: #000; }';</pre>to <pre name="code" class="js">var cssStyle = document.createElement('style');<br /> cssStyle.innerText = 'body { color: #000; }';</pre>and everything works.MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-69215478311910722802011-06-24T07:53:00.000-07:002011-06-24T07:59:43.347-07:00Few words about my CSS Nyan CatLast week Mozilla together with Finnish demoscene hackers organized Flame Party in capital of Finland, Helsinki. More than 100 participants worked whole day on outstanding web demos in two main categories - Single Effect and Main Demo.<br /><a href="http://www.flickr.com/photos/tobimcfly/5854093539/in/photostream/"><img src="http://farm3.static.flickr.com/2749/5854093539_551d141672.jpg" width="430" /></a>Because of nearly release of stable <a href="http://www.mozilla.com/en-US/firefox/all.html">Firefox 5</a>, first Mozilla's browser with CSS3 Animation support, I decide to create CSS3 demo for the Single Effect Compo.<br />Since I really enjoy all that 4chan-like mems stuff, I chose Nyan Cat, as one of the most 'fresh' ones. In case you don't know it (check the progress bar!):<br /><iframe width="425" height="349" src="http://www.youtube.com/embed/QH2-TGUlwu4" frameborder="0" allowfullscreen></iframe><br /><br />I didn't use any graphics to code my <a href="https://developer.mozilla.org/en-US/demos/detail/css-nyan-cat">CSS Nyan Cat</a>. It is completely drawn and animated in CSS. The 'pop-tart' body is created with two rounded cornered divs and big, pink dots separated with non-breaking spaces:<pre name="code" class="js">#toastBody {<br /> background-color:#fad695;<br /> width:100px;<br /> height: 70px;<br /> border: solid #000 5px;<br /> border-radius: 15px;<br /> padding: 2px;<br /> position:absolute;<br /> z-index:19;<br />}<br /><br />#toastBody > div {<br /> width:100px;<br /> height:70px;<br /> border-radius: 30px;<br /> background-color: #fc9dff;<br /> display:block;<br /> color: #da3eb9;<br /> font-size: 40px;<br /> line-height: 10px;<br />}<br /></pre>All the animations was declared with <b>@-moz/webkit-keyframe</b> (I wrote <a href="http://michalbe.blogspot.com/2011/05/css3-animations-in-mibbu.html">a lot</a> about this method before). <br /><br />I made couple of unusual things during development. For example, look on the cat's mouth:<br /><br /><img src="http://img405.imageshack.us/img405/1384/nyank.png" width="430"/><br />Yup, it is rotated 'E' letter:<pre name="code" class="js">&lt;div id="mainHead" class="skin"&gt;<br /> &lt;div class="mouth"&gt;E&lt;/div&gt;<br />&lt;/div&gt;<br /><br />.mouth {<br /> position: absolute;<br /> -moz-transform: scale(2, 0.7) rotate(-90deg);<br /> -webkit-transform: scale(2, 0.7) rotate(-90deg);<br /> font-family: Arial;<br /> font-size: 25px;<br /> font-weight: bold;<br /> top:9px;<br /> left:37px;<br /> color: #000;<br />}<br /><br /></pre>What about the rainbow behind the cat? I just cropped part of original image, put it into <a href="http://www.colorzilla.com/gradient-editor/">CSS Gradient Editor by ColorZilla</a> (awesome tool BTW, but still without couple of necessary features I use daily; I think I will create something like this on my own), which generates me css gradient ready for pasting into the div background:<pre name="code" class="js">.rainbow {<br /> position:absolute;<br /> width:45px;<br /> height:90px; <br /> background: -moz-linear-gradient (top, #d91a12 15%, #e13300 15%, #ff7f14 16%, #f2ab03 32%, #ebc000 32%, #fade00 33%, #efff03 48%, #56fc02 49%, #52ff01 66%, #4ade7e 67%, #3baaf2 67%, #3baaf2 84%, #7337f7 84%, #6b40f2 100%);<br />}</pre>The most annoying thing was the star. Animated stars in the background are made up from 8 animated elements. I google "nyan cat sprite" and found all the star frames <a href="http://i1037.photobucket.com/albums/a453/DryBowser455/th_NyanCatSprite.png?t=1304659408">[like this]</a>. The only way to animate it was pixel-perfect animation of each of 8 divs. It took me really lot of time:<pre name="code" class="js">@-moz-keyframes star1 {<br /> 0% { top: 0; height: 5px;}<br /> 33.19% { top: 0; height: 5px; }<br /> 33.2% { height:10px; top:0; }<br /> 49.79% { height:10px; top:0; }<br /> 49.8% { height:10px; top:5px; }<br /> 66.39% {height:10px; top:5px; }<br /> 66.4% { height:5px; top:10px;}<br /> 82.99% { height:5px; top:10px;}<br /> 83% { height: 5px; top: 15px; }<br /> 99.99% { height: 5px; top: 15px; }<br /> 100% { top: 0; height: 5px; }<br />}<br /><br />@-moz-keyframes star2-3-6-7 {<br /> 0% { visibility: hidden; }<br /> 16.59% { visibility: hidden; }<br /> 16.6% { visibility: visible; }<br /> 33.19% { visibility: visible; }<br /> 33.2% { visibility: hidden; }<br /> 100% { visibility: hidden; }<br />}<br /><br />@-moz-keyframes star4 {<br /> 0% { left: 0; width: 5px; visibility: visible;}<br /> 33.19% { left: 0; width: 5px; }<br /> 33.2% { width:10px; left:0; }<br /> 49.79% { width:10px; left:0; }<br /> 49.8% { width:10px; left:5px; }<br /> 66.39% {width:10px; left:5px; }<br /> 66.4% { width:5px; left:10px;}<br /> 82.99% { width:5px; left:10px;}<br /> 83% { width: 5px; left: 15px; visibility:hidden;}<br /> 99.99% { width: 5px; left: 15px; visibility:hidden;}<br /> 100% { left: 0; width: 5px; visibility:hidden;}<br />}<br /><br />@-moz-keyframes star5 {<br /> 0% { left: 38px; width: 5px; visibility: visible;}<br /> 33.19% { left: 38px; width: 5px; }<br /> 33.2% { width:10px; left:33px; }<br /> 49.79% { width:10px; left:33px; }<br /> 49.8% { width:10px; left:28px; }<br /> 66.39% {width:10px; left:28px; }<br /> 66.4% { width:5px; left:28px;}<br /> 82.99% { width:5px; left:28px;}<br /> 83% { width: 5px; left: 15px; visibility:hidden;}<br /> 99.99% { width: 5px; left: 15px; visibility:hidden;}<br /> 100% { left: 0; width: 5px; visibility:hidden;}<br />}<br /><br />@-moz-keyframes star8 {<br /> 0% { top: 32px; height: 5px; visibility:visible;}<br /> 33.19% { top: 32px; height: 5px; }<br /> 33.2% { height:10px; top:28px; }<br /> 49.79% { height:10px; top:28px; }<br /> 49.8% { height:10px; top:23px; }<br /> 66.39% {height:10px; top:23px; }<br /> 66.4% { height:5px; top:18px;}<br /> 82.99% { height:5px; top:18px;}<br /> 83% { height: 5px; top: 15px; visibility:hidden;}<br /> 99.99% { height: 5px; top: 15px; visibility:hidden;}<br /> 100% { top: 0; height: 5px; visibility:hidden;}<br />}<br /><br />.star {<br /> position: absolute;<br /> width: 40px;<br /> height: 40px;<br /> z-index: 10;<br />}<br /><br />.star div {<br /> width: 5px;<br /> height: 5px;<br /> background-color: #fff;<br /> position: absolute;<br /> -moz-animation: star1 0.4s linear 0s infinite;<br /> -webkit-animation: star1 0.4s linear 0s infinite;<br />}</pre><a href="https://developer.mozilla.org/en-US/demos/detail/css-nyan-cat"><img src="http://images.virtualdesign.pl/images/375991308881152_screenshot_1.png.jpg" width="430" /></a><br />Here is the final result of everything: <a href="https://developer.mozilla.org/en-US/demos/detail/css-nyan-cat">CSS NYAN CAT</a>, and <a href="https://github.com/michalbe/css-nyan-cat">Github repo</a>.<b> If you like it, don't forget to click "I like it" on Mozilla's page!</b>MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-75988694060551532112011-06-09T06:23:00.000-07:002011-06-09T08:07:42.187-07:00The Flame Party Helsinki<img src="http://images.virtualdesign.pl/images/63859demoparty_the_flame_party_logo1.png" width="430"><br />If you are planning to spend next weekend in Finland, you cannot omit <a href="http://mozillalabs.com/demoparty/helsinki">Flame Party</a> organized there by <a href="http://mozillalabs.com/demoparty">Mozilla</a>, <a href="http://www.altparty.org/2011/">Alternative Party Crew</a> and <a href="http://dot.ayy.fi/index.php?s=dot&p=9">DOT</a>. It will be awesome weekend full of coding, BBQ, free drinks, Finish saunas and outstanding workshops including one lead by my - <b>"Dive into HTML5 Animation"</b>:<br /><blockquote>"During the workshop you will learn about different methods of animation in JavaScript. We will compare the performance and ease of it's implementation in various browsers on different devices. Are we condemned to use DOM? What about new CSS techniques? Or maybe canvas is future of the web games?"</blockquote><br />So what are you waiting for? <a href="http://www.fläbät.fi/event/010c7910/">Register now</a> and follow the party on <a href="http://lanyrd.com/2011/the-flame-party-helsinki/">Lanyrd</a> and <a href="http://www.facebook.com/event.php?eid=208867699145074">Facebook</a>.MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-25136654034753442192011-06-05T07:54:00.000-07:002011-06-05T11:30:41.325-07:00CSS Animation in FirefoxMibbu now supports CSS Animations also in Firefox. The only version in which I have tested it is 5.0/Beta, but I think it should works also in Aurora. Feature detection problem <a href="http://michalbe.blogspot.com/2011/05/css3-animations-in-mibbu.html">I describe last week </a>wasn't the only unexpected behavior during implementing this (BTW, I want to thanks Anonymous guy who corrects my attempt - <a href="http://michalbe.blogspot.com/p/contact-me.html">contact me</a>, I have only your IP & Country you were writing from:), and <a href="http://paulirish.com/">Paul Irish</a> for deeper explanation of the problem).<br /><img src="http://images.virtualdesign.pl/images/71715Zrzutekranu2011-06-05(godz.16.03.34).png" width="430"/><br />Every animation I've created using Mibbu in Firefox animate only once. No matter if I put 'infinite' as a value of AnimationIterationCount. Using <a href="http://www.w3.org/TR/css3-animations/#the-animation-shorthand-property-">MozAnimation shorthand property</a> doesn't want to work. I rewrote everything couple of times in different ways without any result (sometimes it just stop working also on webkit:)). And then I figure out that setting 'none' as 'MozAnimationDelay' instead of 0 (<a href="http://www.w3.org/TR/css3-animations/#the-animation-delay-property-">as in the spec!</a>) solves everything. Nice try Mozilla, but it is again 1:0 for me:). I really love everything from Mozilla, Firefox is my main browser, each day I'm working with technologies created there (also in my full time job in GaduGadu), I'm excited in every news like <a href="http://twitter.com/#!/marcoos/status/77372844971003905">THIS ONE</a>, and I even ran <a href="https://developer.mozilla.org/en/XUL">XUL</a> workshop two weeks ago <a href="http://falsyvalues.com/speakers.html#litman-budzynski">on FalsyValues conference</a>. But sometimes I simply don't understand why they solve something in such a weird way.<br />I also had to use MozAnimation attribute using brackets notation because Closure Compiler don't understand it and minimized it to the single letter. <br />So, you can now <a href="https://github.com/michalbe/mibbu">download Mibbu from my Github account</a> and play with it.<br /><br /><a name="update">UPDATE</a><br />Ok, thanks to <a href="http://blog.marcoos.com/">Marek Stepien's</a> research done after my post we figured out that putting delay value without the unit ('0' instead of '0s') solves the problem. Probably, when we put single digit without units, Firefox thought that it is -animation-iteration-count (the only property without any units). Marek creates bug report for this <a href="https://bugzilla.mozilla.org/show_bug.cgi?id=662171">here</a>.MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-44590636458312782422011-05-30T16:03:00.000-07:002011-05-30T16:03:44.026-07:00onGameStart ticketsIt is now possible to register to <a href="http://ongamestart.com ">onGameStart</a> - first HTML5 game conference. Don't wait for anything, just go to <a href="http://ongamestart.com ">http://ongamestart.com</a> and do what you have to do:).<br/><br/><img width="430" src="http://images.virtualdesign.pl/images/69782Zrzutekranu2011-05-31(godz.00.31.12).png" />MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-35605097148565757292011-05-29T15:07:00.000-07:002011-05-29T15:20:09.045-07:00CSS3 animations in MibbuLast week <a href="http://twitter.com/#!/michalbe/status/72435732635070464">I implement CSS Animations</a> in my gamedev micro framework, <a href="http://mibbu.eu/">Mibbu</a>.<br />It is possible now to animate sprites in three different ways - cropping parts of the sprite with .drawImage() in 'canvas mode', manipulating 'top' & 'left' attributes of absolute position of the image [<a href="http://michalbe.blogspot.com/2010/10/four-methods-of-javascript-animation.html">both described in here</a>] and CSS Animation in DOM mode.<br />For now Mibbu supports CSS animations only in webkit based browsers. I know that beta version of Firefox supports it as well, but I didn't find easy way to detect it. In webkit we can just check what is the initial value of given attribute (use whatever DOM element you want), like this:<br /><pre name="code" class="js">if (typeof document.body.style.webkitAnimation !== "undefined") {<br />//all your animation are belong to us<br />} else {<br />//no css animations:(<br />}<br /></pre>Unfortunately it don't work in Aurora, mozAnimation always return 'undefined'. Is there any way to easy detect it?<br /><br />The main point in creating css animations is preparing proper keyframes in a css classes and connecting it to the DOM elements with description parameters like duration or number of iterations. CSS engine will be responsible for sprite animation so draw() function of each sprite object should be empty. The keyframes are generated during constructing the object and append to the document - one class in one script element, it will be easier to edit them when the parameters of the animation will change during the gameplay. I also wrote a little function to convert speed of an animation (from Canvas & DOM mode) to the CSS Animation Duration parameter.<br /><pre name="code" class="js">var calculateSpeed = function(speed, frames) {<br /> return (~~((1 / (60 / speed)) * 100) / 100) * (frames+1);<br />};<br /><br />constructAnimationClass = function(){<br /> var animClass = "@-webkit-keyframes 's" + t.id + "' {\n",<br /> step = 100 / (t.fs + 1),<br /> str = '% { -webkit-transform: translate(';<br /><br /> for (var q = 0; q < t.fs+1; q++) {<br /> animClass += ~~((step * q) * 100) / 100 + str + t.animation * t.width*-1 + 'px,' + q * t.height * -1 + 'px); }\n';<br /> animClass += ~~((step * (q + 1) - 0.01) * 100) / 100 + str + t.animation * t.width * -1 + 'px,' + q * t.height * -1 + 'px); }\n';<br /> }<br /> <br /> return animClass += '100'+ str +t.animation*t.width+'px, 0px); }\n}';<br /> <br />};<br /><br />//append created class to the document<br />t.animStyle = document.createElement('style');<br />t.animStyle.innerHTML = constructAnimationClass();<br />document.body.appendChild(t.animStyle);<br /></pre>Above code creates class like this: <a href="http://images.virtualdesign.pl/images/94494Zrzutekranu2011-05-29%28godz.23.30.29%29.png"><img src="http://images.virtualdesign.pl/images/94494Zrzutekranu2011-05-29%28godz.23.30.29%29.png" width="490"/></a>And every sprite needs to implement description of the animation (name is created by concatenating 's' and internal id of the sprite: <pre name="code" class="js">t.style.webkitAnimation = "'s"+t.id+"' "+calculateSpeed(t.speed, t.fs)+"s linear 0 infinite";<br /></pre>Main problem I had with implementing this was pausing the game - even if main loop stops, CSS engine still animates the keyframes. So I just set '0' for the -webkit-animaition-duration parameter: <pre name="code" class="js">'off': function(){<br /> MB_Stop();<br /> if (MB_usingCSSAnimations){<br /> var i = MB_elements.length;<br /> for (;i--;){<br /> if (MB_elements[i].image)<br /> MB_elements[i].image.style.webkitAnimationDuration = 0;<br /> }<br /> }<br />};<br /></pre>It sucks but it works. Anyone know better solution? Next step is to provide support of webkitAnimationIterations for iteration's callbacks (now it is calculated using JavaScript, not with the events, but contrary to what I thought webkit has already supported DOM events for animation [thanks <a href="http://twitter.com/#!/askoth">Askoth</a>]). If you want help feel free and contribute: <a href="https://github.com/michalbe/mibbu">Mibbu on github</a>. There are also <a href="https://github.com/michalbe/mibbu/issues?sort=created&direction=desc&_pjax=true&state=open">some issues</a> I found creating new features and I have no time to fix it now. If you use <a href="http://mibbu.eu/">Mibbu</a> and have some ideas or found any bugs, write me about it or fork & pull request on <a href="https://github.com/michalbe/mibbu">Github</a>.<br/><br/>BTW, Github will be one of the sponsors of <a href="http://ongamestart.com/">onGameStart, HTML5 Game Conference</a>. We will open registration on Monday evening Central European time, so check <a href="http://ongamestart.com/">the conference page</a> and don't miss it!MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-56833047038505616282011-05-04T17:46:00.000-07:002011-05-04T18:04:09.010-07:00Mibbu - javascript html5 game framework<img src="http://images.virtualdesign.pl/images/69143mibbu.jpg" style="float:right;margin-left:12px;width:200px" />I have just published initial release of <a href="http://mibbu.eu/">Mibbu</a> - my javascript microframework for fast game prototyping. To be honest - it is just set of functions and patterns I use always when I write my games. It is more a sandbox, starting place with basic tools, than a real framework (that's why I called it 'microframework'). It provides sprite animations, basic operations like movement or collisions, scrolling backgrounds and drawing on both - canvas or DOM. It uses DOM only when it is not possible to use Canvas (like in older IEs), but you can force it to do so with one single function (<b><a href="http://mibbu.eu/#canvasOff">canvasOff()</a></b>) - then it will be drawn with divs & imgs. It is the same mechanics I have used in <a href="http://openodyssey.mibbu.eu/">OpenOdyssey</a> or <a href="https://developer.mozilla.org/pl/demos/detail/janpu">Janpu</a>. I will try to write something more about using <a href="https://github.com/michalbe/mibbu">Mibbu</a> later this week.MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-56007704288546884292011-04-30T03:15:00.000-07:002011-04-30T12:07:12.454-07:00First HTML5 Game Conference ever - onGameStartAs probably most of you already know - I'm organizing first HTML5 game conference ever. It will take place in my hometown - <a href="http://en.wikipedia.org/wiki/Warsaw">Warsaw</a> at 22nd & 23rd of September 2011. I've done my best with selection of the speakers - so far it is the only chance to meet and talk with the best Open Web Game developers. Let me introduce some of them:<br /><b><a href="http://www.everyday3d.com/">Bartek Drozd</a></b> - creator of <a href="https://github.com/drojdjou/J3D">J3D</a> - WebGL Library with Unity3d object/scene exporter.<br /><b><a href="http://www.rawkes.com/">Rob Hawkes</a></b> - author of <a href="http://www.amazon.co.uk/gp/product/1430232919/ref=as_li_qf_sp_asin_il_tl?ie=UTF8&tag=rawkes-21&linkCode=as2&camp=1634&creative=6738&creativeASIN=1430232919">"Foundation HTML5 Canvas"</a> book<br /><b><a href="http://agent8ball.com/">Robby Ingebretsen</a></b> - creator of Agent008Ball<br /><b><a href="http://blog.tojicode.com/">Brandon Jones</a></b> - author of <a href="http://code.google.com/p/glmatrix/">glMatrix</a> library and a lot of awesome webGL demos (like <a href="http://media.tojicode.com/q3bsp/">Quake III</a>)<br /><b><a href="http://www.martinkool.com/">Martin Kool</a></b> - creator of multiplayer, online versions of old good Sierra games - <a href="http://sarien.net">Sarien</a><br /><b><a href="http://sethladd.com/">Seth Ladd</a></b> - Google developer advocate (he will speak on <a href="http://www.google.com/events/io/2011/sessions_schedule.html">Google IO</a> in two weeks - don't miss it!)<br /><b><a href="http://nekapuzer.at/">Simon Oberhammer</a></b> - creator of pyGame port for Javascript - GameJS<br /><b><a href="http://www.freeciv.net/">Andreas Røsdal</a></b> - originator of biggest strategy game made in open web technologies based on Sid Mayer's Civilization - Freeciv.net<br /><b><a href="http://www.phoboslab.org/">Dominic Szablewski</a></b> - creator of ImpactJS - most complex and so far the best Javascript game engine.<br /><br />For more information about the conference check our <a href="http://ongamestart.com/">site</a>, <a href="http://lanyrd.com/2011/ongamestart/">lanyrd</a>, <a href="http://twitter.com/#!/onGameStart">twitter</a> and <a href="http://www.facebook.com/onGameStart">facebook</a>. And don't forget to preregister (it is possible on the site).<br /><a href="http://ongamestart.com"><img src="http://img825.imageshack.us/img825/3203/ogse.jpg" width="430" /></a>MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-45231157962569198122011-04-10T02:47:00.000-07:002011-04-23T00:54:21.299-07:00GG WorkshopYesterday I ran Javascript workshop about creating Apps & Games in Social Networks. Fourteen great developers in eight hours tried to create multiplayer checkers (draughts? what's the difference?) game and adapt it to two social network APIs (<a href="htp://facebook.com">Facebook</a> & <a href="http://gg.pl">GG.pl</a>). I published source code of the final result <a href="https://github.com/michalbe/szkolenieGG">on my Github</a>, just as <a href="https://github.com/narfdotpl/gg-checkers">Maciej Konieczny</a>, one of the participants. Here are also my slides and couple of photos:<br /><br /><div style="width:425px" id="__ss_7576298"><strong style="display:block;margin:12px 0 4px"><a href="http://www.slideshare.net/michalbu/gg-workshop-games-apps-in-javascript" title="GG WORKSHOP GAMES &amp; APPS IN JAVASCRIPT">GG WORKSHOP GAMES &amp; APPS IN JAVASCRIPT</a></strong> <iframe src="http://www.slideshare.net/slideshow/embed_code/7576298" width="425" height="355" frameborder="0" marginwidth="0" marginheight="0" scrolling="no"></iframe> <div style="padding:5px 0 12px">View more <a href="http://www.slideshare.net/">presentations</a> from <a href="http://www.slideshare.net/michalbu">michalbu</a> </div></div><br /><a href="http://img696.imageshack.us/g/obraz013f.jpg/"><br /><img src="http://img684.imageshack.us/img684/3772/obraz013r.png" /><br /><img src="http://img808.imageshack.us/img808/10/obraz021.png" /><br /><img src="http://img695.imageshack.us/img695/4387/obraz029g.png" /><br /><img src="http://img852.imageshack.us/img852/1110/obraz036.png" /><br /><img src="http://img811.imageshack.us/img811/6385/obraz037.png" /></a><br />I would like to thanks everyone for the presence and I hope we will meet on frontend meetings in near future (like those organized by <a href="http://googlepolska.blogspot.com/2011/04/deweloperzy-spotkajmy-sie.html">Google Poland</a>). If you will find some free time feel free to rate my workshop <a href="http://speakerrate.com/michalbe"> on SpeakerRate</a>.MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-40015945808485753942011-03-29T03:33:00.000-07:002011-03-29T04:08:21.185-07:00Sun^26<img src="http://img191.imageshack.us/img191/1296/oursun.gif" style="float:left;width:150px;margin-right:10px;"/>That post has nothing in common with programming or even computers but I was so excited when I discover things I want to write about that 140 chars of twitter wasn't enough for me. <br/><br />The Sun is a star in the center of our Solar System Anyone knows that. But have you ever think about number '<span style="font-weight:bold;">26</span>' in Sun statistics? <br /><ul><li>Apparent magnitude of the Sun is -<span style="font-weight:bold;">26</span>,8</li><li>Mean distance from Milky Way <span style="font-weight:bold;">26</span>,000ly</li><li>Galactic period 2<span style="font-weight:bold;">26</span>.000.000 years</li><li>Radiant flux 3,827×10^<span style="font-weight:bold;">26</span> W</li><li>Unicode of Sun symbol - <span style="font-weight:bold;">26</span>09</li><li>Distance from Milky Way Equator - <span style="font-weight:bold;">26</span>ly</li><li>Speed <span style="font-weight:bold;">26</span>0 km/s<li><li>Conversion rate of mass-energy 4.<span style="font-weight:bold;">26</span> million metric tons per second</li><li>Mean mass loss in energy <span style="font-weight:bold;">26</span>,732MeV</li><li>Total mass loss 6,5x10^<span style="font-weight:bold;">26</span></li><li>STEREO observation mission starts at <span style="font-weight:bold;">26</span>th of October <span style="font-weight:bold;">2</span>00<span style="font-weight:bold;">6</span></li></ul><br />Coincidence? Don't think so! :)<br /><br /><span style="font-style:italic;">from <a href="http://pl.wikipedia.org/wiki/S%C5%82o%C5%84ce">Polish</a> & <a href="http://en.wikipedia.org/wiki/Sun">English</a> Wikipedia.</span>MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-12760326026329869492011-03-19T10:12:00.000-07:002011-03-19T11:31:00.213-07:00meet.js in WarsawI have just returned from Warsaw edition of <a href="http://jsnews.pl/">meet.js</a>, polish javascript meeting organized by <a href="http://ferrante.pl/">Damian Wielgosik</a> and <a href="http://czerski.info/">Paweł Czerski</a>, organizers of <a href="http://front-trends.com/">FrontTrends</a> and <a href="http://falsyvalues.com/">Falsy Values</a>. During the meeting we ware able to watch four Javascript tech-talks.<br /><img src="http://images.virtualdesign.pl/images/79366roberttomaszewski.png" />First was Robert Tomaszewski from <a href="http://www.hypermediaisobar.pl/">Hypermedia Isobar</a> with his presentation about different context of calling Js structures. He started with a little of JS history, then explained basics of using 'this' depending on placement of the objects and different approaches of using 'this' in DOM events.<br /><img src="http://images.virtualdesign.pl/images/5248marekstepien.png" width="430"/> Next was <a href="http://blog.marcoos.com/">Marek Stepień</a> - lead of <a href="http://www.aviary.pl/">Aviary.pl</a>, team of programmers and translators localizing open source software for Polish users. He started with review of past JS objects, its restrictions and methods of its elimination. Then he presented new methods of creating objects in Js 1.8.5 like defineProperty() etc. <br /><img src="http://images.virtualdesign.pl/images/76543tomasztunik.png" widh="430"/>After the break there were a little contest - I won weekend stay in <a href="http://en.wikipedia.org/wiki/Karpacz">Karpacz</a> for my implementation of adding function (Thanks!:) ). Just after that <a href="http://twitter.com/#!/I_am_thomas">Tomasz Tunik</a> talked about his <a href="http://provoke.it/einie/">Einie framework</a>. He showed a lot of cool examples (like mouse tracking and interactions with canvas objects, or <a href="http://scorch.duostack.net/">Pew! Pew! Towers</a>, game created in 48h by Thomas and <a href="http://twitter.com/#!/ard">Szymon Pilkowski</a> on <a href="http://html5gamejam.org/">HTML5gameJam in Paris</a>. All of that examples are published on <a href="http://provoke.it/einie/">Einie's site</a> so don't hesitate to check it.<br /><br />Last presentation was made by me. I was talking about pseudorandom numbers and <a href="http://en.wikipedia.org/wiki/Steganography">Steganography</a>. I won't describe my talk, maybe someone else will, I think in couple of days I will publish it as a blog post or maybe little JS library. <br />I want to thanks the organizers one more time, and I hope we will meet on the next meet.js (or at least on Falsy Values:) ).MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-34851913680913568252011-03-03T13:42:00.000-08:002011-03-03T13:42:30.309-08:00BirthdayMy blog is one year old today.<br /><img src="http://images.virtualdesign.pl/images/792461st-birthday-cake.jpg" width=430 />I will try to write some summary of that period later this week or at the beginning of the next one. For sure one of the best things I wrote about was my <a href="http://michalbe.blogspot.com/2010/09/simple-game-with-html5-canvas-part-1.html">HTML5 Canvas Game Tutorial</a>, one of the most popular in all over the web, but there were also other posts I would like to remind.MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-85000662202038667492011-02-27T04:21:00.000-08:002011-02-27T10:45:24.075-08:00CSS3 sprite animation, issues in SafariTogether with CSS3 standard we get <a href="http://www.w3.org/TR/css3-animations/">awesome tool for creating hardware accelerated css-only animated sprites</a>. For now it is implemented only in webkit based browsers like Safari, Chrome or most of the mobile browsers. <a href="http://paulbakaus.com/2010/12/07/finally-sprite-animations-implemented-via-css3-animations/">Paul Bakaus</a> described it on his blog months ago, <a href="http://paulbakaus.com/2010/12/15/sprite-animations-on-css-transitions-revisited/">with additional approaches and performance optimization methods</a>. Also <a href="http://twitter.com/m4r00p">Marek Pawlowski</a> said a lot about this <a href="http://devmeetings.pl/trainings/programowanie-gier-w-javascript">on his DevMeeting gamedev workshop</a>. Working on my new mobile game, I've tested everything I could find all over web. And some of the examples (<a href="http://paulbakaus.com/lab/css/animated_sprite_css3_revisited/">like that Paul's created with Doug Neiner</a>) did not works on Safari and some mobiles (like Samsung's Dolfin on my bada Wave). I spend couple of annoying hours to figure out what happens, analyzing different use cases, different examples and documentation pages. But solution was simple as hell: <blockquote><b>Safari and some of mobile browsers cannot animate any element with CSS3 animation if there is no '0%' and '100%' step.</b></blockquote>That's why example from Paul's blog didn't want to work when I test them:<pre name="code" class="js">@-webkit-keyframes 'animationName' {<br /> 0% { background-position: 0px 0px; }<br /> 12.5% { background-position: -128px 0px; }<br /> 25% { background-position: -256px 0px; }<br /> 37.5% { background-position: -384px 0px; } <br /> 50% { background-position: -512px 0px; }<br /> 62.5% { background-position: -640px 0px; }<br /> 75% { background-position: -768px 0px; }<br /> 87.5% { background-position: -896px 0px; }<br />}</pre>Adding the last frame, with the same parameters as the first one, fixes the problem:<pre name="code" class="js">@-webkit-keyframes 'animationName' {<br /> 0% { background-position: 0px 0px; }<br /> 12.5% { background-position: -128px 0px; }<br /> 25% { background-position: -256px 0px; }<br /> 37.5% { background-position: -384px 0px; } <br /> 50% { background-position: -512px 0px; }<br /> 62.5% { background-position: -640px 0px; }<br /> 75% { background-position: -768px 0px; }<br /> 87.5% { background-position: -896px 0px; }<br /> 100% { background-position: 0px 0px; }<br />}</pre>Of course I didn't want to show that Paul and other guys was wrong - for sure all of them has bigger experience and knowledge than me. And their solutions will eventually work when browsers will implement the standards (what was the point I supposed) - but I was looking for something what will work here and now.<br /><img src="http://images.virtualdesign.pl/images/50726a.png" style="width:430px;" />MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-39589244981524195362011-02-23T16:53:00.000-08:002011-04-14T01:22:34.460-07:00Javascript random numbers with custom seed - part 2<img src="http://img715.imageshack.us/img715/1192/89994001.jpg" style="width:120px;float:right;margin-left:10px" />Generator created in previous example was able only to create integer numbers from zero to the given maximum (2^50) using provided seed. But in most cases we need random numbers from some range, so lets modify previous example and add 'min' and 'max' arguments to the .next() method. Also, to make it more like the native Math.rand(), let's make it generating floats from 0 to 1.<pre name="code" class="js">var CustomRandom = function(nseed) { <br /> <br /> var seed, <br /> constant = Math.pow(2, 13)+1, <br /> prime = 1987, <br />//any prime number, needed for calculations, 1987 is my favorite:) <br /> maximum = 1000; <br />//maximum number needed for calculation the float precision of the numbers (10^n where n is number of digits after dot) <br /> if (nseed) { <br /> seed = nseed; <br /> } <br /> <br /> if (seed == null) { <br />//before you will correct me in this comparison, read Andrea Giammarchi's text about coercion http://goo.gl/N4jCB <br /> <br /> seed = (new Date()).getTime(); <br />//if there is no seed, use timestamp <br /> } <br /> <br /> return { <br /> next : function(min, max) { <br /> seed *= constant; <br /> seed += prime; <br /> <br /> <br /> return min && max ? min+seed%maximum/maximum*(max-min) : seed%maximum/maximum; <br />// if 'min' and 'max' are not provided, return random number between 0 & 1 <br /> } <br /> } <br />} </pre>Now its easy to use it in such a way:<pre name="code" class="js">var rng = CustomRandom(23);<br />//use '23' as a seed<br /> rng.next(); // 0.426<br /> rng.next(); // 0.205<br /></pre>In the next part I will show some GameDev related examples of using Random Number Generators with custom seeds.<br /><br /><a href="http://michalbe.blogspot.com/2011/02/javascript-random-numbers-with-custom.html">Check 1st part of the "Javascript random numbers with custom seed" tutorial</a>MichalBehttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2037107846963035846.post-9094351439958294492011-02-17T15:42:00.000-08:002011-02-24T02:15:17.172-08:00Javascript random numbers with custom seed - part 1<img src="http://images.virtualdesign.pl/images/4712201_dice_color.jpg" width="180" style="margin-right:10px;float:left;" /><b>Introduction</b><br />Any random number generator generates sequences of numbers using some initial seed. The same seed always gives the same sequence. Most popular initialization method is to provide actual timestamp as seed - it changes every second so probability of receiving same sequences is very low. <br /><img src="http://images.virtualdesign.pl/images/81894images.jpg" style="float:right;margin-left:10px;width:100px;" />Generating pseudorandom sequences of numbers has wide variety of uses, ranging from creating random maps for games (with well constructed map generator all the game should remember is just the initial seed, not the array with list of map elements), to <a href="http://en.wikipedia.org/wiki/Steganography">steganography</a>, where you code & decode message on the sample image using the same seed (it is impossible to decode the information from the image without knowing exact number used as seed during coding it). I will create some examples in the next part of the series. <br /><br /><b>First attempt</b><br />Unfortunately, it is impossible to provide custom seed to the Javascript <i>Math.random()</i>. It always uses timesamp for initialization. So let us create our own generator with everything we need.<pre name="code" class="js">var CustomRandom = function(nseed) {<br /><br /> var seed,<br /> constant = Math.pow(2, 13)+1,<br /> prime = 37,<br /> maximum = Math.pow(2, 50);<br /> <br /> if (nseed) {<br /> seed = nseed;<br /> }<br /> <br /> if (seed == null) {<br />//if there is no seed, use timestamp<br /> seed = (new Date()).getTime();<br /> } <br /> <br /> return {<br /> next : function() {<br /> seed *= constant;<br /> seed += prime;<br /> seed %= maximum;<br /> <br /> return seed;<br /> }<br /> }<br />}</pre>And now:<pre name="code" class="js">var rng = CustomRandom(23);<br />//use '23' as a seed<br /> rng.next(); //188476<br /> rng.next(); //1544183905<br /> rng.next(); //12651498733702</pre>In the next parts I will extend that CustomRandom() generator with limits (min and max value) and implement some real-life use cases.<br /><br />Check 2nd part of the tutorial: <a href="http://michalbe.blogspot.com/2011/02/javascript-random-numbers-with-custom_23.html">Javascript random numbers with custom seed</a>MichalBehttp://www.blogger.com/profile/[email protected]
{ "url": "http://michalbe.blogspot.com/feeds/posts/default", "source_domain": "michalbe.blogspot.com", "snapshot_id": "crawl=CC-MAIN-2016-50", "warc_metadata": { "Content-Length": "126931", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:PMPDVBEWJTWKTUTDAW3XT23LY3YA3J6K", "WARC-Concurrent-To": "<urn:uuid:97d3f497-a2bb-4b7a-bf12-7b354b817d17>", "WARC-Date": "2016-12-11T02:26:36Z", "WARC-IP-Address": "209.85.232.132", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:KG6WPTCSXFW3KLJ7URHJV2OL6YOPAJRV", "WARC-Record-ID": "<urn:uuid:2d048672-af4d-4bbe-9808-72ec93ef2d7c>", "WARC-Target-URI": "http://michalbe.blogspot.com/feeds/posts/default", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:13448a0f-2415-49ef-ba03-bb3fb2196dd9>" }, "warc_info": "robots: classic\r\nhostname: ip-10-31-129-80.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-50\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for November 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }
{ "line_start_idx": [ 0 ], "line_end_idx": [ 74400 ] }
{ "red_pajama_v2": { "ccnet_original_length": 74400, "ccnet_original_nlines": 0, "rps_doc_curly_bracket": 0.0027688199188560247, "rps_doc_ldnoobw_words": 1, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.20518246293067932, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01915035955607891, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.42368245124816895, "rps_doc_frac_unique_words": 0.3155980706214905, "rps_doc_mean_word_length": 7.492321968078613, "rps_doc_num_sentences": 1250, "rps_doc_symbol_to_word_ratio": 0.003355189925059676, "rps_doc_unigram_entropy": 6.597452163696289, "rps_doc_word_count": 7424, "rps_doc_frac_chars_dupe_10grams": 0.037790119647979736, "rps_doc_frac_chars_dupe_5grams": 0.062366288155317307, "rps_doc_frac_chars_dupe_6grams": 0.045844338834285736, "rps_doc_frac_chars_dupe_7grams": 0.04235658049583435, "rps_doc_frac_chars_dupe_8grams": 0.037790119647979736, "rps_doc_frac_chars_dupe_9grams": 0.037790119647979736, "rps_doc_frac_chars_top_2gram": 0.0036855300422757864, "rps_doc_frac_chars_top_3gram": 0.0015820800326764584, "rps_doc_frac_chars_top_4gram": 0.0012944299960508943, "rps_doc_books_importance": -7915.61767578125, "rps_doc_books_importance_length_correction": -7915.61767578125, "rps_doc_openwebtext_importance": -4122.7705078125, "rps_doc_openwebtext_importance_length_correction": -4122.7705078125, "rps_doc_wikipedia_importance": -2391.46142578125, "rps_doc_wikipedia_importance_length_correction": -2391.46142578125 }, "fasttext": { "dclm": 0.04559588059782982, "english": 0.6670694947242737, "fineweb_edu_approx": 1.5704904794692993, "eai_general_math": 0.03033537045121193, "eai_open_web_math": 0.12462478876113892, "eai_web_code": 0.1475132703781128 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "794.8", "labels": { "level_1": "Arts", "level_2": "Amusements and Recreation", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "1", "label": "Leftover HTML" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "16", "label": "Personal Blog" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
-4,606,998,742,853,392,000
Perl 6 - the future is here, just unevenly distributed IRC log for #shibboleth, 2013-11-08 | Channels | #shibboleth index | Today | | Search | Google Search | Plain-Text | summary All times shown according to UTC. Time Nick Message 16:08 jmelek joined ##shibboleth 16:09 jmelek pdurbin: fixed ! looks he is out! 16:09 jmelek unfortunatly I have only 10 minutes before to leave work! 16:10 pdurbin ! 16:10 pdurbin jmelek: I hope you type fast ;) 16:11 jmelek haha hope so too! or we can catch up later ? 16:11 pdurbin jmelek: up to you 16:11 pdurbin jmelek: don't mind us. jmelek and I want to talk about OIOSAML: http://digitaliser.dk/forum/2526560 :) 16:11 jmelek pdurbin: let's say tonight better! this way we can talk about the issue out our aise! 16:12 jmelek pdurbin: will make a sign here when I connet! really thanks for the ping! 16:13 pdurbin jmelek: I'm always here but not always awake :) 16:13 jmelek pdurbin: let me check before, what time zone?? 16:13 jmelek :) 16:13 pdurbin cymor: whoops. that was supposed to be for you... "don't mind us" :) 16:13 pdurbin jmelek: I'm in the New York time zone 16:13 pdurbin though I live in Boston 16:13 pdurbin "Yankees Suck!" ;) 16:14 jmelek pdurbin: awtch :D I'm from tunisia 16:14 jmelek but it can work for you I think! I mean by night for me with is after noon 16:14 jmelek for you! 16:15 pdurbin jmelek: we'll figure it out :) 16:15 cymor :-) 16:16 jmelek pdurbin: really thanks! Sorry but I need to go otherwise I will miss my train!! 16:16 pdurbin jmelek: don't miss your train 16:16 pdurbin :) 16:17 jmelek pdurbin: yeahh! okey so!! talk to you later :) prepare coffee I had some intresting changes at the work and oiosaml integration :D 16:18 jmelek bye all! 16:20 pdurbin mmm, coffee 20:27 jmelek joined ##shibboleth 20:28 jmelek hey pdurbin 20:29 pdurbin jmelek: hey 20:31 jmelek pdurbin: so here we go :) 20:31 jmelek pdurbin: I don't know if I presented enough the situation but I'm working on having oiosaml.java as a SP for Jira 20:32 jmelek pdurbin: our client hava pingFederate as IdP and he asked us how he can put his JIra online 20:33 jmelek pdurbin: problem! for the moment following all the steps of oiosaml.java installation didn't give a good result! every url requested return a blank page 20:34 pdurbin :( 20:34 jmelek pdurbin: but I could have some thing after removinf the filter (LoginFIlter) 20:35 jmelek pdurbin: looks like jira have a conflict with its own filters! 20:36 pdurbin I added some filters here: https://github.com/pdurbin/oiosaml_on_​glassfish/blob/master/oiosaml_on_glass​fish/src/main/webapp/WEB-INF/web.xml 20:36 pdurbin below <!-- OIOSAML --> 20:36 jmelek ow cool! let me have a quick look! 20:36 jmelek like you customized the SP filter?! 20:38 pdurbin jmelek: well, it's mostly copied from https://svn.softwareborsen.dk/oiosaml​.java/sp/trunk/docs/installation.html but I did add the <url-pattern>/faces/saml.xhtml</url-pattern> bit 20:39 jmelek pdurbin: yeahh I can see that! you didn't remove the SPFIlter class! 20:40 jmelek pdurbin: Actually I think I need to investigate the last part of this doc https://svn.softwareborsen.dk/oiosam​l.java/sp/trunk/docs/developers.html , I need to create a special filter that Jira can hundle! 20:40 pdurbin ok 20:41 jmelek pdurbin: actually JIra have it's own authentification system called seraph 20:41 pdurbin ok. never heard of it 20:42 jmelek It's a kinf of "big filter" that get the user request to redirect them later! 20:42 pdurbin ok 20:42 jmelek pdurbin: other question! I saw you tried many IDP for the metadata, but how could you make that without SP metadata file? 20:43 jmelek pdurbin: for example I will test my app with Testshib but it requiere to register with an SPmetadata, I couldn't generate that, at least with the /configure link as said in the documentation :( 20:43 pdurbin jmelek: I'm not sure what you mean. I start with the IdP metadata file, which I use to configure OIOSAML. Then I tell the IdP where to download my SP metadata, such as https://dvn-alpha.hmdc.har​vard.edu/dvn/saml/metadata 20:45 jmelek euhmm 20:45 jmelek but if I'm not wrong the get the IdP metadata file, you need an SP metadata file nop?! 20:46 pdurbin hmm. not sure. I always start with the IdP metadata file.... and then configure OIOSAML 20:46 jmelek pdurbin: euhm!! good to know ! Maybe I understood the thing in the wrong way! 20:48 pdurbin it's confusing. I'm confused :) 20:48 pdurbin cymor: explain it to us ;) 20:49 jmelek pdurbin: honestly yes!! I thought it was less complicated! but every day I get confused more and more !! 20:49 pdurbin heh 20:49 cymor I have no idea. 20:50 pdurbin jmelek: do you know about https://addons.mozilla.org/en-​US/firefox/addon/saml-tracer/ ? 20:50 jmelek :D 20:50 jmelek pdurbin: yes yes! already installed it :) 20:51 jmelek pdurbin: saw you tried many versions for oiosaml.java 20:51 pdurbin many many 20:51 jmelek :D 20:52 jmelek pdurbin: what's the one that worked with you! 20:52 jmelek I've tried 9918 as the stable one but honestly It was a total mess = no logs, some jar created problems with jira ... 20:53 jmelek the 11330 is for the moment the one I work with! 20:54 pdurbin jmelek: this version: https://github.com/pdurbin/oiosaml_on_g​lassfish/tree/master/oiosaml_on_glassfi​sh/local_lib/dk/itst/oiosaml.java/8501 20:54 pdurbin (8501) 20:56 jmelek pdurbin: I will give it a try this weekend! ps: I need to update your question in the forum , actually the problem was the path to the file! with the default one it add a ./ in the path I needed to add the exact path in the oiosaml properties file :) 20:57 pdurbin jmelek: yes, if you would mention this chat it would be very helpful. the link is http://irclog.perlgeek.de/shibboleth/2013-11-08 20:57 jmelek okey no problem! 21:00 pdurbin jmelek: have a nice weekend 21:00 jmelek thanks :) 21:00 jmelek same for you 21:07 jmelek left ##shibboleth | Channels | #shibboleth index | Today | | Search | Google Search | Plain-Text | summary
{ "url": "http://irclog.perlgeek.de/shibboleth/2013-11-08", "source_domain": "irclog.perlgeek.de", "snapshot_id": "crawl=CC-MAIN-2017-13", "warc_metadata": { "Content-Length": "28958", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:6XJPMPAB3CWEMKMQZIP7IRVBKTJWU5XH", "WARC-Concurrent-To": "<urn:uuid:c6f309d9-b7af-40ae-9522-5e5520a961a2>", "WARC-Date": "2017-03-28T20:04:27Z", "WARC-IP-Address": "213.95.21.23", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:E22L5RPZ36XVQWU7A2YQXPKM5K24HNLT", "WARC-Record-ID": "<urn:uuid:5ae5f791-0f34-4076-8c38-4b6a5cf123e9>", "WARC-Target-URI": "http://irclog.perlgeek.de/shibboleth/2013-11-08", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e7e575ec-2200-415c-a6df-651e6b44afda>" }, "warc_info": "robots: classic\r\nhostname: ip-10-233-31-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-13\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for March 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }
{ "line_start_idx": [ 0, 55, 56, 92, 93, 182, 183, 217, 218, 236, 269, 316, 387, 403, 449, 507, 539, 656, 755, 842, 904, 964, 980, 1063, 1115, 1153, 1186, 1234, 1322, 1344, 1389, 1405, 1498, 1542, 1559, 1703, 1725, 1751, 1784, 1809, 1835, 1874, 2001, 2106, 2272, 2289, 2379, 2455, 2611, 2648, 2696, 2745, 2940, 3022, 3241, 3258, 3346, 3382, 3473, 3490, 3625, 3832, 4068, 4087, 4187, 4289, 4380, 4426, 4467, 4585, 4603, 4631, 4734, 4750, 4805, 4872, 4896, 4912, 4971, 5102, 5164, 5319, 5340, 5604, 5748, 5778, 5820, 5843, 5869, 5900, 5901 ], "line_end_idx": [ 55, 56, 92, 93, 182, 183, 217, 218, 236, 269, 316, 387, 403, 449, 507, 539, 656, 755, 842, 904, 964, 980, 1063, 1115, 1153, 1186, 1234, 1322, 1344, 1389, 1405, 1498, 1542, 1559, 1703, 1725, 1751, 1784, 1809, 1835, 1874, 2001, 2106, 2272, 2289, 2379, 2455, 2611, 2648, 2696, 2745, 2940, 3022, 3241, 3258, 3346, 3382, 3473, 3490, 3625, 3832, 4068, 4087, 4187, 4289, 4380, 4426, 4467, 4585, 4603, 4631, 4734, 4750, 4805, 4872, 4896, 4912, 4971, 5102, 5164, 5319, 5340, 5604, 5748, 5778, 5820, 5843, 5869, 5900, 5901, 5989 ] }
{ "red_pajama_v2": { "ccnet_original_length": 5989, "ccnet_original_nlines": 90, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 1, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.26920509338378906, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04074816033244133, "rps_doc_frac_lines_end_with_ellipsis": 0.010989010334014893, "rps_doc_frac_no_alph_words": 0.36673346161842346, "rps_doc_frac_unique_words": 0.39675676822662354, "rps_doc_mean_word_length": 4.941621780395508, "rps_doc_num_sentences": 86, "rps_doc_symbol_to_word_ratio": 0.008016030304133892, "rps_doc_unigram_entropy": 5.2137346267700195, "rps_doc_word_count": 925, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.0389411486685276, "rps_doc_frac_chars_dupe_6grams": 0.0389411486685276, "rps_doc_frac_chars_dupe_7grams": 0.027127539739012718, "rps_doc_frac_chars_dupe_8grams": 0.027127539739012718, "rps_doc_frac_chars_dupe_9grams": 0.027127539739012718, "rps_doc_frac_chars_top_2gram": 0.06825640052556992, "rps_doc_frac_chars_top_3gram": 0.006125569809228182, "rps_doc_frac_chars_top_4gram": 0.01181360986083746, "rps_doc_books_importance": -774.6107177734375, "rps_doc_books_importance_length_correction": -774.6107177734375, "rps_doc_openwebtext_importance": -420.1614074707031, "rps_doc_openwebtext_importance_length_correction": -420.1614074707031, "rps_doc_wikipedia_importance": -292.3377990722656, "rps_doc_wikipedia_importance_length_correction": -292.3377990722656 }, "fasttext": { "dclm": 0.05070418119430542, "english": 0.8074172139167786, "fineweb_edu_approx": 0.8945072293281555, "eai_general_math": 0.3502645492553711, "eai_open_web_math": 0.3397819995880127, "eai_web_code": 0.059540629386901855 } }
{ "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": "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": "18", "label": "Q&A Forum" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }
ece34605c058195ed03b4d393ef1a36c
-1,609,462,496,109,020,400
Patch:Vorticon Elite From KeenWiki Jump to: navigation, search Vorticon Elites are extremely dangerous enemies found in Keen 2. This page lists patches relating to these sprites. It is divided into sections relating to the various sprite properties the patches involve. Being fluent with various sprite patch pages will help when working with these patches. This page includes patches relating to the elite's shot, which is also the same as the Guard Robot's. This means any patches affecting it will affect the Guard Robot also. Sprite Type Elites use sprite type 4, which means they are deadly to touch. This not only affects Keen, but the orange enemy shot also respond to it. Changing the Elite's type will make it so that the orange shot hits it (Meaning it can't shoot well.) The 'enemy shot' is the projectile the elite (And Guard Robot) shoot. Keen 2 #Elite sprite type: %patch $3CB9 $04 #Elite %patch $7648 $0B #Enemy shot Sprite Behavior The Elite has three behaviors. The first, and most complex is to walk towards Keen, occasionally jumping or shooting him. The elite will not jump however if the lights are off. The second behavior is to create a shot, then resume walking. The third behavior is to slide along the ground, turning when hitting walls, and afterwards returning to walking. Note that altering the orange shot will also affect the shots of the Guard Robot. Behaviors: $40CEW #Run, jump, seek Keen $41C2W #Shoot $423CW #Slide back and forth along the ground $4283W #Elite collision When spawned #Run, jump, seek Keen %patch $3CDC {$40CEW} In level %patch $4121 {$423CW} #Slide (Randomly when walking) %patch $418A {$41C2W} #Shoot (Randomly when walking) %patch $41BD {$423CW} #Slide (When landing after jumping) %patch $4237 {$40CEW} #Run, jump, seek Keen (After shooting) %patch $4266 {$40CEW} #Run, jump, seek Keen (After sliding) %patch $766C {$7567W} #Orange shot behavior %patch $7677 {$775FW} #Orange shot collision Elite jumping frequency This patch controls how often the Elite jumps. By default the Elite's frequency depends on a general 'difficulty variable' with value 6. This patch creates a new variable for the Elite to use which can be customized. (Here a lower value results in less jumping.) Elite jumping frequency #Elite jumping frequency %patch $4100 $212CW %patch $198AC [$0006W] Elite jumps in the dark This patch allows the Elite to continue jumping 'in the dark' (When the lights have been turned off.) Elite jumps in the dark #Elite jumps in the dark %patch $410D $90 $90 Elite stands\crouches instead of jumping This patch turns the Elite's jump into a 'freezing' which can be used to make it stand still or crouch (Ducking under shots.) The first line stops the Elite moving. On the second line is the 'timer'; when this reaches $0040W the Elite will stop. On the third line the Elite's action is set back to 'walking' and its speed to $0064W. (Walk right.) Elite stands\crouches instead of jumping #Elite crouches instead of jumping %patch $410F $A1 $0002W $A3 $96EAW $A3 $96E0W %patch $425B $A1 $96EAW $03 $06 $5AF0W $A3 $96EAW $3D [$0040W] $7E $0C $C7 $06 $96F2W {$40CEW} $C7 $06 $96E0W [$0064W] $5E $5D $C3 Complete Elite jumping behavior This is the complete code for the Elite's jumping behavior. It is relatively simple. On the first line the Elite's direction is checked and one of two animations chosen. (Left or right.) $E8 $1814W $E8 $1854W calls tile collision and gravity; replacing the first part with $90 $90 $90 will make the Elite 'ghost' through tiles, replacing the second part will stop it falling. One line 3 the tile checks begin. If the Elite touches a floor it changes to its 'walking' behavior while touching walls makes it change its direction to move away ('bounce off') from them. Complete Elite jumping behavior #Complete Elite jumping behavior %patch $423C $55 $8B $EC $56 $83 $3E $96E0W $00 $7E $08 $C7 $06 $96E8W [$0064W] $EB $06 $C7 $06 $96E8W [$0063W] $E8 $1814W $E8 $1854W $8B $F0 $A9 $02 $00 $74 $06 $C7 $06 $96F2W {$40CEW} $F7 $C6 $04 $00 $74 $06 $C7 $06 $96E0W [$FF9CW] $F7 $C6 $01 $00 $74 $06 $C7 $06 $96E0W [$0064W] $5E $5D $C3 Elite doesn't jump OR shoot in the dark This patch stops the Elites from jumping OR shooting Keen whenever the lights are off. This makes them considerably less of a threat when this happens. The second version of this patch is compatible with the 'custom jump frequency' patch given above. Elite doesn't jump OR shoot in the dark #Elite doesn't jump OR shoot in the dark %patch $40FB $83 $3E $96BEW $00 $74 $21 $E8 $76E1W $8B $16 $5AF0W $D1 $E2 $3B $C2 $73 $16 #Elite doesn't jump OR shoot in the dark - custom jumping frequency %patch $198AC [$0006W] %patch $40FB $83 $3E $96BEW $00 $74 $21 $E8 $76E1W $8B $16 $212CW $D1 $E2 $3B $C2 $73 $16 Elite doesn't shoot This patch stops the Elites from ever shooting Keen. Elites don't shoot #Elites don't shoot %patch $4184 $EB Elite shooting duration This patch controls how long the Elite spends shooting. The first value is how long into the shooting behavior the Elite produces a shot while the second value is how long the shooting behavior lasts. (By default the first is one half of the second.) Elites don't shoot #Elite shooting timing %patch $41E6 [$001EW] {$7C} #Make shot here %patch $41E6 [$32] {$7E} #Return to walking here Complete Elite shooting behavior This is the complete code for the Elite's shooting behavior. On the first line the Elite's direction is checked and one of two animations chosen. (Left or right.) The Elite doesn't respond to gravity or tiles while shooting. One line 3 the Elite's timer is checked. If this is greater than $1E then the Elite will continue, otherwise it skips to the end of the code. After this is a second check is made to see how many shots the Elite has made. If it has made 0 then it will run the 'make shot' code, otherwise it skips to the end of line 7 (The second timer check.) The first thing the 'make shot' code does is to set the Elite's shots made to 1. It then plays sound $26. Line 5 is a direction check that tweaks the shot's horizontal position. Line 6 sets the shot's vertical position relative to the shooter. At the end of line 7 a second timer check is made; if the Elite's timer is larger than $32 it sets its action to $40CEW or 'walking'. Complete Vorticon Elite shooting code #Vorticon Elite shooting code %patch $41C2 $55 $8B $EC $56 $83 $3E $96E0W $00 $7D $08 $C7 $06 $96E8W [$0060W] $EB $06 $C7 $06 $96E8W [$0061W] $A1 $96EAW $03 $06 $F0 $5A $A3 $96EAW $3D [$001EW] $7C $4F $83 $3E {$96ECW} [$00] {$75} $3B $C7 $06 {$96ECW} [$0001W] $B8 [$0026W] $50 $E8 $740DW $44 $44 $BE $5E $01 $83 $3E $96E0W $00 $7D $03 $BE $A2 $FE $56 $A1 $96CAW $8B $16 $96C8W $81 $C2 [$FF00W] $15 [$FFFFW] $50 $52 $FF $36 $96C6W $FF $36 $96C4W $E8 $3414W $83 $C4 $0A $83 $3E $96EAW [$32] {$7E} $06 $C7 $06 $96F2W {$40CEW} $5E $5D $C3 Speed and Jump Height The default speed of Elites is +-100 when walking. They will head towards Keen when spawned by default. The Elite will double its speed in a 'charge' towards Keen if Keen is level with it. Elites can jump as high as the Vorticon. Note that altering the Elite's shot speed will not change the speed of the Guard Robot's shot. This aspect of the shot is different for both sprites. Starting speeds %patch $3D06 [$0064W] #If left of Keen (Move right) %patch $3CFF [$FF9CW] #If right of Keen (Move left) In level #When walking\jumping %patch $4150 [$00C8W] #Charging speed l/r (If Keen is level with Elite) %patch $4158 [$0064W] #Walking speed l/r (If Keen is above\below Elite) %patch $4110 [$012CW] #Jump height #Orange shot %patch $4201 [$015EW] #Right %patch $420B [$FEA2W] #Left Sprite Collision Elites interact with Keen's shots. This produces a shot Elite. (See behavior section.) The shot Elite also resets its collision and behavior, the new collision, used for most dead sprites ignores all other sprites, the new behavior likewise is just 'fall an animate' The Elite's shot specifically isn't destroyed by three sprites, the Elite itself, the Guard Robot and the Tantalus ray. This is to stop 'friendly fire' Elite %patch $3CE1 {$4283W} #Elite collision %patch $428E $3F $0A #Elite killed by Keen's shot %patch $42BC {$75FCW} #Dead Elite behavior %patch $42B7 {$61A2W} #Dead Elite collision #Orange shot %patch $7677 {$775FW} #Orange shot collision %patch $776B $3D $06 #Enemy shot ISN'T destroyed by Robot %patch $7770 $3D $0D #Enemy shot ISN'T destroyed by Tantalus %patch $7775 $3D $04 #Enemy shot ISN'T destroyed by Elite Elite strength This is the number of shots minus one needed to kill the Elite. By default it is 3. Elite strength #Elite strength %patch $3CE6 [$0002W] Animations The Elite has four animation cycles, a four frame walking cycle, a two frame dying cycle and two one-frame shooting and sliding cycles When spawned %patch $3D0B [$0058W] #Start In level %patch $40DD [$005CW] #Walking right %patch $40E5 [$0058W] #Walking left %patch $40EF $03 #Frames used -1 %patch $40EB $04 #Animation speed %patch $41D1 [$0060W] #Shooting right %patch $41D9 [$0061W] #Shooting left %patch $424B [$0062W] #Walking right %patch $4253 [$0063W] #Walking left %patch $42B2 [$0064W] #Shot %patch $42AD $02 #Frames used, not -1
{ "url": "https://keenwiki.shikadi.net/wiki/Patch:Vorticon_Elite", "source_domain": "keenwiki.shikadi.net", "snapshot_id": "crawl=CC-MAIN-2021-17", "warc_metadata": { "Content-Length": "50425", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:JZSCCPF5SIHTAQPGNIM342NF7UEMEPWG", "WARC-Concurrent-To": "<urn:uuid:bdff0a38-a208-4509-936c-8ebd8b0ce6f6>", "WARC-Date": "2021-04-21T11:33:44Z", "WARC-IP-Address": "18.221.233.101", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:VRK7NGVSAHO6FKPOSMZXS4VTU5EPJJHN", "WARC-Record-ID": "<urn:uuid:e631caaf-7909-403e-991c-51d48c457052>", "WARC-Target-URI": "https://keenwiki.shikadi.net/wiki/Patch:Vorticon_Elite", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:b82d6bcd-e6d3-4676-aa38-63f8e61450c9>" }, "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-253.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 21, 22, 36, 64, 65, 360, 361, 533, 534, 535, 547, 548, 858, 859, 866, 867, 887, 911, 940, 941, 942, 958, 959, 1312, 1313, 1395, 1396, 1407, 1436, 1450, 1496, 1520, 1521, 1534, 1535, 1557, 1579, 1580, 1589, 1590, 1643, 1696, 1754, 1815, 1875, 1876, 1920, 1965, 1966, 1967, 1991, 1992, 2255, 2256, 2280, 2281, 2306, 2327, 2350, 2351, 2352, 2376, 2377, 2479, 2480, 2504, 2505, 2530, 2551, 2552, 2553, 2594, 2595, 2942, 2943, 2984, 2985, 3020, 3068, 3147, 3220, 3221, 3222, 3254, 3255, 3631, 3632, 3822, 3823, 3855, 3856, 3889, 3971, 4050, 4129, 4208, 4251, 4252, 4253, 4293, 4294, 4545, 4546, 4586, 4587, 4628, 4701, 4734, 4735, 4803, 4826, 4900, 4934, 4935, 4936, 4956, 4957, 5010, 5011, 5030, 5031, 5051, 5068, 5069, 5070, 5094, 5095, 5346, 5347, 5366, 5367, 5390, 5434, 5486, 5487, 5488, 5521, 5522, 5747, 5748, 6091, 6092, 6336, 6337, 6471, 6472, 6510, 6511, 6541, 6623, 6702, 6787, 6870, 6947, 7027, 7108, 7163, 7164, 7165, 7187, 7188, 7418, 7419, 7569, 7570, 7586, 7587, 7639, 7691, 7692, 7701, 7702, 7724, 7796, 7868, 7869, 7904, 7905, 7918, 7947, 7975, 7976, 7977, 7994, 7995, 8262, 8263, 8415, 8416, 8422, 8423, 8464, 8515, 8516, 8561, 8607, 8608, 8621, 8667, 8725, 8786, 8844, 8845, 8846, 8861, 8862, 8946, 8947, 8962, 8963, 8979, 9001, 9002, 9003, 9014, 9015, 9150, 9151, 9164, 9165, 9194, 9195, 9204, 9205, 9242, 9278, 9314, 9351, 9352, 9390, 9427, 9428, 9465, 9501, 9502, 9530 ], "line_end_idx": [ 21, 22, 36, 64, 65, 360, 361, 533, 534, 535, 547, 548, 858, 859, 866, 867, 887, 911, 940, 941, 942, 958, 959, 1312, 1313, 1395, 1396, 1407, 1436, 1450, 1496, 1520, 1521, 1534, 1535, 1557, 1579, 1580, 1589, 1590, 1643, 1696, 1754, 1815, 1875, 1876, 1920, 1965, 1966, 1967, 1991, 1992, 2255, 2256, 2280, 2281, 2306, 2327, 2350, 2351, 2352, 2376, 2377, 2479, 2480, 2504, 2505, 2530, 2551, 2552, 2553, 2594, 2595, 2942, 2943, 2984, 2985, 3020, 3068, 3147, 3220, 3221, 3222, 3254, 3255, 3631, 3632, 3822, 3823, 3855, 3856, 3889, 3971, 4050, 4129, 4208, 4251, 4252, 4253, 4293, 4294, 4545, 4546, 4586, 4587, 4628, 4701, 4734, 4735, 4803, 4826, 4900, 4934, 4935, 4936, 4956, 4957, 5010, 5011, 5030, 5031, 5051, 5068, 5069, 5070, 5094, 5095, 5346, 5347, 5366, 5367, 5390, 5434, 5486, 5487, 5488, 5521, 5522, 5747, 5748, 6091, 6092, 6336, 6337, 6471, 6472, 6510, 6511, 6541, 6623, 6702, 6787, 6870, 6947, 7027, 7108, 7163, 7164, 7165, 7187, 7188, 7418, 7419, 7569, 7570, 7586, 7587, 7639, 7691, 7692, 7701, 7702, 7724, 7796, 7868, 7869, 7904, 7905, 7918, 7947, 7975, 7976, 7977, 7994, 7995, 8262, 8263, 8415, 8416, 8422, 8423, 8464, 8515, 8516, 8561, 8607, 8608, 8621, 8667, 8725, 8786, 8844, 8845, 8846, 8861, 8862, 8946, 8947, 8962, 8963, 8979, 9001, 9002, 9003, 9014, 9015, 9150, 9151, 9164, 9165, 9194, 9195, 9204, 9205, 9242, 9278, 9314, 9351, 9352, 9390, 9427, 9428, 9465, 9501, 9502, 9530, 9570 ] }
{ "red_pajama_v2": { "ccnet_original_length": 9570, "ccnet_original_nlines": 236, "rps_doc_curly_bracket": 0.004388710018247366, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.21084336936473846, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.10456109791994095, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.3541308045387268, "rps_doc_frac_unique_words": 0.2932235598564148, "rps_doc_mean_word_length": 4.343255043029785, "rps_doc_num_sentences": 66, "rps_doc_symbol_to_word_ratio": 0.02409639023244381, "rps_doc_unigram_entropy": 5.3732757568359375, "rps_doc_word_count": 1579, "rps_doc_frac_chars_dupe_10grams": 0.033245839178562164, "rps_doc_frac_chars_dupe_5grams": 0.1704578548669815, "rps_doc_frac_chars_dupe_6grams": 0.1151939332485199, "rps_doc_frac_chars_dupe_7grams": 0.0873432531952858, "rps_doc_frac_chars_dupe_8grams": 0.07392825931310654, "rps_doc_frac_chars_dupe_9grams": 0.04520267993211746, "rps_doc_frac_chars_top_2gram": 0.02216389961540699, "rps_doc_frac_chars_top_3gram": 0.01049869041889906, "rps_doc_frac_chars_top_4gram": 0.008748910389840603, "rps_doc_books_importance": -1096.7215576171875, "rps_doc_books_importance_length_correction": -1096.7215576171875, "rps_doc_openwebtext_importance": -651.2621459960938, "rps_doc_openwebtext_importance_length_correction": -651.2621459960938, "rps_doc_wikipedia_importance": -584.9032592773438, "rps_doc_wikipedia_importance_length_correction": -584.9032592773438 }, "fasttext": { "dclm": 0.40741533041000366, "english": 0.8826637268066406, "fineweb_edu_approx": 2.3636536598205566, "eai_general_math": 0.1368556022644043, "eai_open_web_math": 0.20859479904174805, "eai_web_code": 0.0712081789970398 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "794.8", "labels": { "level_1": "Arts", "level_2": "Amusements and Recreation", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "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": "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" } } }
ece34605c058195ed03b4d393ef1a36c
2,775,727,846,657,577,000
Java-Gaming.org Hi ! Featured games (85) games approved by the League of Dukes Games in Showcase (611) Games in Android Showcase (172) games submitted by our members Games in WIP (657) games currently in development News: Read the Java Gaming Resources, or peek at the official Java tutorials       Home     Help   Search   Login   Register    Pages: [1] 2   ignore  |  Print     Some newbies questions about JME...  (Read 23031 times) 0 Members and 1 Guest are viewing this topic. Offline gouessej « Posted 2008-11-12 23:58:41 » Hi! I seriously plan to use JME for my own FPS called TUER. As you may know, for the moment, I use my own engine. I consider that my scientific investigations and experimentations will end in some months and it will be the time to switch to a true engine. I have some questions for you all : - Is it still maintained? - Is it already possible to use it with JOGL rather than LWJGL? If yes, is it easily possible to modify the text rendering to use my own bug fixes for JOGL (in TextRenderer.java)? - Is it possible to use JME without JOAL (for example, is it possible to use only JavaSound, JOGG and JORBIS for the sound support)? - Is it possible to use JME on low end machines (for example under OpenGL 1.3 with an ATI Radeon 7500 or a Geforce 1)? - Does it work fine under Solaris? - Does it work fine with the OpenJDK? Kaffe? GNU Classpath? - JME is a scenegraph too, does it use a cells-and-portals algorithm? If not, is it possible to modify it so that it uses an implementation of it? - Does JME contain a system of computation of geographic modifications like the engine of Red Faction 2 (you can break almost all walls, etc...)? - What kind of spatial subdivisions are available with it? - Does JME provide graphical hardware accelerated components? If not, is it possible to use it with FengGUI or Slick? - Does the JME team need a financial help? - The geometry of my FPS is really extremely simple. If I switch to JME, do I have a chance to get a better frame rate if I use it correctly? - Does JME include anything that helps to write online games? If not, has someone tried to use it with JGN or Project Darkstar? I'm sorry, I ask you a lot of questions. I have looked for answers but some people told me some contradictory things, I don't know what to think Sad For example, someone told me that it is possible to use JME with JOGL but it is written in the introduction : "Currently, LWJGL is supported with plans for JOGL support in the near future.". Thank you for reading. Offline gouessej « Reply #1 - Posted 2008-11-13 06:52:11 » I have some other questions: - Does gimbal lock occur with JME? - Is it possible to use only Java for keyboard and mouse handling and not JInput? Offline kevglass « JGO Spiffy Duke » Medals: 272 Projects: 25 Exp: 18 years Coder, Trainee Pixel Artist, Game Reviewer « Reply #2 - Posted 2008-11-13 08:45:24 » From my recent foray into JME.. Quote - Is it still maintained? Yes, the majority of the original authors have moved on but new maintainers have stepped up. Quote - Is it already possible to use it with JOGL rather than LWJGL? If yes, is it easily possible to modify the text rendering to use my own bug fixes for JOGL (in TextRenderer.java)? Yes, in JME 2 there is a JOGL renderer. However, the text rendering in JME doesn't rely on JOGL's text renderer. JME's LWJGL is also more tried and tested than the JOGL one. Not sure how many people have tried to use the JOGL renderer in JME. Quote - Is it possible to use JME without JOAL (for example, is it possible to use only JavaSound, JOGG and JORBIS for the sound support)? I believe so, but there's no plugin's for their sound system to use anything other than OpenAL via LWJGL last time I checked. Quote - Is it possible to use JME on low end machines (for example under OpenGL 1.3 with an ATI Radeon 7500 or a Geforce 1)? Yes, as you can imagine rendering would be limited but the renderer in JME2 attempts to not use things that arn't supported  - for instance, shaders are ignored where shaders arn't supported. Quote - JME is a scenegraph too, does it use a cells-and-portals algorithm? If not, is it possible to modify it so that it uses an implementation of it? It doesn't but you could. Quote - Does JME contain a system of computation of geographic modifications like the engine of Red Faction 2 (you can break almost all walls, etc...)? No. Quote - What kind of spatial subdivisions are available with it? Not quite sure what you're looking for here. The scene is culled using bounding shapes which are hieachial based on the scenegraph. The terrain renderer has some quad tree based stuff in it. I think the approach is general to add the subdivision based on the type of thing being renderer - but you'd need an original author to tell you that for sure. Quote - Does it work fine under Solaris? - Does it work fine with the OpenJDK? Kaffe? GNU Classpath? No idea. LWJGL works under SolarisX86 now I think. The other JDKs as long as they're compatible with core Java they should work right? Quote - Does JME provide graphical hardware accelerated components? If not, is it possible to use it with FengGUI or Slick? It has a series of different GUIs implemented for it. I've used FengGUI, BUI, Slick and Thingle on top of JME in different projects, all of which have been fine to work with. Quote - Does the JME team need a financial help? They're an open source collective so probably not. Everyone likes to have some cash to spend on things for the project though so I guess they'd like donations. Quote - The geometry of my FPS is really extremely simple. If I switch to JME, do I have a chance to get a better frame rate if I use it correctly? Depends how efficient the original implementation was. A highly tuned custom system for a game nearly always out performs a more generic library approach. You sacrifice performance for ease of development. However, if the developers of the library no a bit more about rendering then they might just surprise the author. Quote - Does JME include anything that helps to write online games? If not, has someone tried to use it with JGN or Project Darkstar? No, but JGN provides some great integration tools and has been used to write several multiplayer games with JME. Project Darkstar doesn't provide anything directly related to JME but again has been used to produce several impressive demos with it. Quote - Does gimbal lock occur with JME? Don't think so, Quats all the way. Quote - Is it possible to use only Java for keyboard and mouse handling and not JInput? Not sure about this, I guess they depend on LWJGL's input routines. You'd be better to post this at the JME forums though, very active place with lots of users ready to answer. Kev Games published by our own members! Check 'em out! Legends of Yore - The Casual Retro Roguelike Offline gouessej « Reply #3 - Posted 2008-11-13 11:53:17 » Yes, the majority of the original authors have moved on but new maintainers have stepped up. It doesn't reassure me  Sad Yes, in JME 2 there is a JOGL renderer. However, the text rendering in JME doesn't rely on JOGL's text renderer. JME's LWJGL is also more tried and tested than the JOGL one. Not sure how many people have tried to use the JOGL renderer in JME. Some JME users told me that the JOGL renderer is no more really maintained, I will have to do something. Yes, as you can imagine rendering would be limited but the renderer in JME2 attempts to not use things that arn't supported  - for instance, shaders are ignored where shaders arn't supported. Are VBO ignored if not supported? The other JDKs as long as they're compatible with core Java they should work right? TUER crashes under OpenJDK, I don't know why, that's why I asked it. Don't think so, Quats all the way. It is not the title of the next James Bond but I often say THE QUATERNIONS ARE NOT ENOUGH!!!!!!!!!!. Quaternions must be used with non eulerian transforms to avoid gimbal lock. You'd be better to post this at the JME forums though, very active place with lots of users ready to answer. You're right. Thank you for your precise answers, you helped me a lot. Offline gouessej « Reply #4 - Posted 2008-11-13 22:40:34 »  Angry I spent some hours to repair the first test application for the JOGL canvas in JME. The JOGL renderer seems to be absolutely not maintained  Sad Offline erikd JGO Ninja Medals: 16 Projects: 4 Exp: 14 years Maximumisness « Reply #5 - Posted 2008-11-14 10:40:28 » Why not use LWJGL then? When you use a library like JME, the OpenGL binding is no big deal as you typically don't use it directly. Just use the one that works best. Offline kevglass « JGO Spiffy Duke » Medals: 272 Projects: 25 Exp: 18 years Coder, Trainee Pixel Artist, Game Reviewer « Reply #6 - Posted 2008-11-14 11:10:41 » Are you sure you're using JME2 not JME1? The JOGL renderer in JME2 seemed to be functioning correct a few months ago. Kev Offline gouessej « Reply #7 - Posted 2008-11-14 12:06:51 » Are you sure you're using JME2 not JME1? The JOGL renderer in JME2 seemed to be functioning correct a few months ago. Kev Yes JME 2. It worked fine only if you have a recent graphics card. Lots of try/catch clauses were missing to handle the case your graphics card has no shader for example, I modified JOGLContextCapabilities. Why not use LWJGL then? When you use a library like JME, the OpenGL binding is no big deal as you typically don't use it directly. Just use the one that works best. I just want to use the OpenGL binding that works the best on my view, that is the most reliable, JOGL, what else? JOGL must work reliably inside JME, a few people try to use it, it cannot stay no more maintained. A JOGL renderer that doesn't work is useless in JME. Nevertheless, you're right about the fact it is not important because you rarely use it directly in JME except when you want to add new features in it, that is my case, I want to add some results of my experiments into JME. When I tested plenty of games for the first version of the Java game tome, I had more problems with games using LWJGL than games using JOGL even proportionally. I don't trust LWJGL, I would have never planned to use JME if there was no JOGL renderer. You know I have used JOGL for more than 2 years, I have no reason to use LWJGL now, I don't see any advantage to do it, I see some drawbacks as I'm not sure LWJGL works fine under Solaris 32 and 64 bits. Offline princec « JGO Spiffy Duke » Medals: 567 Projects: 3 Exp: 16 years Eh? Who? What? ... Me? « Reply #8 - Posted 2008-11-14 12:16:51 » I'd urge you to stick with LWJGL for JME... it's got a far, far longer track record of success, and nearly all commercially released Java games currently use LWJGL - for a good reason. Cas Smiley Offline erikd JGO Ninja Medals: 16 Projects: 4 Exp: 14 years Maximumisness « Reply #9 - Posted 2008-11-14 13:28:09 » LWJGL games that don't work is by and large the developer's fault, not LWJGL's (relying too much on specific videocard features and screenmodes and such). I think you won't have that problem with JME because (in my experience) they got LWJGL support right. Just try it. Games published by our own members! Check 'em out! Legends of Yore - The Casual Retro Roguelike Offline gouessej « Reply #10 - Posted 2008-11-14 15:38:18 » LWJGL games that don't work is by and large the developer's fault, not LWJGL's (relying too much on specific videocard features and screenmodes and such). Right, same problem with JOGLContextCapabilities in JME. I think you won't have that problem with JME because (in my experience) they got LWJGL support right. Just try it. They didn't have JOGL support right whereas I plan to use it. Why would I use LWJGL instead of JOGL? If I repaired the JOGL renderer, why would I use LWJGL? Offline erikd JGO Ninja Medals: 16 Projects: 4 Exp: 14 years Maximumisness « Reply #11 - Posted 2008-11-14 17:04:30 » They didn't have JOGL support right whereas I plan to use it. Why would I use LWJGL instead of JOGL? If I repaired the JOGL renderer, why would I use LWJGL? Depends on your goals I suppose. Do you want to create your game or work on the JOGL renderer? If it's the latter, then you made the right choice. Offline Matzon JGO Knight Medals: 19 Projects: 1 I'm gonna wring your pants! « Reply #12 - Posted 2008-11-14 20:02:12 » If you want to use JME then go for it. Choosing a renderer should be the least of your issues. Select the first one - if it works stay with it, if it doesn't choose another one. If none of them works, skip JME or fix something. Fixing a renderer when another one already works(?) is a noble idea, but not relevant if you want to *create* something in JME. Offline gouessej « Reply #13 - Posted 2008-11-14 21:42:22 » Depends on your goals I suppose. Do you want to create your game or work on the JOGL renderer? If it's the latter, then you made the right choice. I want to use JME for TUER that historically has used JOGL, I want to allow my game to go on working reliably with JME where it was already the case before I decided to use it, I estimate that JOGL was a good choice and I want to go on using it inside JME. Then, I admit it is not simple (it might become even very hard), I have to do the both tasks, repairing the JOGL renderer and using the engine for TUER (contributing to JME too  Grin). Offline Matzon JGO Knight Medals: 19 Projects: 1 I'm gonna wring your pants! « Reply #14 - Posted 2008-11-15 00:25:47 » I want to use JME for TUER that historically has used JOGL, I want to allow my game to go on working reliably with JME where it was already the case before I decided to use it Since you're going from a raw binding to a scene graph, why do you care what renderer you're running under? - as long as it works? Then, I admit it is not simple (it might become even very hard), I have to do the both tasks, repairing the JOGL renderer and using the engine for TUER (contributing to JME too  Grin). No, you have the option of not fixing the renderer... You seem to be fighting damn hard to avoid LWJGL and I fail to see why (if the objective is to get TUER running on JME)? Does it not work for you? Offline gouessej « Reply #15 - Posted 2008-11-15 09:24:00 » Since you're going from a raw binding to a scene graph, why do you care what renderer you're running under? - as long as it works? No, you have the option of not fixing the renderer... TUER has contained a kind of scenegraph for some months. I think that the reliability depends on the renderer used in JME too. You seem to be fighting damn hard to avoid LWJGL and I fail to see why (if the objective is to get TUER running on JME)? Does it not work for you? Honestly, I have rarely had problems with games using JME under Linux except with the game "Stardust" (that uses the LWJGL renderer), do you succeed in launching it? Does your graphics card support FBO? I really fear that my game works on less machines than before because of the use of LWJGL. Lots of people who use TUER are under Linux, some under Mac, a few under Solaris, some under ... AmigaOS ( Huh I don't know how they do), I don't want to "punish" people who don't own a recent graphics card and I don't want to take the risk of relying on another OpenGL binding whereas JOGL has proved to be very reliable. Therefore, I will fight damn hard to avoid changing the OpenGL binding used for TUER and to avoid using OpenAL. Watch this: Quote Exception in thread "main" java.lang.NoSuchMethodError: Method org.lwjgl.openal.AL10.alEnable(I)V is not declared as native Quote org.lwjgl.LWJGLException: Could not switch mode.         at org.lwjgl.opengl.LinuxDisplay.nSwitchDisplayMode(Native Method) http://lwjgl.org/forum/topics/on-missing-glut-functions/2483/view.html Quote Caused by: org.lwjgl.LWJGLException: No modes available         at org.lwjgl.opengl.LinuxDisplay.init(LinuxDisplay.java:560)         at org.lwjgl.opengl.Display.<clinit>(Display.java:111)         ... 2 more Sorry, I prefer JOGL (and avoid using the exclusive full screen mode). Offline sunsett Senior Devvie ribbit! « Reply #16 - Posted 2008-11-15 21:32:37 » If you're willing to do the work to fix the JOGL renderer then more power to you....I think all the jME devs will support such an endeavor and the only reason that more work hasn't been done is because we all feel more confident in the abilities of LWJGL and really have no reason to really care about JOGL. Offline gouessej « Reply #17 - Posted 2008-11-16 21:37:53 » If you're willing to do the work to fix the JOGL renderer then more power to you....I think all the jME devs will support such an endeavor and the only reason that more work hasn't been done is because we all feel more confident in the abilities of LWJGL and really have no reason to really care about JOGL. I have lots of reason to really care about JOGL unlike you. For the moment, none of my fixes have been included, maybe the JME team has been sleeping for some days lol. I've found a bug in StandardGame!!! When you select JOGL in the settings, your renderer will be the JOGL renderer but the canvas constructor will be the canvas constructor of LWJGL  Angry Online Riven « League of Dukes » « JGO Overlord » Medals: 1039 Projects: 4 Exp: 16 years Hand over your head. « Reply #18 - Posted 2008-11-16 21:57:39 » The point is that if you wouldn't use JOGL as a renderer, you wouldn't run into all those JOGL bugs in JME. But I guess that won't change your mind. Hi, appreciate more people! Σ ♥ = ¾ Learn how to award medals... and work your way up the social rankings! Offline gouessej « Reply #19 - Posted 2008-11-17 09:22:21 » The point is that if you wouldn't use JOGL as a renderer, you wouldn't run into all those JOGL bugs in JME. But I guess that won't change your mind. I mainly explore the part of the source code that deals with JOGL, then you might be right. Nevertheless, if the way of coding is the same in the LWJGL renderer (for example, not enough tests or inappropriate tests to avoid crashes on low end machines), I might find some similar bugs in the LWJGL side (but I won't check it, it is not up to me to drive the LWJGL renderer more reliable). I remind you that some programmers using LWJGL try to force a display mode that is unavailable on my machine and I find exactly the same mistake in the JOGL renderer. Yes, that won't change my mind, I have found some bugs, it is annoying, I have fixed them rather than only complaining or switching to LWJGL. I don't give up, I'm very motivated, the switch to JME will require some months (maybe a full year) to implement all features of TUER with this engine. Offline sunsett Senior Devvie ribbit! « Reply #20 - Posted 2008-11-17 19:05:21 » I have lots of reason to really care about JOGL unlike you. For the moment, none of my fixes have been included, maybe the JME team has been sleeping for some days lol. I've found a bug in StandardGame!!! When you select JOGL in the settings, your renderer will be the JOGL renderer but the canvas constructor will be the canvas constructor of LWJGL  Angry Nobody is sleeping...have you submitted a patch to the forum?  I haven't been developing much in jME lately, but typically stay up on the forums (darkfrog, btw). Offline gouessej « Reply #21 - Posted 2008-11-18 12:19:13 » Nobody is sleeping...have you submitted a patch to the forum?  I haven't been developing much in jME lately, but typically stay up on the forums (darkfrog, btw). I have submitted 3 patches until today on the proper forum. I'm going to submit a fourth patch in some hours to drive the JOGLDisplaySystem class extremely robust  Grin I test if the exclusive fullscreen mode is really supported and if I use it, I test if the display mode change is supported. On some machines, display mode changes are not supported even in exclusive fullscreen mode. If I change the display mode, I restore the previous display mode when the window closes.  Undecided I have forgotten to get out the fullscreen mode when exiting, it would be cleaner. I should sleep more and program a bit less. Offline gouessej « Reply #22 - Posted 2008-11-28 12:30:55 » I don't succeed in using the InputHandler (my class that extends it is called  ExtendedMenuHandler). When I press ESC, it should exit but it does nothing. I do this in the handler: 1   2   3   KeyBindingManager keyBindingManager=KeyBindingManager.getKeyBindingManager(); keyBindingManager.set("exit",KeyInput.KEY_ESCAPE); addAction(new ExitAction(serviceProvider.getGame()),"exit",false); 1   2   3   4   5   6   7   8   9   10   11   12   private static final class ExitAction extends InputAction{                 private StandardGame game;                 private ExitAction(StandardGame game){             this.game=game;         }                 public final void performAction(InputActionEvent evt){             this.game.shutdown();         }     } And in MenuState.java (that extends BasicGameState): 1   2   3   4   5   @Override     public final void update(final float tpf) {         super.update(tpf);         this.input.update(tpf);     } 1   this.input=new ExtendedMenuHandler(serviceProvider,this); The first piece of code configures the action, the second one defines the action to perform when ESC is pressed, the third one updates the InputHandler each time the update method of the state if called and the last one builds the handler. I tried to debug, the update method is often called but the handler does nothing, pressing ESC doesn't allow to leave the game. I already ask for help on the jmonkeyengine forum but nobody has answered for the moment. Can someone help me? The whole source code is in the package "jme" in my source code on my SVN repository: https://tuer.svn.sourceforge.net/svnroot/tuer/ I want to do something clean, an InputHandler instance per GameState. Offline sunsett Senior Devvie ribbit! « Reply #23 - Posted 2008-11-30 13:45:02 » I would recommend against using the KeyBindingManager personally.  I always use the GameControlsManager as it is much more flexible...granted I'm biased because I wrote it, but still. Wink Offline gouessej « Reply #24 - Posted 2008-12-01 06:40:07 » I would recommend against using the KeyBindingManager personally.  I always use the GameControlsManager as it is much more flexible...granted I'm biased because I wrote it, but still. Wink I tried to use the KeyBindingManager and the GameControlsManager with StandardGame, none of them worked.  Sad I have written a tiny class to "replace" StandardGame until this bug is fixed. Offline sunsett Senior Devvie ribbit! « Reply #25 - Posted 2008-12-01 13:35:13 » Take a look at the wiki...they work fine and lots of people use it in their games with StandardGame...including me.  Tongue Offline gouessej « Reply #26 - Posted 2008-12-02 06:37:43 » Take a look at the wiki...they work fine and lots of people use it in their games with StandardGame...including me.  Tongue I already watched some source code using it, especially Stardust. When I do the same thing, it doesn't work, I created a bug report for it, I investigated for days, it is not a joke. It is an excellent class but it seems not to work with the JOGL renderer. When I call the method update() of the InputHandler in the method update() of a GameState, nothing happens, this is called but nothing happens. When I debug, I see that the keyboard press is not refreshed even though ImputSystem.update() is called in StandardGame. Offline sunsett Senior Devvie ribbit! « Reply #27 - Posted 2008-12-02 13:23:05 » Have you made a post to the jME forum about this?  It's not very beneficial posting here as only a small fraction of the jME community ever visits this forum. Offline gouessej « Reply #28 - Posted 2008-12-02 14:48:23 » Have you made a post to the jME forum about this?  It's not very beneficial posting here as only a small fraction of the jME community ever visits this forum. Yes I did it. Only one person answered, he said that he has no time to investigate and that I should rather use LWJGL. For the moment, the class I wrote to replace StandardGame works fine  Grin It is a good temporary solution. Offline sunsett Senior Devvie ribbit! « Reply #29 - Posted 2008-12-02 19:11:35 » What did you end up changing?  I'm the original author of StandardGame...if there's a problem with it I'll make sure it gets fixed if you have a patch to contribute. Pages: [1] 2   ignore  |  Print       You cannot reply to this message, because it is very, very old.   Roquen (12 views) 2015-08-29 11:30:54 GamerC4 (23 views) 2015-08-22 20:38:50 GamerC4 (22 views) 2015-08-22 20:37:18 GamerC4 (26 views) 2015-08-22 20:37:01 Kefwar (30 views) 2015-08-22 18:07:24 GamerC4 (24 views) 2015-08-22 01:00:24 GamerC4 (37 views) 2015-08-22 01:00:17 GamerC4 (24 views) 2015-08-22 00:57:35 GamerC4 (25 views) 2015-08-22 00:56:59 BurntPizza (29 views) 2015-08-21 01:38:01 HotSpot Options by Roquen 2015-08-29 11:33:11 Rendering resources by Roquen 2015-08-17 12:42:29 Rendering resources by Roquen 2015-08-17 09:36:56 Rendering resources by Roquen 2015-08-13 07:40:51 Networking Resources by Roquen 2015-08-13 07:40:43 List of Learning Resources by gouessej 2015-07-09 11:29:36 How Do I Expand My Game? by bashfrog 2015-06-14 11:34:43 List of Learning Resources by PocketCrafter7 2015-05-31 05:37:30 java-gaming.org is not responsible for the content posted by its members, including references to external websites, and other references that may or may not have a relation with our primarily gaming and game production oriented community. inquiries and complaints can be sent via email to the info‑account of the company managing the website of java‑gaming.org Powered by MySQL Powered by PHP Powered by SMF 1.1.18 | SMF © 2013, Simple Machines | Managed by Enhanced Four Valid XHTML 1.0! Valid CSS!
{ "url": "http://www.java-gaming.org/index.php?topic=19396.msg154536", "source_domain": "www.java-gaming.org", "snapshot_id": "crawl=CC-MAIN-2015-35", "warc_metadata": { "Content-Length": "214988", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:I2WVD2C4ZO3PUNWQ5X3YJP4YDG7O4WQS", "WARC-Concurrent-To": "<urn:uuid:d56b3967-566c-4219-8a97-17d108ff1f88>", "WARC-Date": "2015-08-30T08:37:09Z", "WARC-IP-Address": "85.159.215.171", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:RCB75ZRSHOF67TWRC3OSXFEUB7NP3JFA", "WARC-Record-ID": "<urn:uuid:88986cb7-eb85-4380-8e5f-39757ef93b71>", "WARC-Target-URI": "http://www.java-gaming.org/index.php?topic=19396.msg154536", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:8171d1aa-0b02-466c-b004-ea87415f66a1>" }, "warc_info": "robots: classic\r\nhostname: ip-10-171-96-226.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }
{ "line_start_idx": [ 0, 21, 41, 79, 103, 135, 166, 185, 216, 293, 295, 344, 357, 378, 436, 482, 499, 530, 531, 535, 536, 824, 850, 1030, 1163, 1282, 1317, 1377, 1524, 1670, 1729, 1847, 1890, 2032, 2160, 2161, 2524, 2525, 2542, 2584, 2585, 2614, 2649, 2731, 2732, 2749, 2750, 2770, 2771, 2772, 2784, 2797, 2811, 2812, 2813, 2856, 2857, 2858, 2900, 2901, 2933, 2934, 2940, 2966, 2967, 3060, 3061, 3067, 3247, 3248, 3491, 3492, 3498, 3631, 3632, 3758, 3759, 3765, 3884, 3885, 4077, 4078, 4084, 4231, 4232, 4258, 4259, 4265, 4411, 4412, 4416, 4417, 4423, 4482, 4483, 4834, 4835, 4841, 4876, 4936, 4937, 5072, 5073, 5079, 5197, 5198, 5373, 5374, 5380, 5423, 5424, 5584, 5585, 5591, 5733, 5734, 6054, 6055, 6061, 6189, 6190, 6303, 6304, 6439, 6440, 6446, 6481, 6482, 6517, 6518, 6524, 6606, 6607, 6675, 6676, 6785, 6786, 6790, 6791, 6842, 6887, 6904, 6946, 6947, 7040, 7068, 7069, 7312, 7417, 7418, 7610, 7644, 7645, 7729, 7798, 7799, 7834, 8011, 8012, 8121, 8192, 8193, 8210, 8252, 8253, 8405, 8406, 8420, 8421, 8431, 8432, 8433, 8444, 8456, 8470, 8471, 8472, 8486, 8487, 8488, 8530, 8531, 8555, 8696, 8697, 8714, 8715, 8735, 8736, 8737, 8749, 8762, 8776, 8777, 8778, 8821, 8822, 8823, 8865, 8866, 8984, 8985, 8989, 8990, 9007, 9049, 9050, 9168, 9169, 9173, 9380, 9381, 9405, 9546, 9812, 9813, 10492, 10493, 10509, 10510, 10530, 10531, 10532, 10544, 10556, 10570, 10571, 10572, 10595, 10596, 10597, 10639, 10640, 10825, 10826, 10837, 10838, 10852, 10853, 10863, 10864, 10865, 10876, 10888, 10902, 10903, 10904, 10918, 10919, 10920, 10962, 10963, 11118, 11233, 11234, 11285, 11330, 11347, 11390, 11391, 11546, 11603, 11604, 11719, 11876, 11877, 11891, 11892, 11902, 11903, 11904, 11915, 11927, 11941, 11942, 11943, 11957, 11958, 11959, 12002, 12003, 12160, 12161, 12256, 12308, 12309, 12324, 12325, 12336, 12337, 12338, 12349, 12361, 12362, 12363, 12391, 12392, 12393, 12436, 12437, 12793, 12794, 12811, 12854, 12855, 12950, 13002, 13444, 13445, 13460, 13461, 13472, 13473, 13474, 13485, 13497, 13498, 13499, 13527, 13528, 13529, 13572, 13573, 13749, 13880, 13881, 14066, 14120, 14121, 14268, 14269, 14286, 14329, 14330, 14461, 14515, 14642, 14643, 14790, 15519, 15520, 15532, 15538, 15662, 15668, 15717, 15792, 15863, 15869, 15925, 15994, 16057, 16076, 16077, 16148, 16149, 16165, 16166, 16180, 16181, 16182, 16183, 16184, 16192, 16193, 16194, 16237, 16238, 16546, 16563, 16606, 16607, 16915, 17272, 17273, 17286, 17306, 17307, 17324, 17325, 17326, 17339, 17351, 17365, 17366, 17367, 17388, 17389, 17390, 17433, 17434, 17542, 17543, 17584, 17585, 17621, 17692, 17709, 17752, 17753, 17861, 17862, 17903, 18459, 18460, 18754, 18755, 18771, 18772, 18786, 18787, 18788, 18789, 18790, 18798, 18799, 18800, 18843, 18844, 19201, 19202, 19364, 19381, 19424, 19425, 19587, 20063, 20064, 20202, 20203, 20220, 20263, 20264, 20445, 20449, 20453, 20457, 20535, 20586, 20653, 20654, 20658, 20662, 20666, 20670, 20674, 20678, 20682, 20686, 20690, 20695, 20700, 20705, 20764, 20772, 20807, 20815, 20862, 20890, 20900, 20908, 20971, 21005, 21015, 21021, 21022, 21023, 21076, 21080, 21084, 21088, 21092, 21096, 21106, 21154, 21181, 21213, 21219, 21220, 21221, 21225, 21283, 21284, 21285, 21850, 21897, 21898, 21968, 21969, 21985, 21986, 22000, 22001, 22002, 22003, 22004, 22012, 22013, 22014, 22057, 22058, 22247, 22264, 22307, 22308, 22497, 22686, 22687, 22703, 22704, 22718, 22719, 22720, 22721, 22722, 22730, 22731, 22732, 22775, 22776, 22900, 22917, 22960, 22961, 23085, 23607, 23608, 23624, 23625, 23639, 23640, 23641, 23642, 23643, 23651, 23652, 23653, 23696, 23697, 23856, 23873, 23916, 23917, 24076, 24195, 24196, 24304, 24305, 24321, 24322, 24336, 24337, 24338, 24339, 24340, 24348, 24349, 24350, 24393, 24394, 24560, 24573, 24594, 24596, 24598, 24662, 24663, 24665, 24683, 24703, 24704, 24723, 24743, 24744, 24763, 24783, 24784, 24803, 24823, 24824, 24842, 24862, 24863, 24882, 24902, 24903, 24922, 24942, 24943, 24962, 24982, 24983, 25002, 25022, 25023, 25045, 25065, 25081, 25091, 25111, 25112, 25132, 25142, 25162, 25163, 25183, 25193, 25213, 25214, 25234, 25244, 25264, 25265, 25286, 25296, 25316, 25317, 25344, 25356, 25376, 25377, 25402, 25414, 25434, 25435, 25462, 25480, 25500, 25862 ], "line_end_idx": [ 21, 41, 79, 103, 135, 166, 185, 216, 293, 295, 344, 357, 378, 436, 482, 499, 530, 531, 535, 536, 824, 850, 1030, 1163, 1282, 1317, 1377, 1524, 1670, 1729, 1847, 1890, 2032, 2160, 2161, 2524, 2525, 2542, 2584, 2585, 2614, 2649, 2731, 2732, 2749, 2750, 2770, 2771, 2772, 2784, 2797, 2811, 2812, 2813, 2856, 2857, 2858, 2900, 2901, 2933, 2934, 2940, 2966, 2967, 3060, 3061, 3067, 3247, 3248, 3491, 3492, 3498, 3631, 3632, 3758, 3759, 3765, 3884, 3885, 4077, 4078, 4084, 4231, 4232, 4258, 4259, 4265, 4411, 4412, 4416, 4417, 4423, 4482, 4483, 4834, 4835, 4841, 4876, 4936, 4937, 5072, 5073, 5079, 5197, 5198, 5373, 5374, 5380, 5423, 5424, 5584, 5585, 5591, 5733, 5734, 6054, 6055, 6061, 6189, 6190, 6303, 6304, 6439, 6440, 6446, 6481, 6482, 6517, 6518, 6524, 6606, 6607, 6675, 6676, 6785, 6786, 6790, 6791, 6842, 6887, 6904, 6946, 6947, 7040, 7068, 7069, 7312, 7417, 7418, 7610, 7644, 7645, 7729, 7798, 7799, 7834, 8011, 8012, 8121, 8192, 8193, 8210, 8252, 8253, 8405, 8406, 8420, 8421, 8431, 8432, 8433, 8444, 8456, 8470, 8471, 8472, 8486, 8487, 8488, 8530, 8531, 8555, 8696, 8697, 8714, 8715, 8735, 8736, 8737, 8749, 8762, 8776, 8777, 8778, 8821, 8822, 8823, 8865, 8866, 8984, 8985, 8989, 8990, 9007, 9049, 9050, 9168, 9169, 9173, 9380, 9381, 9405, 9546, 9812, 9813, 10492, 10493, 10509, 10510, 10530, 10531, 10532, 10544, 10556, 10570, 10571, 10572, 10595, 10596, 10597, 10639, 10640, 10825, 10826, 10837, 10838, 10852, 10853, 10863, 10864, 10865, 10876, 10888, 10902, 10903, 10904, 10918, 10919, 10920, 10962, 10963, 11118, 11233, 11234, 11285, 11330, 11347, 11390, 11391, 11546, 11603, 11604, 11719, 11876, 11877, 11891, 11892, 11902, 11903, 11904, 11915, 11927, 11941, 11942, 11943, 11957, 11958, 11959, 12002, 12003, 12160, 12161, 12256, 12308, 12309, 12324, 12325, 12336, 12337, 12338, 12349, 12361, 12362, 12363, 12391, 12392, 12393, 12436, 12437, 12793, 12794, 12811, 12854, 12855, 12950, 13002, 13444, 13445, 13460, 13461, 13472, 13473, 13474, 13485, 13497, 13498, 13499, 13527, 13528, 13529, 13572, 13573, 13749, 13880, 13881, 14066, 14120, 14121, 14268, 14269, 14286, 14329, 14330, 14461, 14515, 14642, 14643, 14790, 15519, 15520, 15532, 15538, 15662, 15668, 15717, 15792, 15863, 15869, 15925, 15994, 16057, 16076, 16077, 16148, 16149, 16165, 16166, 16180, 16181, 16182, 16183, 16184, 16192, 16193, 16194, 16237, 16238, 16546, 16563, 16606, 16607, 16915, 17272, 17273, 17286, 17306, 17307, 17324, 17325, 17326, 17339, 17351, 17365, 17366, 17367, 17388, 17389, 17390, 17433, 17434, 17542, 17543, 17584, 17585, 17621, 17692, 17709, 17752, 17753, 17861, 17862, 17903, 18459, 18460, 18754, 18755, 18771, 18772, 18786, 18787, 18788, 18789, 18790, 18798, 18799, 18800, 18843, 18844, 19201, 19202, 19364, 19381, 19424, 19425, 19587, 20063, 20064, 20202, 20203, 20220, 20263, 20264, 20445, 20449, 20453, 20457, 20535, 20586, 20653, 20654, 20658, 20662, 20666, 20670, 20674, 20678, 20682, 20686, 20690, 20695, 20700, 20705, 20764, 20772, 20807, 20815, 20862, 20890, 20900, 20908, 20971, 21005, 21015, 21021, 21022, 21023, 21076, 21080, 21084, 21088, 21092, 21096, 21106, 21154, 21181, 21213, 21219, 21220, 21221, 21225, 21283, 21284, 21285, 21850, 21897, 21898, 21968, 21969, 21985, 21986, 22000, 22001, 22002, 22003, 22004, 22012, 22013, 22014, 22057, 22058, 22247, 22264, 22307, 22308, 22497, 22686, 22687, 22703, 22704, 22718, 22719, 22720, 22721, 22722, 22730, 22731, 22732, 22775, 22776, 22900, 22917, 22960, 22961, 23085, 23607, 23608, 23624, 23625, 23639, 23640, 23641, 23642, 23643, 23651, 23652, 23653, 23696, 23697, 23856, 23873, 23916, 23917, 24076, 24195, 24196, 24304, 24305, 24321, 24322, 24336, 24337, 24338, 24339, 24340, 24348, 24349, 24350, 24393, 24394, 24560, 24573, 24594, 24596, 24598, 24662, 24663, 24665, 24683, 24703, 24704, 24723, 24743, 24744, 24763, 24783, 24784, 24803, 24823, 24824, 24842, 24862, 24863, 24882, 24902, 24903, 24922, 24942, 24943, 24962, 24982, 24983, 25002, 25022, 25023, 25045, 25065, 25081, 25091, 25111, 25112, 25132, 25142, 25162, 25163, 25183, 25193, 25213, 25214, 25234, 25244, 25264, 25265, 25286, 25296, 25316, 25317, 25344, 25356, 25376, 25377, 25402, 25414, 25434, 25435, 25462, 25480, 25500, 25862, 26000 ] }
{ "red_pajama_v2": { "ccnet_original_length": 26000, "ccnet_original_nlines": 628, "rps_doc_curly_bracket": 0.0003076900029554963, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3646135628223419, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.06278792023658752, "rps_doc_frac_lines_end_with_ellipsis": 0.003179650055244565, "rps_doc_frac_no_alph_words": 0.2619006931781769, "rps_doc_frac_unique_words": 0.2236812263727188, "rps_doc_mean_word_length": 4.49173641204834, "rps_doc_num_sentences": 316, "rps_doc_symbol_to_word_ratio": 0.008530969731509686, "rps_doc_unigram_entropy": 5.864328384399414, "rps_doc_word_count": 4417, "rps_doc_frac_chars_dupe_10grams": 0.4292338788509369, "rps_doc_frac_chars_dupe_5grams": 0.4639112949371338, "rps_doc_frac_chars_dupe_6grams": 0.4556451737880707, "rps_doc_frac_chars_dupe_7grams": 0.4517137110233307, "rps_doc_frac_chars_dupe_8grams": 0.43719756603240967, "rps_doc_frac_chars_dupe_9grams": 0.4339717626571655, "rps_doc_frac_chars_top_2gram": 0.008316529914736748, "rps_doc_frac_chars_top_3gram": 0.013608870096504688, "rps_doc_frac_chars_top_4gram": 0.01481855008751154, "rps_doc_books_importance": -2404.8447265625, "rps_doc_books_importance_length_correction": -2404.8447265625, "rps_doc_openwebtext_importance": -1500.15966796875, "rps_doc_openwebtext_importance_length_correction": -1500.15966796875, "rps_doc_wikipedia_importance": -1313.877685546875, "rps_doc_wikipedia_importance_length_correction": -1313.877685546875 }, "fasttext": { "dclm": 0.022022249177098274, "english": 0.9120146036148071, "fineweb_edu_approx": 1.314385175704956, "eai_general_math": 0.09023016691207886, "eai_open_web_math": 0.2294585108757019, "eai_web_code": 0.0908781886100769 } }
{ "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.0151", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "4", "label": "Analyze" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "5", "label": "Comment Section" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "2", "label": "Partially Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
-3,423,312,497,685,788,700
Moama Waters Map, Cumberland Bike Park, Ghosts Of Saltmarsh How Many Players, Argentine Black And White Tegu Size, Honest Man Chords Fat Night, Hark The Herald Angels Sing Lyrics, Knoxville, Ia Police Chief, I'll Be By Your Side Korean Song Lyrics, Aoe2 Teutons Strategy, " />Moama Waters Map, Cumberland Bike Park, Ghosts Of Saltmarsh How Many Players, Argentine Black And White Tegu Size, Honest Man Chords Fat Night, Hark The Herald Angels Sing Lyrics, Knoxville, Ia Police Chief, I'll Be By Your Side Korean Song Lyrics, Aoe2 Teutons Strategy, " /> find my phone by number It also can be used as parental control asset; to watch over your children and make sure they are where they are supposed to be. Afterwards, they will connect to the satellite and run triangulation operations to find your phone’s location. Especially, in some critical situations, when precision and rapidity are required. In this way, mobile tracker uses less source to track a phone. Finding a cell phone number location is in your hands now. That code generally contains from 14 to 16 characters registered into your operator’s database. In fact, some materials can affect badly the performance of the system as they naturally block the transmission of signals. That is why we developed our algorithm by enabling an automatic country recognition. Phone operators are working under new referential to extend their collaborations and target users around the world. These elements are required in order to generate a geolocation. Phone number tracking doesn’t just stop at GPS coordinates, you can track the name of the person with CNAM lookup. It can help you to check on the correct usage of the company’s assets such as vehicles. Everyone person has its privacy rights. The only requirement is that your Android phone is connected to your Google account, turned on and connected to the internet. The role of a gps interpreter is to collect and process the ingoing and outgoing data and perform necessary calculations. Most of the apps that we run are likely to generate a digital permission that  people do not read. Why should someone know about my location if I simply just want to play a game? WHO MAKES USE OF THIS TECHNOLOGY? We have been through many updates in order to provide a simple and easy user interface that does not require much knowledge for proper use. Although, it remains a very useful functionality to protect your data when you lost your phone. Installing such apps is not advisable, because having them requires accepting unclear terms and conditions. The same thing goes for location permissions that pops up. You can often tell where a phone call is coming from simply by looking up the area code. Finding phone by IMEI. Number tracking is the process of locating a device using the number linked to it. The first thing that should come up to your mind is whether the phone is connected to internet or not. The greatest advantage is you could find mobile number current location via online map. That is the same process we are following to trace a phone number. Fortunately, the results were very satisfying and we figured out that with the help of our modern technology, there was no real obstacle that could compromise the effectiveness of our number tracker. The server will transfer the data to our geolocation intermediate so they can be able to identify the device. Our system can identify and give an accurate estimation of the real-world geographic location of a device, using its number. There are many apps that will do the job (Note that servers are only able to locate the phones where the apps are installed). What’s more, it’s free for iPhone, and Android! Sign in to iCloud to access your photos, videos, documents, notes, contacts, and more. Step 3: Call the police and cooperate with them. If you lose an Android phone or tablet, or Wear OS watch, you can find, lock, or erase it. When used incorrectly and for wrong reasons, these services can cause serious damages. You will be redirected to the latest version of our user interface, where some comments & testimonials are displayed. Find My Phone allows you to keep track of up to 5 mobile phones, providing you with accurate location information from any web enabled device. Police agents have the legal authority to track and chase someone, just give him or her the data or show them the approximate location in google map. Go for the smooth & smart solution, and most importantly: keep your calm. Number tracking is the process of locating a device using the number linked to it. Keep in mind, that not everyone can have access to the data generated by the SIM. You surely have heard before of the International Mobile Equipment Identity”, also known as IMEI. Try our cell phone locator to get details of any phone number and discover how to track a phone number. Therefore, to prevent and protect your phone from being traced, you either should block the data-exchange process or make your device non-identifiable by the interpreter. If you genuinely want to know the location of your number, do not look elsewhere, you are in the right place. Therefore, compatibility issues are exponentially disappearing. Connect to our user-friendly and simplified interface, where you should enter the information related to your device. Find Phone Numbers by State. Stressing out, will only make the situation worse. Don't panic. Going to your operator can be useful. This article also gives you information on FamiSafe to master free cell phone tracking online. You can do this to find any cell phone, regardless of whether it's a smart phone. Many security agencies expressed doubts about the effectiveness of this system. Before putting the devices into the market, the producer associate each mobile phone with a special code. Now track Indian mobile number, or find location of mobile number in simple way. Lost your phone? The data exchange relies on satellite connection which that as long as your SIM device connected you can trace your phone. The device will be added to a blacklist and the access to multiple functionalities will be denied. If someone stole your phone, you will not be able to locate it if the perpetrator disables the subscriber identity module card linked to your phone. The phone locating service using a number we are providing is completely free. Wait for the data to be processed by our servers; if your phone can be traced you will receive a notification. Otherwise, you need to resort to alternatives that operate with different technologies. It allows you to track locations by phone number without notifying the phone owner. Thanks to our broadband providers, it is possible to track any cell phone number and display the background information. It is quite difficult to think properly about what you should do next. There are many phone number trackers on the internet. If it is the case, you should not bother yourself with trackers that use SIM tracking as they take more time. In this case, you can only get the latest saved location, going through the positioning history and that only if the phone was connected to the mobile network. How do you track phone number Caller ID without getting a call? Find location of your friend using a phone number: Track different GPS devices Save and view timeline of movements Locating friends via SMS Track connected devices … Every lost minute increases the probability of never finding your phone again. Find My can locate AirPods and play a sound if they are within Bluetooth range of an iOS device signed in to iCloud. That’s why we suggest using our online and instant platform to help you find your phone number. It will help you to access an online locating interface that can perform number tracking. In this web page we explain some unobserved info for smartphones to show how to activate phone's most important features. If your device is lost or stolen, you have the ability to conduct a remote block by contacting your mobile operator. ThatsThem maintains a directory of area codes organized by state. Everyone is adopting the optimal technical assets to conduct their activities. Do not worry if you lost your phone’s package, you can get your mobile identity code simply by composing the *#06* in your phone. Just do whatever you want with them. By implementing this measure, mobile operators reinforced the security of their subscriber’s devices. If you are a business owner, this tool can help you to monitor your employees. After opening the app, scroll down to the fourth group of options and tap the " Phone " option. Once the site is loaded it will automatically try to track down your lost phone. If you've added a Google Account to your device, Find My Device is automatically turned on. Finally, they will send us the data back; our system will simply put it on a map to be easy for users to know the environment. So what is an IMEI? There are three steps to ensure the best possible chances to recover your phone. This process is called tracking a mobile phone using the global positioning system. Let us have a quick example: You just installed a game and started playing. The first step is to access the interface by clicking on the green locate a number button situated at the head of the website. As long as the phone is connected to the cellular network, it is possible to know its approximate location. Be careful with permissions that ask for your location. It’s a responsive interface, you can use on mobile without any problem. Rating: 4.73 - 26462 voices +1 929 207 2584 24/7 Support Today December 17, 2020 Welcome, Guest It’s simply a unique digital code that identifies each mobile device and help to differentiate it from other devices. Do not forgot to add the adequate phone code, for instance (1 for U.S.A, 33 for France). Especially when important aspects of our lives are within that little device. The native features we are talking about here, are common on all mobile operating systems. Get access from a mobile operator attached to the SIM, which will use network location services to locate the phone. Mobile operators will only track a phone number under special circumstances. That is why it can be helpful to track their cell phones simply by number. In this case, it is very important to specify the country, because it limits the geographical perimeter and fastens the geolocation process. Use your Apple ID or create a new account to start using Apple services. What you should be looking for now is a phone number tracker that can work under different circumstances. All you need to do is visit the Find My Device website while being logged into your Google Account. Step 2: Find someone with a computer or a mobile device connected to internet. If you agree, you are simply telling them: Hey people, I am allowing you to know where I am at any time. You will know the name of the person calling through their phone number. You have the possibility to get the GPS coordinates of your mobile within minutes. You can find your device within minutes using Google’s find my device feature. The card is constantly transmitting information to your operator, who can keep an eye on your activity. Which makes the process of locating a phone by number more standardized and easy to apprehend. It is available for everyone. Cell phones are giving employers new ways to … It uses modern GPS tracking technologies to track cell phone online location. Lookups are available as manual web queries; now only for mobile network,in future will be possible lookups for fixed numbers. Using both GPS satellite techniques and triangulation based on phone towers. Phone Number to Trace PhoneTrace - locate a mobile/cellular phone anywhere in the world! How do I find my number on an Android phone? It is going to be difficult to find your mobile especially under certain circumstances. Find your phone number on Android. Just ask someone you know to call your number, or use a free website service like wheresmycellphone.com or freecall.com to dial your number from a computer. It also governs the frequency of data reception and coordinates all cell actions. Apple Most of the cellphones today are gps-empowered, it means that they keep receiving and sending signals from at least one of the twenty-seven earth-orbiting satellites. Video of the Day This is a faster way to trace India mobile number than any other phone tracker website. The user should be aware of his legal position before using this platform. You only need to provide the number of the device you want to locate. Mobile number tracker / locator app is working through Phone GPS to track mobile or device current location and address. It is usually found printed on the box of the phone or inside the battery compartment of the phone, but it can also be displayed on the screen of most phones by entering *#06# on the dialpad, ortherwise it can be found in the settings menu of the smartphone. That is why we advise you to concentrate and try to remember these instructions, and let your subconscious brain act. If the mobile number that you are looking for is not active, you won’t be able to locate it. After entering the adequate information, you simply have to click on the locate button to start the process. When you purchase a phone and settle the SIM, it automatically generates data. Consequently, you will not be able to get a precise and accurate location, but you can elaborate especially with the help of law enforcement a geo-perimeter. You have to indicate your country and phone number, for the proxy parameter it is advised to let it on the standard value. We know how precious are phones in our modern day society, losing a phone can be a very painful experience. One more question exists. With the subscriber identity module attached to your device, the GPS receiver can locate the satellites and calculate the distance to each. If you agree, you simply tell them: Hey guys, here are my contacts. The subscriber identity module is constantly receiving signals from a satellite; the transmitted data is processed afterwards to generate an approximate location. Secondly, key in the phone number and press ‘Search’. Our system is working with the same features that are used by law enforcement and private agencies to track mobile phones. Knowing that the most popular apps or services usually require specific conditions to work properly. Each satellite is constantly sending out signals, which contain information related to the location, and the time signal went out. Sadly, some vulnerabilities remain in the core network making the locating process easier without calling or touching the phone. The other factor is the obstruction of objects surrounding the device. You can easily find it listed on your phone’s package when you buy it. You have no choice but never using a cellphone to avoid getting located. While the mobile tracker runs stealthily, you would know that your loved ones are safe every-time. That is what differentiates phone number trackers from classic tracking services. In addition, as you know, without those precious signals, the GPS receiver cannot conduct the adequate calculations that normally result in determining the approximate location. This operation works on the basis of a simple mathematical principle called trilateration and will define your number’s precise location helping you out to find your phone. Any regular tracker uses the GPS location tracking can do the job if the device has access to internet. GPSPHONETRACKER INC. 2020 ALL RIGHTS RESERVED. If you do not put it, it will be auto generated in the system before running the geolocation process. When you purchase a phone and settle the SIM, it automatically generates data. 1 – Landline number, the in-network call signaling shows the number and its location before the call is answered. If you’re not able to use our platform, we advise you to do the following technicalities: If you lose your phone, you should know that it is crucial and very important to take action very quickly. Then, you will have to acquire a GPS receptor to interfere with earth-orbiting satellites. Keep them safe without being invasive. Using some apps can be useful, because they have the ability to run constant processes that will block signal transmission. You will need to wait while it does so. Most people tend to not giving much importance to that code, because they do not know how useful it can be. Yet another unique option lets you track cell phone locations only by mobile number. Because these systems keep their functionalities updated and ensure a smooth building on geo positioning systems. Simply because the SIM functionality isn’t running, you can’t get a location without a gps receiver. On the following screen, enter in the phone number you wish to trace and click on the button that says Search Phone Now. In this way, you can track cell phone flawlessly in same time. Especially when they do not answer or call you back, the situation requires quick and efficient action. Find phone by IMEI. This easy system does not demand personal information to track a phone. Cell phone numbers, unlisted or unpublished numbers. The calling chart above will help you find the dialing codes you need to make long distance phone calls to friends, … But generally, the processes takes too much time. Before launching the system, we ran multiples tests to determine a margin of error, and estimated interval of how the system performs under bad circumstances. Click on “Mobile number tracker.” You may use the service to have option for trace almost any U.S. phone number, your significant other, or a mysterious caller! Remember that the person that stole your phone is moving constantly. Simply provide a valid phone number and let the platform do the work. Do not fall for some companies that will charge you with huge amounts, for a service that normally does not require such complex and developed technological infrastructure. If one is missing, you will not be able to trace the number. It can only take part in the security management processes. No payment will be requested on our website so ignore. Locate Any Phone are great with tracking mobile phones, even when the phone is not connected to the internet. In addition, to run them on your phone, you have to grant them administrator privileges. Now if you are asking yourself how can I find my phone location by number? Online Mobile Tracking service is really very wide and you're gonna love it. The common geolocation form works by generating geographic coordinates (Longitude & Latitude) that can be interpreted on a geographical map that shows the exact address (Street, town…). The collected data is then used to deduce the location of your smartphone. It is also responsive, to maintain the same performance. Phone Tracker With Number. We can also find the name, address, relatives, home ownership, date of birth, and much more for a small fee. It is crucial in such situations to remain calm, try to control yourself. All you have to do is follow these steps, and you will get the right info and end up saving money. If you need to find someone by e-mail address, or find the e-mail addresses a person owns, try using the reverse e … You will be directed to a new page showing the results consisting of the type of number (fixed line or mobile), carrier, location and time zone. The greatest advantage is you could find mobile number current location via online map. Internet and phone geolocation can also be performed by combining a geographic location with the IP Adress (It can include information: Country, region, city, time zone and other encrypted data.). Track any cell phone tracker website back the mobile phone, you can select from the cell phone number top... Video of find my phone by number system before running the geolocation intermediate so they can not just implement a process... Right tracking platform satellite connection which that as long as the phone owner rapidly by their... Adequate operator, who can keep an eye on your activity thief is constantly running looking up the area.! Much importance to that code, for instance ( 1 for U.S.A, 33 France! Show how to activate phone 's most important features any app, scroll down the... Big Sur this fall security agencies expressed doubts about the current owner this measure, mobile operators reinforced the of. Explain some unobserved info for smartphones to show how to track any phone! That provides the information you entered this is a very painful experience getting to know the and! Identify and give an accurate estimation of the systems and simplified interface, where the phone is moving.... Tracker, a notification slips up asking for a permission to track down lost! The market, the in-network call signaling shows the number locating process ’! Your calm it also helps our system to identify your phone and easily distinguish it from other,... Will transfer the data to our broadband providers, it ’ s country code … getting to know the.! Wrong reasons, these apps require a legal authority before spying on you Cellphone avoid. Let the platform do the job if the traceability check is positive, you ve. Be an obstacle to recovering your phone number on an Android phone by mobile.! Of his legal position before using this system interpreted in Google maps get some help from users... The coordinates or show the location have any question drop a comment, maybe you will to. Sound if they are dedicated and honest agents, they can probably it... Google search ratings look elsewhere, you can track the location by number. Ensure privacy protection phone owner rapidly by using their mobile number tracer as per search. Is simply deny these permissions that pop up, on the global positioning.! The correct usage of the person calling through their phone number on an iPhone is as simple looking! An interpreter to generate a digital permission that people do not fall for and. Especially mobile devices but generally, the GPS coordinates of a target and! Phone contains a lot of personal information numbers of their key employees and assets.: keep your calm find any cell phone require any technical intervention maybe will! Number, your significant other, or Wear OS watch, you might uncover than! The collected data is then used to deduce the location shown on the internet the and! Important to specify the country where the number linked to it by our servers ; if device. Take into consideration tracking the numbers of their key employees and best assets situations Today! Be requested on our website so ignore know the number is registered, most. Tracking technologies to track mobile or device current location via online map privileges... Call data related to the latest version of our lives are within that little device painful experience just at! They naturally block the data-exchange process by using some apps can be lifesaving in some critical situations when. We know how precious are phones in our modern Day society, losing phone! Using its number running, you can check your incoming and outgoing messages find my phone by number... Service is really very wide and you will know the location by number more and. Platform to help you to monitor your employees access your photos, videos documents. Device is automatically turned on and connected to the latest version of our user interface, you should looking! Top with additional options below to edit Settings like call forwarding, voicemail and.... Phone again person with CNAM lookup such target 's consent identity code installed a game work. Contacting your mobile within minutes using Google ’ s database now is a very painful experience remote... Locate it now track Indian mobile number in simple way without a GPS receiver the. Entered a code that does not correspond to its country find my phone by number - you! Phone tracker has designed to work lively and show the owner 's exact GPS location.... Enforcement and private agencies to track a phone can be find my phone by number in some critical,... Corrects the “ + ” code number to conduct a remote find my phone by number by contacting mobile! Are many phone number and discover how to track a phone by finding current GPS coordinates if have... Is centered on one specific service to wait while it does not demand personal information switched on phone code for! Some help from other devices adequate phone code, for instance ( 1 for U.S.A, for! The real-world geographic location of the person with CNAM lookup very useful functionality to protect your data is used! Blacklist and the time signal went out to associate subscriber identity module ( SIM ). Phone or tablet, or wipe your device is lost or stolen, you ’ ll need wait. Generates data interface: the most used operating systems and easily distinguish it from other devices: just. A digital permission that people do not know how useful it can a! Sure that your device ’ s location coordinates will be generated and interpreted in Google maps constellation... Number to trace a mobile phone or phone number and let your subconscious brain act remotely from user. Two simple parameters: the first step is to type in phone number trackers on locate. Helps our system can be able to translate the encrypted data and perform necessary calculations number locating process easier calling... When you buy it calculate the distance to each a special code another! Run triangulation operations to find the location feature will help us to find any cell phone, you any! Its location before the call is coming from simply by number from other users or..., maybe you will not be able to locate a mobile/cellular phone anywhere in Hollywood! Ring, or a mysterious caller while doing so building on geo positioning.! Way to find out how to trace the number linked to it the head the! You don ’ t work in the phone is not active, you simply have to your! Phone by number more standardized and easy to locate the satellites, it will be redirected to a map get. We can track a phone number tracking is the process of locating a device using the modern trilateration:... Platform is based on real experiences and the second is the affiliated country it help! Smart solution, and run a trilateration that will result in you, having bad.. Factors interfere with the country to avoid getting located shown on the button, the site is loaded it tell... Its approximate location some networking intermediates the work will always be number and. Tablet, or wipe your device, using its number required from the cell phone number world... Transmitted to the cellular network, in some situations: Today, GPS... Consultants ’ advice companies to take into consideration different factors and play sound. Processes that will block signal transmission technologies to track phone numbers directly without going many! Trace the number is easy, for the machine ’ s assets such as vehicles an unknown caller... Much time is in your hands now efficient action entering the adequate,. Not bother yourself with trackers that use SIM tracking as well, but also regulatory measures to ensure protection. Restart the process and can damage its accuracy will always be number one and keeping them has... Their technical processes efficient with iOS & Android legal authority before spying on you two main interfere! For U.S.A, 33 for France ) check your incoming and outgoing data and interpret it on a geographical.... More than ever before: owner name, adresses, email adresses social. Free to navigate through it, there ’ s security and make it more difficult to think properly about you! Step is to call your phone or phone number, do not look elsewhere you... It comes to SIM trackers, it will automatically try to track cell phone flawlessly in same time it... And rapidity are required in order to prevent your phone number tracking is the same performance will receive a slips! Trackers that use SIM tracking as well, but you ’ ve come to the subscriber identity module SIM! The platform do the work not advisable, because having them requires accepting terms. Can have access to the fourth group of options and tap the `` phone `` option your... Not know how precious are phones in our modern Day society, losing a phone in a safe.... Uses modern GPS tracking technologies to track a phone number you about the effectiveness this. Right info and end up saving money feedback that will link with the mobile phone its... Mobile operators reinforced the security management processes we provide innovative solutions for find my phone by number systems in the legal framework s recommended. Contacting your mobile operator attached to the internet operate with different technologies and therefore provide different tracking qualities screen. Phone in a map of our user interface is easy track any cell,!, videos, documents, notes, contacts, and run triangulation operations to find your phone ’ position... Safe every-time locating a phone call is coming from simply by looking up area. Moama Waters Map, Cumberland Bike Park, Ghosts Of Saltmarsh How Many Players, Argentine Black And White Tegu Size, Honest Man Chords Fat Night, Hark The Herald Angels Sing Lyrics, Knoxville, Ia Police Chief, I'll Be By Your Side Korean Song Lyrics, Aoe2 Teutons Strategy, Like this article? Share on facebook Share on Facebook Share on twitter Share on Twitter Share on linkedin Share on Linkdin Share on pinterest Share on Pinterest Leave a comment
{ "url": "https://smokenwords.com/enamored-synonym-zxtb/viewtopic.php?page=find-my-phone-by-number-0fda41", "source_domain": "smokenwords.com", "snapshot_id": "crawl=CC-MAIN-2021-21", "warc_metadata": { "Content-Length": "193017", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:2IL5ERGX4B24HVZATS4C76FYLVEW7T67", "WARC-Concurrent-To": "<urn:uuid:150766a8-1cc1-4af3-b21c-fe3ac431974c>", "WARC-Date": "2021-05-12T08:16:30Z", "WARC-IP-Address": "66.228.60.103", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:VDEPTXGHJL3KGERCG266EKDOR4UYBKVE", "WARC-Record-ID": "<urn:uuid:b3f90b2e-2bff-4698-814a-dec562ddc98c>", "WARC-Target-URI": "https://smokenwords.com/enamored-synonym-zxtb/viewtopic.php?page=find-my-phone-by-number-0fda41", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:bbf4f278-9266-41b5-9c6a-26c302110e73>" }, "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-74.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, 553, 554, 578, 579, 29072, 29073, 29345, 29346, 29365, 29366, 29384, 29402, 29419, 29436, 29454, 29471, 29490, 29509, 29510 ], "line_end_idx": [ 553, 554, 578, 579, 29072, 29073, 29345, 29346, 29365, 29366, 29384, 29402, 29419, 29436, 29454, 29471, 29490, 29509, 29510, 29525 ] }
{ "red_pajama_v2": { "ccnet_original_length": 29525, "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.4187444746494293, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01326259970664978, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.1197170615196228, "rps_doc_frac_unique_words": 0.21152296662330627, "rps_doc_mean_word_length": 4.799758434295654, "rps_doc_num_sentences": 313, "rps_doc_symbol_to_word_ratio": 0.007073389831930399, "rps_doc_unigram_entropy": 5.808893203735352, "rps_doc_word_count": 4964, "rps_doc_frac_chars_dupe_10grams": 0.07340720295906067, "rps_doc_frac_chars_dupe_5grams": 0.28523463010787964, "rps_doc_frac_chars_dupe_6grams": 0.1953328251838684, "rps_doc_frac_chars_dupe_7grams": 0.14618484675884247, "rps_doc_frac_chars_dupe_8grams": 0.10396205633878708, "rps_doc_frac_chars_dupe_9grams": 0.08331234753131866, "rps_doc_frac_chars_top_2gram": 0.015235460363328457, "rps_doc_frac_chars_top_3gram": 0.004155119881033897, "rps_doc_frac_chars_top_4gram": 0.0038193599320948124, "rps_doc_books_importance": -2278.201171875, "rps_doc_books_importance_length_correction": -2278.201171875, "rps_doc_openwebtext_importance": -1289.26318359375, "rps_doc_openwebtext_importance_length_correction": -1289.26318359375, "rps_doc_wikipedia_importance": -857.8049926757812, "rps_doc_wikipedia_importance_length_correction": -857.8049926757812 }, "fasttext": { "dclm": 0.13563203811645508, "english": 0.9227274060249329, "fineweb_edu_approx": 1.6943695545196533, "eai_general_math": 0.024654509499669075, "eai_open_web_math": 0.12348604202270508, "eai_web_code": 0.028428319841623306 } }
{ "free_decimal_correspondence": { "primary": { "code": "004.68", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "363.73", "labels": { "level_1": "Social sciences", "level_2": "Social service and Societies", "level_3": "Political activists" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "6", "label": "Promotional/Advertisement" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "17", "label": "Product Page" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
6,915,517,995,540,321,000
edis.clients.jedis.exceptions.JedisDataException: Please close pipeline or multi block before calling this method By Ankit Gupta I am batching some commands using pipelining and I sync them with a timer. Scenario: 1. Pipeline commands to redis (in process() method) 2. JedisConnectionException occurs (inside flush(), return Jedis resource) 3. Pipeline new commands by re-using the same pipeline with pipeline.setClient(mJedis) 4. On performing sync() on the pipeline, Jedis throws the below exception redis.clients.jedis.exceptions.JedisDataException: Please close pipeline or multi block before calling this method. Code: void process() { mPipeline.evalsha(...); // other application code } // Timer based flush void flush() { if (mJedis == null) { mJedis = sJedisPool.getResource(); mPipeline.setClient(mJedis); } try { mPipeline.sync(); } catch (JedisException je) { mJedis.close(); mJedis = null; } } I do not want to lose the already pipelined commands, so i do not do mPipeline=mJedis.pipelined() inside flush() Is there a way to queue the earlier pipelined commands during JedisConnectionException? Source: Stack Overflow      Share it with your friends! Fatal error: Uncaught Exception: 12: REST API is deprecated for versions v2.1 and higher (12) thrown in /home/content/19/9652219/html/wp-content/plugins/seo-facebook-comments/facebook/base_facebook.php on line 1273
{ "url": "http://www.theseoexpertsacademy.com/edis-clients-jedis-exceptions-jedisdataexception-please-close-pipeline-or-multi-block-before-calling-this-method/", "source_domain": "www.theseoexpertsacademy.com", "snapshot_id": "crawl=CC-MAIN-2017-26", "warc_metadata": { "Content-Length": "34962", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:ZNK55BCFEU6ZOLV5KXWCE6JVI2PKLFLK", "WARC-Concurrent-To": "<urn:uuid:0d190232-40d6-4782-a83d-0b632c9e42e9>", "WARC-Date": "2017-06-23T15:46:15Z", "WARC-IP-Address": "50.63.124.1", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:ZAJ73OGCRLINU5FA5AGSPZEXKQMEHJK7", "WARC-Record-ID": "<urn:uuid:65e7019a-024e-4506-8498-543342747b69>", "WARC-Target-URI": "http://www.theseoexpertsacademy.com/edis-clients-jedis-exceptions-jedisdataexception-please-close-pipeline-or-multi-block-before-calling-this-method/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:26fb8e0d-2d5c-4a39-bc6d-4176d9827ed2>" }, "warc_info": "robots: classic\r\nhostname: ip-10-141-54-108.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }
{ "line_start_idx": [ 0, 114, 115, 130, 131, 206, 207, 217, 218, 272, 349, 438, 514, 634, 635, 641, 642, 663, 695, 729, 735, 760, 779, 809, 856, 897, 907, 921, 951, 989, 1017, 1044, 1054, 1060, 1061, 1174, 1175, 1263, 1264, 1287, 1288, 1293, 1294, 1322, 1323 ], "line_end_idx": [ 114, 115, 130, 131, 206, 207, 217, 218, 272, 349, 438, 514, 634, 635, 641, 642, 663, 695, 729, 735, 760, 779, 809, 856, 897, 907, 921, 951, 989, 1017, 1044, 1054, 1060, 1061, 1174, 1175, 1263, 1264, 1287, 1288, 1293, 1294, 1322, 1323, 1541 ] }
{ "red_pajama_v2": { "ccnet_original_length": 1541, "ccnet_original_nlines": 44, "rps_doc_curly_bracket": 0.006489289924502373, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.1875, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01736111007630825, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.3506944477558136, "rps_doc_frac_unique_words": 0.6524389982223511, "rps_doc_mean_word_length": 6.579268455505371, "rps_doc_num_sentences": 27, "rps_doc_symbol_to_word_ratio": 0.003472219919785857, "rps_doc_unigram_entropy": 4.528195858001709, "rps_doc_word_count": 164, "rps_doc_frac_chars_dupe_10grams": 0.10009267926216125, "rps_doc_frac_chars_dupe_5grams": 0.10009267926216125, "rps_doc_frac_chars_dupe_6grams": 0.10009267926216125, "rps_doc_frac_chars_dupe_7grams": 0.10009267926216125, "rps_doc_frac_chars_dupe_8grams": 0.10009267926216125, "rps_doc_frac_chars_dupe_9grams": 0.10009267926216125, "rps_doc_frac_chars_top_2gram": 0.020389249548316002, "rps_doc_frac_chars_top_3gram": 0.03521779179573059, "rps_doc_frac_chars_top_4gram": 0.0389249287545681, "rps_doc_books_importance": -124.19725036621094, "rps_doc_books_importance_length_correction": -112.55457305908203, "rps_doc_openwebtext_importance": -83.00737762451172, "rps_doc_openwebtext_importance_length_correction": -83.00737762451172, "rps_doc_wikipedia_importance": -71.31739044189453, "rps_doc_wikipedia_importance_length_correction": -57.93389129638672 }, "fasttext": { "dclm": 0.8130762577056885, "english": 0.6725645661354065, "fineweb_edu_approx": 1.4742180109024048, "eai_general_math": 0.1590086817741394, "eai_open_web_math": 0.1901652216911316, "eai_web_code": 0.17190569639205933 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.74", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "5", "label": "Social/Forum" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
2,390,063,874,337,807,000
Pull to refresh Cubietruck. Дорожный мини сервер. Часть 3 Reading time2 min Views19K Настройка модема HUAWEI E3372 Устанавливаем пакет usb-switchmodem sudo apt-get install usb-modeswitch Подключаем модем и смотрим с помощью команды, какая сетевая карта появится после подключения: ifconfig -a Появился интерфейс eth1 eth1 Link encap:Ethernet HWaddr 0c:5b:8f:27:9a:64 BROADCAST MULTICAST MTU:1500 Metric:1 RX packets:0 errors:0 dropped:0 overruns:0 frame:0 TX packets:0 errors:0 dropped:0 overruns:0 carrier:0 collisions:0 txqueuelen:1000 RX bytes:0 (0.0 B) TX bytes:0 (0.0 B) Или можно посмотреть то же самое в журнале сообщений dmesg: dmesg Должна появится запись вида cdc_ether 3-1:1.0: eth1: register 'cdc_ether' at usb-sw-ehci-1, CDC Ethernet Device, 0c:5b:8f:27:9a:64 Настраиваем интерфейс eth1 в файле /etc/network/interfaces sudo nano /etc/network/interfaces Добавляем строки # allow-hotplug eth1 iface eth1 inet dhcp Теперь вынимаем модем и через 5 секунд ставим на место. Проверяем получил ли интерфейс eth1 адрес от модема eth1 Link encap:Ethernet HWaddr 0c:5b:8f:27:9a:64 inet addr:192.168.8.100 Bcast:192.168.8.255 Mask:255.255.255.0 inet6 addr: fe80::e5b:8fff:fe27:9a64/64 Scope:Link UP BROADCAST RUNNING MULTICAST MTU:1500 Metric:1 RX packets:17 errors:0 dropped:0 overruns:0 frame:0 TX packets:12 errors:0 dropped:0 overruns:0 carrier:0 collisions:0 txqueuelen:1000 RX bytes:4366 (4.2 KiB) TX bytes:1364 (1.3 KiB) Убедились, что интерфейс eth1 получил адрес 192.168.8.100 Проверяем какой gateway установлен по умолчанию ip route default via 192.168.1.10 dev eth0 192.168.1.0/24 dev eth0 proto kernel scope link src 192.168.1.247 192.168.8.0/24 dev eth1 proto kernel scope link src 192.168.8.100 В качестве шлюза видим 192.168.1.10 интерфейс eth0. Это значит, что в интернет мы будем выходить через сеть eth0, а нам надо через модем eth1. Для этого удалим шлюз по умолчанию sudo route del default И добавим в качестве шлюза модем 192.168.8.1 sudo route add default gw 192.168.8.1 Проверяем default via 192.168.8.1 dev eth1 192.168.1.0/24 dev eth0 proto kernel scope link src 192.168.1.247 192.168.8.0/24 dev eth1 proto kernel scope link src 192.168.8.100 Теперь в интернет мы выходим через модем HUAWEI E3372 Пока используется только такой способ. Сейчас разбираюсь как сделать, что бы: 1. При одновременных подключения и сети и модема шлюз был бы eth0 2. При обрыве соединения или отсутствии соединения на интерфейсе eth0 при включении, шлюз автоматически переключался бы на eth1 Если у кого есть опыт в данном вопросе прошу помочь. Cubietruck. Дорожный мини сервер. Часть 1 Cubietruck. Дорожный мини сервер. Часть 2 Tags: Hubs: Total votes 19: ↑12 and ↓7+5 Comments9 Articles
{ "url": "https://habr.com/en/articles/235361/", "source_domain": "habr.com", "snapshot_id": "CC-MAIN-2024-30", "warc_metadata": { "Content-Length": "102585", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:RAJYNEDZVJCQEP7QMQ5OLIHDXSA5YCZE", "WARC-Concurrent-To": "<urn:uuid:2af7c07b-0460-418a-9463-9abc2a1353c5>", "WARC-Date": "2024-07-15T05:55:36Z", "WARC-IP-Address": "178.248.237.68", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:OY45PD2IUWJSZJ3X5KZ4ODSSX35IGYDI", "WARC-Record-ID": "<urn:uuid:dac3bda4-37d0-451d-992e-0e2c307dbc1f>", "WARC-Target-URI": "https://habr.com/en/articles/235361/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:8cccadd0-eb7e-4461-b7fc-3afbc6db9fae>" }, "warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-168\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 16, 17, 59, 60, 78, 87, 88, 118, 119, 120, 156, 192, 193, 287, 299, 300, 301, 325, 381, 431, 492, 555, 594, 643, 644, 704, 710, 711, 739, 842, 843, 902, 936, 937, 954, 956, 975, 996, 997, 1105, 1161, 1236, 1297, 1358, 1420, 1484, 1523, 1582, 1583, 1641, 1689, 1698, 1699, 1733, 1802, 1871, 1872, 2050, 2073, 2074, 2119, 2157, 2158, 2168, 2201, 2270, 2339, 2340, 2394, 2395, 2434, 2473, 2539, 2667, 2668, 2721, 2722, 2764, 2806, 2812, 2818, 2847, 2857, 2858 ], "line_end_idx": [ 16, 17, 59, 60, 78, 87, 88, 118, 119, 120, 156, 192, 193, 287, 299, 300, 301, 325, 381, 431, 492, 555, 594, 643, 644, 704, 710, 711, 739, 842, 843, 902, 936, 937, 954, 956, 975, 996, 997, 1105, 1161, 1236, 1297, 1358, 1420, 1484, 1523, 1582, 1583, 1641, 1689, 1698, 1699, 1733, 1802, 1871, 1872, 2050, 2073, 2074, 2119, 2157, 2158, 2168, 2201, 2270, 2339, 2340, 2394, 2395, 2434, 2473, 2539, 2667, 2668, 2721, 2722, 2764, 2806, 2812, 2818, 2847, 2857, 2858, 2866 ] }
{ "red_pajama_v2": { "ccnet_original_length": 2866, "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.01479289960116148, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03698224946856499, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.7011834383010864, "rps_doc_frac_unique_words": 0.5737704634666443, "rps_doc_mean_word_length": 5.904371738433838, "rps_doc_num_sentences": 70, "rps_doc_symbol_to_word_ratio": 0.001479289960116148, "rps_doc_unigram_entropy": 5.121360778808594, "rps_doc_word_count": 366, "rps_doc_frac_chars_dupe_10grams": 0.09254974871873856, "rps_doc_frac_chars_dupe_5grams": 0.2600647807121277, "rps_doc_frac_chars_dupe_6grams": 0.1471540927886963, "rps_doc_frac_chars_dupe_7grams": 0.1471540927886963, "rps_doc_frac_chars_dupe_8grams": 0.09254974871873856, "rps_doc_frac_chars_dupe_9grams": 0.09254974871873856, "rps_doc_frac_chars_top_2gram": 0.02591392956674099, "rps_doc_frac_chars_top_3gram": 0.04442387819290161, "rps_doc_frac_chars_top_4gram": 0.03701990097761154, "rps_doc_books_importance": -310.564453125, "rps_doc_books_importance_length_correction": -310.564453125, "rps_doc_openwebtext_importance": -146.00265502929688, "rps_doc_openwebtext_importance_length_correction": -146.00265502929688, "rps_doc_wikipedia_importance": -124.23645782470703, "rps_doc_wikipedia_importance_length_correction": -124.23645782470703 }, "fasttext": { "dclm": 0.22134029865264893, "english": 0.003587230108678341, "fineweb_edu_approx": 1.9281479120254517, "eai_general_math": 0.000007269999969139462, "eai_open_web_math": 0.003613170003518462, "eai_web_code": 0.9599179029464722 } }
{ "free_decimal_correspondence": { "primary": { "code": "004.6", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "005.456", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
-2,387,096,104,217,931,300
gbk转换为utf 8 php,PHP中文GBK编码转UTF-8 iconv 和 mb_convert_encoding的区别 函数比较 string mb_convert_encoding( string str, string to_encoding [, mixed from_encoding] ) 需要先enable mbstring 扩展库,在 php.ini里将; extension=php_mbstring.dll 前面的 ; 去掉 mb_convert_encoding 可以指定多种输入编码,它会根据内容自动识别,但是执行效率比iconv差太多; string iconv ( string in_charset, string out_charset, string str ) 注意:第二个参数,除了可以指定要转化到的编码以外,还可以增加两个后缀://TRANSLIT 和 //IGNORE,其中 //TRANSLIT 会自动将不能直接转化的字符变成一个或多个近似的字符,//IGNORE 会忽略掉不能转化的字符,而默认效果是从第一个非法字符截断。 Returns the converted string or FALSE on failure. 示例 做一个GBK To UTF-8 < ?php header("content-Type: text/html; charset=Utf-8"); echo mb_convert_encoding("妳係我的友仔", "UTF-8", "GBK"); ?> $content = iconv("UTF-8", "GBK//IGNORE",$content); PHP——字符串统一转码为GBK,自动判断是否UTF8并转码 public static function strToGBK($strText) { $encode = mb_detect_encoding($strText, array('UTF-8','GB2312','GBK')); if($encode == "UTF-8") { return @iconv('UTF-8','GB18030',$strText); } else { return $strText; } } 实战 $str = "馃槝馃槝"; // $str = "鑼跺崱闀囧崄瀛楄矾鍙e悜鍖?00绫?楂樺師缇庝附涔℃潙澶ч棬鏃佽竟"; // $new_str = iconv( "gbk","utf-8", $str); $new_str = iconv('UTF-8', 'GBK//TRANSLIT', $str); dump($new_str); // iconv("UTF-8", "GBK//IGNORE", $text); echo mb_convert_encoding($str, "GBK", "UTF-8"); dump($str_new); dump($new_str); 表情包 插入表情 评论将由博主筛选后显示,对所有人可见 | 还能输入1000个字符 相关推荐 ©️2020 CSDN 皮肤主题: 1024 设计师:白松林 返回首页
{ "url": "https://blog.csdn.net/weixin_31614753/article/details/115151630", "source_domain": "blog.csdn.net", "snapshot_id": "crawl=CC-MAIN-2021-25", "warc_metadata": { "Content-Length": "118264", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:LVMR6Q446O3P74DD23GTRDCBOLEK5FSS", "WARC-Concurrent-To": "<urn:uuid:54465cd1-9f1f-4b36-99ee-932fdcb5c4b3>", "WARC-Date": "2021-06-15T06:31:03Z", "WARC-IP-Address": "182.92.187.217", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:B7Q3BT4AWSAKCINLCUTFLHDIDGUX2G2D", "WARC-Record-ID": "<urn:uuid:0d91161d-702d-4f7a-adbc-760ce4ec81fe>", "WARC-Target-URI": "https://blog.csdn.net/weixin_31614753/article/details/115151630", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:8702e4c0-2ad4-4201-851d-1a2d44b2b219>" }, "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-40.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, 33, 34, 65, 66, 71, 72, 157, 158, 230, 231, 290, 291, 358, 359, 495, 496, 546, 547, 550, 551, 567, 568, 575, 576, 626, 627, 679, 680, 683, 684, 735, 736, 767, 768, 810, 811, 813, 814, 885, 886, 909, 910, 912, 913, 956, 957, 959, 960, 965, 966, 968, 969, 986, 987, 989, 990, 992, 993, 996, 997, 1012, 1013, 1060, 1061, 1104, 1105, 1155, 1156, 1172, 1173, 1214, 1215, 1263, 1264, 1280, 1281, 1297, 1298, 1302, 1307, 1340, 1345 ], "line_end_idx": [ 33, 34, 65, 66, 71, 72, 157, 158, 230, 231, 290, 291, 358, 359, 495, 496, 546, 547, 550, 551, 567, 568, 575, 576, 626, 627, 679, 680, 683, 684, 735, 736, 767, 768, 810, 811, 813, 814, 885, 886, 909, 910, 912, 913, 956, 957, 959, 960, 965, 966, 968, 969, 986, 987, 989, 990, 992, 993, 996, 997, 1012, 1013, 1060, 1061, 1104, 1105, 1155, 1156, 1172, 1173, 1214, 1215, 1263, 1264, 1280, 1281, 1297, 1298, 1302, 1307, 1340, 1345, 1380 ] }
{ "red_pajama_v2": { "ccnet_original_length": 1380, "ccnet_original_nlines": 82, "rps_doc_curly_bracket": 0.004347830079495907, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.015673980116844177, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.09717868268489838, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.6269592642784119, "rps_doc_frac_unique_words": 0.7636363506317139, "rps_doc_mean_word_length": 8.92727279663086, "rps_doc_num_sentences": 8, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.252962112426758, "rps_doc_word_count": 110, "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.018329940736293793, "rps_doc_frac_chars_top_3gram": 0, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -82.59517669677734, "rps_doc_books_importance_length_correction": -82.5912094116211, "rps_doc_openwebtext_importance": -60.95999526977539, "rps_doc_openwebtext_importance_length_correction": -60.95999526977539, "rps_doc_wikipedia_importance": -29.7028751373291, "rps_doc_wikipedia_importance_length_correction": -28.49566078186035 }, "fasttext": { "dclm": 0.9387621283531189, "english": 0.07726381719112396, "fineweb_edu_approx": 3.533721923828125, "eai_general_math": 0.023806210607290268, "eai_open_web_math": 0.002190890023484826, "eai_web_code": 0.5238192677497864 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.0151", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "6", "label": "Indeterminate" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
-259,450,829,871,036,770
uses maze.Maze, maze.makeMaze, maze.simpleSolver, io.print printArray(s:array[string]) = ( h:int = length s; i:int = 0; while (i < h) ( print(s[i]); print("\N"); i++ ) ) main(args:array[string]):int = ( maze:array[string] = new string[15](""); // simple maze, no backtracking //maze[ 0] = "**************************************************"; //maze[ 1] = "*S....* * * *..............* ** * *"; //maze[ 2] = "** **..** * * *.************.**** * *** *"; //maze[ 3] = "* **.* * *....*......**.* ******** *"; //maze[ 4] = "** * *.* * * * ****.*.*** ....** *......* *****"; //maze[ 5] = "* *.*** * *******.*.* * * *** *.****.*** *"; //maze[ 6] = "* ****...............*.* ****** ***.* *.* * *"; //maze[ 7] = "* ********* ********.* *..........* **.****** *"; //maze[ 8] = "* * * * ......* .********** * ......* *"; //maze[ 9] = "***** * * *** *.* * *...* * *** *.* *"; //maze[10] = "* *** * * * *.*** * ***.* * ***** ***.* *"; //maze[11] = "* * * * * *...* * *.* *** *.........* *"; //maze[12] = "*** **** *********.********.* * ****.********** *"; //maze[13] = "* *..........* *...........F*"; //maze[14] = "**************************************************"; // complicated maze... lots of backtracking maze[ 0] = "**************************************************"; maze[ 1] = "*S *"; maze[ 2] = "** ** ** * * * ************ **** * *** *"; maze[ 3] = "* ** * * * * ** * ******** *"; maze[ 4] = "* ************ **** * * *****"; maze[ 5] = "* * *** * ** *** * * * * *** * **** *** *"; maze[ 6] = "* **** * * ****** *** * * * * *"; maze[ 7] = "* ********* ******** * * * ** ****** *"; maze[ 8] = "* * * * * ********** * * *"; maze[ 9] = "***** * * *** * * * * * * * *** * * **"; maze[10] = "* *** * * * * *** * *** * * ***** *** * *"; maze[11] = "* * * * * * * * * * *** * *"; maze[12] = "*** **** ********* ******** * * ** * ********** *"; maze[13] = "* * * F*"; maze[14] = "**************************************************"; m:Maze = makeMaze(maze, length maze[0], length maze); m.reset(); print("\N\NEmpty Board:\N"); printArray(m.asText()); m.solve(simpleSolver()); print("\N\NSolved Board:\N"); printArray(m.asText()); 0 )
{ "url": "https://courses.cs.cornell.edu/cs412/2000SP/resources/bench/maze_test.mod", "source_domain": "courses.cs.cornell.edu", "snapshot_id": "crawl=CC-MAIN-2021-49", "warc_metadata": { "Content-Length": "3053", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:AH3GLKFXTIFDCV2EQUMU4NREUN2HKPIY", "WARC-Concurrent-To": "<urn:uuid:a296a972-2bb5-4957-af40-90927da1b92e>", "WARC-Date": "2021-12-02T10:28:02Z", "WARC-IP-Address": "128.253.49.40", "WARC-Identified-Payload-Type": "text/plain", "WARC-Payload-Digest": "sha1:JJDTWWL3QEB43VUM6ARIXKISGNF2LEN2", "WARC-Record-ID": "<urn:uuid:302b9f24-58ed-43d0-be20-db2384aa7376>", "WARC-Target-URI": "https://courses.cs.cornell.edu/cs412/2000SP/resources/bench/maze_test.mod", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3042cb79-8e3c-4801-a5fc-5752c442145e>" }, "warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-12\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0 ], "line_end_idx": [ 2127 ] }
{ "red_pajama_v2": { "ccnet_original_length": 2127, "ccnet_original_nlines": 0, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.03368794173002243, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01595745049417019, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.804964542388916, "rps_doc_frac_unique_words": 0.5151515007019043, "rps_doc_mean_word_length": 5.141414165496826, "rps_doc_num_sentences": 23, "rps_doc_symbol_to_word_ratio": 0.06205673888325691, "rps_doc_unigram_entropy": 3.478020668029785, "rps_doc_word_count": 99, "rps_doc_frac_chars_dupe_10grams": 0.36935165524482727, "rps_doc_frac_chars_dupe_5grams": 0.36935165524482727, "rps_doc_frac_chars_dupe_6grams": 0.36935165524482727, "rps_doc_frac_chars_dupe_7grams": 0.36935165524482727, "rps_doc_frac_chars_dupe_8grams": 0.36935165524482727, "rps_doc_frac_chars_dupe_9grams": 0.36935165524482727, "rps_doc_frac_chars_top_2gram": 0.06286837160587311, "rps_doc_frac_chars_top_3gram": 0.066797636449337, "rps_doc_frac_chars_top_4gram": 0.08251473307609558, "rps_doc_books_importance": -317.73187255859375, "rps_doc_books_importance_length_correction": -317.73187255859375, "rps_doc_openwebtext_importance": -99.28368377685547, "rps_doc_openwebtext_importance_length_correction": -99.28368377685547, "rps_doc_wikipedia_importance": -105.47663116455078, "rps_doc_wikipedia_importance_length_correction": -105.47663116455078 }, "fasttext": { "dclm": 1.0000094175338745, "english": 0.39029109477996826, "fineweb_edu_approx": 2.6559271812438965, "eai_general_math": 0.7805113196372986, "eai_open_web_math": 0.3137943744659424, "eai_web_code": 0.9337387681007385 } }
{ "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": "793.73", "labels": { "level_1": "Arts", "level_2": "Amusements and Recreation", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
2,179,728,146,146,835,700
327 is 59 Percent of what? 327 is 59 Percent of 554.24 % 327 is 59% of 554.24 Calculation steps: 327 ÷ ( 59 ÷ 100 ) = 554.24 Calculate 327 is 59 Percent of what? • F Formula 327 ÷ ( 59 ÷ 100 ) • 1 Percent to decimal 59 ÷ 100 = 0.59 • 2 327 ÷ 0.59 = 554.24 So 327 is 59% of 554.24 Example
{ "url": "https://calcforme.com/percentage-calculator/327-is-59-percent-of-what", "source_domain": "calcforme.com", "snapshot_id": "crawl=CC-MAIN-2022-27", "warc_metadata": { "Content-Length": "14565", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:V2SPOEI3NUTMPLXFDR5VH3ZEACN5OPWZ", "WARC-Concurrent-To": "<urn:uuid:8bd9ebd7-4bb5-4ee7-bfdd-f6217d8127c4>", "WARC-Date": "2022-06-30T04:30:21Z", "WARC-IP-Address": "76.76.21.93", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:F5NBVM5TG5AWFHVZB5EOEV65FKIEISYC", "WARC-Record-ID": "<urn:uuid:40a261df-fcbe-47ac-8e3e-4d96c80a732f>", "WARC-Target-URI": "https://calcforme.com/percentage-calculator/327-is-59-percent-of-what", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:5c6cd7a1-43d1-4f85-b31b-d65dd82d8843>" }, "warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-203\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 27, 28, 56, 57, 59, 60, 81, 82, 101, 102, 130, 131, 168, 169, 175, 176, 188, 189, 212, 213, 219, 220, 243, 244, 264, 265, 271, 272, 320, 321 ], "line_end_idx": [ 27, 28, 56, 57, 59, 60, 81, 82, 101, 102, 130, 131, 168, 169, 175, 176, 188, 189, 212, 213, 219, 220, 243, 244, 264, 265, 271, 272, 320, 321, 328 ] }
{ "red_pajama_v2": { "ccnet_original_length": 328, "ccnet_original_nlines": 30, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.14606742560863495, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.011235959827899933, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.7191011309623718, "rps_doc_frac_unique_words": 0.35483869910240173, "rps_doc_mean_word_length": 3.1935484409332275, "rps_doc_num_sentences": 10, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 2.7872531414031982, "rps_doc_word_count": 62, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.5252525210380554, "rps_doc_frac_chars_dupe_6grams": 0.20202019810676575, "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.1262626349925995, "rps_doc_frac_chars_top_3gram": 0.17676767706871033, "rps_doc_frac_chars_top_4gram": 0.21212120354175568, "rps_doc_books_importance": -34.17522048950195, "rps_doc_books_importance_length_correction": -34.17522048950195, "rps_doc_openwebtext_importance": -25.646724700927734, "rps_doc_openwebtext_importance_length_correction": -25.646724700927734, "rps_doc_wikipedia_importance": -10.555009841918945, "rps_doc_wikipedia_importance_length_correction": -10.555009841918945 }, "fasttext": { "dclm": 0.3421093821525574, "english": 0.7798298001289368, "fineweb_edu_approx": 2.3731722831726074, "eai_general_math": 0.9651408195495605, "eai_open_web_math": 0.9737442135810852, "eai_web_code": 0.0526311993598938 } }
{ "free_decimal_correspondence": { "primary": { "code": "513.2", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Geometry" } }, "secondary": { "code": "-1", "labels": { "level_1": "", "level_2": "", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "-1", "label": "Abstain" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "0", "label": "No missing content" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
6,024,643,288,280,593,000
How can I protect my server from dictionary password attacks? 1. Home 2. Knowledge Base 3. GMS 4. How can I protect my server from dictionary password attacks? Question Dictionary attacks are designed to find the password used to access an account normally consist of many attempts to log on to an account each using a different password. Many different combinations of password are attempted until the correct one is found. Answer Gordano’s software automatically protects from potential dictionary attacks designed to discover users passwords. Each failed log on attempt to an account will set a "LogonDelay" variable for that account. Each subsequent failed log on attempt will increase that delay. The delay is reset once an account is correctly logged in to using the correct information. For instance the first failed log on will set a delay of 1 second, the second a delay of 2 seconds, the third a delay of 4 seconds and so on. This is normally more than enough to disuade any dictionary attacks as by the time they have tried say ten times the delay is already up to 512 seconds. They may have to try many thousands of combinations before they get the correct one. Keywords:Dictionary, Password, Attack, Delay, log on, logon, log Was this article helpful? Related Articles
{ "url": "https://www.gordano.com/knowledge-base/how-can-i-protect-my-server-from-dictionary-password-attacks-3/", "source_domain": "www.gordano.com", "snapshot_id": "crawl=CC-MAIN-2021-21", "warc_metadata": { "Content-Length": "33520", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:27JNUEC2IHYN4ZLBXSZNYRXNED554TJR", "WARC-Concurrent-To": "<urn:uuid:f2626623-f84a-4392-921d-3dcdf5ff4d03>", "WARC-Date": "2021-05-11T10:39:56Z", "WARC-IP-Address": "63.33.163.210", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:AAFB3CSWSSFBD7SCHL75RBN7SG36JHIF", "WARC-Record-ID": "<urn:uuid:e704873a-c400-47d7-a076-9f521ccf4281>", "WARC-Target-URI": "https://www.gordano.com/knowledge-base/how-can-i-protect-my-server-from-dictionary-password-attacks-3/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:936ea744-da10-46f8-9535-73f112ba7d14>" }, "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-81.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, 62, 63, 73, 93, 102, 169, 170, 179, 180, 436, 437, 444, 445, 559, 560, 808, 809, 951, 952, 1190, 1191, 1256, 1257, 1283, 1284 ], "line_end_idx": [ 62, 63, 73, 93, 102, 169, 170, 179, 180, 436, 437, 444, 445, 559, 560, 808, 809, 951, 952, 1190, 1191, 1256, 1257, 1283, 1284, 1300 ] }
{ "red_pajama_v2": { "ccnet_original_length": 1300, "ccnet_original_nlines": 25, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.41056910157203674, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.012195119634270668, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.1463414579629898, "rps_doc_frac_unique_words": 0.5092592835426331, "rps_doc_mean_word_length": 4.810184955596924, "rps_doc_num_sentences": 17, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.418297290802002, "rps_doc_word_count": 216, "rps_doc_frac_chars_dupe_10grams": 0.09817132353782654, "rps_doc_frac_chars_dupe_5grams": 0.09817132353782654, "rps_doc_frac_chars_dupe_6grams": 0.09817132353782654, "rps_doc_frac_chars_dupe_7grams": 0.09817132353782654, "rps_doc_frac_chars_dupe_8grams": 0.09817132353782654, "rps_doc_frac_chars_dupe_9grams": 0.09817132353782654, "rps_doc_frac_chars_top_2gram": 0.024061599746346474, "rps_doc_frac_chars_top_3gram": 0.03176131099462509, "rps_doc_frac_chars_top_4gram": 0.026948990300297737, "rps_doc_books_importance": -133.22657775878906, "rps_doc_books_importance_length_correction": -133.22657775878906, "rps_doc_openwebtext_importance": -66.73193359375, "rps_doc_openwebtext_importance_length_correction": -66.73193359375, "rps_doc_wikipedia_importance": -39.2838134765625, "rps_doc_wikipedia_importance_length_correction": -39.283809661865234 }, "fasttext": { "dclm": 0.5243436098098755, "english": 0.9319707155227661, "fineweb_edu_approx": 2.5559027194976807, "eai_general_math": 0.26383286714553833, "eai_open_web_math": 0.07297825813293457, "eai_web_code": 0.030031979084014893 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.822", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }
ece34605c058195ed03b4d393ef1a36c
4,126,455,600,904,860,700
ERROR: type should be string, got "https://project-haystack.org/forum/topic/feed Project Haystack Forum 2017-10-17T18:11:10Z Brian Frank https://project-haystack.org/forum/topic/551#0 Haystack Type System WG 2017-10-17T18:11:10Z\n\nOverview\n\nHaystack is designed around the concept of tagging entities with name/value pairs to describe facts about those entities. The formal definitions of these tags and their value types are captured in a machine readable format (Trio files) which is used to generate the tags section of this website. But how tags are combined lacks formal machine readable definitions. For example the description and constraints of how to model site/equip/point entities is largely described by documentation without a corresponding formal schema and machine readable format. Historically this has been by design since formalization of \"compound types\" introduces significant complexity. But with broader adaptation of Haystack, there seems to be a pent-up demand to formalize types/schema. We believe its time to tackle this problem, and would like to kick start a new working group.\n\nI have spent several weeks designing various prototypes with help from Matthew Giannini. By way of this post, I will describe a fairly complete prototype which serves as a starting point for a proposal on how types might work in Haystack. The prototype defines most of the Haystack model using a type system I will discuss here. I have made the source code and the documentation it generates available for download (discussed below).\n\nRequirements\n\nLeverage Markers: we wish to leverage Haystack's existing and extensive use of markers as the basis for a more advanced data type system. We do not wish to introduce a new concept such as a \"type\" tag.\n\nNo Indirection: all data semantics should be captured in the entity's tags. You should not be required to have previous knowledge (such as a data dictionary) or make an additional network request to infer semantics. For example if a point currently uses discharge air temp sensor, then that will not be coalesced into some abstract \"tag set\" name that requires another request to know that all those tags were applied. Or put another way: entities will always continue to expand their full set of tags inline.\n\nTooling: a common use case for a more advanced type system is to allow tool manufactures to develop UIs that \"guide\" users to properly tag their data. Capturing tag relationships and rules in machine format is a key requirement for tooling\n\nValidation: a machine readable schema allows validation of data models. But we acknowledge that type systems require a trade-off; more complex type systems are required to more fully validate data. And no declarative type system can perform 100% validation. We wish to strike a compromise with a practical type system that performs basic validation, but will not provide perfect validation.\n\nRDF: it is desired that enhancements to Haystack allow our taxonomy to be expressed in alternate formats such as RDFS, RDFa, micro-data, JSON-LD, etc. These technologies are based on the concept of subject-predicate-object triples that map well to Haystack's entity name/value tags. And ideally we want to map Haystack types to the RDF Schema class model.\n\nSource Definitions: the goal of this effort is to rewrite the project-haystack.org specification source material using the new definitions and formats as the authoritative source. The machine readable formats will be directly accessible over HTTP and also used to auto-generation the HTML presented on the site.\n\nObservations\n\nLets begin with a couple observations of how the existing model works. There are essentially only four \"root\" entity types: sites, equips, points, and weather stations. All other Haystack tags are used to annotate these four core entity types with additional information.\n\nThere are three distinct ways we use tags to annotate the core entity types:\n\n • Has Tags: an entity may have specific value based tags. For example a site entity may apply the area tag to define the building's square footage. This sort of tag usage includes all the tags which are neither markers nor refs.\n • Subtyping Tags: we use marker tags to create subtypes to further refine the semantics of a given entity. For example adding sensor to a point entity narrows the type of point represented\n • Relationship Tags: we use ref tags to establish relationships between entities. For example adding equipRef on a point defines a equip/point containment relationship\n\nIn all three cases, what we really desire is to document the behavior of a specific combination of tags. This has been a pain point maintaining the documentation. For example lets take the water tag. It has a generic definition which means \"associated with liquid water\". But it also has more specific definitions when paired with point, meter, or tank. In our final solution, we want tags to be defined generically with more specific documentation as we combine tags.\n\nTag Based Subtyping\n\nWe add marker tags to an entity to indicate a more specific type of the entity. For example we add ahu to equip to mark the equipment as an air handler unit. We can further mark the AHU with steamHeat to indicate its an AHU using steam from a central plant for heating. Each time we apply a marker tag we further restrict what the entity type represents. From a type system perspective, this is a form of subtyping.\n\nThere are two key observations to be made about how marker tags are used for subtyping:\n\n • Subtypes are often defined as an exclusive choice: for example an AHU can have hotWaterHeat, steamHeat, elecHeat, or gasHeat\n • Subtyping is multi-dimensional: for example I can subtype a AHU by its heating method, cooling method, and ductwork configuration (all simultaneously)\n\nThis pattern plays out in the documentation quite often in a non-formal way:\n\n • Point qualifier: sensor, cmd, sp\n • Point subject: air, water, steam, elec, etc\n • Point quantity: temp, flow, pressure, power, energy, etc\n • Power Qualifier: active, reactive, apparent\n • AHU heating: steamHeat, hotWaterHeat, gasHeat, elecHeat\n • AHU cooling: dxCool, chilledWaterCool\n • AHU ductwork: singleDuct, dualDuct, tripleDuct\n • VAV airflow: series, parallel\n • Chiller type: absorption, reciprocal, screw, centrifugal\n\nAnother important consideration is that these exclusive choices are often open ended. This is opposed to an enum in a programming language which is closed (once defined you may not add new choices to the enumeration). But in a data model type system, these enumerated choices may be expanded after the fact. An example might be a project which requires a subtype choice not covered by the standard Haystack tag library.\n\nType Names\n\nOne of the common questions I've heard over the years is this: why not just define a shorthand name for a combination of tags such as \"discharge air temp point\". But what would this name be? Creating a shortcut such as \"DAT\" would go against the principle of avoiding indirection to understand an entity's tags. And to provide the same information without indirection would lead to a name such as \"DischargeAirTempPoint\" which sort of defeats the purpose of creating new names. I would propose that any new synthetic name generated for Haystack's type system is strictly just a combination of existing tag names. For example the type that represents an AHU with steam heating:\n\nequip ahu steamHeat // tags separated by space\nequip-ahu-steamHeat // tags separated with dash\nequip+ahu+steamHeat // tags separated with plus\nsteamHeat ahu equip // most specific to least specific\n\nFor this proposal I will use the first option: a type name is a list of tags separated by space and ordered from least to most specific. For the prototype documentation HTML pages I used dash instead of space as a more URL friendly file name.\n\nSide note: I also investigated using camel case to join tags name together (if all tags were lowercase). But we have many tags such as hotWaterHeat where this would cause a problem. These compound tag names are a potential problem which could possibly be solved more elegantly through the type system. But I'll leave that as a discussion for the working group.\n\nNotation\n\nIn order to discuss how we might apply a type system to Haystack tags using the concepts above, we need some notation. I'm going to introduce a notation/syntax which I have found concise and readable to develop the prototype. However, my proposal is based on the abstraction concepts, not the specific syntax I am using here. However at some point we will need to formalize one or more machine readable formats which capture the type system abstractions.\n\nHere is the quick summary of notation:\n\ntype > tag // type has tag\ntype dim> // type has subtype dimension\ntype dim> tag // subtype choice within given dimension\ntype <ref> type // relationship definition\n\nLets look at each of these notations in more detail...\n\nNotation: Has\n\nLets start off with an entity which might have data tags:\n\nsite > area // Square footage of the site\nsite > tz // Timezone of the site\nsite > primaryFunction // Primary function of the site\nsite > yearBuilt // Original construction year of the site\n\nHere we using the syntax \"type > tag\" to define that the LHS (left hand side) type may optionally use the RHS (right hand side) tag according the definition given in the slash-slash comment. This definition is context specific to when the tag is applied to the LHS type.\n\nWe can use Python style indentation to omit the base type. The following has exactly the same semantics as the definitions above:\n\nsite \n > area // Square footage of the site\n > tz // Timezone of the site\n > primaryFunction // Primary function of the site\n > yearBuilt // Original construction year\n\nNotation: Subtype\n\nHere is how to define a subtype dimension\n\npoint subject> // Subject or substance of the point's measurement or control\npoint subject> air // Point related to air\npoint subject> water // Point related to water\npoint subject> steam // Point related to steam\npoint subject> elec // Point related to electricity\n\nHere we define a named dimension of subtyping on points. In this case the dimension name is subject as defined with the syntax \"type dim>\". Then we can define exclusive subtype choices for that dimension with the syntax \"type dim> tag\". Each choice defines a new type. In our example above, we have now defined the new types \"point air\", \"point water\", etc.\n\nWe can use indentation to collapse the definition above. And lets flush out more point subtypes to see how it works in practice:\n\npoint\n\nqualifier> // Classifies the point as a sensor, command, or setpoint\n sensor // Point is a sensor, input, AI/BI\n cmd // Point is a command, actuator, AO/BO\n sp // Point is a setpoint, soft point, internal control variable, schedule\n\nsubject> // Subject or substance of the point's measurement or control\n air // Point related to air\n water // Point related to water\n steam // Point related to steam\n elec // Point related to electricity\n refrig // Point related to refrigerant substance\n\nair\n\n quantity> // Quantity of air measured or controlled\n temp // Point related to dry bulb air temperature\n humidity // Point related to percent relative humidity of air\n flow // Point related to volumetric air flow\n pressure // Point related to static air pressure\n\nwater\n\n quantity> // Quantity of water measured or controlled\n temp // Point related to water temperature\n flow // Point related to volumetric water flow\n pressure // Point related to water pressure\n\n waterType> // Type of the water and its usage\n domestic // Tap water for drinking, washing, cooking, and flushing of toliets\n hot // Hot water used for heating or supply to hot taps\n chilled // Water used for cooling\n condenser // Water used used to remove heat through condensation\n makeup // Water used used to makeup water loss through leaks, evaporation, or blowdown\n blowdown // Water expelled from a system to remove mineral build up\n\nWhat is created as you define these dimensions and their choices is a \"type tree\" or \"decision tree\". Each time you add a marker tag it potentially opens up new choices to narrow the type along multiple branches (dimensions).\n\nNotation: Relationship\n\nLastly we need a notation to define relationships. Here are some examples:\n\nequip <equipRef> equip // Equipment contains sub-equipment\nequip <equipRef> point // Equipment contains point\n\nA relationship has a LHS type and a RHS type and one or more relationship tags grouped between the \"<>\". The first relationship tag must be a ref tag which is applied to the entity on the RHS to reference the LHS. Or put another way the RHS is the \"from entity\" and the LHS is the \"to entity\" in terms of the ref tag. Lets deconstruct this example:\n\nLHS Tags RHS Doc definition of relationship\n----- --------- ----- -------------------------------\nequip <equipRef> point // Equipment contains point\n\nThe LHS type is any entity tagged with the equip marker tag. The RHS is a point entity. In order to apply the relationship, then the equipRef tag must applied to the RHS (the point) and reference the LHS (the equip). When all of those conditions hold true, then the relationship applies.\n\nWe can define additional tags to apply to the RHS entity for more complex relationships:\n\nequip ahu <equipRef discharge> point air // AHU point associated with discharge air duct\nequip ahu <equipRef return> point air // AHU point associated with return air duct\n\nIn the example above, the LHS (to) is AHU equipment and the RHS (from) is points associated with the measurement/control of air. The relationship tags include both a ref tag as well as a \"section tag\" to apply to the point to create the specified relationship. This model allows us to reuse the subtype definition of \"point air\" without duplicating massive point tag combinations under each equipment (like we do today).\n\nHere are some more relationship examples for a steam plant:\n\nequip plant steam\n\n <steamPlantRef> equip ahu steamHeat // Plant supplies steam to AHU for heating \n <equipRef> equip boiler // Plant contains boiler\n <equipRef leaving> point steam // Point associated with steam leaving plant as heating supply\n <equipRef delta> point steam // Point associated with steam differential between leaving and entering\n <equipRef entering> point steam // Point associated with steam returning to plant to be heated back up\n\nPrototype\n\nI have developed a complete prototype for the type system discussed above. This is actually my third prototype (the first two being dead ends). The prototype is developed in Fantom and has following key features:\n\n • TagDef: models a single tag definition\n • TypeDef: models type, its has tags, dimensions, and relationships\n • Model: immutable data structure for all the TagDef and TypeDef\n • Loader: loads one or more haydef text files to build an in-memory model\n • DocGen: generates simple HTML documentation for a model\n • lib/*.haydef: definitions for about 70% of the Haystack model using notation discussed\n\nYou can download the prototype include source code, definitions, and example documentation from:\n\nhttps://project-haystack.org/download/build/haystack-model-prototype-2017-10-17.zip\n\nTo run the documentation use this command which generates HTML files to \"./doc/\"\n\nbin/fan haystackModel::DocGen\n\nThe prototype has quite a bit of the model flushed out including\n\n • air, water, steam points\n • electrical meters and power/energy/volt/current points\n • central plants (using simple, not existing compound tags)\n • chillers\n • boilers\n • VAVs\n\nNone of it is complete, but its pretty far along to test out the concepts. If you are interested in this topic, then I would encourage you to download it and at least look thru the haydef text files.\n\nNext Steps\n\nThere seems to lots of momentum with various organizations, vendors, and community members around this core problem. I believe now is a great time to tackle the problem head on. So I'd like to create a new working group (WG) for those interested. I'm thinking of a WG process with weekly webcast calls. Also feel free to post ideas/comments to the forum. If you are interested please use the \"Join Group\" command to join the WG.\n\nTerry Herr https://project-haystack.org/forum/topic/548#12 auto-tagging 2017-10-16T21:20:55Z\n\nGabe,\n\nthose are good articles. I found them a while back. That conference looks interesting. I am not aware that Johnson published anything regarding their standard. We have lots of BAS data sets, and many are Johnson. The standard I am referring to is typically only the last acronym in the longer point name which as you note also includes network controllers acronyms.\n\nChristian, LON was much better than BACnet at defining and requiring standard snvt's (point) naming https://www.lonmark.org/technical_resources/resource_files/snvt.pdf\n\nI believe BACnet is adopting equipment profiles and standard naming, which will make this problem less important some years down the road. In the meantime we are stuck with thousands of buildings with non standard point names.\n\nStephen Frank https://project-haystack.org/forum/topic/536#5 Maintaining consisting on points with Multiple Tags 2017-10-16T15:04:48Z\n\nI recently was sent this academic paper which has some great discussion of some of these issues:\n\nBrick: Towards a Unified Metadata Schema For Buildings\n\nIt builds on both Haystack and RDF and explicitly addresses some of the areas of weakness in Haystack right now, include sets of tags and a formal ontology.\n\nAlthough it seems pretty academic to me (and maybe clunky to implement, if those SPARQL queries are any indication), there are some good ideas in here that could likely be used alongside Haystack or else pulled into Haystack at some future point.\n\nChristian Tremblay https://project-haystack.org/forum/topic/548#11 auto-tagging 2017-10-16T02:58:58Z\n\n@Terry, I don't work a lot with Lonworks anymore but I remember their variables names being the same for standard applications like VFD or VAV...\n\nGabe Fierro https://project-haystack.org/forum/topic/548#10 auto-tagging 2017-10-14T12:31:21Z\n\nHi all:\n\nI'm a PhD student at UC Berkeley working on building metadata, analytics and controls. Just wanted to jump in and provide some pointers to some of the academic work in this area:\n\nDeconstructing human-readable tags\n\nIdentifying sensor streams\n\nThe BuildSys conference is a growing community of computer scientists, building scientists, mechanical/civil engineers, etc interested in these kinds of topics, so you can search past programs to find other related work.\n\nThe systems I linked above aren't \"production ready\", but they do offer promising avenues of being able to automatically extract tags from existing metadata and timeseries data. Terry, you mentioned that JCI has something like a standard for these point names. Is this written down/published anywhere that I could take a look? In the buildings I've worked with, there's been very little standardization around point names beyond common idiomatic abbreviations such as VAV and AHU. Point names usually betray more about the BMS network than they do about the actual physical relationships (such as which chiller connects to this AHU)\n\nTerry Herr https://project-haystack.org/forum/topic/548#9 auto-tagging 2017-10-13T11:37:33Z\n\nChristian & Aaron,\n\nWhat you describing is a good start - an every growing look-up library/dictionary of standard point names from OEM equipment vendors, and BAS vendors with the appropriate tags added. In our experience OEM vendors do have point name standards, but only Johnson Controls has anything approximating a standard. Most other BAS products allowed the tech-on-the-bucket to create his own point names. The latter case is where you need more sophisticated algorithms using more than just the point name to decipher.\n\nProject Haystack is great example of the community working together for collective benefit. The tagging standard is great, now we need to reduce the time and cost to apply them to a data set. I have seen an example of one tool and heard of another that can ingest (auto-discover) a BAS, apply tags, and then the appropriate rules/algorithms automatically apply. I am sure this will always require some human oversight /vetting, but it would be minimal.\n\nAaron Sanchez https://project-haystack.org/forum/topic/548#8 auto-tagging 2017-10-12T19:17:05Z\n\nThat's a great idea in theory. If we had a csv file for each vendor's point naming structure so that anyone using a system where auto-tagging was possible, they can pull the appopriate csv file. Also, if there were new point names there weren't on the list, anyone can add to each respective csv file and push so that it is up to date. I'm a fan of this idea.\n\nChristian Tremblay https://project-haystack.org/forum/topic/548#7 auto-tagging 2017-10-12T18:48:27Z\n\nAs we can see, there are a lot of solution allowing to tag automatically points. As a community though, would it be viable that some kind of \"sharing\" be possible for basic auto-tagging ?\n\nI'm wearing my integrator hat here. If I have some kind of CSV file (that can be used or modified to be used by any tool) with tags that I would just need to review, what a time saver.\n\nI'm pretty sure everyone is doing its own list actually.\n\nI would see something like :\n\njohnson_control_standard_variables.csv (DA-T : temp, sensor, air, discharge; etc...) ABB_drive_tags.csv CompanyX_HeatPump.csv\n\nFor this I work with variable names has those are typically standard for manufactured products...\n\nThis would not prevent the integrator to \"validate and verify\" that the tagging has been done correctly, but this certainly be valuable information.\n\nA versionning system like github would be very cool to handle those files and anyone could participate doing pull requests.\n\nAaron Sanchez https://project-haystack.org/forum/topic/548#6 auto-tagging 2017-10-12T18:13:56Z\n\nTerry,\n\nEverything you're describing is possible with FIN|Stack, we've just never created the tool ourselves. However, our Fin Framework, allows any user to build virtually anything they want on top of what's already built within FIN|Stack. Obviously you'll have to know axon to do some of these things but we've made it easier for people to launch tools for their functions with the Form Builder 2.0 documentation page.\n\nRicky Villa Valle https://project-haystack.org/forum/topic/550#1 Dropping points into nHaystack Service View results in all controller points showing under Hierarchy 2017-10-10T17:38:16Z\n\nHi Kyle,\n\nThe video are you viewing was made at the end of 2013, which by then an older version of the nhaystack module was being used. It has now changed and usually the haystack slot is used for tagging and specifying an equip if something else other than what its currently under.\n\nIn the newer version, it is automatically displaying all the points under a certain equip whether they have the haystack slot or not. Unfortunately there isn't a property that I know of that will display only the points that haystack slot.\n\nHowever, I do know that in FIN Stack, we have a property on the connector that allows you to toggle it. Then when dragging the entire site over, it would only bring over points with the haystack slot. Otherwise, it would bring in all points.\n\nHopefully Richard, or one of the others will be able to better answer your question. I would consider it a feature request on the Niagara side.\n\nKyle Herbst https://project-haystack.org/forum/topic/550#0 Dropping points into nHaystack Service View results in all controller points showing under Hierarchy 2017-10-10T11:54:39Z\n\nSorry for the lengthy title.\n\nUsing nHaystack 2.0.1 on a N4 4.2.36.34 system.\n\nTrying to click and drag points from my Networks and dropping them into my Site-Equip-Point Hierarchy page, as described on this video How-To created by J2\n\nhttps://www.youtube.com/watch?v=dStqInuDkiE\n\nOnce I create a Site/then Equip, I can drag one single point into the \"Drag Components here to add a haystack slot\" and the whole point list will populate underneath that associated equipment in the haystack window.\n\nThe only single point I've clicked an dragged over will appear with the haystack slot, as is should, however my import function gets messy as it will end up pulling all my points from that equipment (even ones that don't have a haystack tag) into Skyspark.\n\nIs there anything I'm doing wrong that's not being covered in that video? It seems to me that video was created in AX, not N4...however the process appears to be the same from what I can determine.\n\nLong story short, I'm trying to see if I can only have my Hierarchy display points that I want to drag and drop to add the haystack tag, rather than all points underneath that controller.\n\nThanks\n\nTerry Herr https://project-haystack.org/forum/topic/548#5 auto-tagging 2017-10-10T10:44:11Z\n\nThere are a number of tools that can apply tag values from an internal library, via pattern extraction from regular expression text search of the point name.\n\nBetter tools will take advantage of more than than the point name. Most bacnet drivers / discover tools can also extract - point type, units, description, present value,etc from the controller. And these can be used to help decipher / understand the point and add tags.\n\nThe best tools will also use historical time series data, machine learning methods, and an ever expanding dictionary as it learns from more and more data sets. The ideal is a tool that can completely and fully tag a data set without human involvement.\n\nMachine learning methods like - multi layer feature extraction, support vector machine, logistic regression, latent semantic indexing..\n\nThere are a number of researchers from DOE labs, UofC Berkely and Davis, that have done some fundamental research in the development of such a tool. We have one tool that was developed by United Technology Research Center and DOE funded that is a reasonable start, but needs completing. The tool is written in python.\n\nGreg Ingram https://project-haystack.org/forum/topic/545#5 Examples of TagKinds in JSON, Zinc and CSV format 2017-10-09T21:14:46Z\n\nCorrect, I'm working on a few connection APIs. I plan to post a link to them once I feel they are up to par during testing.\n\nI look forward to the test server once released.\n\nThx\n\nBrian Frank https://project-haystack.org/forum/topic/539#2 Two-speed Fans 2017-10-09T12:59:03Z\n\nIf its just one point, then I'd probably use an enum point:\n\npoint\nkind:\"Str\"\nenum:\"off,slow,fast\"\nBrian Frank https://project-haystack.org/forum/topic/545#4 Examples of TagKinds in JSON, Zinc and CSV format 2017-10-09T12:57:09Z\n\nIt sounds like maybe you are implementing your own client and/or server? In that case I think probably the best option might be to use one of the open source projects as a reference. For example the Java Haystack toolkit has a pretty extensive test suite including Zinc, JSON, etc tests. It also has a complete test server you can run and perform all those queries against (read, sub, unsub, etc). Or if you are working with a specific vendor use an actual project. Plus we are probably going to make this site itself a test server pretty soon\n\nGreg Ingram https://project-haystack.org/forum/topic/545#3 Examples of TagKinds in JSON, Zinc and CSV format 2017-10-09T00:24:24Z\n\nJust wanted to ping again to see if anyone had some examples. For example, do you have a large Zinc versus CSV versus JSON file with data similar to what is shown on https://project-haystack.org/doc/Csv?\n\nThanks in advance.\n\nRav Panchalingam https://project-haystack.org/forum/topic/403#11 nhaystack for Niagara 4 available 2017-10-06T05:28:03Z\n\nhello, is there any docs on how to write to a schedule object (via haystack API) ?\n\nAaron Sanchez https://project-haystack.org/forum/topic/548#4 auto-tagging 2017-10-05T19:13:51Z\n\nIf the tool works based off the names of the points. We, at J2 Innovations, have created a tool for this to work with FIN|Stack. It also references a CSV file and can be edited by each SI to fit their point nomenclature.\n\nChristian Tremblay https://project-haystack.org/forum/topic/548#3 auto-tagging 2017-10-05T19:03:28Z\n\nI've added this feature to nHaystack in the latest versions. Based on the name of the point, the module will look at a CSV file and add the tags corresponding to a point name.\n\nThis format allow easy sharing of tags based on names.\n\nThe module also allow to modify the file to be used so one can switch between files if necessary.\n\nReally useful when using always same names in our programs. Or for manufacturing using always the same names in their products.\n\nhttps://bitbucket.org/richiemac_77/nhaystack/src/b070b8e2ee7c8ea122878456d467c82e83697872/README.md?at=ax&fileviewer=file-view-default\n\nJohn Petze https://project-haystack.org/forum/topic/549#0 Embedded Computing Article Series on Semantic Interoperability Includes Discussion of Haystack 2017-10-05T17:54:53Z\n\nI was recently asked to contribute to a multi-part article series on cross-industry IoT interoperability from multiple industry experts being published in Embedded Computing magazine.\n\nIt's a very detailed series of articles and compares a range of semantic efforts across different industries that are part of the IoT. I wanted to make the community aware of the effort and the Haystack participation in the articles.\n\nParts 1-5 are posted on a landing page at http://www.embedded-computing.com/semantic-interop\n\nParts 4 and 5 have been the top \"semantic interoperability\" News for Bing and Google for the past few weeks:\n\nhttps://www.bing.com/news/search?q=semantic+interoperability\n\nhttps://www.google.com/search?q=semantic+interoperability&tbm=nws\n\nPart 1 is currently on the first \"semantic interop\" search page on Bing:\n\nhttps://www.bing.com/search?q=semantic%20interoperability\n\nMore articles in the series will be coming out soon.\n\nAaron Sanchez https://project-haystack.org/forum/topic/548#2 auto-tagging 2017-10-05T16:28:51Z\n\nTerry,\n\nRegarding the auto-tagging tool you've seen in two different vendors, is the auto-tagging done via the names of the points or how does the tool know which tags to apply to each point?\n\nJohn Petze https://project-haystack.org/forum/topic/548#1 auto-tagging 2017-10-05T13:04:16Z\n\nA few thoughts that may be helpful:\n\n 1. Wanted to make you aware of the Project-Builder Plus tool which has been donated to the community as open source. It includes many tools to streamline and automate tagging and accepts a range of data types as input. You can find details here: https://project-haystack.org/forum/topic/467\n 2. If you are working with Niagara systems the nHaystack tool does part of the work automatically by interpreting a range of factors from Niagara points.\n 3. We see a number of our SkyFoundry partners building tools for auto tagging to meet there project needs. Some might be of general use and some may be interested in sharing. Asking the community for comments here is a good step.\nTerry Herr https://project-haystack.org/forum/topic/548#0 auto-tagging 2017-10-05T11:19:13Z\n\nIs there any community effort to build and auto-tagging tool? Meaning, a software tool that applies tags with little or no human involvement.\n\nI know of at least two commercial analytics vendors who are or have built such a tool, but its dedicated to their product. I know of several University or DOE funded research efforts around this problem/task as well.\n\nSuch a tool would reduce the cost of deploying analytics as tagging is one of the most time consuming tasks in the deployment process.\n\nLet me know if anyone else is interested in coordinating an effort to create such a tool.\n\nJohn Petze https://project-haystack.org/forum/topic/547#0 Haystack Connections Magazine Fall 2017 Is Now Available ! 2017-10-04T15:13:12Z\n\nProject-Haystack.org is excited to announce the publication of the Fall 2017 issue of Haystack Connections magazine. Haystack Connections reports the news from the Haystack community around the world and provides updates on the development of working groups, new tagging models, reference implementations, complimentary applications, and success stories from the community as we work together to make device data easier to use across applications of all types.\n\nWith 50 pages of content from members around the world this issue provides clear evidence of the success and continued adoption of Haystack, and the growth of the community. It also includes a focus on the May 2017 Haystack Connect conference that we think readers will see great value in – even if you attended the event – as there was just too much to take in at once. And for the first time, Haystack Connections includes ads from technology suppliers that provide complimentary products, services and applications to the Haystack Community. We greatly appreciate their support of the publication.\n\nYou can find the Fall 2017 issue of Haystack Connections at this link\n\nFinally, special thanks to everyone that contributed to the content for this issue of Haystack Connections and especially to Therese Sullivan, Editor.\n\nBill Smith https://project-haystack.org/forum/topic/546#0 Niagara/Haystack Auth Patch for N4.2 2017-10-03T14:52:14Z\n\nThe authentication mechanism described in http://project-haystack.org/doc/Auth is now available for Niagara 4.2 by installing the following patch modules:\n\nbaja 4.2.36.42.3 jetty-rt 4.2.36.42.3 web-rt 4.2.36.42.3 docDeveloper 4.2.36.42.3\n\nThis will allow you to authenticate to Niagara 4.2 using the scram-sha mechanism defined in the Auth document. You should be able to obtain these through your support channel.\n\nGreg Ingram https://project-haystack.org/forum/topic/545#2 Examples of TagKinds in JSON, Zinc and CSV format 2017-10-01T14:06:22Z\n\nBrian,\n\nYup, those pages are very helpful. I believe I didn't do a good job on my post/question. I mentioned TagKinds, but I'm really looking for examples of the format others have captured for Operations and what the TagKinds look like in those examples.\n\nBeing able to see examples of real data would be helpful...\n\n 1. Where it might be a little confusing in the docs seeing 1 example for each TagKinds/Operations and\n 2. Use those different examples to test in parser/generators to have better confidence their implementation is protocol compliant.\n\nBTW... I think the docs could be improved with some of the Operations like Watch Sub/Unsub/Poll, PointWrite, etc. Once I have a better understanding, I wouldn't mind helping with examples. Just need to understand a little more :)\n\nBrian Frank https://project-haystack.org/forum/topic/545#1 Examples of TagKinds in JSON, Zinc and CSV format 2017-10-01T13:35:19Z\n\nThere is an example of each literal type in the docs for both Zinc and JSON. Plus more detailed examples for how nesting of data structures work. The only tricky one is DateTime which actually has a separate sub-section in Zinc with all the various flavors\n\nGreg Ingram https://project-haystack.org/forum/topic/545#0 Examples of TagKinds in JSON, Zinc and CSV format 2017-09-30T11:30:14Z\n\nAnyone have any detailed examples of the different TagKinds (Number, Extended String, Grid, etc.) in the different formats?\n\nThe project documentation lacks in this area and would be nice to see different examples.\n\nThanks in advance.\n\nBuddy Patton https://project-haystack.org/forum/topic/543#5 Vibration as a common VFD point 2017-09-29T18:14:11Z\n\nIt's typically measured with a sensor hooked directly to the piece of equipment that needs to be monitored but the units can vary widely based on the importance of the vibration being measured. I believe the most common method of measurement is to measure the frequency (in Hz) but I've also seen where the actual distance is measured as in mm/s.\n\nedit: I agree that this probably shouldn't be limited to VFDs\n\nJay Herron https://project-haystack.org/forum/topic/543#4 Vibration as a common VFD point 2017-09-29T15:22:01Z\n\nI think this would be a good addition.\n\nScott Boehm https://project-haystack.org/forum/topic/543#3 Vibration as a common VFD point 2017-09-29T14:42:37Z\n\nI'm no expert however what I've seen is an analog value expressed as inches/second as well as a simple binary value (true/false). Not familiar with industrial applications as Buddy suggests.\n\nBrian Frank https://project-haystack.org/forum/topic/544#1 What's the better practice, String markers for extra fidelity or new tags? 2017-09-29T12:28:05Z\n\nAs an overall rule, \"types\" are defined with marker tags (or combinations of tags). Never use a tag called \"type\"\n\nThese would parallel the \"what\" or \"subject\" of the point which is done with marker tags: air, water, steam, elec, refrig\n\nHydraulic fluid would definitely fit into that model.\n\nPneumatic is interesting because its is often air but air used in a specific way, so that would probably warrant some discussion\n\nBrian Frank https://project-haystack.org/forum/topic/543#2 Vibration as a common VFD point 2017-09-29T12:24:58Z\n\nHow is it typically measured and with what unit(s)?\n\nScott Boehm https://project-haystack.org/forum/topic/543#1 Vibration as a common VFD point 2017-09-28T17:58:21Z\n\nIndeed vibration should be a tag, however it should not be limited to a VFD as other equipment has vibration sensors such as cooling towers, chillers, fans and other machines that are prone to self-destruction.\n\nBuddy Patton https://project-haystack.org/forum/topic/544#0 What's the better practice, String markers for extra fidelity or new tags? 2017-09-28T17:08:19Z\n\nI have some pressure sensors, some hydraulic, some pneumatic. Would it make more sense to tag these as hydraulic and pneumatic respectively or would it be cleaner to do type:\"hydraulic\" and type:\"pneumatic\"?\n\nJust asking in terms of best practices. I can see from discussions on the forums that tags should be more generalized.\n\nBuddy Patton https://project-haystack.org/forum/topic/543#0 Vibration as a common VFD point 2017-09-28T16:21:22Z\n\nCould we see vibration added as a new haystack standard tag for VFDs? It's common among all of my VFD equips that the spindle motor vibration has a sensor attached in an industrial setting.\n\nAndrew Stokes https://project-haystack.org/forum/topic/538#4 Polling data from Netatmo devices 2017-09-27T20:37:17Z\n\nChris, I did download and install Pyhaystack and installed it on a Raspberry Pi, but I never got it to work, mostly through my own inexperience with Linux OSes. Although, maybe it was Pypipes... or both.\n\nBrian, right now I have a script in Python which can poll for the data and using pprint, this is the format that all the data arrives as:\n\n{'body': {'devices': [{'_id': '*********',\n\n'cipher_id': '****************',\n'co2_calibrating': False,\n'dashboard_data': {'AbsolutePressure': 1003.2,\n 'CO2': 980,\n 'Humidity': 62,\n 'Noise': 48,\n 'Pressure': 1012.1,\n 'Temperature': 22.7,\n 'date_max_temp': 1497383969,\n 'date_min_temp': 1497359852,\n 'max_temp': 22.7,\n 'min_temp': 21.2,\n 'time_utc': 1497384269},\n'data_type': ['Temperature',\n 'CO2',\n 'Humidity',\n 'Noise',\n 'Pressure'],\n'date_setup': 1366459135,\n'firmware': 124,\n'last_setup': 1366459135,\n'last_status_store': 1497384282,\n'last_upgrade': 1440322796,\n'module_name': 'Indoor',\n'modules': [{'_id': '**********',\n 'battery_percent': 100,\n 'battery_vp': 6335,\n 'dashboard_data': {'Humidity': 67,\n 'Temperature': 22.3,\n 'date_max_temp': 1446918449,\n 'date_min_temp': 1446918449,\n 'max_temp': 22.3,\n 'min_temp': 22.3,\n 'time_utc': 1446918449},\n 'data_type': ['Temperature', 'Humidity'],\n 'firmware': 34,\n 'last_message': 1446918525,\n 'last_seen': 1446918500,\n 'last_setup': 1366638628,\n 'module_name': 'Outdoor',\n 'rf_status': 32,\n 'type': 'NAModule1'}],\n'place': {'altitude': 75.891496494971,\n 'city': '*******',\n 'country': 'US',\n 'location': [******, *******],\n 'timezone': 'America/New_York'},\n'station_name': 'JP_Atmo',\n'type': 'NAMain',\n'wifi_status': 45}],\n'user': {'administrative': {'country': 'US',\n 'feel_like_algo': 1,\n 'lang': 'en-US',\n 'pressureunit': 1,\n 'reg_locale': 'en-US',\n 'unit': 1,\n 'windunit': 1},\n 'mail': '***********'}},\n\nstatus: ok, time_exec: 0.019564867019653, time_server: 1506541397}\n\nI also, through formating, can print out individual values. Is that the same JSON format Haystack follows? Really, the only value I actually care about is temperature. Which the code\n\nprint('\"Temperature\":', data['body']['devices'][0]['dashboard_data']['Temperature'])\n\nwill print out:\n\n\"Temperature\": 22.7\n\nso even if I reduce the code to just be the number value, I'm not sure how I get that value through my JACE, whether I save it and somehow get it sent to the JACE, or have something poll for the data using a similar script and send it to the JACE.\n\nJonathan Hughes https://project-haystack.org/forum/topic/542#1 haystackCall read fails for Objects with N4 Relations (Custom) 2017-09-26T20:48:03Z\n\nCustom dictionary relationship failures in the Kodaro Haystack Driver has been resolved in release 1.0.16.\n\nThis issue stemmed from the assumption that the Haystack dictionary was installed and used to create the relationships. This was a bad assumption as it should not necessarily be a requirement to use the haystack dictionary to create your tagging database in N4. The 1.0.16 correctly handles all relationships and ID resolving techniques that were previously assumed to be from the Haystack dictionary for any dictionary the relationship was created with.\n\nBrandyn Carlson https://project-haystack.org/forum/topic/542#0 haystackCall read fails for Objects with N4 Relations (Custom) 2017-09-26T19:20:15Z\n\nI'm having an issue not being able to discover objects with custom relation references in Niagara 4 using the haystackCall function. The Kodaro Haystack Driver is being used for this project so that N4 marker tags can be synced between Skyspark and the N4 database, which contains extensive tagging and N4 object relations. In order to be usable within the customer's custom tag dictionary, the relation references for siteRef, ahuRef, and equipRef (in addition to some others) have been configured within their custom tag library and applied to site, equip and point objects across the N4 database. Therefore, haystack tag dictionary is not being used.\n\nWhile the haystackCall function can discover objects using neql filters for tags within the customer's custom tag dictionary, it appears that the only point or equip objects are discovered/returned using the haystackCall function are those without any relation references. The same query that returns 500+ objects with an \"equip\" tag in N4 returns 0 records upon a haystackCall read with the same exact filter.\n\nIs there an inherent issue for the haystack protocol or haystackCall function to interact with N4 objects with (certain types of) relation references? I'm working with Kodaro to troubleshoot the issue from their side but I wanted to reach out to the forum to see if this is a known issue or limitation associated with the haystack protocol?\n\nThanks!\n\nStephen Frank https://project-haystack.org/forum/topic/539#1 Two-speed Fans 2017-09-25T14:37:32Z\n\nI think the fan cases covered right now are simple on/off or on a VFD. I don't know that I have the right answer for you, but you could consider using speed with discrete percentage values, or could consider using run + stage (1,2) along the lines of cooling/heating equipment.\n\nChristian Tremblay https://project-haystack.org/forum/topic/538#3 Polling data from Netatmo devices 2017-09-25T14:36:54Z\n\nI would try to make a driver in the Jace that would poll the info directly... Or maybe only a small script that reads from a URL if sufficient.\n\nOr you will need a 3rd device between the 2 everytime...\n\nBrian Frank https://project-haystack.org/forum/topic/540#3 Marker Tag format in JSON when not used 2017-09-25T00:12:15Z\n\nYou don't need name - I just copied that from our software and we add a few more columns\n\nGreg Ingram https://project-haystack.org/forum/topic/540#2 Marker Tag format in JSON when not used 2017-09-24T23:23:01Z\n\nThanks Brian, I will review and update my code.\n\nI have another question based on your example. It appears you added a column for \"name\". This is not shown as a property/column in the Formats section in documentation. Which one is correct? To include \"name\" or not include?\n\nThanks again for the help.\n\nGreg Ingram https://project-haystack.org/forum/topic/541#2 Getting 404 Not Found errors on Download page 2017-09-24T23:17:39Z\n\nNo problem. Thanks for the fix.\n\nMatthew Giannini https://project-haystack.org/forum/topic/541#1 Getting 404 Not Found errors on Download page 2017-09-24T22:59:20Z\n\nGreg - this has been resolved. Sorry for the inconvenience."
{ "url": "https://project-haystack.org/forum/topic/feed", "source_domain": "project-haystack.org", "snapshot_id": "crawl=CC-MAIN-2017-43", "warc_metadata": { "Content-Length": "62169", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:Q5CG5T6BAEPE4NQVKMJ32R4ZYRBI6XHG", "WARC-Concurrent-To": "<urn:uuid:f6119f51-073e-4f05-a064-e4ebf48cea2f>", "WARC-Date": "2017-10-18T09:28:29Z", "WARC-IP-Address": "45.79.157.16", "WARC-Identified-Payload-Type": "application/atom+xml", "WARC-Payload-Digest": "sha1:TDJTUUPJ23JHXJP2EX3QQFDZKJQSGKMG", "WARC-Record-ID": "<urn:uuid:9e569103-fe98-46bd-aabb-5f3dd974695e>", "WARC-Target-URI": "https://project-haystack.org/forum/topic/feed", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:ec74b832-6207-46c3-917a-a3e233f2925a>" }, "warc_info": "robots: classic\r\nhostname: ip-10-239-91-247.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, 194, 195, 204, 205, 1070, 1071, 1505, 1506, 1519, 1520, 1722, 1723, 2233, 2234, 2474, 2475, 2866, 2867, 3223, 3224, 3536, 3537, 3550, 3551, 3823, 3824, 3901, 3902, 4133, 4324, 4494, 4495, 4964, 4965, 4985, 4986, 5402, 5403, 5491, 5492, 5621, 5776, 5777, 5854, 5855, 5892, 5940, 6001, 6049, 6109, 6151, 6202, 6236, 6297, 6298, 6718, 6719, 6730, 6731, 7408, 7409, 7459, 7510, 7561, 7619, 7620, 7863, 7864, 8225, 8226, 8235, 8236, 8691, 8692, 8731, 8732, 8765, 8812, 8870, 8914, 8915, 8970, 8971, 8985, 8986, 9044, 9045, 9099, 9147, 9203, 9269, 9270, 9541, 9542, 9672, 9673, 9679, 9730, 9775, 9828, 9879, 9880, 9898, 9899, 9941, 9942, 10026, 10072, 10120, 10168, 10222, 10223, 10581, 10582, 10711, 10712, 10718, 10719, 10799, 10856, 10917, 11011, 11012, 11096, 11142, 11190, 11238, 11292, 11356, 11357, 11361, 11362, 11426, 11493, 11568, 11630, 11692, 11693, 11699, 11700, 11766, 11826, 11890, 11947, 11948, 12005, 12096, 12170, 12218, 12295, 12397, 12478, 12479, 12705, 12706, 12729, 12730, 12805, 12806, 12870, 12926, 12927, 13276, 13277, 13336, 13396, 13452, 13453, 13741, 13742, 13831, 13832, 13922, 14009, 14010, 14431, 14432, 14492, 14493, 14511, 14512, 14596, 14661, 14764, 14877, 14988, 14989, 14999, 15000, 15213, 15214, 15257, 15327, 15394, 15470, 15530, 15621, 15622, 15719, 15720, 15804, 15805, 15886, 15887, 15917, 15918, 15983, 15984, 16013, 16072, 16134, 16147, 16159, 16168, 16169, 16369, 16370, 16381, 16382, 16811, 16812, 16905, 16906, 16912, 16913, 17279, 17280, 17448, 17449, 17676, 17677, 17811, 17812, 17909, 17910, 17965, 17966, 18123, 18124, 18371, 18372, 18473, 18474, 18620, 18621, 18715, 18716, 18724, 18725, 18904, 18905, 18940, 18941, 18968, 18969, 19190, 19191, 19824, 19825, 19917, 19918, 19937, 19938, 20445, 20446, 20899, 20900, 20995, 20996, 21356, 21357, 21457, 21458, 21646, 21647, 21832, 21833, 21890, 21891, 21920, 21921, 22047, 22048, 22146, 22147, 22296, 22297, 22421, 22422, 22517, 22518, 22525, 22526, 22939, 22940, 23127, 23128, 23137, 23138, 23412, 23413, 23653, 23654, 23896, 23897, 24041, 24042, 24223, 24224, 24253, 24254, 24302, 24303, 24459, 24460, 24504, 24505, 24721, 24722, 24979, 24980, 25178, 25179, 25367, 25368, 25375, 25376, 25468, 25469, 25627, 25628, 25898, 25899, 26151, 26152, 26288, 26289, 26607, 26608, 26738, 26739, 26863, 26864, 26913, 26914, 26918, 26919, 27014, 27015, 27075, 27076, 27082, 27093, 27114, 27244, 27245, 27789, 27790, 27920, 27921, 28125, 28126, 28145, 28146, 28266, 28267, 28350, 28351, 28446, 28447, 28668, 28669, 28769, 28770, 28946, 28947, 29002, 29003, 29101, 29102, 29230, 29231, 29366, 29367, 29541, 29542, 29726, 29727, 29961, 29962, 30055, 30056, 30165, 30166, 30227, 30228, 30294, 30295, 30368, 30369, 30427, 30428, 30481, 30482, 30577, 30578, 30585, 30586, 30770, 30771, 30863, 30864, 30900, 30901, 31194, 31350, 31582, 31674, 31675, 31817, 31818, 32035, 32036, 32171, 32172, 32262, 32263, 32401, 32402, 32863, 32864, 33465, 33466, 33536, 33537, 33688, 33689, 33805, 33806, 33961, 33962, 34044, 34045, 34221, 34222, 34352, 34353, 34360, 34361, 34609, 34610, 34670, 34671, 34775, 34908, 34909, 35139, 35140, 35270, 35271, 35528, 35529, 35659, 35660, 35784, 35785, 35875, 35876, 35895, 35896, 36009, 36010, 36357, 36358, 36420, 36421, 36532, 36533, 36572, 36573, 36685, 36686, 36877, 36878, 37033, 37034, 37148, 37149, 37271, 37272, 37326, 37327, 37456, 37457, 37569, 37570, 37622, 37623, 37735, 37736, 37947, 37948, 38104, 38105, 38313, 38314, 38433, 38434, 38547, 38548, 38738, 38739, 38855, 38856, 39060, 39061, 39199, 39200, 39243, 39244, 39277, 39303, 39350, 39381, 39416, 39448, 39487, 39527, 39575, 39623, 39660, 39697, 39741, 39770, 39791, 39817, 39840, 39867, 39893, 39910, 39936, 39969, 39997, 40022, 40056, 40093, 40126, 40174, 40227, 40288, 40349, 40399, 40449, 40506, 40561, 40590, 40631, 40669, 40708, 40747, 40777, 40813, 40852, 40881, 40908, 40949, 40992, 41019, 41037, 41058, 41103, 41152, 41197, 41244, 41295, 41334, 41378, 41412, 41413, 41480, 41481, 41664, 41665, 41750, 41751, 41767, 41768, 41788, 41789, 42037, 42038, 42185, 42186, 42293, 42294, 42749, 42750, 42897, 42898, 43552, 43553, 43964, 43965, 44306, 44307, 44315, 44316, 44413, 44414, 44692, 44693, 44814, 44815, 44959, 44960, 45017, 45018, 45138, 45139, 45228, 45229, 45349, 45350, 45398, 45399, 45624, 45625, 45652, 45653, 45779, 45780, 45812, 45813, 45944, 45945 ], "line_end_idx": [ 194, 195, 204, 205, 1070, 1071, 1505, 1506, 1519, 1520, 1722, 1723, 2233, 2234, 2474, 2475, 2866, 2867, 3223, 3224, 3536, 3537, 3550, 3551, 3823, 3824, 3901, 3902, 4133, 4324, 4494, 4495, 4964, 4965, 4985, 4986, 5402, 5403, 5491, 5492, 5621, 5776, 5777, 5854, 5855, 5892, 5940, 6001, 6049, 6109, 6151, 6202, 6236, 6297, 6298, 6718, 6719, 6730, 6731, 7408, 7409, 7459, 7510, 7561, 7619, 7620, 7863, 7864, 8225, 8226, 8235, 8236, 8691, 8692, 8731, 8732, 8765, 8812, 8870, 8914, 8915, 8970, 8971, 8985, 8986, 9044, 9045, 9099, 9147, 9203, 9269, 9270, 9541, 9542, 9672, 9673, 9679, 9730, 9775, 9828, 9879, 9880, 9898, 9899, 9941, 9942, 10026, 10072, 10120, 10168, 10222, 10223, 10581, 10582, 10711, 10712, 10718, 10719, 10799, 10856, 10917, 11011, 11012, 11096, 11142, 11190, 11238, 11292, 11356, 11357, 11361, 11362, 11426, 11493, 11568, 11630, 11692, 11693, 11699, 11700, 11766, 11826, 11890, 11947, 11948, 12005, 12096, 12170, 12218, 12295, 12397, 12478, 12479, 12705, 12706, 12729, 12730, 12805, 12806, 12870, 12926, 12927, 13276, 13277, 13336, 13396, 13452, 13453, 13741, 13742, 13831, 13832, 13922, 14009, 14010, 14431, 14432, 14492, 14493, 14511, 14512, 14596, 14661, 14764, 14877, 14988, 14989, 14999, 15000, 15213, 15214, 15257, 15327, 15394, 15470, 15530, 15621, 15622, 15719, 15720, 15804, 15805, 15886, 15887, 15917, 15918, 15983, 15984, 16013, 16072, 16134, 16147, 16159, 16168, 16169, 16369, 16370, 16381, 16382, 16811, 16812, 16905, 16906, 16912, 16913, 17279, 17280, 17448, 17449, 17676, 17677, 17811, 17812, 17909, 17910, 17965, 17966, 18123, 18124, 18371, 18372, 18473, 18474, 18620, 18621, 18715, 18716, 18724, 18725, 18904, 18905, 18940, 18941, 18968, 18969, 19190, 19191, 19824, 19825, 19917, 19918, 19937, 19938, 20445, 20446, 20899, 20900, 20995, 20996, 21356, 21357, 21457, 21458, 21646, 21647, 21832, 21833, 21890, 21891, 21920, 21921, 22047, 22048, 22146, 22147, 22296, 22297, 22421, 22422, 22517, 22518, 22525, 22526, 22939, 22940, 23127, 23128, 23137, 23138, 23412, 23413, 23653, 23654, 23896, 23897, 24041, 24042, 24223, 24224, 24253, 24254, 24302, 24303, 24459, 24460, 24504, 24505, 24721, 24722, 24979, 24980, 25178, 25179, 25367, 25368, 25375, 25376, 25468, 25469, 25627, 25628, 25898, 25899, 26151, 26152, 26288, 26289, 26607, 26608, 26738, 26739, 26863, 26864, 26913, 26914, 26918, 26919, 27014, 27015, 27075, 27076, 27082, 27093, 27114, 27244, 27245, 27789, 27790, 27920, 27921, 28125, 28126, 28145, 28146, 28266, 28267, 28350, 28351, 28446, 28447, 28668, 28669, 28769, 28770, 28946, 28947, 29002, 29003, 29101, 29102, 29230, 29231, 29366, 29367, 29541, 29542, 29726, 29727, 29961, 29962, 30055, 30056, 30165, 30166, 30227, 30228, 30294, 30295, 30368, 30369, 30427, 30428, 30481, 30482, 30577, 30578, 30585, 30586, 30770, 30771, 30863, 30864, 30900, 30901, 31194, 31350, 31582, 31674, 31675, 31817, 31818, 32035, 32036, 32171, 32172, 32262, 32263, 32401, 32402, 32863, 32864, 33465, 33466, 33536, 33537, 33688, 33689, 33805, 33806, 33961, 33962, 34044, 34045, 34221, 34222, 34352, 34353, 34360, 34361, 34609, 34610, 34670, 34671, 34775, 34908, 34909, 35139, 35140, 35270, 35271, 35528, 35529, 35659, 35660, 35784, 35785, 35875, 35876, 35895, 35896, 36009, 36010, 36357, 36358, 36420, 36421, 36532, 36533, 36572, 36573, 36685, 36686, 36877, 36878, 37033, 37034, 37148, 37149, 37271, 37272, 37326, 37327, 37456, 37457, 37569, 37570, 37622, 37623, 37735, 37736, 37947, 37948, 38104, 38105, 38313, 38314, 38433, 38434, 38547, 38548, 38738, 38739, 38855, 38856, 39060, 39061, 39199, 39200, 39243, 39244, 39277, 39303, 39350, 39381, 39416, 39448, 39487, 39527, 39575, 39623, 39660, 39697, 39741, 39770, 39791, 39817, 39840, 39867, 39893, 39910, 39936, 39969, 39997, 40022, 40056, 40093, 40126, 40174, 40227, 40288, 40349, 40399, 40449, 40506, 40561, 40590, 40631, 40669, 40708, 40747, 40777, 40813, 40852, 40881, 40908, 40949, 40992, 41019, 41037, 41058, 41103, 41152, 41197, 41244, 41295, 41334, 41378, 41412, 41413, 41480, 41481, 41664, 41665, 41750, 41751, 41767, 41768, 41788, 41789, 42037, 42038, 42185, 42186, 42293, 42294, 42749, 42750, 42897, 42898, 43552, 43553, 43964, 43965, 44306, 44307, 44315, 44316, 44413, 44414, 44692, 44693, 44814, 44815, 44959, 44960, 45017, 45018, 45138, 45139, 45228, 45229, 45349, 45350, 45398, 45399, 45624, 45625, 45652, 45653, 45779, 45780, 45812, 45813, 45944, 45945, 46004 ] }
{ "red_pajama_v2": { "ccnet_original_length": 46004, "ccnet_original_nlines": 635, "rps_doc_curly_bracket": 0.0003912700049113482, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.32749542593955994, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.035242289304733276, "rps_doc_frac_lines_end_with_ellipsis": 0.007861640304327011, "rps_doc_frac_no_alph_words": 0.2381003499031067, "rps_doc_frac_unique_words": 0.25375375151634216, "rps_doc_mean_word_length": 5.28123140335083, "rps_doc_num_sentences": 404, "rps_doc_symbol_to_word_ratio": 0.005909529980272055, "rps_doc_unigram_entropy": 6.2633514404296875, "rps_doc_word_count": 6660, "rps_doc_frac_chars_dupe_10grams": 0.011542939580976963, "rps_doc_frac_chars_dupe_5grams": 0.0660165473818779, "rps_doc_frac_chars_dupe_6grams": 0.048218801617622375, "rps_doc_frac_chars_dupe_7grams": 0.033719051629304886, "rps_doc_frac_chars_dupe_8grams": 0.025303499773144722, "rps_doc_frac_chars_dupe_9grams": 0.021323170512914658, "rps_doc_frac_chars_top_2gram": 0.005686180200427771, "rps_doc_frac_chars_top_3gram": 0.006368520203977823, "rps_doc_frac_chars_top_4gram": 0.0034117100294679403, "rps_doc_books_importance": -3764.362060546875, "rps_doc_books_importance_length_correction": -3764.362060546875, "rps_doc_openwebtext_importance": -2194.319091796875, "rps_doc_openwebtext_importance_length_correction": -2194.319091796875, "rps_doc_wikipedia_importance": -1594.5101318359375, "rps_doc_wikipedia_importance_length_correction": -1594.5101318359375 }, "fasttext": { "dclm": 0.03497809171676636, "english": 0.8826755285263062, "fineweb_edu_approx": 1.9089752435684204, "eai_general_math": 0.7678518891334534, "eai_open_web_math": 0.21278119087219238, "eai_web_code": 0.6290764808654785 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "621.8", "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": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "4", "label": "Advanced Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }
ece34605c058195ed03b4d393ef1a36c
5,599,237,691,301,560,000
top of page Working Mothers Public·14 members What You Need to Know About the Gartner Magic Quadrant for VDI in 2023 How to Choose the Best VDI Solution Based on the Gartner Magic Quadrant If you are looking for a virtual desktop solution for your organization, you might have come across the term VDI, which stands for Virtual Desktop Infrastructure. VDI is a full, thick-client user environment run as a virtual machine (VM) on a server and accessed remotely. VDI can offer many benefits for your business, such as improved security, scalability, manageability, and user experience. gartner magic quadrant vdi DOWNLOAD: https://glycoltude.blogspot.com/?l=2tOiLc However, choosing the best VDI solution for your needs can be challenging, as there are many vendors and products in the market. How can you compare and evaluate them objectively and effectively? One way to do that is to use the Gartner Magic Quadrant for VDI, which is a research report that provides a graphical representation of the relative positions of the leading VDI vendors in the market based on their ability to execute and their completeness of vision. In this article, we will explain what the Gartner Magic Quadrant for VDI is, how it works, and how you can use it to choose the best VDI solution for your organization. What is the Gartner Magic Quadrant for VDI? The Gartner Magic Quadrant for VDI is a research report that evaluates and ranks the top VDI vendors in the market based on two criteria: ability to execute and completeness of vision. Ability to execute measures how well a vendor performs in delivering and supporting its VDI solution, while completeness of vision measures how well a vendor anticipates and responds to the changing needs and expectations of the market. The report also provides an analysis of the strengths and weaknesses of each vendor, as well as their future plans and strategies. The Gartner Magic Quadrant for VDI divides the vendors into four quadrants: Leaders, Challengers, Visionaries, and Niche Players. The position of each vendor in the quadrant reflects their relative strengths and weaknesses in relation to each other. The quadrants are defined as follows: • Leaders: These are vendors that have a strong ability to execute and a clear vision for the future of VDI. They have a large and loyal customer base, a robust product portfolio, a strong presence in multiple regions, and a proven track record of innovation and customer satisfaction. They are well-positioned to address the current and future needs of the market. • Challengers: These are vendors that have a strong ability to execute but a less clear vision for the future of VDI. They have a solid product offering, a large customer base, and a good financial performance, but they may lack innovation or differentiation in their products or strategies. They may also have limited geographic coverage or market awareness. • Visionaries: These are vendors that have a clear vision for the future of VDI but a weaker ability to execute. They have innovative products or services that address emerging trends or needs in the market, but they may lack scale, resources, or experience to deliver and support them effectively. They may also have limited customer references or market share. • Niche Players: These are vendors that have a limited ability to execute and a narrow vision for the future of VDI. They focus on a specific segment of the market or a specific type of customer, but they may not offer a comprehensive or competitive solution for the broader market. They may also have low visibility or recognition in the market. The Gartner Magic Quadrant for VDI is updated periodically to reflect the changes and developments in the market. The latest report was published in August 2020 and included 12 vendors: Citrix, VMware, Microsoft, Amazon Web Services (AWS), Nutanix Xi Frame (formerly Frame), Workspot, Evolve IP (formerly Parallels RAS), dinCloud (formerly Nerdio), Cloudalize (formerly Dizzion), Paperspace (formerly Teradici), Cameyo (formerly Ericom), and Apporto . How to Use the Gartner Magic Quadrant for VDI? The Gartner Magic Quadrant for VDI can be a useful tool for you to compare and evaluate the different VDI vendors and products in the market and to choose the best one for your organization. However, you should not rely on it as the only source of information or as a definitive guide. You should also consider your own specific needs, goals, budget, and preferences when making your decision. Here are some tips on how to use the Gartner Magic Quadrant for VDI effectively: • Understand the criteria and methodology: Before you look at the quadrant, you should read the report carefully and understand how Gartner defines and measures the ability to execute and the completeness of vision of each vendor. You should also be aware of the assumptions, limitations, and scope of the research, as well as the data sources and validation methods used by Gartner. • Look beyond the quadrant: The quadrant is a visual summary of the relative positions of the vendors, but it does not tell the whole story. You should also read the detailed analysis of each vendor's strengths and weaknesses, as well as their future plans and strategies. You should also look at other sources of information, such as customer reviews, case studies, demos, trials, or references. • Focus on your needs: The quadrant is based on a general evaluation of the VDI market, but it may not reflect your specific situation or requirements. You should identify your own needs, goals, challenges, and expectations for your VDI solution, and then map them to the capabilities and offerings of each vendor. You should also consider factors such as cost, support, integration, security, scalability, and compatibility. • Use it as a starting point: The quadrant is a snapshot of the current state of the VDI market, but it may change over time as new technologies, trends, or competitors emerge. You should use it as a starting point for your research and evaluation process, but not as a final destination. You should also update your knowledge and analysis regularly to keep up with the changes in the market. The Gartner Magic Quadrant for VDI can be a valuable resource for you to learn about the VDI market and to compare and evaluate the different VDI vendors and products available. However, you should also use your own judgment and criteria when choosing the best VDI solution for your organization. Who are the Leaders in the Gartner Magic Quadrant for VDI 2020? The Gartner Magic Quadrant for VDI 2020 report identified two vendors as Leaders in the VDI market: Citrix and VMware. These vendors have a strong ability to execute and a clear vision for the future of VDI, and they offer comprehensive and competitive solutions that address the current and future needs of the market. Here is a brief overview of each vendor's strengths and weaknesses, according to the report: Citrix Citrix is a well-established and recognized leader in the VDI market, with a large and loyal customer base, a robust product portfolio, a strong presence in multiple regions, and a proven track record of innovation and customer satisfaction. Citrix offers Citrix Virtual Apps and Desktops (CVAD) as its flagship VDI solution, which can be deployed on-premises, in the cloud, or in a hybrid model. Citrix also offers Citrix DaaS as its cloud-based VDI solution, which is powered by Microsoft Azure and provides a fully managed service for customers who want to outsource their VDI infrastructure. Some of the strengths of Citrix include: • Its ability to deliver a high-quality user experience across various devices, networks, and locations, using its proprietary HDX protocol and adaptive transport technology. • Its integration with Microsoft technologies, such as Windows Virtual Desktop (WVD), Microsoft Teams, Office 365, Azure Active Directory, and Azure Monitor. • Its support for hybrid and multicloud deployments, allowing customers to leverage different cloud providers and platforms for their VDI workloads. • Its comprehensive management and security capabilities, such as Citrix Workspace Environment Management (WEM), Citrix Analytics, Citrix App Layering, Citrix Endpoint Management (CEM), and Citrix Secure Workspace Access. • Its innovation and vision for the future of VDI, such as its focus on intelligent workspace solutions that provide contextual and personalized access to applications and data. Some of the weaknesses of Citrix include: • Its complex licensing and pricing models, which can be confusing and expensive for some customers. • Its dependency on Microsoft Azure for its DaaS solution, which can limit its flexibility and scalability for some customers. • Its lack of native support for Linux-based virtual desktops, which can be a disadvantage for some customers who require Linux-based applications or environments. VMware VMware is another well-established and recognized leader in the VDI market, with a large and loyal customer base, a robust product portfolio, a strong presence in multiple regions, and a proven track record of innovation and customer satisfaction. VMware offers VMware Horizon as its flagship VDI solution, which can be deployed on-premises, in the cloud, or in a hybrid model. VMware also offers VMware Horizon Cloud as its cloud-based VDI solution, which can run on VMware Cloud on AWS, Microsoft Azure, IBM Cloud, or Google Cloud Platform. Some of the strengths of VMware include: • Its ability to deliver a high-quality user experience across various devices, networks, and locations, using its proprietary Blast Extreme protocol and adaptive transport technology. <
{ "url": "https://www.hoganscreekmbc.com/group/working-mothers/discussion/5751e71e-e786-4d9d-97b4-827d9af5dbc4", "source_domain": "www.hoganscreekmbc.com", "snapshot_id": "CC-MAIN-2023-23", "warc_metadata": { "Content-Length": "1050492", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:C4YPGFNRDCBFT7KW4SRFAZW43AEWM4E3", "WARC-Concurrent-To": "<urn:uuid:4203a4b4-5bad-431a-bb3f-23dae03ce809>", "WARC-Date": "2023-06-09T04:16:46Z", "WARC-IP-Address": "34.149.87.45", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:NXWLLKOELKDVCXG52WWBLIPQ6GKCVRGJ", "WARC-Record-ID": "<urn:uuid:83456954-ea1d-4476-89fe-226bf9fee94d>", "WARC-Target-URI": "https://www.hoganscreekmbc.com/group/working-mothers/discussion/5751e71e-e786-4d9d-97b4-827d9af5dbc4", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:60273185-1a93-4f89-978f-f45bb39e3bcb>" }, "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-36\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 12, 13, 29, 30, 48, 49, 120, 121, 122, 123, 195, 196, 197, 198, 199, 595, 596, 597, 598, 599, 626, 627, 628, 680, 681, 682, 683, 1316, 1317, 1318, 1362, 1363, 1364, 1365, 1366, 1919, 1920, 1921, 2209, 2210, 2211, 2579, 2580, 2581, 2582, 2944, 2945, 2946, 2947, 3312, 3313, 3314, 3315, 3664, 3665, 3666, 3667, 4119, 4120, 4121, 4168, 4169, 4170, 4171, 4172, 4647, 4648, 4649, 5035, 5036, 5037, 5038, 5437, 5438, 5439, 5440, 5868, 5869, 5870, 5871, 6266, 6267, 6268, 6269, 6566, 6567, 6568, 6632, 6633, 6634, 6635, 6636, 7049, 7050, 7051, 7058, 7059, 7060, 7061, 7062, 7658, 7659, 7660, 7701, 7702, 7703, 7880, 7881, 7882, 7883, 8043, 8044, 8045, 8046, 8197, 8198, 8199, 8200, 8424, 8425, 8426, 8427, 8607, 8608, 8609, 8610, 8652, 8653, 8654, 8757, 8758, 8759, 8760, 8889, 8890, 8891, 8892, 9058, 9059, 9060, 9061, 9068, 9069, 9070, 9071, 9072, 9615, 9616, 9617, 9658, 9659, 9660, 9847, 9848, 9849, 9850 ], "line_end_idx": [ 12, 13, 29, 30, 48, 49, 120, 121, 122, 123, 195, 196, 197, 198, 199, 595, 596, 597, 598, 599, 626, 627, 628, 680, 681, 682, 683, 1316, 1317, 1318, 1362, 1363, 1364, 1365, 1366, 1919, 1920, 1921, 2209, 2210, 2211, 2579, 2580, 2581, 2582, 2944, 2945, 2946, 2947, 3312, 3313, 3314, 3315, 3664, 3665, 3666, 3667, 4119, 4120, 4121, 4168, 4169, 4170, 4171, 4172, 4647, 4648, 4649, 5035, 5036, 5037, 5038, 5437, 5438, 5439, 5440, 5868, 5869, 5870, 5871, 6266, 6267, 6268, 6269, 6566, 6567, 6568, 6632, 6633, 6634, 6635, 6636, 7049, 7050, 7051, 7058, 7059, 7060, 7061, 7062, 7658, 7659, 7660, 7701, 7702, 7703, 7880, 7881, 7882, 7883, 8043, 8044, 8045, 8046, 8197, 8198, 8199, 8200, 8424, 8425, 8426, 8427, 8607, 8608, 8609, 8610, 8652, 8653, 8654, 8757, 8758, 8759, 8760, 8889, 8890, 8891, 8892, 9058, 9059, 9060, 9061, 9068, 9069, 9070, 9071, 9072, 9615, 9616, 9617, 9658, 9659, 9660, 9847, 9848, 9849, 9850, 9851 ] }
{ "red_pajama_v2": { "ccnet_original_length": 9851, "ccnet_original_nlines": 156, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.39922696352005005, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.030922140926122665, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.13859745860099792, "rps_doc_frac_unique_words": 0.27429667115211487, "rps_doc_mean_word_length": 5.050511360168457, "rps_doc_num_sentences": 65, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.178701877593994, "rps_doc_word_count": 1564, "rps_doc_frac_chars_dupe_10grams": 0.17027471959590912, "rps_doc_frac_chars_dupe_5grams": 0.36143815517425537, "rps_doc_frac_chars_dupe_6grams": 0.31978732347488403, "rps_doc_frac_chars_dupe_7grams": 0.2590201199054718, "rps_doc_frac_chars_dupe_8grams": 0.21559691429138184, "rps_doc_frac_chars_dupe_9grams": 0.19825294613838196, "rps_doc_frac_chars_top_2gram": 0.010760859586298466, "rps_doc_frac_chars_top_3gram": 0.03797949105501175, "rps_doc_frac_chars_top_4gram": 0.04076464846730232, "rps_doc_books_importance": -696.5390625, "rps_doc_books_importance_length_correction": -696.5390625, "rps_doc_openwebtext_importance": -318.7545471191406, "rps_doc_openwebtext_importance_length_correction": -318.7545471191406, "rps_doc_wikipedia_importance": -227.92306518554688, "rps_doc_wikipedia_importance_length_correction": -227.92306518554688 }, "fasttext": { "dclm": 0.08632296323776245, "english": 0.9456233382225037, "fineweb_edu_approx": 1.2948790788650513, "eai_general_math": 0.13547736406326294, "eai_open_web_math": 0.14819931983947754, "eai_web_code": 0.12600219249725342 } }
{ "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.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": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "2", "label": "Click Here References" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
8,335,145,588,230,912,000
This project has moved and is read-only. For the latest updates, please go here. OnCollision not being called for two bodies when using XNA 4.0 and FarSeer 3.3 Topics: User Forum Sep 29, 2013 at 10:48 PM I admit, I'm very new to FarSeer physics. I plan on using it for it's collision detection system in an XNA project. I've looked around quite a bit, tried many things and haven't had any luck solving my problem, I hope someone with more experience can help me out. Essentially, I've created two bodies using BodyFactory.CreateRectangle. In the project I update their positions manually (no gravity or velocity is used), then place the Sprite/XNA rectangle onto the position of the FarSeer bodies. This works fine, using the ConvertUnits functions the positions match up exactly. The trouble comes when I want the two bodies to collide. During LoadContent I assign the player body collision a function to call (Player_Body.OnCollision += FarSeer_Collision) However, when the two bodies collide, this function is never called. I do not know what I'm doing wrong and I would love some help. Below is how I've created the bodies for the Player and the other object, as well as the FarSeer_Collision that I would like to call when the two objects collide. Player_Body = BodyFactory.CreateRectangle(world, FarseerPhysics.SamplesFramework.ConvertUnits.ToSimUnits(Players[0].Rect.Width), FarseerPhysics.SamplesFramework.ConvertUnits.ToSimUnits(Players[0].Rect.Height), 1.0f, FarseerPhysics.SamplesFramework.ConvertUnits.ToSimUnits(Players[0].Position)); Player_Body.BodyType = BodyType.Static; Player_Body.CollidesWith = Category.All; Player_Body.CollisionCategories = Category.All; public bool FarSeer_Collision(Fixture f1, Fixture f2, Contact contact) { return true; } Is there something else I have to do before the two objects will "collide"? I apologize if this is a simple mistake and would greatly appreciate any advice. I also apologize if this has been asked and solved before, I have searched but haven't had any luck. I am also more than happy to provide more information if needed. Sep 29, 2013 at 11:31 PM I think you need to set at least one of your bodies to BodyType.Dynamic for the engine to check for collisions. Also make sure you're calling World.Step() in your update method. Also, moving bodies my setting the Position vector isn't good practice. Use Body.ApplyForce() or at least set Body.LinearVelocity to get your body moving around e.g. Player_Body.ApplyForce(new Vector2(0.1, 0)) would start moving your body to the right. Have fun Sep 30, 2013 at 1:36 AM Ah! Setting one to Dynamic completely fixed that problem! Thank you so much, I feel a bit stupid now that it was such a simple fix... I had tried setting both to Dynamic, but never one at a time... I know setting Position isn't a great idea, I was using it until I can figure out a good way to use the methods you mentioned in the way I would like. Again, thanks for the quick and helpful response!
{ "url": "http://farseerphysics.codeplex.com/discussions/459661", "source_domain": "farseerphysics.codeplex.com", "snapshot_id": "crawl=CC-MAIN-2017-51", "warc_metadata": { "Content-Length": "41120", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:S552QTU5T6Y4WWUG7XVYSI5E5GSQK7T2", "WARC-Concurrent-To": "<urn:uuid:9448cd10-cbee-4b7a-a87e-e953579fbbf7>", "WARC-Date": "2017-12-17T17:42:08Z", "WARC-IP-Address": "65.52.103.72", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:UY2UNSMXZXYLJIZVSDUD7R46QUMLZCN4", "WARC-Record-ID": "<urn:uuid:8294608a-fa8f-48fc-a123-6546877d3b14>", "WARC-Target-URI": "http://farseerphysics.codeplex.com/discussions/459661", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:1b511333-bb5a-4ede-8367-4b2626c17927>" }, "warc_info": "robots: classic\r\nhostname: ip-10-143-47-177.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, 81, 82, 161, 162, 181, 206, 470, 471, 842, 843, 963, 1032, 1033, 1259, 1554, 1606, 1659, 1719, 1720, 1791, 1801, 1826, 1836, 2159, 2184, 2362, 2363, 2616, 2617, 2626, 2650, 2848, 2849, 3000, 3001 ], "line_end_idx": [ 81, 82, 161, 162, 181, 206, 470, 471, 842, 843, 963, 1032, 1033, 1259, 1554, 1606, 1659, 1719, 1720, 1791, 1801, 1826, 1836, 2159, 2184, 2362, 2363, 2616, 2617, 2626, 2650, 2848, 2849, 3000, 3001, 3050 ] }
{ "red_pajama_v2": { "ccnet_original_length": 3050, "ccnet_original_nlines": 35, "rps_doc_curly_bracket": 0.0006557399756275117, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3571428656578064, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.049689438194036484, "rps_doc_frac_lines_end_with_ellipsis": 0.0277777798473835, "rps_doc_frac_no_alph_words": 0.24223601818084717, "rps_doc_frac_unique_words": 0.5376105904579163, "rps_doc_mean_word_length": 5.219026565551758, "rps_doc_num_sentences": 60, "rps_doc_symbol_to_word_ratio": 0.0031055898871272802, "rps_doc_unigram_entropy": 5.120846271514893, "rps_doc_word_count": 452, "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.010173800401389599, "rps_doc_frac_chars_top_3gram": 0.0076303500682115555, "rps_doc_frac_chars_top_4gram": 0.009325990453362465, "rps_doc_books_importance": -269.9893798828125, "rps_doc_books_importance_length_correction": -269.9893798828125, "rps_doc_openwebtext_importance": -143.83319091796875, "rps_doc_openwebtext_importance_length_correction": -143.83319091796875, "rps_doc_wikipedia_importance": -111.54206085205078, "rps_doc_wikipedia_importance_length_correction": -111.54206085205078 }, "fasttext": { "dclm": 0.13382524251937866, "english": 0.9327872395515442, "fineweb_edu_approx": 1.1139419078826904, "eai_general_math": 0.7804474234580994, "eai_open_web_math": 0.2465735673904419, "eai_web_code": 0.3632084131240845 } }
{ "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": "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" } } }
ece34605c058195ed03b4d393ef1a36c
3,848,293,586,934,849,500
0 Hello guys, I need help with this. When I run it, I get a blank page. Please Me out. <?php //The Main Program $call_put_flag="c"; $S=50; $X=52; $T=0.5; $r=0.05; $v=0.15; BlackScholes ($call_put_flag, $S, $X, $T, $r, $v); //echo $call_put_flag, $S, $X, $T, $r, $v; //Commulative function function CND ($x) { $Pi = 3.141592653589793238; $a1 = 0.319381530; $a2 = -0.356563782; $a3 = 1.781477937; $a4 = -1.821255978; $a5 = 1.330274429; $L = abs($x); $k = 1 / ( 1 + 0.2316419 * $L); $p = 1 - 1 / pow(2 * $Pi, 0.5) * exp( -pow($L, 2) / 2 ) * ($a1 * $k + $a2 * pow($k, 2)+ $a3 * pow($k, 3) + $a4 * pow($k, 4) + $a5 * pow($k, 5) ); if ($x >= 0) { print $p; } else { print 1-$p; } } //BlackScholes calculation function BlackScholes ($call_put_flag, $S, $X, $T, $r, $v) { $d1 = ( log($S / $X) + ($r + pow($v, 2) / 2) * $T ) / ( $v * pow($T, 0.5) ); $d2 = $d1 - $v * pow($T, 0.5); if ($call_put_flag == 'c') { print $S * CND($d1) - $X * exp( -$r * $T ) * CND($d2); //Call Option } else { print $X * exp( -$r * $T ) * CND(-$d2) - $S * CND(-$d1); //Put Option } ?> 2 Contributors 2 Replies 3 Views 7 Years Discussion Span Last Post by muhito 0 A blank page usually means that you had a syntax problem and the program didn't run. If you use an editor that has built in syntax checking (like Netbeans) it will help you find these errors. Indenting your code makes it easier to see some kinds of problems visually. In this case, you are missing the final bracket for the BlackScholes function. 0 A blank page usually means that you had a syntax problem and the program didn't run. If you use an editor that has built in syntax checking (like Netbeans) it will help you find these errors. Indenting your code makes it easier to see some kinds of problems visually. In this case, you are missing the final bracket for the BlackScholes function. Thanks so much. This question has already been answered. Start a new discussion instead. Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.
{ "url": "https://www.daniweb.com/programming/web-development/threads/363719/php-function-problem-please-help", "source_domain": "www.daniweb.com", "snapshot_id": "crawl=CC-MAIN-2018-34", "warc_metadata": { "Content-Length": "48238", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:SM56OYC6PQX2Y6LYT4BWKZWE3W6R5MUJ", "WARC-Concurrent-To": "<urn:uuid:719c37c4-f940-435a-bd14-2589d21f3249>", "WARC-Date": "2018-08-17T13:32:50Z", "WARC-IP-Address": "198.23.117.137", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:XWSFHUBI2N53DA5YFNTUYAVYEZ4PTAZ6", "WARC-Record-ID": "<urn:uuid:8ffed080-eb00-403c-8631-683be1b4c4f3>", "WARC-Target-URI": "https://www.daniweb.com/programming/web-development/threads/363719/php-function-problem-please-help", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:36f7db00-8343-41cd-9bb9-25ea43f53799>" }, "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-67-167-236.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 2, 3, 88, 89, 95, 114, 134, 141, 148, 156, 165, 174, 225, 268, 269, 292, 312, 313, 341, 342, 361, 362, 382, 383, 402, 403, 423, 424, 443, 444, 458, 459, 491, 492, 639, 640, 656, 657, 667, 668, 677, 678, 690, 691, 693, 694, 696, 723, 783, 785, 786, 863, 864, 895, 896, 925, 926, 995, 996, 1006, 1007, 1077, 1078, 1080, 1081, 1084, 1086, 1099, 1101, 1109, 1111, 1117, 1125, 1141, 1161, 1163, 1164, 1432, 1433, 1512, 1513, 1515, 1516, 1784, 1785, 1864, 1865, 1881, 1882, 1955 ], "line_end_idx": [ 2, 3, 88, 89, 95, 114, 134, 141, 148, 156, 165, 174, 225, 268, 269, 292, 312, 313, 341, 342, 361, 362, 382, 383, 402, 403, 423, 424, 443, 444, 458, 459, 491, 492, 639, 640, 656, 657, 667, 668, 677, 678, 690, 691, 693, 694, 696, 723, 783, 785, 786, 863, 864, 895, 896, 925, 926, 995, 996, 1006, 1007, 1077, 1078, 1080, 1081, 1084, 1086, 1099, 1101, 1109, 1111, 1117, 1125, 1141, 1161, 1163, 1164, 1432, 1433, 1512, 1513, 1515, 1516, 1784, 1785, 1864, 1865, 1881, 1882, 1955, 2093 ] }
{ "red_pajama_v2": { "ccnet_original_length": 2093, "ccnet_original_nlines": 90, "rps_doc_curly_bracket": 0.005255610216408968, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.19778481125831604, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0569620281457901, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.5047468543052673, "rps_doc_frac_unique_words": 0.47546011209487915, "rps_doc_mean_word_length": 4.092024326324463, "rps_doc_num_sentences": 30, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.833184719085693, "rps_doc_word_count": 326, "rps_doc_frac_chars_dupe_10grams": 0.4167915880680084, "rps_doc_frac_chars_dupe_5grams": 0.48725637793540955, "rps_doc_frac_chars_dupe_6grams": 0.4707646071910858, "rps_doc_frac_chars_dupe_7grams": 0.45877060294151306, "rps_doc_frac_chars_dupe_8grams": 0.4167915880680084, "rps_doc_frac_chars_dupe_9grams": 0.4167915880680084, "rps_doc_frac_chars_top_2gram": 0.013493250124156475, "rps_doc_frac_chars_top_3gram": 0.022488759830594063, "rps_doc_frac_chars_top_4gram": 0.03148426115512848, "rps_doc_books_importance": -225.76852416992188, "rps_doc_books_importance_length_correction": -225.76852416992188, "rps_doc_openwebtext_importance": -151.2156219482422, "rps_doc_openwebtext_importance_length_correction": -151.2156219482422, "rps_doc_wikipedia_importance": -130.04226684570312, "rps_doc_wikipedia_importance_length_correction": -130.04226684570312 }, "fasttext": { "dclm": 0.9686922430992126, "english": 0.7833444476127625, "fineweb_edu_approx": 1.664616346359253, "eai_general_math": 0.8203067779541016, "eai_open_web_math": 0.3818557858467102, "eai_web_code": 0.5485289096832275 } }
{ "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": "332.6", "labels": { "level_1": "Social sciences", "level_2": "Economics", "level_3": "Finance" } } }, "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": "Truncated Snippets" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
5,219,995,350,803,101,000
Skip to content HTTPS clone URL Subversion checkout URL You can clone with HTTPS or Subversion. Download ZIP A simple PHP API to make working with SharePoint lists easy. PHP branch: develop Failed to load latest commit information. src/Thybag Specify TLSv1 License.txt Update readme SharePointAPI.php composer.json Bump version for good measure readme.md cleanup + update readme readme.md PHP SharePoint Lists API The PHP SharePoint Lists API is designed to make working with SharePoint Lists in PHP a less painful developer experience. Rather than messing around with SOAP and CAML requests, just include the SharePoint lists API in to your project and you should be good to go. This library is free for anyone to use and is licensed under the MIT license. Using the PHP SharePoint Lists API, you can easily create, read, edit and delete from SharePoint list. The API also has support for querying list metadata and the list of lists. Known to work with: SharePoint 2007 and SharePoint online (experimental). Usage Instructions Installation Download the WSDL file for the SharePoint Lists you want to interact with. This can normally be obtained at: sharepoint.url/subsite/_vti_bin/Lists.asmx?WSDL If you are using composer, just add thybag/php-sharepoint-lists-api to your composer.json and run composer. { "require": { "thybag/php-sharepoint-lists-api": "dev-master" } } If you are not using composer you can download a copy of the SharePointAPI files manually and include the top "SharePointAPI.php" class in your project. Creating SharePointAPI object In order to use the PHP SharePoint Lists API you will need a valid user/service account with the permissions to the required list. For most SharePoint installations, you can create a new instance of the API using: use Thybag\SharePointAPI; $sp = new SharePointAPI('<username>', '<password>', '<path_to_WSDL>'); If your installation requires NTLM Authentication, you can instead use: use Thybag\SharePointAPI; $sp = new SharePointAPI('<username>', '<password>', '<path_to_WSDL>', 'NTLM'); SharePoint Online users must use: use Thybag\SharePointAPI; $sp = new SharePointAPI('<username>', '<password>', '<path_to_WSDL>', 'SPONLINE'); All methods return an Array by default. SetReturnType can be used to specify that results should be returned as objects instead. Reading from a List. To return all items from a list use either $sp->read('<list_name>'); or $sp->query('<list_name>')->get(); To return only the first 10 items from a list use: $sp->read('<list_name>', 10); or $sp->query('<list_name>')->limit(10)->get(); To return all the items from a list where surname is smith use: $sp->read('<list_name>', NULL, array('surname'=>'smith')); or $sp->query('<list_name>')->where('surname', '=', 'smith')->get(); To return the first 5 items where the surname is smith and the age is 40 $sp->read('<list_name>', 5, array('surname'=>'smith','age'=>40)); or $sp->query('<list_name>')->where('surname', '=', 'smith')->and_where('age', '=', '40')->limit(5)->get(); To return the first 10 items where the surname is "smith" using a particular view, call: (It appears views can only be referenced by their GUID) $sp->read('<list_name>', 10, array('surname'=>'smith','age'=>40),'{0FAKE-GUID001-1001001-10001}'); or $sp->query('<list_name>')->where('surname', '=', 'smith')->and_where('age', '=', '40')->limit(10)->using('{0FAKE-GUID001-1001001-10001}')->get(); To return the first 10 items where the surname is smith, ordered by age use: $sp->read('<list_name>', 10, array('surname'=>'smith'), NULL, array('age' => 'desc')); or $sp->query('<list_name>')->where('surname', '=', 'smith')->limit(10)->sort('age','DESC')->get(); To return the first 5 items, including the columns "favroite_cake" and "favorite animal" $sp->read('<list_name>', 5, NULL, array("favroite_cake", "favorite_animal")); or $sp->query('<list_name>')->fields(array("favroite_cake", "favorite_animal")->limit(5)->get(); By default list item's are returned as arrays with lower case index's. If you would prefer the results to return as object's, before invoking any read operations use: $sp->setReturnType('object'); Automatically making the attribute names lowercase can also be deactivated by using: $sp->lowercaseIndexs(FALSE); Querying a list The query method can be used when you need to specify a query that is to complex to be easily defined using the read methods. Queries are constructed using a number of (hopefully expressive) pseudo SQL methods. If you for example wanted to query a list of pets and return all dogs below the age of 5 (sorted by age) you could use. $sp->query('list of pets')->where('type','=','dog')->and_where('age','<','5')->sort('age','ASC')->get(); If you wanted to get the first 10 pets that were either cats or hamsters you could use: $sp->query('list of pets')->where('type','=','cat')->or_where('type','=','hamster')->limit(10)->get(); If you need to return 5 items, but including all fields contained in a list, you can use. (pass false to all_fields to include hidden fields). $sp->query('list of pets')->all_fields()->get(); If you have a set of CAML for a specific advanced query you would like to run, you can pass it to the query object using: $sp->query('list of pets')->raw_where('<Eq><FieldRef Name="Title" /><Value Type="Text">Hello World</Value></Eq>')->limit(10)->get(); Adding to a list To add a new item to a list you can use either the method "write", "add" or "insert" (all function identically). Creating a new record in a List with the columns forename, surname, age and phone may look like: $sp->write('<list_name>', array('forename'=>'Bob','surname' =>'Smith', 'age'=>40, 'phone'=>'(00000) 000000' )); You can also run multiple write operations together by using: $sp->writeMultiple('<list_name>', array( array('forename' => 'James'), array('forename' => 'Steve') )); Editing Rows To edit a row you need to have its ID. Assuming the above row had the ID 5, we could change Bob's name to James with: $sp->update('<list_name>','5', array('forename'=>'James')); As with the write method you can also run multiple update operations together by using: $sp->updateMultiple('<list_name>', array( array('ID'=>5,'job'=>'Intern'), array('ID'=>6,'job'=>'Intern') )); When using updateMultiple every item MUST have an ID. Deleting Rows In order to delete a row, an ID as well as list name is required. To remove the record for James with the ID 5 you would use: $sp->delete('<list_name>', '5'); If you wished to delete a number of records at once, an array of ID's can also be passed to the delete multiple method $sp->deleteMultiple('<list_name>', array('6','7','8')); CRUD - Create, Read, Update and Delete The above actions can also be performed using the CRUD wrapper on a list. This may be useful when you want to perform multiple actions on the same list. Crud methods do not require a list name to be passed in. $list = $sp->CRUD('<list_name>'); $list->read(10); $list->create(array( 'id'=>1, 'name'=>'Fred' )); List all Lists. You can get a full listing of all available lists within the connected SharePoint subsite by calling: $sp->getLists(); List metaData. You can access a lists meta data (Column configuration for example) by calling $sp->readListMeta('My List'); By default the method will attempt to strip out non-useful columns from the results, but keep "hidden". If you'd like the full results to be returned call: $sp->readListMeta('My List',FALSE); You can also now ignore "hidden" columns: $sp->readListMeta('My List', FALSE, TRUE); Field history / versions. If your list is versioned in SharePoint, you can read the versions for a specific field using: $sp->getVersions('<list>', '<id>', '<field_name>'); Attach a file to a SharePoint list item Files can be attached to SharePoint list items using: $sp->addAttachment('<list>', '<id>', '<path_to_file>'); Helper methods The PHP SharePoint API contains a number of helper methods to make it easier to ensure certain values are in the correct format for some of SharePoints special data types. dateTime The dataTime method can either be passed a text based date $date = \Thybag\SharepointApi::dateTime("2012-12-21"); Or a unix timestamp $date = \Thybag\SharepointApi::dateTime(time(), true); And will return a value which can be stored in to SharePoints DateTime fields without issue. Lookup The lookup data type in SharePoint is for fields that reference a row in another list. In order to correctly populate these values you will need to know the ID of the row the value needs to reference. $value = \Thybag\SharepointApi::lookup('3','Pepperoni Pizza'); If you do not know the name/title of the value you are storing the method will work fine with just an ID (which SharePoint will also accept directly) $value = \Thybag\SharepointApi::lookup('3'); Magic Lookup If you are attempting to store a value in a "lookup" data type but for some reason only know the title/name of the item, not its ID, you can use the MagicLookup method to quickly look this value up and return it for you. This method will need to be passed both the items title & the list it is contained within. $sp->magicLookup("Pepperoni Pizza", "Pizza List"); Trouble shooting • Unable to find the wrapper "https" If you are getting this error it normally means that php_openssl (needed to curl https urls) is not enabled on your webserver. With many local websevers (such as XAMPP) you can simply open your php.ini file and uncomment the php_openssl line (ie. remove the ; before it). Something went wrong with that request. Please try again.
{ "url": "https://github.com/thybag/PHP-SharePoint-Lists-API", "source_domain": "github.com", "snapshot_id": "crawl=CC-MAIN-2015-18", "warc_metadata": { "Content-Length": "53574", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:DIRX76R7DXWVTVMF7ZKNNRFZ3XIBWR6B", "WARC-Concurrent-To": "<urn:uuid:7aed4d87-d5f6-42ac-9a55-e22c1a813c61>", "WARC-Date": "2015-04-25T13:49:12Z", "WARC-IP-Address": "192.30.252.128", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:VI6SZY342TEUK2XXCL6T3KL65YR5OJUO", "WARC-Record-ID": "<urn:uuid:56b94cf6-63cb-4673-8b77-2bc8dbd523f1>", "WARC-Target-URI": "https://github.com/thybag/PHP-SharePoint-Lists-API", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:8656770c-387b-414f-93fd-2644e001723c>" }, "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, 16, 17, 33, 34, 58, 59, 99, 100, 113, 174, 178, 194, 236, 261, 287, 305, 349, 383, 384, 394, 395, 420, 421, 765, 766, 944, 945, 1019, 1020, 1039, 1040, 1053, 1054, 1211, 1212, 1320, 1321, 1323, 1340, 1396, 1402, 1404, 1405, 1558, 1559, 1589, 1590, 1721, 1722, 1805, 1806, 1832, 1903, 1904, 1976, 1977, 2003, 2082, 2083, 2117, 2118, 2144, 2227, 2228, 2357, 2358, 2379, 2380, 2423, 2450, 2451, 2454, 2455, 2489, 2540, 2571, 2572, 2575, 2576, 2621, 2685, 2745, 2746, 2749, 2750, 2816, 2889, 2956, 2957, 2960, 2961, 3066, 3211, 3311, 3312, 3315, 3316, 3463, 3540, 3628, 3629, 3632, 3633, 3730, 3819, 3898, 3899, 3902, 3903, 3997, 3998, 4165, 4166, 4197, 4198, 4283, 4284, 4313, 4314, 4330, 4331, 4542, 4543, 4663, 4664, 4769, 4770, 4858, 4859, 4962, 4963, 5106, 5107, 5156, 5157, 5279, 5280, 5413, 5414, 5431, 5432, 5642, 5643, 5755, 5756, 5818, 5819, 5860, 5894, 5927, 5931, 5932, 5945, 5946, 6064, 6065, 6125, 6126, 6214, 6215, 6257, 6293, 6328, 6332, 6333, 6387, 6388, 6402, 6403, 6529, 6530, 6563, 6564, 6683, 6684, 6740, 6741, 6780, 6781, 6991, 6992, 7026, 7043, 7092, 7093, 7109, 7110, 7212, 7213, 7230, 7231, 7246, 7247, 7326, 7327, 7357, 7358, 7514, 7515, 7551, 7552, 7594, 7595, 7638, 7639, 7665, 7666, 7761, 7762, 7814, 7815, 7855, 7856, 7910, 7911, 7967, 7968, 7983, 7984, 8156, 8157, 8166, 8167, 8226, 8227, 8283, 8284, 8304, 8305, 8360, 8361, 8454, 8455, 8462, 8463, 8664, 8665, 8728, 8729, 8879, 8880, 8925, 8938, 8939, 9251, 9252, 9303, 9304, 9321, 9322, 9361, 9362, 9634, 9635 ], "line_end_idx": [ 16, 17, 33, 34, 58, 59, 99, 100, 113, 174, 178, 194, 236, 261, 287, 305, 349, 383, 384, 394, 395, 420, 421, 765, 766, 944, 945, 1019, 1020, 1039, 1040, 1053, 1054, 1211, 1212, 1320, 1321, 1323, 1340, 1396, 1402, 1404, 1405, 1558, 1559, 1589, 1590, 1721, 1722, 1805, 1806, 1832, 1903, 1904, 1976, 1977, 2003, 2082, 2083, 2117, 2118, 2144, 2227, 2228, 2357, 2358, 2379, 2380, 2423, 2450, 2451, 2454, 2455, 2489, 2540, 2571, 2572, 2575, 2576, 2621, 2685, 2745, 2746, 2749, 2750, 2816, 2889, 2956, 2957, 2960, 2961, 3066, 3211, 3311, 3312, 3315, 3316, 3463, 3540, 3628, 3629, 3632, 3633, 3730, 3819, 3898, 3899, 3902, 3903, 3997, 3998, 4165, 4166, 4197, 4198, 4283, 4284, 4313, 4314, 4330, 4331, 4542, 4543, 4663, 4664, 4769, 4770, 4858, 4859, 4962, 4963, 5106, 5107, 5156, 5157, 5279, 5280, 5413, 5414, 5431, 5432, 5642, 5643, 5755, 5756, 5818, 5819, 5860, 5894, 5927, 5931, 5932, 5945, 5946, 6064, 6065, 6125, 6126, 6214, 6215, 6257, 6293, 6328, 6332, 6333, 6387, 6388, 6402, 6403, 6529, 6530, 6563, 6564, 6683, 6684, 6740, 6741, 6780, 6781, 6991, 6992, 7026, 7043, 7092, 7093, 7109, 7110, 7212, 7213, 7230, 7231, 7246, 7247, 7326, 7327, 7357, 7358, 7514, 7515, 7551, 7552, 7594, 7595, 7638, 7639, 7665, 7666, 7761, 7762, 7814, 7815, 7855, 7856, 7910, 7911, 7967, 7968, 7983, 7984, 8156, 8157, 8166, 8167, 8226, 8227, 8283, 8284, 8304, 8305, 8360, 8361, 8454, 8455, 8462, 8463, 8664, 8665, 8728, 8729, 8879, 8880, 8925, 8938, 8939, 9251, 9252, 9303, 9304, 9321, 9322, 9361, 9362, 9634, 9635, 9692 ] }
{ "red_pajama_v2": { "ccnet_original_length": 9692, "ccnet_original_nlines": 254, "rps_doc_curly_bracket": 0.0008254200220108032, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2855800688266754, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.029591359198093414, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.301550030708313, "rps_doc_frac_unique_words": 0.34976887702941895, "rps_doc_mean_word_length": 5.421417713165283, "rps_doc_num_sentences": 55, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.370284080505371, "rps_doc_word_count": 1298, "rps_doc_frac_chars_dupe_10grams": 0.012789539992809296, "rps_doc_frac_chars_dupe_5grams": 0.09293732792139053, "rps_doc_frac_chars_dupe_6grams": 0.06792666763067245, "rps_doc_frac_chars_dupe_7grams": 0.04177917167544365, "rps_doc_frac_chars_dupe_8grams": 0.03240016847848892, "rps_doc_frac_chars_dupe_9grams": 0.012789539992809296, "rps_doc_frac_chars_top_2gram": 0.013642179779708385, "rps_doc_frac_chars_top_3gram": 0.012789539992809296, "rps_doc_frac_chars_top_4gram": 0.011936900205910206, "rps_doc_books_importance": -974.5667114257812, "rps_doc_books_importance_length_correction": -974.5667114257812, "rps_doc_openwebtext_importance": -650.0987548828125, "rps_doc_openwebtext_importance_length_correction": -650.0987548828125, "rps_doc_wikipedia_importance": -383.4679870605469, "rps_doc_wikipedia_importance_length_correction": -383.4679870605469 }, "fasttext": { "dclm": 0.11976373195648193, "english": 0.7429662346839905, "fineweb_edu_approx": 1.9162715673446655, "eai_general_math": 0.26383185386657715, "eai_open_web_math": 0.10496091842651367, "eai_web_code": 0.536183774471283 } }
{ "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.74", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "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": "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" } } }
ece34605c058195ed03b4d393ef1a36c
-7,723,980,307,401,762,000
Docker Docker メリット、デメリット はい、こんばんは。 Dockerについて少し勉強したので、アウトプットさせていただきます!! Dockerとは? Docker社が提供している、コンテナ型のアプリケーション実行環境のことです。コンテナ型の仮想化を利用して... ダイエット ダイエット経過(1週目) はい、こんばんは。 エンジニアに大切なものは健康である!!としてダイエットを始めました。 1週間ほどたちましたので、経過を記載していきたいと思います。 ※今回のダイエットでは痩せるためのサプリや健康食品等は使っておらず、... ダイエット エンジニア生活4週目に気づいた大切なこと はい、こんばんは。 今回はエンジニア生活で気づいた大切なことについて書きたいと思います。 エンジニアにとって何が一番大切か?? 技術力?もちろん大切です。給料?それも外せませんね〜。 私は健康が一番大切であると考え... Apache LAMP環境 「A」のApache(アパッチ) Apacheとは?? Apacheとは、世界で最も使われている Webサーバーのオープンソースソフトウェアになります。(無料で使えるソフトウェアということです。) Webサーバーとは?? クライアント(ここではActor... Apache 今後の方向性を決めました!! はい、こんばんは!! 久しぶりの投稿となってしまいました。 業務が始まり、忙しくなる中でもアウトプットを怠らずできると良いなと思っていますがなかなか・・・ ということで、エンジニア生活もそろそろ1ヶ月ということで... 交通事故 腰椎椎間板ヘルニアについて調べてみた。 はい、こんにちは!! タイトルの通り、腰椎椎間板ヘルニアになりました。 エンジニアにとって致命傷な腰の怪我です・・・ 良い機会なので、腰椎椎間板ヘルニアについて調べて見ました!! 症状 腰や臀部に痛み... CSS レスポンシブ対応に不可欠の「メディアクエリ」 レスポンシブデザインで使えるCSS紹介!!レスポンシブでお悩みの方、初学者の方はぜひ参考にして見てください。皆様からのコメント待っています!! 未分類 CSSのスタイル指定方法(直下セレクタ) はい、こんばんは。 本日はCSSの学びをアウトプットします。 入れ子構造の一番上にだけスタイルをあてたい・・・ ということで実際に例を出して見て行きます。 悪い例 HTML <div class="se... 振り返り エンジニア生活 1週目 振り返り はい、こんばんは。 早いもので、エンジニアとして活動させていただいて一週間が過ぎました。振り返りと題して、ここもっと勉強しておけばよかった・・・ということなどつらつらと書いていければと思います。 技術面 ・フロン... TECH::CAMP エンジニア生活始まる はい、こんばんは。 3月よりエンジニアとして働いております。 思えば、昨年の11月から現在に到るまで長い道のりでした。全ては、エンジニアとして勉強したいということを伝えた時に、頑張ってこいと背中を押してくれた妻のおかげと思って... タイトルとURLをコピーしました
{ "url": "https://azarashi-blogs.com/page/2/", "source_domain": "azarashi-blogs.com", "snapshot_id": "crawl=CC-MAIN-2019-30", "warc_metadata": { "Content-Length": "53040", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:LERRKK6VS34YWREQXZAVTRFATU4VAOOE", "WARC-Concurrent-To": "<urn:uuid:a902beb8-6c67-432e-8d08-e7d20839dff2>", "WARC-Date": "2019-07-18T08:47:53Z", "WARC-IP-Address": "183.181.79.130", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:PDYOZGPI4UVSXOW2MY5WMF4RZ5WLISRK", "WARC-Record-ID": "<urn:uuid:3dfcc457-dbe8-4b89-80fe-025859618b74>", "WARC-Target-URI": "https://azarashi-blogs.com/page/2/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:8709d750-b514-47e1-a1c2-f7ae6c2606a4>" }, "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-146-52-92.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, 7, 8, 26, 27, 141, 147, 148, 161, 162, 276, 282, 283, 304, 305, 416, 423, 424, 448, 449, 563, 570, 571, 586, 587, 697, 702, 703, 723, 724, 828, 832, 833, 856, 857, 929, 933, 934, 955, 956, 1061, 1066, 1067, 1084, 1085, 1195, 1206, 1207, 1218, 1219, 1336 ], "line_end_idx": [ 7, 8, 26, 27, 141, 147, 148, 161, 162, 276, 282, 283, 304, 305, 416, 423, 424, 448, 449, 563, 570, 571, 586, 587, 697, 702, 703, 723, 724, 828, 832, 833, 856, 857, 929, 933, 934, 955, 956, 1061, 1066, 1067, 1084, 1085, 1195, 1206, 1207, 1218, 1219, 1336, 1352 ] }
{ "red_pajama_v2": { "ccnet_original_length": 1352, "ccnet_original_nlines": 50, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04975124076008797, "rps_doc_frac_lines_end_with_ellipsis": 0.1764705926179886, "rps_doc_frac_no_alph_words": 0.8706467747688293, "rps_doc_frac_unique_words": 0.8695652484893799, "rps_doc_mean_word_length": 19.173913955688477, "rps_doc_num_sentences": 10, "rps_doc_symbol_to_word_ratio": 0.04477611929178238, "rps_doc_unigram_entropy": 3.997936487197876, "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, "rps_doc_frac_chars_top_3gram": 0, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -60.14641189575195, "rps_doc_books_importance_length_correction": -60.14638137817383, "rps_doc_openwebtext_importance": -33.68686294555664, "rps_doc_openwebtext_importance_length_correction": -33.68686294555664, "rps_doc_wikipedia_importance": -33.809425354003906, "rps_doc_wikipedia_importance_length_correction": -33.768924713134766 }, "fasttext": { "dclm": 0.8446580767631531, "english": 0, "fineweb_edu_approx": 2.2110252380371094, "eai_general_math": 0.00017148000188171864, "eai_open_web_math": 0.6284130215644836, "eai_web_code": 0.5393037796020508 } }
{ "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": "613.2", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Medicine", "level_3": "Health and Hygiene" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "9", "label": "Personal/Misc" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "16", "label": "Personal Blog" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "1", "label": "General Audience" } } }
ece34605c058195ed03b4d393ef1a36c
-3,682,597,712,435,778,600
flat assembler Message board for the users of flat assembler. flat assembler > Heap > Why do YOU love assembly? Goto page 1, 2  Next Author Thread Post new topic Reply to topic moveax41h Joined: 18 Feb 2018 Posts: 47 This forum's description says "anything not related to assembly language programming," however, this is an editorial so I didn't feel that it was right to post it in the Main forum. Moderators, if you disagree, feel free to move it. Tell us why you love assembly language. For me, assembly language has a very special place in my heart. I began programming at age 11 using PHP, Python, and C++. PHP was at version 3 or 3.5 I believe back then. After a few years, I put programming down and took up others things, as well as continuing my education. After a few other careers didn't work out, one day I decided to start programming again and realized that I loved it and this was the career for me. However, as a kid I was unlike other kids in that after school, I would always be reading howstuffworks.com, books like Basic Electricity, physics, and mathematics. I was obsessed with knowing how things worked at the deepest and most atomic levels. Little did I know that I would make a carer out of it way later in life by becoming a software reverse engineer. I somehow made career out of doing what I loved as a kid. I've owned TVs my whole life but they've done nothing but collect dust and stay off most of the time! As an adult programmer, I was not satisfied by high level languages... I'm not a huge fan of abstraction although I recognize the necessity of it in modern applications. I ALWAYS want to know the implementation details... I wanted to know how strcpy worked, what objects really were, what the stack really was, what the heap really was, how the kernel interacted with drivers to control hardware, etc... I love low-level programming. This took me to assembly language. To me, assembly language is very powerful and so much fun. I love playing with binary numbers, bits, and bytes. I love the fine-tuned control that assembly language affords, and knowing exactly how the CPU works. I also view assembly as a true art and I feel that humans and compilers have only discovered like 5% of what assembly really has to offer. _________________ -moveax41h Post 21 Jul 2018, 05:15 View user's profile Send private message Reply with quote Ali.Z Joined: 08 Jan 2018 Posts: 222 i didnt read your full post, anyhow .. if i would describe asm and it meaning in my life it would take a very very very long time. (maybe 24hrs writing without a break) but to make it short, read my signature. (adding extra word "philosophers") and welcome to asm world. _________________ Asm For Wise Humans Post 21 Jul 2018, 06:35 View user's profile Send private message Reply with quote Tomasz Grysztar Assembly Artist Joined: 16 Jun 2003 Posts: 7316 Location: Kraków, Poland moveax41h wrote: I ALWAYS want to know the implementation details... I wanted to know how strcpy worked, what objects really were, what the stack really was, what the heap really was, how the kernel interacted with drivers to control hardware, etc... I love low-level programming. I believe this is a very valuable approach and even if one is going to stick with high-level languages, the knowledge of the underlying architectures really pays off. moveax41h wrote: I love the fine-tuned control that assembly language affords, and knowing exactly how the CPU works. I would say that this is what was always the main appeal of assembly languages to me - it gives you that feeling of "being in the driver's seat" and having everything under control. I see some similarities between assembly programming and sailplane gliding - another thing I really liked, perhaps they both appealed to the same yearning. In a glider you feel you're completely on your own, with some very basic tools that you have to deeply understand in order to use them effectively. And that knowledge gives you an unique sense of control. Post 21 Jul 2018, 09:25 View user's profile Send private message Visit poster's website Reply with quote Furs Joined: 04 Mar 2016 Posts: 1429 Tomasz Grysztar wrote: moveax41h wrote: I ALWAYS want to know the implementation details... I wanted to know how strcpy worked, what objects really were, what the stack really was, what the heap really was, how the kernel interacted with drivers to control hardware, etc... I love low-level programming. I believe this is a very valuable approach and even if one is going to stick with high-level languages, the knowledge of the underlying architectures really pays off. For me, personally, I learned asm precisely because I wanted to understand some concepts that are very poorly explained in HLL books and "abstracted away" with silly analogies. For example, pointers. So in fact my original goal for learning asm was for understanding HLL concepts better... But now I became obsessed with knowing how every little thing works, even when I look at HLL code. If it's a HLL project I write from the start (not e.g. contributing to some other project), I always use something like -nostdlib because I don't want junk pulled into my project. I want to control the entry point and so on, assembly kind of "spoiled" me in this regard. I do use some standard library APIs sometimes, but just as normal libraries, not statically linked to my application/lib. I also have an obsession with overusing inline asm even in HLL code (inline asm is best thing about GCC Razz), or writing some functions purely in FASM even if the main project is HLL-based (and not necessarily because I profiled them to be slow, but more than that). I kind of hate polluting my code with unoptimized crap (i.e. most static linking falls into this) even when using HLLs, unless it's for development/internal use only. I've no problem using libraries that are somewhat bloated, though, because I always justify it as "they are shared libraries so it's ok for them to be more generalized than specialized for my application" in my mind... otherwise I go crazy with the bloat in my code. Yeah sort of an obsession. Confused For example, I hate static linking printf, but dynamic linking to it is ok. Post 22 Jul 2018, 19:33 View user's profile Send private message Reply with quote jazz Joined: 16 Jul 2016 Posts: 59 I love ASM because it makes my head hurt so much that writing in C/Delphi/Lisp - my usual go-to languages - feels like a long, chilling holiday afterwards. Oh, and because I hate software that hogs half a gigabyte of RAM doing nothing... and I want to do it better. Post 25 Jul 2018, 21:11 View user's profile Send private message Reply with quote moveax41h Joined: 18 Feb 2018 Posts: 47 jazz wrote: I love ASM because it makes my head hurt so much that writing in C/Delphi/Lisp - my usual go-to languages - feels like a long, chilling holiday afterwards. Oh, and because I hate software that hogs half a gigabyte of RAM doing nothing... and I want to do it better. Tell me about it. I cannot for the life of me even ponder to understand how on earth it's currently ok for a CHAT ROOM PROGRAM (cough cough SLACK) or a web browser with 25 tabs of text and images open to take 6 GIGABYTES of active RAM. It's just unbelievable because both of those problems have been solved like 40 years ago. But that's a rant for another thread. I enjoy reading everyones reasons. _________________ -moveax41h Post 25 Jul 2018, 23:16 View user's profile Send private message Reply with quote Furs Joined: 04 Mar 2016 Posts: 1429 moveax41h wrote: Tell me about it. I cannot for the life of me even ponder to understand how on earth it's currently ok for a CHAT ROOM PROGRAM (cough cough SLACK) or a web browser with 25 tabs of text and images open to take 6 GIGABYTES of active RAM. It's just unbelievable because both of those problems have been solved like 40 years ago. But that's a rant for another thread. I enjoy reading everyones reasons. Yeah, fully agreed. I think things are overbloated out of hand these days. It's so bad that I cannot even imagine how it can possibly use that much memory, unless it's made to waste memory on purpose. Seriously, I just can't. Post 30 Jul 2018, 20:24 View user's profile Send private message Reply with quote revolution When all else fails, read the source Joined: 24 Aug 2004 Posts: 16733 Location: In your JS exploiting you and your system Furs wrote: Yeah, fully agreed. I think things are overbloated out of hand these days. It's so bad that I cannot even imagine how it can possibly use that much memory, unless it's made to waste memory on purpose. Seriously, I just can't. You might be thinking of the "garbage collector". It means the programmer never has to free memory, ever. And naturally it works perfectly, NOT. Post 30 Jul 2018, 21:19 View user's profile Send private message Visit poster's website Reply with quote moveax41h Joined: 18 Feb 2018 Posts: 47 revolution wrote: Furs wrote: Yeah, fully agreed. I think things are overbloated out of hand these days. It's so bad that I cannot even imagine how it can possibly use that much memory, unless it's made to waste memory on purpose. Seriously, I just can't. You might be thinking of the "garbage collector". It means the programmer never has to free memory, ever. And naturally it works perfectly, NOT. And of course it's always way more secure and there can't be any memory corruption. Smile _________________ -moveax41h Post 30 Jul 2018, 22:12 View user's profile Send private message Reply with quote DimonSoft Joined: 03 Mar 2010 Posts: 570 Location: Belarus Garbage collection is what decreases the minimal level of professionalism o a programmer to the ground, so we’d all better just shut up and start writing the same crap Smile Don’t look for any sense in the phrase. Post 31 Jul 2018, 10:41 View user's profile Send private message Visit poster's website Reply with quote rugxulo Joined: 09 Aug 2005 Posts: 2341 Location: Usono (aka, USA) It's too hard to express what I feel here. I've already scrapped one long post days ago. Long story short .... I don't prefer assembly anymore (except for fun). Well, I'm a DOS fan (luddite), so being incompatible with modern Windows and Linux (plus the prevalence of things like Android atop ARM) makes me prefer portable code, even if HLLs are notoriously bad and sloppy regarding true portability (which should be one of their strengths, but it's much harder than it sounds and nobody cares). Yes, I know, you can have some portability with assembly (like FASM), but's it's also hard. If I had to go back in time, I'd rather learn Turbo Pascal or Oberon (first) rather than x86 assembly. Obviously, with a smartlinker, the problems of bloat aren't as bad. But even without, you can workaround such problems if you're diligent enough. I feel like there are enough bigger problems to solve than just worrying about every last cpu cycle or byte of RAM or disk space (even if I agree that we shouldn't be lazy or wasteful). I think learning good algorithms and such or avoiding common high-level pitfalls are probably worth more attention than cpu instruction minutiae. Then again, with CPUID and a billion extensions and tons of barely-compatible cpus (of various ages that still function, thus shouldn't be thrown out nor abandoned), I think assembly can be crucial. But overall, lowest common denominator (generic code from generic compiler) is often "good enough" (begrudgingly). But I'm not as experienced in assembly as some people, nor am I a Comp. Sci. professional or engineer. So limited skills means my efforts aren't up to snuff. I'm sure somebody can do brilliant things in assembly, but it ain't me. My point is that simplicity, elegance, minimalism are all virtues that can be cultivated outside of any specific OS or programming language or tool. I feel like you can learn and be successful despite any language. Of course, some languages are better than others for certain tasks. Use the right tool for the job. Heck, pre-made (canned) solutions can sometimes be combined to avoid rewriting everything from scratch (although I still think bootstrapping from scratch is a noble, yet often ignored, goal). Bad tools can still produce good code, creating good solutions to common problems (and vice versa). A poor carpenter blames his tools, but I do feel like "x86 only" (or "AMD64 only") is a dead end. Backwards compatibility (in x86, binary compatibility) and supporting legacy is a noble goal, but at this point, nobody cares or it's just too much work. So I feel like we're drowning (or rebeling?) against such things. Too many incompatible machines exist nowadays, which causes modern developers to only tend to focus more on high-end (sadly) instead of low-end cpus. Ignoring complexity entirely or denigrating working legacy machines is bad, IMHO. As bloated and heavyweight as HLLs are, they don't have to be. They do indeed perform a useful function (if used wisely). But I think they should be simplified. But it's not easy making things simple. It takes a genius (or heavy experience?) to minimize, isolate, reduce, simplify without breaking anything or omitting useful features or being hard to use. I don't think x86 assembly directly encourages that. I think it's some urge or necessity beyond the language or tool itself. Certainly I'm not recommending OberonOS or DOS to modern people, but certainly even those OSes can be useful in a pinch (or under VM) for specific tasks. Not every problem needs a billion-dollar OS as its solution, nor does everything have to be written in C++17. SUMMARY: So is assembly a panacea? No, but neither are HLLs. The true goal is to focus on portability, simplicity, legibility, maintainability, elegance, minimalism, flexibility, provable correctness, liberty, etc. No tool is off limits (although the less arcane / archaic, the better). Post 13 Aug 2018, 19:36 View user's profile Send private message Visit poster's website Reply with quote rugxulo Joined: 09 Aug 2005 Posts: 2341 Location: Usono (aka, USA) But I don't think HLLs by themselves waste a lot of RAM in bloated code generation. The RAM usage is usually related to (dynamic?) data, not code. I know you're not naive, but I don't know how you think assembly automatically fixes that. Sure, it forces you to know what you're doing behind the scenes (unlike C++, perhaps?), thus avoiding accidentally misusing costly algorithms. I do blame AMD64 as part of the problem since it treats memory as unlimited. With old IA-32, you knew that a gig was a lot of memory, and you avoided trying to use it all. But nowadays nobody cares because they can just buy / install more, ad infinitum. That breeds laziness (although I'm sure it's harder than it sounds to be RAM efficient). FYI, in case it wasn't obvious from my other posts, OberonOS has been ported to Spartan Xilinx FPGA. The entire OS, with compiler self-hosting, can run in only a single meg of RAM. And yes, it's garbage collected and even native code (no VM, JIT, bytecode). Maybe that's not impressive to you because it omits so much, but the point is that garbage collection isn't always bad or inefficient. It's good to care about optimizations, algorithms, improving things, finding better solutions. But I think it's a mistake to lean too heavily on any tool or OS or language as if it is somehow superior, "in all ways", to everything else. Someone mentioned "web browser with 25 tabs", but there are plenty of alternatives, they just don't do literally everything and the kitchen sink. GNU Emacs is bloated as hell, but it does a ton. You don't need to leverage all of that for every little text edit you make. *nix in old days was focused on "doing one thing (only) and doing it well". Sometimes I think we complicate and add too many features to our software. ("You ain't gonna need it", "keep it simple, stupid", "don't repeat yourself", "write one to throw away" ... you know, relatively common wisdom being thrown around in certain circles.) See what I mean? Post 13 Aug 2018, 19:48 View user's profile Send private message Visit poster's website Reply with quote Furs Joined: 04 Mar 2016 Posts: 1429 Well I love C/C++ as much as asm, but the problem is with most other HLLs, they just can't be "tamed". It is undeniable that at some point it will add bloated instructions, regardless of how good the compiler is, because it simply cannot know that (until runtime). For example, even low level languages like Rust will forcefully enable bounds checking (which ironically makes them more vulnerable to Spectre even if the code is perfect), even though it doesn't have garbage collector. So, the bloat is unavoidable, not due to compilers not being smart enough, but due to the language itself. (in Rust you can use unsafe blocks but well, nobody does that often, hence the reason of bloat) C/C++ are special because you can, theoretically, make really transparent HLL abstractions in terms of code generation. There are some exceptions though, where you'll need compiler extensions (or plugins). Most HLLs, however, just suck because they'll forever generate bad code due to their design. Don't get me started on garbage collected languages (e.g. D, Go). Sometimes large memory use is the fault of the language, and in this case, their integrated garbage collectors. BTW speaking of Pascal, I don't know why but I just can't "get" into it. Everytime I see .pas files from some open source software, I cringe, because reading it looks so heavy to me. I mean the language text itself feels bloated, not the output. It's like Lisp with parentheses weirdness, but this time it's just too much heaviness from overuse of words. However the one language that's worse to read is Haskell. It's like hieroglyphs. Post 14 Aug 2018, 11:59 View user's profile Send private message Reply with quote rugxulo Joined: 09 Aug 2005 Posts: 2341 Location: Usono (aka, USA) Furs wrote: BTW speaking of Pascal, I don't know why but I just can't "get" into it. Everytime I see .pas files from some open source software, I cringe, because reading it looks so heavy to me. I mean the language text itself feels bloated, not the output. It's like Lisp with parentheses weirdness, but this time it's just too much heaviness from overuse of words. However the one language that's worse to read is Haskell. It's like hieroglyphs. There are too many dialects and derivatives. That alone makes things very hard to understand. It's considered in the Algol line, thus directly inspired by Algol 60 (and -W, unofficially) but not 68, but it also had improvements, successors, and unofficial derivatives. So you have to contend with classic, Extended, Turbo, Delphi, and many more! Not to mention Modula-2, Oberon (both with many dialects: PIM2, PIM3, ISO ... -1, -2, -07, Component Pascal, Active, Zonnon) and various others like Modula-3, Turing, Ada, Oxygene. Most code is naive or throw-away, so you'll see functions that are too long, not enough use of separate modules (units), esp. for non-portable "system" stuff. In other words, not enough abstraction or encapsulation. (I hate to be that guy, but it's true.) And FPC itself (or even GPC) allows you to mix dialects (which is brittle but can be useful) although truly FPC started as TP-only and eventually became Delphi-obsessed. Yes, FPC mostly supports "ISO" (7185) nowadays, but it's very rare. Most Delphi code is Win32 specific, and most old TP code is DOS specific (with too much use of inline asm). So compatibility is a nightmare, even if FPC does wonderfully (for the most part). I like comparing various dialects, but newcomers are intimidated into only following the "newest, greatest, most powerful" one, i.e. Delphi (dialect), which was (until relatively recently) mostly focused on Windows only. Like I said, even FPC went Delphi crazy since 2.0.0, released in 2005, so there's no great excuse for me to not embrace it (although it's bizarrely different). Even Turbo dialect bears little relation to Delphi anymore. I guess I'm just slow and stubborn for not immediately jumping on the latest fad / craze. I'm too simple, so I need simplicity. Delphi and FPC are the only obvious big choices nowadays (although of course others exist, too). For Oberon, you'll usually only see oo2c (-2) or obc/Oxford (-2, now also -07), esp. in *nix distros. For Modula-2, GNU gm2 (ISO 10514) still isn't in GCC trunk (yet), but it's very stable and still being updated. And of course Ada/GNAT is still kicking (but I never truly learned it) with its own dialects ('83 [obsolete], '95 [OOP! most popular?], '05, '12). SUMMARY: My point is that it depends on what dialect the code you're trying to read was written in. Usually it's non-portable code, so I wouldn't take that as a good example (esp. if abandoned, obsolete, etc). I guess you need to look at simpler, more high-level code, to get a good picture of what is supported and why, at the simple level. Dialects and portability make a huge difference. But honestly you don't need to know everything (or anything?), it's just trivial details. It's not that you're missing out on any brilliant ideas (for the most part), just slight differences in how things are done. Pascal does have some virtues over C or even C++, but it's not necessarily enough for you to throw everything else away. The common wisdom is to only learn new languages to see how to do things differently. That experience does come in handy, even if you don't use those languages anymore later on. Post 14 Aug 2018, 20:40 View user's profile Send private message Visit poster's website Reply with quote DimonSoft Joined: 03 Mar 2010 Posts: 570 Location: Belarus There’s still one thing that makes Pascal better than most languages nowadays: String is made first-class citizen. It’s funny how a whole bunch of languages derived from C have strings behave in strange ways (from the point of view of hypothetic someone not “spoiled” by deep knowledge of different ways to implement them). I mean, it’s necessary to know how your types work but having a type behave in an high-level and consistent way (compare with C++: str + "abc" vs "abc" + str) is what actually makes programming the process of solving a task, instead of fixing the language design mistakes. Post 14 Aug 2018, 22:13 View user's profile Send private message Visit poster's website Reply with quote rugxulo Joined: 09 Aug 2005 Posts: 2341 Location: Usono (aka, USA) DimonSoft wrote: There’s still one thing that makes Pascal better than most languages nowadays: String is made first-class citizen. It’s funny how a whole bunch of languages derived from C have strings behave in strange ways (from the point of view of hypothetic someone not “spoiled” by deep knowledge of different ways to implement them). I mean, it’s necessary to know how your types work but having a type behave in an high-level and consistent way (compare with C++: str + "abc" vs "abc" + str) is what actually makes programming the process of solving a task, instead of fixing the language design mistakes. I assume you knew some (or all?) of this. Actually, I assume you're mostly referring to Delphi. C didn't include strings in the language proper because it complicated the grammar. But classic Pascal did have "packed array [1..n] of char" (built-in because obviously it didn't have headers/libraries). Extended Pascal had proper strings and schemata arrays. Actually, classic Pascal (sometimes) had conformant arrays. PIM Modula-2 lacked strings except via external modules, but Oberon added some support back in the grammar (now always ending in NUL). ISO Modula-2 had string concat operator, similar to Turbo Pascal. I think UCSD was the first Pascal dialect to implement strings. Turbo had (up to) 255-byte proper variable strings. Extended was often limited to either 32000 or 64000 bytes (depending on implementation). I assume you're thinking more of Delphi's huge / ANSI strings, which are reference-counted and on the heap, thus much larger capacity. Delphi also has dynamic arrays (using exceptions behind the scenes) while Modula-2 only had open arrays (vs. conformant). Oberon-2 added "POINTER TO ARRAY OF CHAR" for dynamic strings via heap. Oh, and while I never truly learned Ada, it had strings (although wasn't "unbounded" only introduced in '95?). Of course, Ada had '&' string concat. Even Modula-3 [sic] had that, but their TEXT type was read-only, heap-based, garbage-collected strings. Yeah, it's complicated. I don't claim to fully understand it all! My point is that it varies not just by language but also by dialect. It's impossible to treat them all similarly, even at the simplest functionality. It's quite a mess, actually. But most people don't know or care about obscure dialects. For "Pascal", you really only have to worry about Delphi these days. (Moria was written in VAX/VMS Pascal, "varying of char" or whatever, but even that was long ago ported to C for U(nix)Moria. But I think one fork called BOSS was also translated to FPC a few years ago.) Yeah, I wasted too much time investigating obscure dialects. Laughing Post 17 Aug 2018, 07:16 View user's profile Send private message Visit poster's website Reply with quote Picnic Joined: 05 May 2007 Posts: 1277 Location: countryside The fact that is a short language with no data types, it has registers and the memory, enough to make everything. I love that. Post 17 Aug 2018, 07:47 View user's profile Send private message Reply with quote Coty Joined: 17 May 2010 Posts: 546 Location: &#9216; The thing I like about assembly is that it is raw, I can manipulate bits and bytes however I want and whenever I want, I don't have to worry about how I need to make my string an int, or a byte or vise versa or whatever, I can can just point at binary and flip bits as I so chose. as long as I don't try some crap like mov al, dword then I'm fine. But HLLs... especially the ones I tend to use get all stuffy and I have to end up writing sub routines with over 30 lines to convert my data around just so I can flip a bit, then call another routine to put it back. ... I also like that it's straight forward, as a guy who uses allot of different languages, you would be surprised how often i forget how to do a for loop in X language. But not for assembly lol _________________ http://codercat.info/ http://codercat.org/ Post 19 Aug 2018, 18:35 View user's profile Send private message Send e-mail Visit poster's website AIM Address Reply with quote praddo Joined: 09 Oct 2011 Posts: 10 Elegance, power and control. Post 19 Aug 2018, 19:30 View user's profile Send private message Reply with quote rugxulo Joined: 09 Aug 2005 Posts: 2341 Location: Usono (aka, USA) It's too vague. "Assembly" can mean many things. What cpu (i686 or x64 or AVX-512 or ARMv8)? Raw or high-level (preprocessor, macros, structs)? What APIs (DPMI, Win32, SDLv2 or GTK or whatever)? What calling convention (cdecl vs. stdcall)? What linker (if any)? What host and target OSes (Bash vs. Powershell vs. CMD vs. TCC, among other native tools)? Are Makefiles needed (or what alternative build system)? What third-party dependencies (libraries or tools that aren't pre-installed)? And even all of this assumes you know good algorithms. So assembly won't help if you don't understand heapsort vs. mergesort or dynamic memory usage or buffering I/O or whatever. (I don't really, that's why I mention it! But I'm no pro anyways.) Maybe some things are too easy, too obvious, for some of you. Or maybe it's not relevant or important enough for your projects. I'm just saying, in general, it can be very overwhelming and complicated, even for simple commandline userland apps that don't do any heavy lifting. Don't overestimate how "simple" it truly is. We have to strive for greater simplicity because everything is already brittle, and there's only so much a novice can handle. Not everyone is an engineer who can dynamically patch their kernel, rebuild world from scratch, or solder a board. Post 20 Aug 2018, 14:53 View user's profile Send private message Visit poster's website Reply with quote Display posts from previous: Post new topic Reply to topic Jump to:   Goto page 1, 2  Next < Last Thread | Next Thread > Forum Rules: You cannot post new topics in this forum You cannot reply to topics in this forum You cannot edit your posts in this forum You cannot delete your posts in this forum You cannot vote in polls in this forum You can attach files in this forum You can download files in this forum Copyright © 1999-2019, Tomasz Grysztar. Powered by rwasa.
{ "url": "http://board.flatassembler.net/topic.php?p=205613", "source_domain": "board.flatassembler.net", "snapshot_id": "crawl=CC-MAIN-2019-39", "warc_metadata": { "Content-Length": "80780", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:XL7NWGY4W7TWABI75R2IP4AZ2P33BUCX", "WARC-Concurrent-To": "<urn:uuid:f31386e3-5551-47bc-979b-816f149bab1c>", "WARC-Date": "2019-09-17T13:22:44Z", "WARC-IP-Address": "208.99.203.253", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:ZR5ZWMNJTEZNP3CQJT6LVTD2WCINLEUZ", "WARC-Record-ID": "<urn:uuid:85b942b5-9e5c-4997-b9b5-907f341341d9>", "WARC-Target-URI": "http://board.flatassembler.net/topic.php?p=205613", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:f28c8ae2-c4ab-473b-9843-b9e63f3d111a>" }, "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-252.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, 15, 62, 63, 113, 114, 135, 142, 179, 189, 190, 191, 192, 212, 222, 455, 456, 496, 497, 773, 774, 1446, 1447, 1881, 1882, 2269, 2270, 2288, 2299, 2323, 2381, 2387, 2388, 2389, 2390, 2410, 2421, 2590, 2591, 2667, 2693, 2694, 2712, 2732, 2756, 2814, 2830, 2846, 2847, 2848, 2868, 2880, 2905, 2922, 3186, 3353, 3354, 3371, 3472, 3654, 3655, 4016, 4040, 4121, 4126, 4127, 4128, 4129, 4149, 4161, 4184, 4201, 4465, 4632, 4922, 4923, 5415, 5416, 5684, 5685, 6231, 6255, 6313, 6318, 6319, 6320, 6321, 6341, 6351, 6507, 6508, 6618, 6642, 6700, 6710, 6711, 6712, 6713, 6733, 6743, 6755, 6911, 6912, 7022, 7023, 7024, 7260, 7261, 7424, 7425, 7443, 7454, 7478, 7536, 7541, 7542, 7543, 7544, 7564, 7576, 7593, 7829, 7830, 7993, 8219, 8243, 8301, 8312, 8349, 8350, 8351, 8371, 8384, 8436, 8448, 8674, 8819, 8843, 8924, 8934, 8935, 8936, 8937, 8957, 8967, 8985, 8997, 9223, 9368, 9369, 9370, 9460, 9461, 9479, 9490, 9514, 9572, 9582, 9583, 9584, 9585, 9605, 9616, 9634, 9848, 9872, 9953, 9961, 9962, 9963, 9964, 9984, 9996, 10023, 10134, 10135, 10612, 10613, 11508, 11509, 12246, 12247, 12897, 12898, 13644, 13645, 13654, 13932, 13956, 14037, 14045, 14046, 14047, 14048, 14068, 14080, 14107, 14488, 14489, 14832, 14833, 15226, 15227, 16088, 16112, 16193, 16198, 16199, 16200, 16201, 16221, 16233, 16498, 16499, 16922, 16923, 17222, 17223, 17401, 17402, 17403, 17839, 17863, 17921, 17929, 17930, 17931, 17932, 17952, 17964, 17991, 18003, 18004, 18440, 18441, 18442, 18969, 18970, 19572, 19573, 20097, 20098, 20684, 20685, 20694, 21590, 21614, 21695, 21705, 21706, 21707, 21708, 21728, 21739, 21757, 22081, 22082, 22355, 22379, 22460, 22468, 22469, 22470, 22471, 22491, 22503, 22530, 22547, 22871, 22872, 23145, 23146, 23147, 23243, 23244, 24553, 24554, 25130, 25131, 25201, 25225, 25306, 25313, 25314, 25315, 25316, 25336, 25348, 25370, 25497, 25521, 25579, 25584, 25585, 25586, 25587, 25607, 25618, 25636, 25955, 25956, 25970, 25971, 26202, 26203, 26398, 26399, 26417, 26439, 26460, 26484, 26589, 26596, 26597, 26598, 26599, 26619, 26629, 26658, 26682, 26740, 26748, 26749, 26750, 26751, 26771, 26783, 26810, 26859, 26860, 26904, 26955, 27006, 27051, 27073, 27164, 27221, 27299, 27300, 27546, 27547, 28110, 28134, 28215, 28244, 28274, 28275, 28286, 28307, 28308, 28338, 28351, 28392, 28433, 28474, 28517, 28556, 28591, 28628, 28629, 28630, 28670, 28671 ], "line_end_idx": [ 15, 62, 63, 113, 114, 135, 142, 179, 189, 190, 191, 192, 212, 222, 455, 456, 496, 497, 773, 774, 1446, 1447, 1881, 1882, 2269, 2270, 2288, 2299, 2323, 2381, 2387, 2388, 2389, 2390, 2410, 2421, 2590, 2591, 2667, 2693, 2694, 2712, 2732, 2756, 2814, 2830, 2846, 2847, 2848, 2868, 2880, 2905, 2922, 3186, 3353, 3354, 3371, 3472, 3654, 3655, 4016, 4040, 4121, 4126, 4127, 4128, 4129, 4149, 4161, 4184, 4201, 4465, 4632, 4922, 4923, 5415, 5416, 5684, 5685, 6231, 6255, 6313, 6318, 6319, 6320, 6321, 6341, 6351, 6507, 6508, 6618, 6642, 6700, 6710, 6711, 6712, 6713, 6733, 6743, 6755, 6911, 6912, 7022, 7023, 7024, 7260, 7261, 7424, 7425, 7443, 7454, 7478, 7536, 7541, 7542, 7543, 7544, 7564, 7576, 7593, 7829, 7830, 7993, 8219, 8243, 8301, 8312, 8349, 8350, 8351, 8371, 8384, 8436, 8448, 8674, 8819, 8843, 8924, 8934, 8935, 8936, 8937, 8957, 8967, 8985, 8997, 9223, 9368, 9369, 9370, 9460, 9461, 9479, 9490, 9514, 9572, 9582, 9583, 9584, 9585, 9605, 9616, 9634, 9848, 9872, 9953, 9961, 9962, 9963, 9964, 9984, 9996, 10023, 10134, 10135, 10612, 10613, 11508, 11509, 12246, 12247, 12897, 12898, 13644, 13645, 13654, 13932, 13956, 14037, 14045, 14046, 14047, 14048, 14068, 14080, 14107, 14488, 14489, 14832, 14833, 15226, 15227, 16088, 16112, 16193, 16198, 16199, 16200, 16201, 16221, 16233, 16498, 16499, 16922, 16923, 17222, 17223, 17401, 17402, 17403, 17839, 17863, 17921, 17929, 17930, 17931, 17932, 17952, 17964, 17991, 18003, 18004, 18440, 18441, 18442, 18969, 18970, 19572, 19573, 20097, 20098, 20684, 20685, 20694, 21590, 21614, 21695, 21705, 21706, 21707, 21708, 21728, 21739, 21757, 22081, 22082, 22355, 22379, 22460, 22468, 22469, 22470, 22471, 22491, 22503, 22530, 22547, 22871, 22872, 23145, 23146, 23147, 23243, 23244, 24553, 24554, 25130, 25131, 25201, 25225, 25306, 25313, 25314, 25315, 25316, 25336, 25348, 25370, 25497, 25521, 25579, 25584, 25585, 25586, 25587, 25607, 25618, 25636, 25955, 25956, 25970, 25971, 26202, 26203, 26398, 26399, 26417, 26439, 26460, 26484, 26589, 26596, 26597, 26598, 26599, 26619, 26629, 26658, 26682, 26740, 26748, 26749, 26750, 26751, 26771, 26783, 26810, 26859, 26860, 26904, 26955, 27006, 27051, 27073, 27164, 27221, 27299, 27300, 27546, 27547, 28110, 28134, 28215, 28244, 28274, 28275, 28286, 28307, 28308, 28338, 28351, 28392, 28433, 28474, 28517, 28556, 28591, 28628, 28629, 28630, 28670, 28671, 28688 ] }
{ "red_pajama_v2": { "ccnet_original_length": 28688, "ccnet_original_nlines": 362, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 1, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3759898543357849, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.045137789100408554, "rps_doc_frac_lines_end_with_ellipsis": 0.005509640090167522, "rps_doc_frac_no_alph_words": 0.21840354800224304, "rps_doc_frac_unique_words": 0.26455461978912354, "rps_doc_mean_word_length": 4.584653377532959, "rps_doc_num_sentences": 305, "rps_doc_symbol_to_word_ratio": 0.0026924300473183393, "rps_doc_unigram_entropy": 6.229015827178955, "rps_doc_word_count": 4861, "rps_doc_frac_chars_dupe_10grams": 0.25872746109962463, "rps_doc_frac_chars_dupe_5grams": 0.28910526633262634, "rps_doc_frac_chars_dupe_6grams": 0.2840797007083893, "rps_doc_frac_chars_dupe_7grams": 0.2780669629573822, "rps_doc_frac_chars_dupe_8grams": 0.27407342195510864, "rps_doc_frac_chars_dupe_9grams": 0.27407342195510864, "rps_doc_frac_chars_top_2gram": 0.008076819591224194, "rps_doc_frac_chars_top_3gram": 0.014358789660036564, "rps_doc_frac_chars_top_4gram": 0.017948489636182785, "rps_doc_books_importance": -2453.61474609375, "rps_doc_books_importance_length_correction": -2453.61474609375, "rps_doc_openwebtext_importance": -1675.4754638671875, "rps_doc_openwebtext_importance_length_correction": -1675.4754638671875, "rps_doc_wikipedia_importance": -1340.795654296875, "rps_doc_wikipedia_importance_length_correction": -1340.795654296875 }, "fasttext": { "dclm": 0.1450023055076599, "english": 0.9539185762405396, "fineweb_edu_approx": 1.5098588466644287, "eai_general_math": 0.1419590711593628, "eai_open_web_math": 0.16943669319152832, "eai_web_code": 0.020892320200800896 } }
{ "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.2", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "5", "label": "Evaluate" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "5", "label": "Comment Section" } }, "reasoning_depth": { "primary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
-4,439,577,039,659,208,000
MOAB: Mesh Oriented datABase  (version 5.4.1) GeomSetHierarchy.cpp File Reference #include "moab/Core.hpp" #include "moab/Range.hpp" #include "MBCN.hpp" #include "MBTagConventions.hpp" #include "moab/GeomTopoTool.hpp" #include <iostream> #include <cassert> + Include dependency graph for GeomSetHierarchy.cpp: Go to the source code of this file. Functions int main (int argc, char **argv) Variables const char * ent_names [] = { "Vertex", "Edge", "Face", "Region" } Function Documentation int main ( int  argc, char **  argv  ) Definition at line 11 of file GeomSetHierarchy.cpp. References moab::Range::begin(), moab::Range::clear(), dim, moab::Range::end(), ent_names, ErrorCode, GEOM_DIMENSION_TAG_NAME, geom_tag, moab::Interface::get_entities_by_type_and_tag(), moab::Interface::get_parent_meshsets(), moab::GeomTopoTool::get_sense(), moab::GeomTopoTool::get_senses(), moab::Interface::globalId_tag(), moab::Interface::load_file(), mb, MB_SUCCESS, MB_TYPE_INTEGER, MBENTITYSET, moab::Range::size(), moab::Interface::tag_get_data(), and moab::Interface::tag_get_handle(). { if( 1 == argc ) { std::cout << "Usage: " << argv[0] << " <filename>" << std::endl; return 0; } // instantiate & load a file moab::Interface* mb = new moab::Core(); moab::ErrorCode rval = mb->load_file( argv[1] ); assert( moab::MB_SUCCESS == rval ); // get the geometric topology tag handle moab::Tag geom_tag, gid_tag; rval = mb->tag_get_handle( GEOM_DIMENSION_TAG_NAME, 1, moab::MB_TYPE_INTEGER, geom_tag ); assert( moab::MB_SUCCESS == rval ); gid_tag = mb->globalId_tag(); assert( NULL != gid_tag ); // traverse the model, from dimension 3 downward moab::Range psets, chsets; std::vector< moab::EntityHandle > sense_ents; std::vector< int > senses; int dim, pgid, chgid; void* dim_ptr = &dim; int sense; moab::GeomTopoTool gt( mb, true ); for( dim = 3; dim >= 0; dim-- ) { // get parents at this dimension chsets.clear(); rval = mb->get_entities_by_type_and_tag( 0, MBENTITYSET, &geom_tag, &dim_ptr, 1, chsets, 1, false ); assert( moab::MB_SUCCESS == rval ); // for each child, get parents and do something with them moab::Range::iterator ch_it, p_it; for( ch_it = chsets.begin(); ch_it != chsets.end(); ++ch_it ) { // get the children and put in child set list psets.clear(); rval = mb->get_parent_meshsets( *ch_it, psets ); assert( moab::MB_SUCCESS == rval ); rval = mb->tag_get_data( gid_tag, &( *ch_it ), 1, &chgid ); assert( moab::MB_SUCCESS == rval ); // print # parents std::cout << ent_names[dim] << " " << chgid << " has " << psets.size() << " parents." << std::endl; if( 2 == dim ) { for( p_it = psets.begin(); p_it != psets.end(); ++p_it ) { rval = mb->tag_get_data( gid_tag, &( *p_it ), 1, &pgid ); assert( moab::MB_SUCCESS == rval ); rval = gt.get_sense( *ch_it, *p_it, sense ); if( moab::MB_SUCCESS != rval ) continue; std::cout << ent_names[dim + 1] << " " << pgid << ", " << ent_names[dim] << " " << chgid << " sense is: "; if( 1 == sense ) std::cout << "FORWARD" << std::endl; else std::cout << "REVERSE" << std::endl; } } else if( 1 == dim ) { sense_ents.clear(); senses.clear(); rval = gt.get_senses( *ch_it, sense_ents, senses ); if( moab::MB_SUCCESS != rval ) continue; for( unsigned int i = 0; i < sense_ents.size(); i++ ) { rval = mb->tag_get_data( gid_tag, &sense_ents[i], 1, &pgid ); assert( moab::MB_SUCCESS == rval ); std::cout << ent_names[dim + 1] << " " << pgid << ", " << ent_names[dim] << " " << chgid << " sense is: "; if( -1 == senses[i] ) std::cout << "REVERSED" << std::endl; else if( 0 == senses[i] ) std::cout << "BOTH" << std::endl; else if( 1 == senses[i] ) std::cout << "FORWARD" << std::endl; else std::cout << "(invalid)" << std::endl; } } } } delete mb; return 0; } Variable Documentation const char* ent_names[] = { "Vertex", "Edge", "Face", "Region" } Definition at line 9 of file GeomSetHierarchy.cpp. Referenced by main().  All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines
{ "url": "https://ftp.mcs.anl.gov/pub/fathom/moab-docs/GeomSetHierarchy_8cpp.html", "source_domain": "ftp.mcs.anl.gov", "snapshot_id": "CC-MAIN-2023-50", "warc_metadata": { "Content-Length": "25862", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:CM2IO2NOL5GQ3TLW7GCT35XUIIKCSGED", "WARC-Concurrent-To": "<urn:uuid:87f5980b-58c6-4589-98df-74b406d0ed70>", "WARC-Date": "2023-12-09T14:14:59Z", "WARC-IP-Address": "140.221.6.23", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:W6CPS5WEZJUBDTDWOHZ7HMMFM6VMODUI", "WARC-Record-ID": "<urn:uuid:b56d9167-dad0-4022-b40e-5ea4de5db89b>", "WARC-Target-URI": "https://ftp.mcs.anl.gov/pub/fathom/moab-docs/GeomSetHierarchy_8cpp.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:89a820e6-b3e9-42f9-905d-b7a6f435f220>" }, "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-117\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, 82, 107, 133, 153, 185, 218, 238, 257, 310, 311, 347, 348, 358, 359, 392, 393, 403, 404, 471, 472, 495, 496, 518, 533, 535, 536, 588, 589, 1084, 1085, 1087, 1107, 1113, 1186, 1204, 1210, 1211, 1244, 1289, 1342, 1382, 1383, 1428, 1461, 1555, 1595, 1629, 1660, 1661, 1714, 1745, 1795, 1826, 1852, 1878, 1893, 1894, 1933, 1934, 1970, 1976, 2017, 2041, 2150, 2194, 2195, 2261, 2304, 2374, 2384, 2442, 2469, 2530, 2578, 2579, 2651, 2699, 2700, 2731, 2843, 2844, 2871, 2885, 2958, 2976, 3054, 3110, 3175, 3236, 3345, 3393, 3430, 3491, 3516, 3577, 3595, 3609, 3641, 3655, 3691, 3723, 3791, 3848, 3918, 3936, 4018, 4074, 4183, 4231, 4273, 4335, 4381, 4439, 4485, 4546, 4571, 4634, 4652, 4666, 4676, 4682, 4683, 4698, 4699, 4713, 4715, 4716, 4739, 4740, 4805, 4806, 4857, 4858, 4880, 4881 ], "line_end_idx": [ 46, 82, 107, 133, 153, 185, 218, 238, 257, 310, 311, 347, 348, 358, 359, 392, 393, 403, 404, 471, 472, 495, 496, 518, 533, 535, 536, 588, 589, 1084, 1085, 1087, 1107, 1113, 1186, 1204, 1210, 1211, 1244, 1289, 1342, 1382, 1383, 1428, 1461, 1555, 1595, 1629, 1660, 1661, 1714, 1745, 1795, 1826, 1852, 1878, 1893, 1894, 1933, 1934, 1970, 1976, 2017, 2041, 2150, 2194, 2195, 2261, 2304, 2374, 2384, 2442, 2469, 2530, 2578, 2579, 2651, 2699, 2700, 2731, 2843, 2844, 2871, 2885, 2958, 2976, 3054, 3110, 3175, 3236, 3345, 3393, 3430, 3491, 3516, 3577, 3595, 3609, 3641, 3655, 3691, 3723, 3791, 3848, 3918, 3936, 4018, 4074, 4183, 4231, 4273, 4335, 4381, 4439, 4485, 4546, 4571, 4634, 4652, 4666, 4676, 4682, 4683, 4698, 4699, 4713, 4715, 4716, 4739, 4740, 4805, 4806, 4857, 4858, 4880, 4881, 4979 ] }
{ "red_pajama_v2": { "ccnet_original_length": 4979, "ccnet_original_nlines": 136, "rps_doc_curly_bracket": 0.00401687016710639, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.05999999865889549, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.024000000208616257, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.5329999923706055, "rps_doc_frac_unique_words": 0.469072163105011, "rps_doc_mean_word_length": 6.579896926879883, "rps_doc_num_sentences": 35, "rps_doc_symbol_to_word_ratio": 0.00800000037997961, "rps_doc_unigram_entropy": 4.814216136932373, "rps_doc_word_count": 388, "rps_doc_frac_chars_dupe_10grams": 0.038386210799217224, "rps_doc_frac_chars_dupe_5grams": 0.13160987198352814, "rps_doc_frac_chars_dupe_6grams": 0.0846063494682312, "rps_doc_frac_chars_dupe_7grams": 0.06737171858549118, "rps_doc_frac_chars_dupe_8grams": 0.038386210799217224, "rps_doc_frac_chars_dupe_9grams": 0.038386210799217224, "rps_doc_frac_chars_top_2gram": 0.059929490089416504, "rps_doc_frac_chars_top_3gram": 0.06306306272745132, "rps_doc_frac_chars_top_4gram": 0.010967490263283253, "rps_doc_books_importance": -403.4513854980469, "rps_doc_books_importance_length_correction": -403.4513854980469, "rps_doc_openwebtext_importance": -266.8818054199219, "rps_doc_openwebtext_importance_length_correction": -266.8818054199219, "rps_doc_wikipedia_importance": -203.23207092285156, "rps_doc_wikipedia_importance_length_correction": -203.23207092285156 }, "fasttext": { "dclm": 0.7952544689178467, "english": 0.3813249170780182, "fineweb_edu_approx": 2.2288730144500732, "eai_general_math": 0.9909778237342834, "eai_open_web_math": 0.2019532322883606, "eai_web_code": 0.8995091915130615 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "550", "labels": { "level_1": "Science and Natural history", "level_2": "Geology and Earth sciences", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "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": "4", "label": "Missing Images or Figures" } }, "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" } } }
ece34605c058195ed03b4d393ef1a36c
4,633,130,105,910,974,000
Beefy Boxes and Bandwidth Generously Provided by pair Networks go ahead... be a heretic   PerlMonks   Re^2: How do I work with multidimensional arrays in Moose? by tobyink (Abbot) on Sep 04, 2013 at 09:53 UTC ( #1052275=note: print w/ replies, xml ) Need Help?? in reply to Re: How do I work with multidimensional arrays in Moose? in thread How do I work with multidimensional arrays in Moose? Further to that, here's the Moose example reworked to use MooseX::Role::Parameterized; this factors out the grid-related logic into a role, to make it easier to create classes that are a grid of Cell objects, or a grid of strings, or a grid of filehandles, or whatever... use v5.14; package Cell { use Moose; use Types::Standard -types; has name => (is => 'rw', isa => Str); sub from_name { my $class = shift; $class->new(name => @_); } __PACKAGE__->meta->make_immutable; } package Grid { use MooseX::Role::Parameterized; use List::Objects::Types -types; use Types::TypeTiny qw( TypeTiny ); parameter type_constraint => (isa => TypeTiny, required => 1); role { my $p = shift; has cells => ( is => 'ro', isa => TypedArray[TypedArray[ $p->type_constraint ]], coerce => 1, handles => { get_row => 'get', set_row => 'set', all_rows => 'all', add_row => 'push', }, ); method get_cell => sub { my $self = shift; my ($row, $col) = @_; $self->get_row($row)->get($col); }; method set_cell => sub { my $self = shift; my ($row, $col, $value) = @_; $self->get_row($row)->set($col, $value); }; method all_cells => sub { my $self = shift; map { $_->all } $self->all_rows; }; method get_col => sub { my $self = shift; my ($col) = @_; map { $_->get($col) } $self->all_rows; }; method set_col => sub { my $self = shift; my ($col, $values) = @_; my @rows = $self->all_rows; for my $i (0 .. $#rows) { $rows[$i]->set($col) = $values->[$i]; } }; method add_col => sub { my $self = shift; my ($values) = @_; my @rows = $self->all_rows; for my $i (0 .. $#rows) { $rows[$i]->push($values->[$i]); } }; method all_cols => sub { my $self = shift; my $col_count = $self->get_row(0)->count; my $return_type = TypedArray[$p->type_constraint]; return map { $return_type->coerce($_); } map { [ $self->get_col($_) ]; } 0 .. $col_count-1; }; } } package CellGrid { use Moose; use Types::Standard -types; with Grid => { type_constraint => (InstanceOf['Cell'])->plus_constructors(Str +, 'from_name') }; sub to_string { my $self = shift; join "\n", map(join("\t", map($_->name, $_->all)), $self->all_ +rows); } __PACKAGE__->meta->make_immutable; } my $grid = CellGrid->new( cells => [ [ 'foo1', 'bar1' ], [ 'foo2', 'bar2' ], ] ); $grid->add_col(['baz1', 'baz2']); $grid->get_cell(1, 1)->name('QUUX'); say $grid->to_string; __END__ foo1 bar1 baz1 foo2 QUUX baz2 I really need to add some sugar for parameterized roles to Moops. :-) use Moops; class Cow :rw { has name => (default => 'Ermintrude') }; say Cow->new->name Comment on Re^2: How do I work with multidimensional arrays in Moose? Download Code Log In? Username: Password: What's my password? Create A New User Node Status? node history Node Type: note [id://1052275] help Chatterbox? and the web crawler heard nothing... How do I use this? | Other CB clients Other Users? Others chilling in the Monastery: (13) As of 2015-01-31 15:17 GMT Sections? Information? Find Nodes? Leftovers? Voting Booth? My top resolution in 2015 is: Results (258 votes), past polls
{ "url": "http://www.perlmonks.org/index.pl?node_id=1052275", "source_domain": "www.perlmonks.org", "snapshot_id": "crawl=CC-MAIN-2015-06", "warc_metadata": { "Content-Length": "24547", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:7STEIQ2ES2DN7CYPBKHPQURDNTCG63RI", "WARC-Concurrent-To": "<urn:uuid:1ae663cc-27e3-49b1-9113-a1ae7f4099ac>", "WARC-Date": "2015-01-31T15:20:29Z", "WARC-IP-Address": "66.39.54.27", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:RXTWNIZUZQ2XV7SLWEPNUHOV2WA7XTSM", "WARC-Record-ID": "<urn:uuid:6b5b9e52-ff1a-4f74-93be-3997581e96e3>", "WARC-Target-URI": "http://www.perlmonks.org/index.pl?node_id=1052275", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:725794b8-8dac-45eb-9836-ba8e12cc0a95>" }, "warc_info": "robots: classic\r\nhostname: ip-10-180-212-252.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-06\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for January 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }
{ "line_start_idx": [ 0, 63, 88, 90, 102, 103, 162, 163, 182, 264, 265, 266, 335, 398, 399, 671, 672, 2724, 2725, 2795, 2796, 2883, 2884, 2885, 2955, 2969, 2970, 2978, 2988, 2998, 2999, 3019, 3037, 3050, 3063, 3094, 3099, 3111, 3148, 3149, 3187, 3200, 3239, 3266, 3276, 3289, 3301, 3312, 3330, 3331, 3365, 3366, 3367, 3368, 3369, 3370, 3371, 3372, 3373, 3374, 3375, 3376, 3377, 3378, 3379, 3380, 3381, 3382 ], "line_end_idx": [ 63, 88, 90, 102, 103, 162, 163, 182, 264, 265, 266, 335, 398, 399, 671, 672, 2724, 2725, 2795, 2796, 2883, 2884, 2885, 2955, 2969, 2970, 2978, 2988, 2998, 2999, 3019, 3037, 3050, 3063, 3094, 3099, 3111, 3148, 3149, 3187, 3200, 3239, 3266, 3276, 3289, 3301, 3312, 3330, 3331, 3365, 3366, 3367, 3368, 3369, 3370, 3371, 3372, 3373, 3374, 3375, 3376, 3377, 3378, 3379, 3380, 3381, 3382, 3417 ] }
{ "red_pajama_v2": { "ccnet_original_length": 3417, "ccnet_original_nlines": 67, "rps_doc_curly_bracket": 0.012876790016889572, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.18421052396297455, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.016447370871901512, "rps_doc_frac_lines_end_with_ellipsis": 0.029411759227514267, "rps_doc_frac_no_alph_words": 0.4868420958518982, "rps_doc_frac_unique_words": 0.5369928479194641, "rps_doc_mean_word_length": 5.219570636749268, "rps_doc_num_sentences": 25, "rps_doc_symbol_to_word_ratio": 0.006578950211405754, "rps_doc_unigram_entropy": 5.041439056396484, "rps_doc_word_count": 419, "rps_doc_frac_chars_dupe_10grams": 0.04206676036119461, "rps_doc_frac_chars_dupe_5grams": 0.1911294013261795, "rps_doc_frac_chars_dupe_6grams": 0.14997713267803192, "rps_doc_frac_chars_dupe_7grams": 0.13260173797607422, "rps_doc_frac_chars_dupe_8grams": 0.11248285323381424, "rps_doc_frac_chars_dupe_9grams": 0.11248285323381424, "rps_doc_frac_chars_top_2gram": 0.021947870030999184, "rps_doc_frac_chars_top_3gram": 0.04023776948451996, "rps_doc_frac_chars_top_4gram": 0.04481023922562599, "rps_doc_books_importance": -410.029296875, "rps_doc_books_importance_length_correction": -410.029296875, "rps_doc_openwebtext_importance": -213.96316528320312, "rps_doc_openwebtext_importance_length_correction": -213.96316528320312, "rps_doc_wikipedia_importance": -167.7519989013672, "rps_doc_wikipedia_importance_length_correction": -167.7519989013672 }, "fasttext": { "dclm": 0.8836849927902222, "english": 0.6373030543327332, "fineweb_edu_approx": 2.265650510787964, "eai_general_math": 0.02086251974105835, "eai_open_web_math": 0.47104477882385254, "eai_web_code": 0.09313725680112839 } }
{ "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": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "6", "label": "Indeterminate" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "4", "label": "Advanced Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "5", "label": "Exceptionally Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
-1,178,348,780,671,599,900
/* * Copyright (C) 1998-2005 Andre Noll * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111, USA. */ /** \file fade.c a volume fader and alarm clock */ #include "fade.cmdline.h" #include "para.h" #include "fd.h" #include #include #include /* EXIT_SUCCESS */ #include #include #include #include #include #include "string.h" struct gengetopt_args_info args_info; void para_log(__unused int ll, const char *fmt,...) { va_list argp; time_t t1; struct tm *tm; time(&t1); tm = localtime(&t1); printf("%d:%02d:%02d ", tm->tm_hour, tm->tm_min, tm->tm_sec); va_start(argp, fmt); vprintf(fmt, argp); va_end(argp); } /* * open mixer device */ static int open_mixer(void) { int mixer_fd; if ((mixer_fd = open(args_info.mixer_device_arg, O_RDWR, 0)) < 0) return -1; return mixer_fd; } /* * get volume via mixer_fd */ static int do_get_vol(int mixer_fd) { int volume; if (ioctl(mixer_fd, MIXER_READ(SOUND_MIXER_VOLUME), &volume) < 0) return -1; /* take the mean value of left and right volume */ return (volume % 256 + (volume >> 8)) / 2; } /* * open mixer, get volume and close mixer */ static int get_vol(void) { int mixer_fd; int volume; mixer_fd = open_mixer(); if (mixer_fd < 0) return -1; volume = do_get_vol(mixer_fd); close(mixer_fd); return volume; } /* * set volume via mixer_fd */ static int do_set_vol(int mixer_fd, int volume) { int tmp; tmp = (volume << 8) + volume; if (ioctl(mixer_fd, MIXER_WRITE(SOUND_MIXER_VOLUME), &tmp) < 0) return 0; return 1; } /* * open mixer, set volume and close mixer */ static int set_vol(int volume) { int mixer_fd; int ret; mixer_fd = open_mixer(); ret = 0; if (mixer_fd < 0) goto out; if (!do_set_vol(mixer_fd, volume)) goto out; ret = 1; close(mixer_fd); out: return ret; } /* * Open mixer, get volume, fade to new_vol in secs seconds and * close mixer */ static int fade(int new_vol, unsigned int secs) { int vol, mixer_fd = -1, diff, incr, ret; struct timespec ts; unsigned long long tmp, tmp2; /* Careful with that axe, Eugene! */ PARA_NOTICE_LOG("fading to %d in %d seconds\n", new_vol, secs); ret = 0; if (!secs) goto out; mixer_fd = open_mixer(); if (mixer_fd < 0) goto out; vol = do_get_vol(mixer_fd); if (vol < 0) goto out; diff = new_vol - vol; if (!diff) { sleep(secs); ret = 1; goto out; } incr = diff > 0? 1: -1; diff = diff > 0? diff: -diff; tmp = secs * 1000 / diff; tmp2 = tmp % 1000; while ((new_vol - vol) * incr > 0) { ts.tv_nsec = tmp2 * 1000000; /* really nec ?*/ ts.tv_sec = tmp / 1000; /* really nec ?*/ //printf("ts.tv_sec: %i\n", ts.tv_nsec); vol += incr; if (!do_set_vol(mixer_fd, vol)) goto out; //printf("vol = %i\n", vol); nanosleep(&ts, NULL); } out: if (mixer_fd >= 0) close(mixer_fd); return 1; } static int client_cmd(const char *cmd,...) { int ret, fds[3] = {0, 0, 0}; pid_t pid; char *cmdline = make_message(BINDIR "/para_client %s", cmd); PARA_INFO_LOG("%s", cmdline); ret = para_exec_cmdline_pid(&pid, cmdline, fds); free(cmdline); return ret; } /* * sleep */ static void sweet_dreams(void) { time_t t1, wake_time_epoch; unsigned int delay; struct tm *tm; int hour = args_info.wake_hour_arg; int min = args_info.wake_min_arg; char *fa_stream = args_info.fa_stream_arg; char *wake_stream = args_info.wake_stream_arg; //char *current_stream = stat_items[STREAM].content; int wf = args_info.wake_fade_arg; int sf = args_info.fa_fade_arg; int wv = args_info.wake_vol_arg; int sv = args_info.fa_vol_arg; int iv = args_info.sleep_ivol_arg; char *cmd, *sleep_stream = args_info.sleep_stream_given? args_info.sleep_stream_arg : NULL; if (sf) { PARA_INFO_LOG("initial volume: %d\n", iv); set_vol(iv); cmd = make_message("csp %s\n", fa_stream); client_cmd(cmd); free(cmd); fade(sv, sf); } if (sleep_stream) { cmd = make_message("csp %s\n", sleep_stream); client_cmd(cmd); free(cmd); } else client_cmd("stop"); if (!wf) return; /* calculate wake time */ time(&t1); tm = localtime(&t1); if (tm->tm_hour > hour || (tm->tm_hour == hour && tm->tm_min> min)) { /* wake time is tomorrow */ t1 += 86400; tm = localtime(&t1); t1 -= 86400; } tm->tm_hour = hour; tm->tm_min = min; tm->tm_sec = 0; wake_time_epoch = mktime(tm); PARA_INFO_LOG("waketime: %s", asctime(tm)); while (wake_time_epoch > t1 + wf) { delay = wake_time_epoch - t1 - wf; PARA_INFO_LOG("sleeping %u seconds (%u:%02u)\n", delay, delay / 3600, (delay % 3600) / 60); sleep(delay); time(&t1); } cmd = make_message("csp %s\n", wake_stream); client_cmd(cmd); free(cmd); fade(wv, wf); PARA_INFO_LOG("%s", "fade complete, returning\n"); } static void snooze(void) { if (get_vol() < args_info.snooze_out_vol_arg) set_vol(args_info.snooze_out_vol_arg); else fade(args_info.snooze_out_vol_arg, args_info.snooze_out_fade_arg); client_cmd("pause"); PARA_NOTICE_LOG("%d seconds snooze time...\n", args_info.snooze_time_arg); sleep(args_info.snooze_time_arg); client_cmd("play"); fade(args_info.snooze_in_vol_arg, args_info.snooze_in_fade_arg); } static int configfile_exists(void) { static char *config_file; if (!args_info.config_file_given) { char *home = para_homedir(); const char *conf = ".paraslash/fade.conf"; free(config_file); config_file = make_message("%s/%s", home, conf); free(home); args_info.config_file_arg = config_file; } return file_exists(args_info.config_file_arg); } int main(int argc, char *argv[]) { int ret; if (cmdline_parser(argc, argv, &args_info)) exit(EXIT_FAILURE); ret = configfile_exists(); if (!ret && args_info.config_file_given) { PARA_EMERG_LOG("can not read config file %s\n", args_info.config_file_arg); exit(EXIT_FAILURE); } if (ret) cmdline_parser_configfile(args_info.config_file_arg, &args_info, 0, 0, 0); if ((ret = open_mixer()) < 0) { PARA_EMERG_LOG("can not open mixer device %s.", args_info.mixer_device_arg); exit(EXIT_FAILURE); } else close(ret); ret = 0; setlinebuf(stdout); if (!strcmp(args_info.mode_arg, "sleep")) { sweet_dreams(); goto out; } if (!strcmp(args_info.mode_arg, "fade")) { fade(args_info.fade_vol_arg, args_info.fade_time_arg); goto out; } if (!strcmp(args_info.mode_arg, "snooze")) { snooze(); goto out; } ret = -1; out: return ret; }
{ "url": "http://git.tuebingen.mpg.de/?p=paraslash.git;a=blob_plain;f=fade.c;hb=c430e588047c5db3eb0d043c4dd1378680ec2bcf", "source_domain": "git.tuebingen.mpg.de", "snapshot_id": "crawl=CC-MAIN-2020-45", "warc_metadata": { "Content-Length": "7501", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:M74Q3BLDZD6UXFSEDYJAH55QOMRS5BPL", "WARC-Concurrent-To": "<urn:uuid:98bb7938-c2d8-4568-b406-84afadcffd66>", "WARC-Date": "2020-10-30T21:06:24Z", "WARC-IP-Address": "192.124.27.42", "WARC-Identified-Payload-Type": "text/x-csrc", "WARC-Payload-Digest": "sha1:B67XEKBKBG6FIBBDC3JOY3PAYBM6P73R", "WARC-Record-ID": "<urn:uuid:7bb16a36-b25a-4cda-bbe4-2b294f3f46f0>", "WARC-Target-URI": "http://git.tuebingen.mpg.de/?p=paraslash.git;a=blob_plain;f=fade.c;hb=c430e588047c5db3eb0d043c4dd1378680ec2bcf", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:41770278-79e3-43e0-87e1-b87efac5c3b4>" }, "warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-128.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": [ 6647 ] }
{ "red_pajama_v2": { "ccnet_original_length": 6647, "ccnet_original_nlines": 0, "rps_doc_curly_bracket": 0.007522189989686012, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.09691096097230911, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.02241065911948681, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.49485161900520325, "rps_doc_frac_unique_words": 0.403292179107666, "rps_doc_mean_word_length": 6.1152262687683105, "rps_doc_num_sentences": 71, "rps_doc_symbol_to_word_ratio": 0.009085400030016899, "rps_doc_unigram_entropy": 5.154145240783691, "rps_doc_word_count": 729, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.07357559353113174, "rps_doc_frac_chars_dupe_6grams": 0.025123370811343193, "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.015702109783887863, "rps_doc_frac_chars_top_3gram": 0.023553159087896347, "rps_doc_frac_chars_top_4gram": 0.012786000035703182, "rps_doc_books_importance": -811.452392578125, "rps_doc_books_importance_length_correction": -811.452392578125, "rps_doc_openwebtext_importance": -511.34600830078125, "rps_doc_openwebtext_importance_length_correction": -511.34600830078125, "rps_doc_wikipedia_importance": -359.6152038574219, "rps_doc_wikipedia_importance_length_correction": -359.6152038574219 }, "fasttext": { "dclm": 0.8652448058128357, "english": 0.39843589067459106, "fineweb_edu_approx": 2.595524549484253, "eai_general_math": 0.31350743770599365, "eai_open_web_math": 0.3545030355453491, "eai_web_code": 0.06100153923034668 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "621.392", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Engineering", "level_3": "Mechanical engineering and Machinery" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "-1", "label": "Abstain" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "25", "label": "Other/Unclassified" } }, "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" } } }
ece34605c058195ed03b4d393ef1a36c
-2,425,605,197,684,464,600
Back to Africa Check GUIDE: Where was that photo taken? How to locate (almost) any place on Earth In the age of fake news it’s more important than ever to verify the information we receive. Image-altering apps can make this trickier. But sometimes the fakery isn’t in the images themselves, but how they are used. News articles are sometimes illustrated by genuine pictures used out of context. The photo is real, but it doesn’t match the story. Here’s how to check if a picture was taken in the place an article claims it’s from. Free image verification and mapping tools make it possible to locate (almost) any place on Earth.   Step one: Check if the image file has exif data Most modern smartphones store the exif data from an image file. This data can tell you the device used to take the picture, the camera’s shutter speed and lens type, the date and time the picture was taken and, sometimes, even its location in the form of GPS coordinates. To find an image’s exif data, right-click the photo and select either “properties” or “information”. If the GPS coordinates appear, simply type them into Google Maps to find the location. But you often won’t be able to view an image’s exif data. Cameras only save this information when location or GPS services are enabled. Social media such as Facebook and Instagram also automatically strip exif data from images as they are uploaded, for privacy reasons. But there are other ways to check an image’s location.   Step two: Do a reverse image search Your next best bet is a reverse image search. This scans the internet for any earlier versions of the image, letting you trace it to its location and original source or story. Google reverse image search Google’s image search engine can find other websites that have published the image, and possibly its location, too. Google will also find similar photos, which can help you identify famous landmarks and tourist attractions. Here are four ways to do a reverse image search on Google: 1. Upload the image. If you can save the picture to your computer, upload it to the search box by clicking the camera icon, then selecting “upload an image” and “choose file”.   2. Drag and drop. If you use the Chrome browser, click the image you want to search for and, holding the mouse button, drag the image into the search box. 3. Image URL (address). If you can’t save an image to your computer, right-click it and select “copy image address”. You can then paste the URL into the search box. 4. Download the extension. On Chrome and Firefox you can download an image search extension for Google. You then right-click a picture and select “Search image on Google”. A new tab will open with the results.   5.   TinEye reverse image search TinEye is an advanced image search engine. Like Google, it finds other web pages that have used the image, as well as similar images. But TinEye’s filters take image-checking to another level. You can sort its search results to view the oldest, newest and “most changed” versions of a picture. This makes it easy to find out when an image first appeared online, when it was last uploaded, and if it has been manipulated in between. You can often find the location of a picture even if it has been cropped, resized or edited. There are two ways to use TinEye: 1. Upload the image. Save the picture to your computer and upload it to the search box by clicking the arrow icon. 2. Image URL (address). Right click the image and select “copy image address”. You can then paste the URL into the search box. TinEye is great for doing reverse image searches on your mobile phone. But both tools should get you a step closer to checking the location of an image.   Step three: Look for visual clues If you’re still having no luck it’s time to consider visual clues. Does the picture show a distinct building or mountain range? Can you identify a language from a visible billboard or shop sign? Also look out for schools, hospitals, statues and towers. Even vehicle licence plates can reveal the location. Plug these details into Google - for example, by searching for GKB number plate - and see what comes up. Even if you can’t find the exact location, visual clues can help you narrow your search to a region, country or city.     Step four: Map it out You’re pretty sure the photo was taken in a certain country or city. Now you can use mapping tools to find its exact location.   Wikimapia is a community mapping project that collects information about places on the globe. Anyone can contribute to the maps by tagging pictures and adding descriptions, categories and locations. Browsing through these could reveal the location of your image. You can also filter the map using categories. Filters are available for stadiums, hotels, restaurants, hospitals and more. A search for “churches” in Windhoek will return all churches in the city. Click on each result and browse the map to see if the surroundings match your image.     You may find it useful to use more than one mapping tool. Once you’ve found a location in Wikimapia, Google Maps can help to identify structures and terrain. Its satellite imagery lets you zoom in on and rotate different views. Google Street View shows ground level imagery of locations, in all directions. It’s then possible to measure distance and figure out where a picture was taken from.   Tips for geo-locating: • Google is your friend. Sometimes a simple and seemingly obvious search like “gold statue in Mexico” can return the image you are looking for. • Visual clues are important, but don’t investigate too much. You could spend hours sorting through possible locations that a reverse image search could find in seconds. • If you can’t save a picture, screenshot it. Image search engines will still be able to pick it up. • Be aware that images may be flipped to trick search engines. • Also be aware of the foreshortening effect, in which an object can appear closer than it actually is because of the way the picture was angled. • If you suspect a picture may have been taken in a certain location but still can’t verify it, contact someone who may have more information.   •   Add new comment Restricted HTML • Allowed HTML tags: <a href hreflang> <em> <strong> <cite> <blockquote cite> <code> <ul type> <ol start type> <li> <dl> <dt> <dd> <h2 id> <h3 id> <h4 id> <h5 id> <h6 id> • Lines and paragraphs break automatically. • Web page addresses and email addresses turn into links automatically. limit: 600 characters
{ "url": "https://africacheck.org/fact-checks/guides/guide-where-was-photo-taken-how-locate-almost-any-place-earth", "source_domain": "africacheck.org", "snapshot_id": "crawl=CC-MAIN-2021-39", "warc_metadata": { "Content-Length": "63540", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:DHE4GRGYNA25GSD33JXWKS7NPXZCYTBY", "WARC-Concurrent-To": "<urn:uuid:1622be36-3583-4bd9-942a-c48a4806c9ee>", "WARC-Date": "2021-09-26T16:08:48Z", "WARC-IP-Address": "104.26.14.78", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:73AW4SXZRKRW6WDEKN2UP6BB57USZTUM", "WARC-Record-ID": "<urn:uuid:7dec246b-74af-4079-831b-36e1bb31628c>", "WARC-Target-URI": "https://africacheck.org/fact-checks/guides/guide-where-was-photo-taken-how-locate-almost-any-place-earth", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:a2d2ff3c-0164-437d-9fd4-f1e34636b784>" }, "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-204\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 21, 22, 99, 100, 236, 237, 449, 450, 633, 635, 636, 684, 685, 686, 958, 959, 1147, 1148, 1473, 1475, 1476, 1512, 1513, 1514, 1690, 1691, 1719, 1720, 1721, 1945, 1946, 2005, 2006, 2186, 2187, 2344, 2345, 2512, 2513, 2727, 2728, 2735, 2736, 2764, 2765, 2766, 2900, 2901, 3061, 3062, 3293, 3294, 3328, 3329, 3446, 3447, 3576, 3577, 3730, 3732, 3733, 3767, 3768, 3769, 3964, 3965, 4301, 4303, 4304, 4326, 4327, 4328, 4457, 4458, 4721, 4722, 5008, 5009, 5237, 5238, 5405, 5406, 5429, 5430, 5576, 5577, 5749, 5750, 5853, 5854, 5919, 5920, 6068, 6069, 6216, 6217, 6223, 6224, 6240, 6241, 6257, 6258, 6431, 6477, 6551 ], "line_end_idx": [ 21, 22, 99, 100, 236, 237, 449, 450, 633, 635, 636, 684, 685, 686, 958, 959, 1147, 1148, 1473, 1475, 1476, 1512, 1513, 1514, 1690, 1691, 1719, 1720, 1721, 1945, 1946, 2005, 2006, 2186, 2187, 2344, 2345, 2512, 2513, 2727, 2728, 2735, 2736, 2764, 2765, 2766, 2900, 2901, 3061, 3062, 3293, 3294, 3328, 3329, 3446, 3447, 3576, 3577, 3730, 3732, 3733, 3767, 3768, 3769, 3964, 3965, 4301, 4303, 4304, 4326, 4327, 4328, 4457, 4458, 4721, 4722, 5008, 5009, 5237, 5238, 5405, 5406, 5429, 5430, 5576, 5577, 5749, 5750, 5853, 5854, 5919, 5920, 6068, 6069, 6216, 6217, 6223, 6224, 6240, 6241, 6257, 6258, 6431, 6477, 6551, 6572 ] }
{ "red_pajama_v2": { "ccnet_original_length": 6572, "ccnet_original_nlines": 105, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.39257100224494934, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.009468319825828075, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.1718863844871521, "rps_doc_frac_unique_words": 0.3895297348499298, "rps_doc_mean_word_length": 4.566991806030273, "rps_doc_num_sentences": 84, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.416643142700195, "rps_doc_word_count": 1127, "rps_doc_frac_chars_dupe_10grams": 0.024868860840797424, "rps_doc_frac_chars_dupe_5grams": 0.06877793371677399, "rps_doc_frac_chars_dupe_6grams": 0.0606178417801857, "rps_doc_frac_chars_dupe_7grams": 0.04973771050572395, "rps_doc_frac_chars_dupe_8grams": 0.03846900910139084, "rps_doc_frac_chars_dupe_9grams": 0.03846900910139084, "rps_doc_frac_chars_top_2gram": 0.015543029643595219, "rps_doc_frac_chars_top_3gram": 0.020983099937438965, "rps_doc_frac_chars_top_4gram": 0.014765880070626736, "rps_doc_books_importance": -663.86865234375, "rps_doc_books_importance_length_correction": -663.86865234375, "rps_doc_openwebtext_importance": -374.9913024902344, "rps_doc_openwebtext_importance_length_correction": -374.9913024902344, "rps_doc_wikipedia_importance": -302.3556213378906, "rps_doc_wikipedia_importance_length_correction": -302.3556213378906 }, "fasttext": { "dclm": 0.020122170448303223, "english": 0.8959214687347412, "fineweb_edu_approx": 2.8480305671691895, "eai_general_math": 0.007491409778594971, "eai_open_web_math": 0.1274852156639099, "eai_web_code": 0.0036569801159203053 } }
{ "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": "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": "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": "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" } } }
ece34605c058195ed03b4d393ef1a36c
5,508,541,381,209,539,000
Porting a simple Silverlight game loop to Windows 8 Metro style The other evening I went on the hunt for a XAML/C#-based example of a game loop. I ran into a couple of OLD blog posts by Mike Snow. Naturally it caught my eye, simply because of his last name. In his posts he described game loop based on Silverlight 2. OK. Silverlight uses XAML, and the code was C#. XAML/C# are first-class citizens in the Windows 8 Metro style app world, so I figured, why not see what it takes to make this work on Windows 8? The posts I used as reference: The first post contains the code for the majority of the application – the XAML and the C# code. In second post Mike switches the game loop to use CompositionTarget.Rendering instead of DispatcherTimer or the Storyboard timer. Are they still around in the Metro XAML world? To find out, I open Visual Studio and took a look in the Object Browser. Guess what I found. Yep. DispatcherTimer, Storyboard, and CompositionTarget are all alive and well in the Windows.UI.XAML namespaces. So I figured, why not give it a try? It turned out that most of the “work” was simple copy & paste. I had to change the using statements to point to the Windows.UI.Xaml namespaces for the controls. Had to change the signature for a couple of the event handlers. And a few other minor things. Here are the steps I took to make the port. MainPage.xaml 1. Create a new C# Metro style BlankApplication called Win8Snowflakes. 2. Delete BlankPage.xaml then added a new UserControl named MainPage.xaml. (Yes, we’re adding a UserControland naming it a page.) 3. Replace the contents of MainPage.xaml with the XAML for the UserControl Snowflakes.Page(from the blog post “making it snow”). Then . . . 1. Replace All UserControl with Page 2. Change x:Class=”Snowflakes.Page” to x:Class=“Win8Snowflakes.MainPage”to match the name of the app & page. 3. Remove the full screen Button. Just delete that entire tag. We won’t worry about going full screen. MainPage.xaml.cs 1. Replace the contents of MainPage.xaml.cs with the C# code sample for public partial class Page : UserControl(from the blog post “making it snow”). Then. . . 1. In the using statements you’ll see some red squigglies. To get rid of them, change Controls, Documents, Media, Media.Animation, Input, and Shapes to reference Windows.UI.Xaml instead of System.Windows 2. Add the following using statement: using Windows.UI.Xaml.Controls.Primitives; 3. Change namespace Snowflakes to namespace Win8Snowflakes 4. Change Page : UserControl to MainPage : Page 5. The method prototypes for the event handlers for Slider_ValueChanged and Wind_ValueChanged need to be changed. You need to replace RoutedPropertyChangedEventArgs<double> with RangeBaseValueChangedEventArgs, such as from this: 1. Wind_ValueChanged(object sender, RoutedPropertyChangedEventArgs<double> e) to this: private void Wind_ValueChanged(object sender, RangeBaseValueChangedEventArgs e) 6. Remove the Button_Clickmethod. (We’re not going to deal with changing the window size for now.) 7. In the MainPage()constructor, we need to change the way the event handler is defined and the signature for the event handler. 1. To wire up the event handler, _snowflakeTimer.Completed +=_snowflakeTimer_Completed; 2. And the new signature for the event handler: void _snowflakeTimer_Completed(object sender, object e) Snowflake.xaml 1. Add a new UserControl to your project and name it Snowflake.xaml 2. Replace the contents of Snowflake.xaml with the XAML for the Snowflakes.Snowflake (from the blog post “making it snow”). Then . . . 1. Change x:Class=”Snowflakes.SnowFlake” to x:Class=”Win8Snowflakes.SnowFlake” Snowflake.xaml.cs 1. Replace the contents of Snowflake.xaml.cs with the C# code sample for public partial class Snowflake : UserControl (from the blog post “making it snow”). Then. . . 1. Change the using statements just as we did in MainPage.xaml.cs to reference the Windows.UI.Xaml namespaces for Controls, Documents, Media, Media.Animation, Input, and Shapes 2. Change namespace Snowflakes to namespace Win8Snowflakes App.xaml.cs 1. In the OnLaunched() method, change rootFrame.Navigate(typeof(BlankPage)); to rootFrame.Navigate(typeof(MainPage)); Images 1. Download the zip file containing the two image files (one is for the background and the other for the snowflake) from Mike’s download link. 2. Unzip the files and copy them to your project’s folder. 1. Right click on the project and Add Existing Item, and select the two files, to add them to the project itself. image Time to run the app. You should see this image The running app.Congratulations. One more change It’s very easy to change the game loop to use the CompositionTarget.Rendering event instead of a Storyboard. 1. In the MainPage() constructor for MainPage.xaml.cs 1. Remove the following 3 lines:_snowflakeTimer.Duration = TimeSpan.FromMilliseconds(10); _snowflakeTimer.Completed +=_snowflakeTimer_Completed; _snowflakeTimer.Begin(); 2. And replace them with this one line: CompositionTarget.Rendering += CompositionTarget_Rendering; 3. Change the signature for the event handler method itself 1. from void _snowflakeTimer_Completed(object sender, object e) 2. to void CompositionTarget_Rendering(object sender, object e) And that’s it. As you’ve probably heard over and over again, if you’re a Silverlight developer you have the skills to be a Windows 8 Metro style developer. A great resource for developing Metro style apps on Windows 8 is http://dev.windows.com. Happy Windows 8 developing! –bliz (@snowstormlife) Comments (6) 1. Jason says: Thanks to Mr. Blizzard and Mr. Snow on this one! I had been asking around for suggestions on converting my XNA/Silverlight games using XNA Dispatchtimer for the game loop and everybody kept staring at me blankly saying HTML5. Well here it is, thanks again. So cold in here! 🙂 2. Hi Jason, glad you found the info helpful. — bliz 3. Jan says: Very glad to have found this ahead of the Windows 8 Hackathon in Berlin 🙂 4. @Jan – I hope it helps. Have fun at the hackathon!  (By the way, I haven't taken a look yet to see if there were any breaking changes for this app using Windows 8 Release Preview and VS 2012 Release Candidate. That's on my to-do list. The code in the blog post was using the Windows 8 Consumer Preview release and VS11 BETA.) 5. ian says: Hi.  I just wanted to point out that the links you have in your article no longer point to pages/files that you had intended. Thanks for the great article though. 6. Alex Schearer says: While using CompositionTarget.Rendering works I think it's not a great option. It ties your updates to framerate which is not suitable for many types of games. You also have no idea how much time passed between frames which again is a problem for certain games. I have detailed two alternatives (as well as this option) on my blog: http://www.spottedzebrasoftware.com/…/windows-8-game-loop.html In a nutshell I would recommend developers interested in making a game for Windows 8 to either:  1. Use MonoGame and effectively XNA, or  2. Use MonoGame's GameTimer Hope this helps!
{ "url": "https://blogs.msdn.microsoft.com/jimblizzard/2012/05/21/porting-a-simple-silverlight-game-loop-to-windows-8-metro-style/", "source_domain": "blogs.msdn.microsoft.com", "snapshot_id": "crawl=CC-MAIN-2016-30", "warc_metadata": { "Content-Length": "52974", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:BK6OGRMHC2PHCDELLP36WN5KN6PV4BYX", "WARC-Concurrent-To": "<urn:uuid:aaf02921-3987-436a-9075-6e4ab0ef4831>", "WARC-Date": "2016-07-27T19:14:50Z", "WARC-IP-Address": "104.90.99.136", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:4IMWCBPBRWJIVBIWXOODUJL7YYMFOVQ6", "WARC-Record-ID": "<urn:uuid:8bd5e752-132f-486a-91db-b1a1e6888517>", "WARC-Target-URI": "https://blogs.msdn.microsoft.com/jimblizzard/2012/05/21/porting-a-simple-silverlight-game-loop-to-windows-8-metro-style/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:c6f482e9-2895-4524-8a96-2aee85f9c8ce>" }, "warc_info": "robots: classic\r\nhostname: ip-10-185-27-174.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-30\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for July 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }
{ "line_start_idx": [ 0, 64, 65, 66, 260, 261, 514, 515, 546, 547, 821, 822, 915, 916, 1030, 1031, 1068, 1069, 1324, 1325, 1369, 1370, 1384, 1385, 1458, 1590, 1732, 1773, 1886, 1993, 1994, 2011, 2012, 2174, 2382, 2467, 2530, 2582, 2815, 2988, 3091, 3224, 3318, 3428, 3429, 3444, 3445, 3515, 3652, 3735, 3736, 3754, 3755, 3924, 4105, 4168, 4169, 4181, 4182, 4302, 4303, 4310, 4311, 4456, 4517, 4635, 4647, 4648, 4689, 4690, 4696, 4729, 4730, 4746, 4747, 4856, 4857, 4913, 5087, 5191, 5255, 5325, 5395, 5396, 5411, 5412, 5553, 5554, 5643, 5644, 5672, 5673, 5696, 5697, 5710, 5711, 5728, 5729, 5990, 5991, 6014, 6015, 6070, 6071, 6086, 6087, 6165, 6166, 6497, 6498, 6513, 6514, 6644, 6645, 6686, 6687, 6712, 6713, 7049, 7050, 7117, 7118, 7218, 7219, 7264, 7265, 7298, 7299 ], "line_end_idx": [ 64, 65, 66, 260, 261, 514, 515, 546, 547, 821, 822, 915, 916, 1030, 1031, 1068, 1069, 1324, 1325, 1369, 1370, 1384, 1385, 1458, 1590, 1732, 1773, 1886, 1993, 1994, 2011, 2012, 2174, 2382, 2467, 2530, 2582, 2815, 2988, 3091, 3224, 3318, 3428, 3429, 3444, 3445, 3515, 3652, 3735, 3736, 3754, 3755, 3924, 4105, 4168, 4169, 4181, 4182, 4302, 4303, 4310, 4311, 4456, 4517, 4635, 4647, 4648, 4689, 4690, 4696, 4729, 4730, 4746, 4747, 4856, 4857, 4913, 5087, 5191, 5255, 5325, 5395, 5396, 5411, 5412, 5553, 5554, 5643, 5644, 5672, 5673, 5696, 5697, 5710, 5711, 5728, 5729, 5990, 5991, 6014, 6015, 6070, 6071, 6086, 6087, 6165, 6166, 6497, 6498, 6513, 6514, 6644, 6645, 6686, 6687, 6712, 6713, 7049, 7050, 7117, 7118, 7218, 7219, 7264, 7265, 7298, 7299, 7319 ] }
{ "red_pajama_v2": { "ccnet_original_length": 7319, "ccnet_original_nlines": 127, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.31803280115127563, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.030163930729031563, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.25901639461517334, "rps_doc_frac_unique_words": 0.37372803688049316, "rps_doc_mean_word_length": 5.204440116882324, "rps_doc_num_sentences": 169, "rps_doc_symbol_to_word_ratio": 0.00524589978158474, "rps_doc_unigram_entropy": 5.332683563232422, "rps_doc_word_count": 1081, "rps_doc_frac_chars_dupe_10grams": 0.01421969011425972, "rps_doc_frac_chars_dupe_5grams": 0.13099892437458038, "rps_doc_frac_chars_dupe_6grams": 0.08496267348527908, "rps_doc_frac_chars_dupe_7grams": 0.05652327835559845, "rps_doc_frac_chars_dupe_8grams": 0.03874867036938667, "rps_doc_frac_chars_dupe_9grams": 0.02808389998972416, "rps_doc_frac_chars_top_2gram": 0.012797719798982143, "rps_doc_frac_chars_top_3gram": 0.009776039980351925, "rps_doc_frac_chars_top_4gram": 0.01421969011425972, "rps_doc_books_importance": -748.6173095703125, "rps_doc_books_importance_length_correction": -748.6173095703125, "rps_doc_openwebtext_importance": -429.8859558105469, "rps_doc_openwebtext_importance_length_correction": -429.8859558105469, "rps_doc_wikipedia_importance": -338.9984130859375, "rps_doc_wikipedia_importance_length_correction": -338.9984130859375 }, "fasttext": { "dclm": 0.08041142672300339, "english": 0.841941237449646, "fineweb_edu_approx": 1.1956926584243774, "eai_general_math": 0.4265899062156677, "eai_open_web_math": 0.18160247802734375, "eai_web_code": 0.017532529309391975 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.4", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
-1,662,654,172,035,899,100
My Best Teaching Is One-on-One 一対一が僕のベスト Of course, I team teach and do special lessons, etc. 当然、先生方と共同レッスンも、特別レッスンの指導もします。 But my best work in the classroom is after the lesson is over -- going one-on-one, helping individual students with their assignments. しかし、僕の一番意味あると思っている仕事は、講義が終わってから、 一対一と 個人的にその課題の勉強を応援することです。 It's kind of like with computer programs, walking the client through hands-on. The job isn't really done until the customer is using the program. まあ、コンピュータプログラムにすると、得意先の方に出来上がった製品を体験させるようなことと思います。 役に立たない製品はまだ製品になっていないと同様です。 Monday, May 22, 2017 journal 20170522 So I think I'll start posting parts of my work journal. 作業日記の一部を公開しようと思うようになりました。 I'm still spinning my wheels. まだ無駄作業ばかりです。 My last contract ended in March. 最後の契約が3月に終わったのです。 In complete rejection of logic and reason, I have not been burning myself out to find a new job. 完全に理と役から離れて、就職活動に無駄な力を尽くしていません。 I have a series of novels I want to write. 書いて公開したい連続小説があります。 Nobody but my oldest sister is reading them. 一番上の姉以外はだれも読んでくれていません。 After the contract ended, I've been stuck on a little side-tour. 契約が終わってから、寄り道に詰まっています。 I needed to calculate the calendar of the world where the first several stories take place. 小説の最初の話の舞台となる惑星の暦を計算しないと進めないものがあります。 Then I got really interested in the puzzle of adding double integer divide to the base wordset of the programming language Forth. プログラミング言語フォース(「先へ」)の基本単語集に、倍範囲幅変数型の割り算計算機能を付け加えることの謎謎に夢中になってしまいました。 Last week, I pretty much proved to myself that there are no easy, fast, deterministic methods for division, the way there are with multiplication. 掛け算にあるような、簡単で早い決定経路型手順は割り算に無いことに、だいたい納得できるまであちこちを探って、自分なりに証明しました。 Not a mathematical proof, just finding a difficult problem that no one else seems to have solved. 正確に証明したのではありません。ただ、南海の問題にぶつかって、その問題を解決した人の情報がどうしても出てこないのです。 We humans intuitively use estimates when we divide large numbers. 我々人間は、大きい数字の割り算に手を付けると、無意識に推測して、概算の手順を使います。 We have the multiplication tables memorized, and we use those tables in division. 既に暗記済みの掛け算表を参考に、割り算を行います。 When doing this in computers, those tables can become larger than the entire memory of the old 8-bit processors. コンピュータに割り算を実装すると、その掛け算表が一昔の8ビット中央計算装置の全記憶装置量を超えるほどの量になることがあります。 The Forth that needs the double length divide is an 8-bit CPU implementation. この倍範囲幅割り算を必要としているフォース言語は8ビットCPUに実装したものです。 Fortunately, the size of the table depends on the numeric base you operate in. 幸いに、その概算表の量は数値表現の進法に決まっているものです。 The table for one digit of decimal math is not really big, only 100 elements: 十進法の一桁の場合は表が大きくありません。百個の要素だけです。つまり、 ×0123456789 00000000000 10123456789 2024681012141618 30369121518212427 404812162024283236 5051015202530354045 6061218243036424854 7071421283542495663 8081624324048566472 9091827364554637281 But we are not talking about one digit of decimal math. ただ、十進法の一桁の話ではないのです。 The smallest table we can do without using bit shifts is a table for one column of base 256 math. ビットシフト演算なしで一番小さい表はなんと 256 進法の一桁の表です。 That means a table 256 wide and 256 deep. That's 65,536 16-bit integers. つまり、 256 桁の 256 行の表です。 65,536個の 16 ビットの整数です。 I'm not going to reproduce that here, because I'm pretty sure it would give your browser fits, not to mention what it might do to blogspot's template engine. ここで再現しようとありがたく思われないので、止めておきます。閲覧者のウェブプラウザには全く優しくないどころか、ブログスポットのテンプレートエンジンの結構ひどい扱いにもなります。 (Blogspot might accuse me of trying to DOS them, and you might accuse my of DOSsing you.) (あなたにも、ブログスポットにも、攻撃と思われるかも知れません。) Now the problem is the shifts. Left shifts are just doubling, so they are pretty cheap. It's just an addition. ビットシフト演算が問題です。左シフトは倍の計算ですので、特に問題になりません。足し算だけです。 Unless you have actual bit shifts, shifting to the right is expensive, requiring a division. ビットシフト演算がなければ、右にシフトするのは割り算の重たい計算がかかります。 It's a relatively cheap single-wide division, so it's not a chicken-and-egg problem, but even single-wide divisions take a long time on old microprocessors. 単幅の比較的に重たくない割り算ですので、鶏と卵のような問題ではありません。と言っても、古いマイクロプロセッサーには結構の暇が掛かります。 Addition on old microprocessors takes maybe ten microseconds. Division takes easily 200 times that. 古いマイクロプロセッサでは、足し算は凡そ十ナノ秒(一秒の十万分の一)しか掛かりません。割り算は辛うじてその200倍がかかります。 It's possible to use scaling to reduce the amount of math required without the tables, but scaling requires shifting as well. 表無しでよろうと思えば、スケーリングという尺度合わせのような手もあります。但し、これにもビット演算が必要です。 Binary division is different. This is all there is to the table: 二進法の割り算は違います。これだけの表です。 ×01 000 101 And binary division is just shifting, subtracting, and counting. そして、二進法の割り算はただシフト演算と引き算と回数の一をとることで済ませる。 It's slow, but it's straightforward. ゆっくりと出来上がりますが単純な決定経路型手順です。 So, if I have to use shifts anyway, I may as well go down to the machine level and implement the division in assembler anyway. なるほど、シフトをもって実装するしかないなら、もう、低レベルアセンブリ言語で割り算そのものを実装するほうが懸命ではありませんか? This is not the way a sane person spends his time when he needs to be finding a new job, you know. 新しい仕事を探しているはずの正気の人がやるようの人生の過ごし方ではありません。ね。 Last Sunday, I went to the special stake conference in Kõbe and listened to Elder Oaks and other Church leaders. 先の日曜日は、特別ステーク大会のために神戸に行って、オークス長老と他の教会指導者の話を聞きました。 I'm feeling much less down. ちょっと立ち直りました。 Monday, May 15, 2017 Do Not Pay the Modern Danegeld! -- Ransomware Yesterday, I read in the paper how ransomware has been spreading. It would be easy to waste electrons castigating Microsoft for leading the establishment of impossible-to-secure software as industry standards. (The words "unsafe at any speed" make me wonder why Nader has been mostly silent about the current computer industry.) It is true that software, including operating systems, is not exempt from the mathematical principle that absolute security is an internally inconsistent concept. But the habit of the industry has been to rely on lack of education rather than actual prevention. This combined with excessive competition for the market has led to unsafe practices built on unsafe features built on unsafe practices. We all know that our information devices are unsafe -- impossible to secure. (Or, if you do not, you have been deliberately closing you eyes. Perhaps you think there is nothing to do about it.) So, now someone you know is looking at a message on his or her screen: Pay up or lose your precious data! You seriously can't be thinking $300 is cheaper than losing my mail archives and address book! Let me put the real costs in front of you: Every dollar you give in ransom is the price of one bomb or landmine, small enough to hide, large enough to kill and maim humans and animals, large enough to destroy or disable cars, trucks, roads, communication lines, etc. Every bitcoin paid in ransom is 1,700 such bombs. And if you pay it now, you will be faced with paying it again. What should we do? Step back, take a deep breath, let common sense flood back into your brain. • Do you have backups? If not, now is the time to start planning. • Can you reconstruct the data? Re-constructing the data may take time, but if you can't reconstruct your data, it was never yous in the first place. ("Big Data" is a comfortable illusion with some substantial features, but you really should be honest with yourself about that. Money doesn't really grow on data trees, whether binary, b-star or otherwise.) • Okay, you have partial backups -- USBs, dropboxes, cloud services, etc.  • And you can reconstruct the most important data, if you are willing to take the time.  So, no, the data that has been locked away from you is not worth continuing to arm the enemy. • First step, shut that computer off.  If you have reason to believe that the ransomware will try to delete data on shutdown or some such stupidity, pull the plug and the batteries. Your local geek may be worried about data loss on shutdown, but the converse is also a problem. Hiding is easy, but encryption takes time. Remove all hard disks, SDs, and USB storage devices that were attached when the malware showed up, and collect all external storage that has been attached to the infected device in the past week, at least. Learn something about security. Do not depend on books with names like "Security for Dummies." Dummies are soon chumps, and that's how you got in this mess. Yes, I should write a book. Somebody front me the money. Oh, well, that's not happening very soon. Two of my blogs, free is not free, and defining computers have some useful information, but some of it is old, and both mix rants, daydreams, and parable with practical advice. So use your own brain. Here's a start: 1. Think about what secrets are.  2. Think about what computer data is. 3. Think about walls and locks 4. Think about protocol. Think about what the limits of the above are without computers. Then convince yourself that computers are not magic. Fast and re-writable, but not magic. I'll list a few really relevant rants: Back to practical steps: • Re-flash the BIOS of the infected device.  If you don't do that, you're likely to get re-infected. BIOS attacks are becoming commonplace, and the ransomware attacks are at that level. (And, yes, there are indeed huge problems in the new BIOSses. Reflash or buy new, but buying new is a problem, too.) • Install new boot and other internal media (new hard disk or SD for boot and data) and install a new, safer OS. I'd recommend a Linux OS such as Debian, Ubuntu, or Red Hat Linux, but, really, the marketplace has been infecting those with unsafe applications, practices, and features for the last fifteen years. Eventually, I want to recommend installing a Linux or BSD OS and installing MSWindows in a VM on top of that, but that is not yet ready for prime time, and Microsoft and Intel seem to think they have financial incentives in working behind the scenes to make that not happen. If you have to use a Microsoft OS, just don't keep important data on it, especially not without backup. • Make a plan about where to store your data. As much as it galls me to say so, yes, I'm suggesting NAS and cloud if you have any really valuable data. At bare minimum, keep copies on USB drives that you properly unmount before removing. (Click the "remove" button and wait until the OS says it's okay.) And do not keep the USB drive inserted in the computer while you work. Do not keep any valuable data on your workstation. (I say, but I can't afford to do otherwise right now. I'll have to take my own advice and collect my data onto an external device, as soon as I get some résumés sent out. But I'm using an OS I'm fairly confident I can still trust.) • Take a little time to review what you think you know about computers on a regular basis. Learn an alternative OS. And • Take time to understand your data, what you have, and what it's worth. Now that we have that out of the way, now is the time to think about recovering that locked-up data. • First, mount the media device (hard disk, SD, USB) on a known-safe machine.  • Then look around and see what was actually encrypted and what was just moved somewhere. • Then go look for tools for un-erasing data. The attackers may not have encrypted the partitions, and probably has not tried to find deleted files to encrypt. So you will likely be able to recover up until the last save, even if the encryption really is unbreakable. • Finally, if you still have data that is highly valuable and not recovered, now you know how much you will be willing to pay a legitimate professional to try to get it back by brute-forcing the encryption keys. That last list is the one you wanted me to tell you first. But that would not be helping you to be secure the next time, and the next time is already waiting for you. Thursday, May 11, 2017 Visions and Pioneering and Responsibility to Family I was talking with some members of the Forth community on comp.lang.forth about using floating point numbers in a Forth language, and thinking about how I really don't much care for floating point math in programming languages. Arbitrary precision is much more what most people want. It's a little slower than floating point, but it has fewer surprises. (There are still some surprises induced by the fact that computers do not easily extend precision, where we on the other hand are quite happy to grab another piece of paper and keep going until our wrists get sore or we fall asleep -- or get bored.) Fixed precision is much faster and much lighter on computer resources. With 64 bit math on modern computers, we can easily do math to 18 decimal places. That would cover most peoples yearly budgets, easily. But, for all that fixed precision would cover most daily calculation needs, it requires us to keep track of precision ourselves. That's why arbitrary precision and floating point are useful. Floating point would be a bit easier if it weren't for all the bit fields that have to be extracted from memory that don't fall on easily addressed boundaries. Then I had this idea about having the exponent be in one integer and the fractional part be in another. That would give ridiculous range for 16-bit CPUs (like 10 followed by more than 16,000 zeros). The fraction part would give us one part in 65536, or a bit more than four digits on the right of the decimal point, which isn't enough for some things, but is plenty for others. On 32 bit CPUs, the range would be even more ridiculous, but we would have about nine digits on the right of the decimal. Which is why floating point fields don't fall on even boundaries. On 64 bit CPUs, the range would be beyond ridiculous. Billions of zeros. But the fractional part would be more than 18 digits, which is pretty decent. The discussion on comp.lang.forth focused on the problem of knowing just how wide a floating point number on the top of the stack of recently used numbers is. When working on the stack, you need to know the size of the numbers that are on the stack so you can get them off the stack and get around them to other numbers, and so forth. It occurred to me that a floating point number that could tell the programmer how wide it is would be rather useful. And this first-blush byte format came to mind, just before I went to bed: 8888 8888 length = 0 (8 bits) exponent (24 bits)fraction (32 bits) And, in fact, it kept me up a bit, re-thinking things: 8888 8888 sign (high bit), length = 0 (7 bits) exponent (24 bits) fraction (32 bits) And then it was 8888 8888 sign (high bit), length = 0 (7 bits) exponent (8 bits) fraction (16 bits) ------ sign (high bit), length = 1 (7 bits) exponent (24 bits) fraction (32 bits) Where length of 0 would be a special case, with the whole floating point number contained in a single 4 byte (32 bit) unit. From length 1 on, the length would be the count of 32 bit units containing the fractional part (or mantissa, I have to figure out details later), and the three bytes after the length byte would be the exponent. Checking the IEEE floating point specs on Wikipedia, none of the most common formats have more than 15 bits of exponent. The standard 32-bit format has only 7 bits of exponent, and the standard 64-bit format has only 11 bits of exponent. So 24 bits of exponent is plenty. Maybe I can scrape the top two bits of the exponent off for flags of some sort. 22 bits of exponent still gives an exponent range of 10 followed by two million zeros. Speaking of zeros, being able to specify up to 127 times 32 bits of mantissa means ( 127 × 4 == 508 bytes, or 1016 nibbles) better than 1100 decimal digits worth of accuracy in decimal terms. That's going to be enough to satisfy most mathematical needs for primary grades through college, except for certain engineering purposes. Mathematically, it's a loose fit, but, with everything falling on nice byte boundaries, it's going to be a lot less work up front. A similar approach could be used for decimal or other base digits, which is something to think about later. It will be a little slow, since it will be implemented in software, but you can extend the numbers, mid calculation, to avoid losing precision. And, randomly associating, a similar approach could be taken with text strings, if we had a better way of representing numbers in the middle of text (a topic which I really want to rant on sometime). You can probably get a sense of what this has to do with pioneering (ergo, new or less-explored computer/data techniques), but what does this have to do with visions and responsibility to families? I really should not be typing this. I really should be running around like a chicken with its head cut off trying to scrounge up work for when my savings runs out in another month. I am being irresponsible. I woke up this morning at three thirty, still thinking about this stuff. And I was thinking about Nephi, in the Book of Mormon, 1 Nephi 17: 9, asking God where to go to get ore to make tools to build the ship with. Now we have to understand the story. Nephi had been helping his father get their families moved across the desert towards the sea. He had done his part in making sure that the women and children had enough to eat. They had found a nice place on the sea shore to settle down and maybe be safe from the Babylonians and others whom the prophets had been foretelling would be coming to take Jerusalem down for real this time. Now, he was getting inspired to take the whole group on a long adventure into the unknown, across the sea to a land he and his father had seen in dreams. His older brothers were upset, and we can understand why. I am being inspired to take my family on a long adventure into uncharted territory with my writings and other dreams, visions, fantasies, and delusions such as the above. My family is understandably upset. (Delusions. Ask pretty much anyone, and they will tell you that someone like me should not working with all the wonderful technology that is out there for the using. We have floating point. We have arbitrary precision math. We have the Unicode character set. We have programming languages and CPUs. What need have we of more of these? (Other than that it is a deliberate mess, designed to keep the riff-raff like you and me from using it to make the world a better place.) Well, Nephi asked God where he should go to get ore for tools. I have been asking God where I should go to get funding. There is a bit of difference. Nephi had done his part in securing food and a place for his family. My family and I are on the brink. He was looking for ore for tools. I am looking for money for a place, for food, and for tools. This is scary business. Visions, pioneering, and responsibility to family. Tuesday, April 18, 2017 Why Tarō Can't Communicate -- 太郎は人の話が通じないのは何だ! (Test Question -- 試験問題) Choose the correct answer: 正しい回答を選びなさい: (1) What is your job?   A: My job is an English teacher.   B: I teach English. You've seen this in the newspaper ads: 新聞広告で見たことがあるかもしらない: × A: My job is an English teacher. ○ B: I teach English. But this is wrong. 間違いです。 Here's the real answer: 正解は以下の通りです。 △ A: My job is an English teacher. ○ B: I teach English. Here's an even better answer set: もっと適切な回答があります: △ A: My job is an English teacher. ○ B: I teach English. ○ C: I am an English teacher. ○ D: My job is teaching English. △ E: My job is to work as an English teacher. ○ F: I work as an English teacher. It is true that A is not the best phrasing for the assumed intent. 確かに A は推測の意味にしては、最適な言葉並びではありません。 It is also true that E is way too wordy. E は正に言葉が多すぎます。 But they are not without meaning. しかし、意味がないとはいえませんし、 and the assumed intent is within the range of possible interpretations. その推測の意味は可能な解釈の範囲の内に入ります。 The best interpretation of  My job is an English teacher. would be something like My job is something that teaches English. and this is not incompatible with the assumed meaning. では、  My job is an English teacher. の最適な解釈は 私の仕事は英語を教える物です。 と言えば、想定の意味に反論しません。 There is a problem of semantics. 意味について議論はできます。 A job is a thing and an English teacher is a person. 仕事は物です。英語先生は人です。 So it makes a person seem to be a thing. この文によって、人がモノにされようとします。 So it would not be the preferred expression. 推薦する表現になりません。 Not totally wrong, but not preferred. 完全に間違ってはないけど、推薦される表現ではありません。 But you can't explain this when you are focused on preparing students for the test. There's no time. テスト中心勉強しているとこんなのを説明することはできません。そんな暇ありません。 And this is the problem. ここでは原因が診えます。 Too much of current curriculum is focused on tests. 現在の教科過程は試験集中しすぎています。 Tests cannot test everything like this. Therefore, they cannot teach everything like this. 試験はこういうところを綺麗に探ることができません。したがって、こういうところを充分に明かすこともできません。 Students need time to read things that there will never be time to test. 生徒らは考査するための余間がどうしてもできないほどの、たっぷりな読書が必要です。読書するほどの時間が必要です。 And they need time for discussion, time to talk about the things they have learned. そして、談話の時間が必要です。学んだことを話し会う時間を必要しています。 If there's too much test prep homework, there's no time to learn. 試験向きの宿題が多すぎると学ぶ余地がありません。 That's why Tarō can't communicate. これが太郎くんの話し会いができないわけです。人の話が通じないわけです。 More on this subject here: またここでこの話をとりあげています http://reiisi.blogspot.com/2016/09/grammar-rules-in-japan.html. Friday, April 7, 2017 The Danger of Charity I have been seeing bits and pieces of this news about rejecting homeless shelters, and I am feeling no small shame and anger at my fellow Utahns. Community after community is rejecting the building of shelters and other facilities for those who are less fortunate than themselves. If it were rejecting homeless shelters in order to use the money for providing more people with meaningful work where they can earn enough to pay the rent and feed their families, I could maybe see that. But I don't think that's what's happening. Dawn Armstrong posted a gentle plea to people everywhere (and especially in Utah) to quit trying to keep the homeless people at a safe distance. I know that's an awkward way to interpret things, but it's what you are saying when you say you don't want a homeless shelter in your neighborhood: Keep them at safe distance! Is homelessness a disease? Are they somehow tainted by their association with the road? Or is it that they must have done something terribly wrong to warrant losing their homes, and you, heaven forbid, should not have to associate with people like that? Maybe you think of the Brian David Mitchells out there. Somebody posted such a comment on Dawn's blog. I think, maybe, I overreacted in my comment on that post. Dawn was much kinder. Maybe I'm overreacting still, posting this in my blog. But, statistically speaking, your family is no safer with, say, your business associates, neighbors, friends, relatives. Most abuse is perpetrated by people who are known by the victim. I think that's why Jesus finds no moral quandary in teaching us to be good Samaritans. Avoiding the good deed makes us no safer. (If I had time, I'd work out a lengthy discussion of why charitable behavior ultimately makes the world safer for both your children and you, but it's two in the morning here.) Would I be playing too rough if I questioned whether you were more concerned about your property value than with your family's safety? They. The homeless. Dawn is not the only one for whom the "they" means "we". If you'll stop for a moment's sober reflection, you'll remember that the only thing that stands between you and them is a little luck. If you can stand to admit your dependence on deity, there, but for the grace of God, go we. The disease which is destroying our modern world, the source of the violence that expresses itself in terrorism and the conundrum of religious warfare is precisely the us vs. them approach to economics, and to life in general. Them is us. They are we. [JMR201704071335 added:] I know it's easy to be scared. But if they are not safe, neither are we. Nor ours. [JMR201704071335 end-added.] Tuesday, March 14, 2017 "We Only Contact Applicants Who ...." I don't like to sell myself. Somehow, I think the work I do is more important than who I am. That doesn't make sense, of course, because the work that I do is who I am, or, at least, is the expression of who I am. What do Steve Jobs, Bill Gates, and Donald Trump have in common with Willy Loman? What does success really mean? Why should people sell success or buy it? Anyway, teaching English in Japan is not a job for people who don't like to sell themselves. Sure, you can (contrary to my earlier understanding) get certified. But then you are stuck with a different job, one which is mostly neither teaching nor English. (In some senses, it could be called glorified babysitting, but that's too many distractions in one rant.) If you don't get certified, you end up having to renew your contract every year, because Japanese laws don't allow the company to keep renewing a temporary contract. After three years, they have to take you full time or tell you to move on. That's not exactly what the law is supposed to say, but that's the effect. My interpretation is that that law essentially attempts to protect the jobs of the people who do meet the "qualifications" and get hired as full-time, permanent employees. And I personally think that the correct solution is to kick the illusion of security to the curb and get rid of the permanent employee status. Any company can fold, and, when it does, everyone finds out their job was just temporary. Anyway, I spent all of last Friday working up an on-line résumé on a job search site called Gaijinpot that specializes in foreigners who want to work in Japan. This morning, I realized I had let the nicely done (if slow) interface lull me into regurgitating my work history, which is not what I wanted the companies I applied to last Friday to see. It does not tell them that I am focused on teaching. Okay, I'm not focused on teaching. I'm focused on writing a novel, now. And having to look for work is a serious distraction. (This is the common complaint of artists everywhere, but, again, that's too many distractions for one rant. And the distraction is not actually a bad thing unless I let it be a bad thing. Distractions actually help creativity. Even though they push the finished product further off into the future, they help refine the product.) I need to make a copy of my résumé for backup and clean it up, refine the focus, sell my accomplishments. (I have a focused résumé online, uhm, that is, relatively speaking, focused. For me, it's focused. :-/) Well, I realized something else this morning, something that moved me to rant mode: All three companies said they would only contact those applicants whose résumés passed their initial screening process. That means I have no way of knowing that they even got my résumé. For all I know, Gaijinpot's server may have gone temporarily off-line, and that error message I got about the server timing out may really mean that my résumé was never sent. Without some sort of confirmation that the submitted résumé actually made it to the company I intended to submit it to, I have no way of knowing they even got it. I can only wait for an event I have no reason to believe will actually happen. And I don't know how long I should wait. This is bad information protocol. A program written this way would die on you every time you turned around. Well, I can call and bug them about my résumé. All the counseling about job search tells you to follow up, anyway, so I really should follow up: Me: Did you get it? HR: We said we'd contact you if we want to interview you. Me: Oh. Sorry. That's not what I read. I read that I should assume that you really didn't want to see my résumé at all. Okay, so asking, "Did you get it?" is probably the wrong way to start. But submitting the résumé on-line to a company that says they won't respond unless they want to respond is probably not the best thing to do, either. Should have reviewed my résumé before I sent it. And I should have sent it directly. After calling them first. I should know this, considering the number of training sessions I've been through. (But I've never actually gotten a job doing it the way the training sessions tell you, which means that the one thing you should never do in a job search is rely on some sort of set procedure. Which means that software and job search are not a good match, after all.) Maybe I can make sending the wrong copy an excuse to sent a decent copy instead. We'll see. Job search sites really, really should provide, in their web UI, some sort of feedback button that the HR person can hit to send an e-mail saying, at bare minimum, "Yes, we did get the résumé, and if we don't reply within n days, you should assume you didn't pass the first screening." A company whose HR department can't provide bare minimum information exchange protocol may not be worth applying to. Except that that is precisely the sort of company that currently owns the market for foreign English teachers in Japan. Which is one of the reasons I want my novel to find readers -- so I can hope it will find buyers if I finish it. If I can't hope to pay the rent with my writing, I should focus on teaching, in spite of the non-optimal stuff that I have to put up with in order to do so. Speaking of my novel, here's the current (second) draft in progress again: http://joel-rees-economics.blogspot.com/2017/01/soc500-00-00-toc.html And here's the (roughly) two-thirds-complete first draft: http://joel-rees-economics.blogspot.com/2016/04/economics-101-novel-rough-draft-index.html. If you like it, tell your friends about it. Don't worry about whether the publishers will be scared away, if I have to, I'll self-publish. Maybe start with an electronic edition and a link to my paypal account if I can't find something better. If the IRS hasn't found a way to throttle that, too. But if I know people are reading it, I will find some way to properly publish it. Friday, December 23, 2016 Why Reiisi? どうして零石? I guess it's time to explain the 当て字 (ate-ji) I use. ボクが選んだ当て字のワケを明確にする必要があるかも知りません。 When I was a young CJCLDS missionary in the 関東 (Kantō) area about thirty-five (Wow!) years ago, I looked in my pocket Japanese-English dictionary under り (ri) and れ (re) to see if there were any interesting words with similar pronunciation to my last name. (吃驚の)35年も前の、関東地方に配置された末日聖徒イエスキリスト教会の若き専任宣教師だったころの話です。ポケット和英辞書の「り」や「れ」の項目で、名字の発音に似た発音の単語を調べました。 I found 栗鼠 (risu), the Japanese for "squirrel". That would actually not have been a bad choice, I think. 「栗鼠」は出てきました。悪くない選択肢だったかも知れないのです。 I also found 零 (rei), the 漢字 (kanji) for "zero". 「0」という意味の「零」も出てきました。 You have to understand. I was only nineteen. My favorite genre of novel was science fiction and fantasy, and it had only been maybe six years since I had discovered Alice Mary (Andre) Norton's Moon of Three Rings and The Zero Stone. わかってほしいことがあります。ただ十九歳の私です。好きな小説のジャンルはサイエンスフィクション・ファンタジーです。理化学を元にした空想の物語や純粋空想の物語の好みです。アリス・メアリー・ノートン(アンドレ・ノートン)の小説、三輪の月やゼロ・ストンを発見したのはたった六年前のことでした。 The zero stone is a deep black stone, blacker than any other black. It responds to psycho-kinetic energy as an all-purpose natural amplifier. (This is fantasy. We don't care about the laws of physics, okay?) このゼロ・ストンは何れの黒よりも黒の濃い黒い宝石です。念力働きに答えて万能天然増幅器となります。(ファンタジーです。空想です。いい、ね。物理の原則は関係ありません。) (And, in the end of the series, the protagonist Murdoc Jern's familiar, Eet, something like a cross between a ferret and a cat, swallows the stone and turns into what every young male geek wishes for, a beautiful female human companion who is already bound to him for eternity without his having to consciously work through the incomprehensible dance of the sexes. Heh.) (ちなみに、その連続小説の末尾に、主人公だったマードク・ジャンのイタチと猫のハフのようなものだった使い魔のイートさまが、そのゼロストンを飲み込んで、すべての若き男ギークが切に望む、理解不可な異性との舞いを意識して行き来する必要なく、永久に伴侶となってくれる美しき女伴侶に、変身してくれるのです。まあ、ね。) One word in Japanese for "stone" is 石 (ishi). 石ですね。 End of explanation. Well, except that it didn't end there. 説明はそれで終わりですね。いや、それでは終わられません。 All the missionaries thought 印鑑 (inkan, the hardwood inked seal/stamp that is traditionally used in Japan instead of a signature) were cool. One day, when I had a little extra money and was at a printer to order calling cards, I asked about the cost of having an inkan made. 宣教師は皆は印鑑をかっこ良く思っていたのです。日本の方が皆、署名のように使っているあの印鑑ですね。カッコエエですね。ある日、小さな印刷屋で名詞を注文していて、予算がちょっと余っていたのです。印鑑を作ってもらうことの値段を聞きました。 It was within my budget. On the spur of the moment, I made one for the characters, 「零石」。 予算の内にできそうだったので気分に乗って「零石」の字に注文しました。 End of story. Well, except there was more to it. 終わり。いや、まだあります。 In LDS culture, there is an expression "magnify your priesthood". I vaguely understood that it meant using your God-given talents, guided by prayer, to fulfill your priesthood calling in your own unique way. モルモンという末日聖徒文化の中には「自分の神権を大いなるものとする」という表現があります。一応、その意味は、自分が神様からもらっている才能を、祈りの下、自分の特質を活かしてその神権召しを尊んで果たす、という事を漠然して理解していたはずです。 As I young missionary, I had this romantic image in my head, of becoming a "zero stone" in God's hands. Not that God needs any amplification, but I wanted to subsume myself in God's will. 若宣教師の私の頭の中に、神様の手に「ゼロストン」となるような、冒険心の想像が浮かんでいたのです。そもそも神様は増幅器なんか必要などもしませんが、ワタシが神様の御心に昇華されその一部となりたかったのです。 I did understand, sort-of, that God really does not want us to be His mindless robots. After my mission, I have come to understand part of why that is. And the adventure so far has been pretty cool, when I stop to think about it. (I need to stop and thank God for the adventure more often. Right now, I'm blessed and struggling with yet another turn in the trail. God has been pretty good to me, all things considered.) 神様の所有する、個人的な意志の無いロボットなどになることが、神様の御旨にかないませんと、なんとなくわかっていました。伝道終わってからその理由の一部をわかってきていると思っています。これまでの人生の冒険が結構楽しくできています。(神様への感謝を忘れるのが多すぎるけど、思い出したら文句は言えません。全般のことを考えて、今の難しいところがあっても神様からは良い物を受けています。) Anyway, that's the reason for 「零石」、and reiisi. さて、以上が「零石」及び reiisi のわけです。  
{ "url": "http://reiisi.blogspot.jp/", "source_domain": "reiisi.blogspot.jp", "snapshot_id": "crawl=CC-MAIN-2017-22", "warc_metadata": { "Content-Length": "159951", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:FXD6F6EI2WAXZY42EQUWE3QC57Z4NNQN", "WARC-Concurrent-To": "<urn:uuid:c96870da-9230-4830-a741-93d0ceb94dd2>", "WARC-Date": "2017-05-30T05:33:46Z", "WARC-IP-Address": "172.217.7.161", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:M76PECLQCF4SSIQAYUWJ6R4YQMGSR3QG", "WARC-Record-ID": "<urn:uuid:fee2509d-214c-4eb7-8f25-b562a6c71082>", "WARC-Target-URI": "http://reiisi.blogspot.jp/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:9b296b58-5f73-41ca-bbbe-3d09a3ee10a2>" }, "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, 31, 32, 42, 43, 96, 97, 127, 128, 193, 211, 263, 264, 297, 302, 324, 325, 404, 471, 472, 523, 550, 551, 572, 573, 590, 591, 647, 673, 674, 704, 717, 718, 751, 769, 770, 867, 899, 900, 943, 962, 963, 1008, 1031, 1032, 1097, 1120, 1121, 1213, 1250, 1251, 1381, 1449, 1450, 1597, 1663, 1664, 1762, 1822, 1823, 1889, 1933, 1934, 2016, 2042, 2043, 2156, 2220, 2221, 2299, 2341, 2342, 2421, 2453, 2454, 2532, 2568, 2569, 2570, 2582, 2594, 2606, 2623, 2641, 2660, 2680, 2700, 2720, 2740, 2760, 2761, 2817, 2837, 2838, 2936, 2937, 2974, 2975, 3048, 3093, 3094, 3252, 3253, 3342, 3343, 3433, 3467, 3468, 3579, 3627, 3628, 3721, 3761, 3762, 3919, 3988, 3989, 4089, 4154, 4155, 4281, 4337, 4338, 4403, 4426, 4427, 4431, 4435, 4439, 4440, 4505, 4545, 4546, 4583, 4610, 4611, 4738, 4803, 4804, 4903, 4945, 4946, 5059, 5109, 5110, 5138, 5151, 5152, 5173, 5174, 5220, 5221, 5287, 5288, 5432, 5433, 5552, 5553, 5716, 5717, 5816, 5817, 5953, 5954, 6148, 6149, 6220, 6221, 6256, 6288, 6351, 6394, 6395, 6619, 6620, 6670, 6671, 6734, 6735, 6754, 6755, 6756, 6832, 6833, 6858, 6859, 6902, 6903, 6937, 6938, 7056, 7057, 7264, 7265, 7342, 7433, 7434, 7528, 7529, 7570, 7571, 7714, 7715, 7854, 7855, 8061, 8062, 8219, 8220, 8319, 8320, 8497, 8498, 8537, 8573, 8613, 8646, 8673, 8827, 8828, 8867, 8868, 8893, 8894, 8941, 8942, 9083, 9084, 9201, 9202, 9317, 9318, 9517, 9518, 9793, 9794, 9898, 9899, 9947, 9948, 10054, 10055, 10278, 10279, 10562, 10563, 10681, 10685, 10760, 10861, 10862, 10943, 11035, 11305, 11519, 11686, 11687, 11710, 11711, 11763, 11764, 11992, 11993, 12369, 12370, 12577, 12578, 12769, 12770, 12930, 12931, 13309, 13310, 13498, 13499, 13650, 13651, 13986, 13987, 14104, 14105, 14179, 14180, 14190, 14201, 14210, 14247, 14248, 14303, 14304, 14314, 14319, 14331, 14342, 14351, 14389, 14390, 14406, 14407, 14417, 14422, 14434, 14445, 14454, 14463, 14472, 14481, 14491, 14498, 14503, 14515, 14526, 14535, 14573, 14574, 14698, 14699, 14910, 14911, 15183, 15184, 15351, 15352, 15544, 15545, 15683, 15684, 15815, 15816, 15924, 15925, 16069, 16070, 16270, 16271, 16469, 16470, 16506, 16507, 16652, 16653, 16679, 16680, 16753, 16754, 16896, 16897, 17319, 17320, 17474, 17475, 17533, 17534, 17740, 17741, 18040, 18041, 18077, 18078, 18216, 18217, 18280, 18281, 18338, 18339, 18369, 18370, 18473, 18474, 18569, 18570, 18594, 18595, 18646, 18647, 18671, 18672, 18719, 18720, 18744, 18745, 18772, 18785, 18786, 18808, 18843, 18865, 18904, 18924, 18959, 18981, 19000, 19007, 19008, 19032, 19044, 19079, 19101, 19135, 19150, 19185, 19207, 19237, 19270, 19316, 19351, 19657, 19658, 19659, 19687, 19717, 19741, 19783, 19838, 19839, 19844, 19874, 19882, 19898, 19917, 19918, 19951, 19966, 19967, 20020, 20037, 20038, 20079, 20102, 20103, 20148, 20162, 20163, 20201, 20230, 20231, 20332, 20373, 20374, 20399, 20412, 20413, 20465, 20486, 20487, 20578, 20633, 20634, 20707, 20763, 20764, 20848, 20885, 20886, 20952, 20977, 20978, 21013, 21049, 21050, 21077, 21095, 21159, 21160, 21182, 21183, 21205, 21206, 21487, 21488, 21735, 21736, 21881, 21882, 22030, 22058, 22059, 22086, 22087, 22148, 22149, 22315, 22316, 22499, 22500, 22555, 22556, 22677, 22678, 22743, 22744, 22873, 22874, 23051, 23052, 23187, 23188, 23265, 23266, 23493, 23494, 23721, 23722, 23747, 23748, 23773, 23774, 23857, 23858, 23887, 23888, 23912, 23913, 23951, 23952, 24166, 24167, 24322, 24323, 24579, 24580, 24686, 24687, 24928, 24929, 25004, 25005, 25177, 25178, 25411, 25412, 25814, 25815, 25941, 25942, 26272, 26273, 26379, 26380, 26381, 26485, 26486, 26570, 26571, 26691, 26692, 26933, 26934, 27217, 27218, 27326, 27327, 27472, 27492, 27493, 27551, 27552, 27672, 27743, 27744, 27894, 27895, 27944, 27945, 28090, 28091, 28359, 28360, 28452, 28453, 28739, 28740, 28857, 28858, 29091, 29092, 29249, 29250, 29325, 29326, 29396, 29397, 29455, 29456, 29548, 29549, 29793, 29794, 29847, 29848, 29930, 29931, 29932, 29958, 29959, 29979, 29980, 30033, 30065, 30066, 30323, 30418, 30419, 30524, 30557, 30558, 30607, 30628, 30629, 30862, 31006, 31007, 31215, 31299, 31300, 31671, 31825, 31826, 31872, 31878, 31879, 31938, 31967, 31968, 32243, 32360, 32361, 32450, 32485, 32486, 32535, 32550, 32551, 32759, 32880, 32881, 33069, 33171, 33172, 33592, 33781, 33782, 33829, 33856, 33857, 33858 ], "line_end_idx": [ 31, 32, 42, 43, 96, 97, 127, 128, 193, 211, 263, 264, 297, 302, 324, 325, 404, 471, 472, 523, 550, 551, 572, 573, 590, 591, 647, 673, 674, 704, 717, 718, 751, 769, 770, 867, 899, 900, 943, 962, 963, 1008, 1031, 1032, 1097, 1120, 1121, 1213, 1250, 1251, 1381, 1449, 1450, 1597, 1663, 1664, 1762, 1822, 1823, 1889, 1933, 1934, 2016, 2042, 2043, 2156, 2220, 2221, 2299, 2341, 2342, 2421, 2453, 2454, 2532, 2568, 2569, 2570, 2582, 2594, 2606, 2623, 2641, 2660, 2680, 2700, 2720, 2740, 2760, 2761, 2817, 2837, 2838, 2936, 2937, 2974, 2975, 3048, 3093, 3094, 3252, 3253, 3342, 3343, 3433, 3467, 3468, 3579, 3627, 3628, 3721, 3761, 3762, 3919, 3988, 3989, 4089, 4154, 4155, 4281, 4337, 4338, 4403, 4426, 4427, 4431, 4435, 4439, 4440, 4505, 4545, 4546, 4583, 4610, 4611, 4738, 4803, 4804, 4903, 4945, 4946, 5059, 5109, 5110, 5138, 5151, 5152, 5173, 5174, 5220, 5221, 5287, 5288, 5432, 5433, 5552, 5553, 5716, 5717, 5816, 5817, 5953, 5954, 6148, 6149, 6220, 6221, 6256, 6288, 6351, 6394, 6395, 6619, 6620, 6670, 6671, 6734, 6735, 6754, 6755, 6756, 6832, 6833, 6858, 6859, 6902, 6903, 6937, 6938, 7056, 7057, 7264, 7265, 7342, 7433, 7434, 7528, 7529, 7570, 7571, 7714, 7715, 7854, 7855, 8061, 8062, 8219, 8220, 8319, 8320, 8497, 8498, 8537, 8573, 8613, 8646, 8673, 8827, 8828, 8867, 8868, 8893, 8894, 8941, 8942, 9083, 9084, 9201, 9202, 9317, 9318, 9517, 9518, 9793, 9794, 9898, 9899, 9947, 9948, 10054, 10055, 10278, 10279, 10562, 10563, 10681, 10685, 10760, 10861, 10862, 10943, 11035, 11305, 11519, 11686, 11687, 11710, 11711, 11763, 11764, 11992, 11993, 12369, 12370, 12577, 12578, 12769, 12770, 12930, 12931, 13309, 13310, 13498, 13499, 13650, 13651, 13986, 13987, 14104, 14105, 14179, 14180, 14190, 14201, 14210, 14247, 14248, 14303, 14304, 14314, 14319, 14331, 14342, 14351, 14389, 14390, 14406, 14407, 14417, 14422, 14434, 14445, 14454, 14463, 14472, 14481, 14491, 14498, 14503, 14515, 14526, 14535, 14573, 14574, 14698, 14699, 14910, 14911, 15183, 15184, 15351, 15352, 15544, 15545, 15683, 15684, 15815, 15816, 15924, 15925, 16069, 16070, 16270, 16271, 16469, 16470, 16506, 16507, 16652, 16653, 16679, 16680, 16753, 16754, 16896, 16897, 17319, 17320, 17474, 17475, 17533, 17534, 17740, 17741, 18040, 18041, 18077, 18078, 18216, 18217, 18280, 18281, 18338, 18339, 18369, 18370, 18473, 18474, 18569, 18570, 18594, 18595, 18646, 18647, 18671, 18672, 18719, 18720, 18744, 18745, 18772, 18785, 18786, 18808, 18843, 18865, 18904, 18924, 18959, 18981, 19000, 19007, 19008, 19032, 19044, 19079, 19101, 19135, 19150, 19185, 19207, 19237, 19270, 19316, 19351, 19657, 19658, 19659, 19687, 19717, 19741, 19783, 19838, 19839, 19844, 19874, 19882, 19898, 19917, 19918, 19951, 19966, 19967, 20020, 20037, 20038, 20079, 20102, 20103, 20148, 20162, 20163, 20201, 20230, 20231, 20332, 20373, 20374, 20399, 20412, 20413, 20465, 20486, 20487, 20578, 20633, 20634, 20707, 20763, 20764, 20848, 20885, 20886, 20952, 20977, 20978, 21013, 21049, 21050, 21077, 21095, 21159, 21160, 21182, 21183, 21205, 21206, 21487, 21488, 21735, 21736, 21881, 21882, 22030, 22058, 22059, 22086, 22087, 22148, 22149, 22315, 22316, 22499, 22500, 22555, 22556, 22677, 22678, 22743, 22744, 22873, 22874, 23051, 23052, 23187, 23188, 23265, 23266, 23493, 23494, 23721, 23722, 23747, 23748, 23773, 23774, 23857, 23858, 23887, 23888, 23912, 23913, 23951, 23952, 24166, 24167, 24322, 24323, 24579, 24580, 24686, 24687, 24928, 24929, 25004, 25005, 25177, 25178, 25411, 25412, 25814, 25815, 25941, 25942, 26272, 26273, 26379, 26380, 26381, 26485, 26486, 26570, 26571, 26691, 26692, 26933, 26934, 27217, 27218, 27326, 27327, 27472, 27492, 27493, 27551, 27552, 27672, 27743, 27744, 27894, 27895, 27944, 27945, 28090, 28091, 28359, 28360, 28452, 28453, 28739, 28740, 28857, 28858, 29091, 29092, 29249, 29250, 29325, 29326, 29396, 29397, 29455, 29456, 29548, 29549, 29793, 29794, 29847, 29848, 29930, 29931, 29932, 29958, 29959, 29979, 29980, 30033, 30065, 30066, 30323, 30418, 30419, 30524, 30557, 30558, 30607, 30628, 30629, 30862, 31006, 31007, 31215, 31299, 31300, 31671, 31825, 31826, 31872, 31878, 31879, 31938, 31967, 31968, 32243, 32360, 32361, 32450, 32485, 32486, 32535, 32550, 32551, 32759, 32880, 32881, 33069, 33171, 33172, 33592, 33781, 33782, 33829, 33856, 33857, 33858, 33859 ] }
{ "red_pajama_v2": { "ccnet_original_length": 33859, "ccnet_original_nlines": 645, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.41392403841018677, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.026722930371761322, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.236708864569664, "rps_doc_frac_unique_words": 0.2840680480003357, "rps_doc_mean_word_length": 4.9831719398498535, "rps_doc_num_sentences": 372, "rps_doc_symbol_to_word_ratio": 0.0001406499941367656, "rps_doc_unigram_entropy": 6.201625347137451, "rps_doc_word_count": 5467, "rps_doc_frac_chars_dupe_10grams": 0.0072312201373279095, "rps_doc_frac_chars_dupe_5grams": 0.027897069230675697, "rps_doc_frac_chars_dupe_6grams": 0.016811659559607506, "rps_doc_frac_chars_dupe_7grams": 0.012113199569284916, "rps_doc_frac_chars_dupe_8grams": 0.009176669642329216, "rps_doc_frac_chars_dupe_9grams": 0.0072312201373279095, "rps_doc_frac_chars_top_2gram": 0.00440480001270771, "rps_doc_frac_chars_top_3gram": 0.005873070098459721, "rps_doc_frac_chars_top_4gram": 0.001982159912586212, "rps_doc_books_importance": -2910.20849609375, "rps_doc_books_importance_length_correction": -2910.20849609375, "rps_doc_openwebtext_importance": -2107.9052734375, "rps_doc_openwebtext_importance_length_correction": -2107.9052734375, "rps_doc_wikipedia_importance": -1504.806640625, "rps_doc_wikipedia_importance_length_correction": -1504.806640625 }, "fasttext": { "dclm": 0.1521972417831421, "english": 0.8613829612731934, "fineweb_edu_approx": 1.4915951490402222, "eai_general_math": 0.541341245174408, "eai_open_web_math": 0.28496044874191284, "eai_web_code": 0.1972259283065796 } }
{ "free_decimal_correspondence": { "primary": { "code": "004.0151", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "370.1", "labels": { "level_1": "Social sciences", "level_2": "Education", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "4", "label": "Analyze" }, "secondary": { "code": "5", "label": "Evaluate" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "9", "label": "Personal/Misc" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "16", "label": "Personal Blog" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "6", "label": "Not Applicable/Indeterminate" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "1", "label": "General Audience" } } }
ece34605c058195ed03b4d393ef1a36c
-7,314,295,678,900,696,000
changing font  grid = $find("<%=RadGrid1.ClientID %>");                                 if (grid.get_masterTableView().get_selectedItems().length == 0) .length gives me the length of the selected items... how can I change the font of the selected items to not bold ?? 1jawsAsked: Who is Participating?   pritamduttCommented: If your intent is to change font on RowSelection you should use OnRowSelected Event option available for RADGrid For further reading see ... http://www.telerik.com/help/aspnet-ajax/grid-onrowselected.html 0   pritamduttCommented: You could make a choice between using inline CSS or CSS class Here is an example for inline CSS <p style="font-style:normal"> Some Normal Text </p> Open in new window Here is an example for using CSS class <style type="text/css"> p.normal {font-style:normal} </style> <p class="normal">Normal Text </p> Open in new window Hope this helps 0   1jawsAuthor Commented: actually my question was     if (grid.get_masterTableView().get_selectedItems(). ????? comes after that ().  on above ... length gives me lenght but .font doesnt for example... 0 Cloud Class® Course: CompTIA Healthcare IT Tech This course will help prep you to earn the CompTIA Healthcare IT Technician certification showing that you have the knowledge and skills needed to succeed in installing, managing, and troubleshooting IT systems in medical and clinical settings.   pritamduttCommented: Based on code snippet provided by you I understand that you are using RadGrid Control! But I am unable to understand what you actually desire considering the get_selectedItems() function returns an array of the grid rows selected on the client (and all sub levels in hierarchical grid structure). 0   1jawsAuthor Commented: when I debug and see those, I see like  _element,  attributes,  style,  font after that get_selectedItems()... but stil having hard time to write those out...I did like that didnt work.. grid.get_masterTableView().get_selectedItems()._element.attributes.style.font = bold; 0   1jawsAuthor Commented: yes, I am doing this on function onGridRowSelected(sender, args)  event already, but can you be able help me how to change the font?           0   1jawsAuthor Commented: I just did on server side... thanks for trying to help... 0   pritamduttCommented: I am glad you found the solution! 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/27384916/changing-font.html", "source_domain": "www.experts-exchange.com", "snapshot_id": "crawl=CC-MAIN-2018-26", "warc_metadata": { "Content-Length": "127483", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:2OTH3Q46QVPFVWY4Q5MVEM5H52NZA6NF", "WARC-Concurrent-To": "<urn:uuid:042049ff-6cac-496c-a14d-f671ebea6ca5>", "WARC-Date": "2018-06-23T22:08:34Z", "WARC-IP-Address": "104.20.168.10", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:CKJQ57KHI6UTHYW246NLL3P3SFOV4BXH", "WARC-Record-ID": "<urn:uuid:b1124f1b-1b0f-41bd-b058-157f12810fe0>", "WARC-Target-URI": "https://www.experts-exchange.com/questions/27384916/changing-font.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:ec072b59-1677-4a77-873f-a64d047be149>" }, "warc_info": "robots: classic\r\nhostname: ip-10-166-200-108.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, 14, 15, 57, 73, 153, 154, 270, 282, 304, 306, 327, 440, 441, 533, 535, 537, 558, 620, 654, 655, 707, 708, 727, 728, 729, 768, 792, 821, 830, 831, 866, 867, 886, 887, 888, 904, 906, 908, 931, 956, 1018, 1108, 1110, 1158, 1159, 1404, 1405, 1407, 1428, 1515, 1516, 1726, 1727, 1728, 1730, 1732, 1755, 1794, 1805, 1818, 1826, 1832, 1833, 1867, 1943, 2029, 2031, 2033, 2056, 2189, 2199, 2201, 2203, 2226, 2284, 2286, 2288, 2309, 2343, 2345, 2379, 2380, 2481, 2482, 2527, 2528, 2540, 2541 ], "line_end_idx": [ 14, 15, 57, 73, 153, 154, 270, 282, 304, 306, 327, 440, 441, 533, 535, 537, 558, 620, 654, 655, 707, 708, 727, 728, 729, 768, 792, 821, 830, 831, 866, 867, 886, 887, 888, 904, 906, 908, 931, 956, 1018, 1108, 1110, 1158, 1159, 1404, 1405, 1407, 1428, 1515, 1516, 1726, 1727, 1728, 1730, 1732, 1755, 1794, 1805, 1818, 1826, 1832, 1833, 1867, 1943, 2029, 2031, 2033, 2056, 2189, 2199, 2201, 2203, 2226, 2284, 2286, 2288, 2309, 2343, 2345, 2379, 2380, 2481, 2482, 2527, 2528, 2540, 2541, 2588 ] }
{ "red_pajama_v2": { "ccnet_original_length": 2588, "ccnet_original_nlines": 88, "rps_doc_curly_bracket": 0.0007728000055067241, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3292929232120514, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03232323005795479, "rps_doc_frac_lines_end_with_ellipsis": 0.0337078683078289, "rps_doc_frac_no_alph_words": 0.23232322931289673, "rps_doc_frac_unique_words": 0.533707857131958, "rps_doc_mean_word_length": 5.505618095397949, "rps_doc_num_sentences": 42, "rps_doc_symbol_to_word_ratio": 0.016161620616912842, "rps_doc_unigram_entropy": 4.961944580078125, "rps_doc_word_count": 356, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.03877551108598709, "rps_doc_frac_chars_dupe_6grams": 0.020408159121870995, "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.02448979951441288, "rps_doc_frac_chars_top_3gram": 0.04285714030265808, "rps_doc_frac_chars_top_4gram": 0.018367350101470947, "rps_doc_books_importance": -217.46249389648438, "rps_doc_books_importance_length_correction": -217.46249389648438, "rps_doc_openwebtext_importance": -113.99188232421875, "rps_doc_openwebtext_importance_length_correction": -113.99188232421875, "rps_doc_wikipedia_importance": -78.18740844726562, "rps_doc_wikipedia_importance_length_correction": -78.18740844726562 }, "fasttext": { "dclm": 0.1302424669265747, "english": 0.7711629867553711, "fineweb_edu_approx": 2.142531156539917, "eai_general_math": 0.02414082922041416, "eai_open_web_math": 0.5072239637374878, "eai_web_code": 0.6769887208938599 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.4", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
-4,038,314,275,658,853,000
PyCharm 2020.1 Help Tasks and contexts When you work on a project, you can organize your work in smaller tasks that you need to complete. These can be tasks that you set yourself. In PyCharm, you can divide a large piece of work into smaller tasks and associate them with changelists. Or these can be tasks coming from your issue tracker. For example, you can work with tasks and bugs assigned to you directly from PyCharm. To be able to do so, connect the IDE and your tracker account. Configure integration with issue trackers PyCharm supports integration with: Connect the IDE to your tracker 1. In the Settings/Preferences dialog Ctrl+Alt+S, select Tools | Tasks | Servers. 2. Click the Add button and select the necessary issue tracker from the list. 3. Enter connection details. Note that settings differ depending on your issue tracker. Normally, you have to specify the server URL and connection credentials: Username and Password. In some cases, you can enter an API token in the Password field instead of your password. 4. Select the Share URL option to allow access to the server for other members of your team. When this option is enabled, a server URL and its type are saved to the .idea/misc.xml file, which can be shared between development team members through version control. 5. Click Proxy settings if you want to access the server via a proxy server. You can find more information on proxy settings in the HTTP Proxy section. Setting on the General tab of the Servers page 6. On the Commit Message tab, you can enable adding a commit message for a changelist and configure a message template. Configuring a commit message on the Commit Message tab 7. On the Server Configuration tab, configure advanced parameters for connecting to your issue tracker. This tab is only available for some trackers (for example, for trackers that are not supported out of the box). Server Configuration tab parameters ItemDescription Login URL The resource for authentication. The IDE sends requests to this resource every time before retrieving the list of issues from the server, for example: {serverUrl}/rest/user/login?login={username}&password={password}. The field is disabled if you have selected the Use HTTP authentication checkbox on the General tab. Tasks List URL The resource for retrieving the list of issues from the server, for example: {serverUrl}/rest/api/2/search. Single Task URL The resource for retrieving detailed information about an issue by its ID, for example: {serverUrl}/rest/api/2/issue/{id}. This field is optional unless you select the Each task in separate request checkbox. GET or POSTSelect the necessary type of HTTP requests. Each task in a separate request Enabling this option allows the IDE to send several requests in order to retrieve the list of issues with their IDs first, and then to obtain detailed information on each issue separately using the resource specified in the Single Task URL field. This option is for issue trackers with restricted REST APIs that cannot send all the required information in a single response. Response typeSelect the format in which your issue tracker responses: XML for XPath, JSON for JSONPath, or Text for regular expressions. The table of selectorsSelectors allow you to specify which information about an issue is going to be retrieved from the server response. tasksThe path to the list of issues in the server response. This field is mandatory. idThe path to the issue ID in the server response. This field is mandatory. summaryThe path to the issue title in the server response. This field is mandatory. The Server Configuration tab shown in the settings Specify additional integration options 1. In the Settings/Preferences dialog Ctrl+Alt+S, select Tools | Tasks. 2. Configure the necessary options: • Changelist name format: when you open or create a new task, PyCharm prompts you to create a new changelist associated with this task. In this field, you can specify a template that will be used for generating names for new changelists. Click the Add placeholder button to select placeholders from the list. • Feature branch name format: when you create or open a new task, PyCharm prompts you to create a new feature branch. In this field, you can configure the template for generating names of new feature branches. Click the Add placeholder button to select placeholders from the list. Use the Lowercased and Replace spaces with options to configure prompted feature branch names. These settings are useful if your IDE is integrated with an issue tracker. For example, the DSGN-0001 Add new icon task name is going to be converted to the dsgn-0001add-new-icon feature branch name. • Task history length: the number of tasks that PyCharm stores. • Save context on commit: every time you commit changes, PyCharm creates a new closed local task that keeps files, bookmarks, and breakpoints that you have worked with. This way, you can quickly restore all tabs associated with the task any time in the future. • Enable issue cache: optimize synchronization between PyCharm and your issue tracker. Synchronization is especially recommended if you work with "slow" issue tracking systems. PyCharm caches the list of issues loaded from the tracker and updates them repeatedly. You can specify how many issues should be cached and how often PyCharm should update information about them. Task settings Tasks In PyCharm, there two types of tasks: • Tasks that were loaded to PyCharm from your issue tracker. These are tracker tasks Tracker tasks are linked with the corresponding issues in your issue tracker. This allows you to monitor and update them directly from PyCharm. • Tasks that were originally created in PyCharm. These are local tasks. Local tasks are not related to an issue tracker. If you have created at least one task of either type, a list called task combo becomes available on the toolbar. Open tracker tasks Tracker tasks are loaded to your PyCharm once you connect it to your issue tracker. 1. From the main menu, select Tools | Tasks & Contexts | Open TaskAlt+Shift+N, or click the task combo on the toolbar. 2. Select the necessary task from the list. 3. In the Open Task dialog, you can update issue state. If you want to close all tabs that are currently opened in the editor, select the Clear current context checkbox. 4. In the VCS operations section, you can create a new changelist, select an existing branch to which you want to contribute, or create a new one. You can also shelve the current changes to return to them later. Opening a tracker task Create local tasks In PyCharm, you can create local tasks that do not originate from your issue tracker. 1. From the main menu, select Tools | Tasks & Contexts | Open Task. You can also use the task combo or press Alt+Shift+N. 2. In the Enter task name dialog, select Create New Task. 3. Enter a name for the new task. If you want to close all tabs that are currently opened in the editor, select the Clear current context checkbox. 4. In the VCS operations section, you can create a new changelist, select an existing branch to which you want to contribute, or create a new branch. You can also shelve the current changes to return to them later. View task description When you are choosing a task to switch to, the list of tasks shows only task IDs. This information is not always sufficient, because it reflects neither the steps that lead to the problem nor the related discussion. 1. Go to Tools | Tasks & Contexts | Open Task. 2. Open the necessary task and press Ctrl+Q to open the task description in PyCharm, or Alt+Shift+B to view the description in a browser. Alternatively, go to Tools | Tasks & Contexts and click Show 'task ID' Description or Open 'task ID' in Browser. View closed tasks A closed local task is a task that is not associated with a changelist if the entire project or the affected directory is under a version control. A closed tracker task is a task that has the closed status in your the issue tracker. 1. Click the task combo and then click Open Task. 2. Select the Include closed tasks checkbox, or press Alt+Shift+N. Close tasks • Go to Tools | Tasks & Contexts and click Close Active Task. This will close the current context in the PyCharm. Select the necessary checkboxes to commit changes and, optionally, merge the branch that was created. For tracker tasks, you can also change their state. The new state will be propagated to your issue tracker. Closing a task Delete tasks If you do not need a task to appear in PyCharm, you can remove it from the list of tasks. 1. Click the task combo on the main toolbar. 2. Select one or more tasks you want to delete. Use Shift (for adjacent items) or Ctrl (for non-adjacent items) keys for multiple selection. 3. Click the right-arrow button, and select Remove. When you are deleting tracker tasks, you remove them from the IDE. They will remain in your issue tracker. Local tasks in this case will be completely removed, since they are not connected to your issue tracker. Time tracking With PyCharm, you can track the amount of time you spend on a task working in the editor. For local tasks, this information might be helpful if you want to know how much time exactly you need to compete a task as you work on a project. For tracker tasks, this option is useful if your issue tracker configuration requires that you log the time you spend on tasks. In this case, you can send your time log from PyCharm to the tracker. Enable time tracking 1. In the Settings/Preferences dialog Ctrl+Alt+S, go to Tools | Tasks | Time Tracking and select the Enable Time Tracking checkbox. 2. (Optionally) Change the Suspend delay value. Here you can specify how long you have to stay inactive before the task will be considered suspended. Track time • Click Auto Mode for automatic time logging. For manual time tracking, click Start time for the active task. To stop manual time tracking, click Stop time for the active task. Time Tracking tool window with two ongoing tasks Send time log to tracker 1. Click Post work item to bug tracker Export an item to the bug tracker in the Time Tracking tool window. 2. Specify time interval you want to log and add a comment if necessary. Click OK. Send the log to the tracker Contexts A context is a set of bookmarks, breakpoints, and tabs opened in the editor. Contexts are linked to tasks, but you can work with contexts without associating them with specific tasks. Having separate contexts lets you work on several things and switch between them without mixing the changes. Save a context 1. From the main menu, select Tools | Tasks & Contexts | Save Context. 2. In the Save Context dialog, enter the name of the context and click OK. Add items to existing contexts 1. From the main menu, select Tools | Tasks & Contexts | Load Context. 2. Add the necessary items (bookmarks or breakpoints) or open the necessary files and save the context: Tools | Tasks & Contexts | Save Context. Switch between contexts When you switch between tasks, the IDE automatically switches related contexts. However, if the contexts that you work with are not associated with tasks, you can switch between them manually. 1. From the main menu, select Tools | Tasks & Contexts | Load Context. 2. In the Load Context popup, select the necessary context from the list. Alternatively, click the right arrow and select Load. Loading a context Clear a context • To clear the current context without loading another one, select Tools | Tasks & Contexts| Clear Context from the main menu, or press Alt+Shift+X. Delete a context When a task is finished, or if you do not need a context anymore, you can remove it. 1. From the main menu, select Tools | Tasks & Contexts | Load Context. 2. In the Load Context popup, click the right arrow and select Remove. Last modified: 15 July 2020
{ "url": "https://www.jetbrains.com/help/pycharm/2020.1/managing-tasks-and-context.html", "source_domain": "www.jetbrains.com", "snapshot_id": "crawl=CC-MAIN-2022-27", "warc_metadata": { "Content-Length": "51277", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:PNHL5ZFGIQIMF4BOVKYTQH5DGIUIKW6T", "WARC-Concurrent-To": "<urn:uuid:7514fe61-55e9-43ee-8f4a-3304da572fed>", "WARC-Date": "2022-07-01T17:49:14Z", "WARC-IP-Address": "18.67.76.68", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:5GRBTIMW3LMMLJ4SHITBLDFGM2R7FA3F", "WARC-Record-ID": "<urn:uuid:bc041919-af94-4f6a-8a87-69cb937864f0>", "WARC-Target-URI": "https://www.jetbrains.com/help/pycharm/2020.1/managing-tasks-and-context.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:d83b03cc-d603-4c9d-b1eb-4a206012b33a>" }, "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-112\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 20, 21, 40, 41, 140, 141, 288, 289, 491, 492, 534, 535, 570, 571, 603, 604, 688, 689, 769, 770, 860, 861, 961, 962, 1056, 1057, 1323, 1324, 1478, 1479, 1530, 1652, 1653, 1712, 1818, 1819, 1935, 1936, 1972, 1973, 1989, 1999, 2000, 2217, 2218, 2318, 2319, 2442, 2458, 2459, 2582, 2583, 2668, 2669, 2724, 2756, 2757, 3004, 3005, 3133, 3134, 3271, 3408, 3493, 3569, 3653, 3704, 3705, 3744, 3745, 3819, 3820, 3858, 3859, 4101, 4102, 4179, 4180, 4394, 4395, 4472, 4473, 4574, 4575, 4781, 4782, 4850, 4851, 5116, 5117, 5298, 5299, 5501, 5502, 5522, 5523, 5529, 5530, 5568, 5569, 5800, 5801, 5924, 5925, 6038, 6039, 6058, 6059, 6143, 6144, 6265, 6266, 6312, 6313, 6371, 6372, 6490, 6491, 6640, 6641, 6710, 6711, 6738, 6739, 6758, 6759, 6845, 6846, 6970, 6971, 7031, 7032, 7068, 7069, 7187, 7188, 7340, 7341, 7410, 7411, 7433, 7434, 7650, 7651, 7700, 7701, 7841, 7842, 7955, 7956, 7974, 7975, 8122, 8123, 8209, 8210, 8262, 8263, 8332, 8333, 8345, 8346, 8410, 8411, 8673, 8674, 8689, 8690, 8703, 8704, 8794, 8795, 8842, 8843, 8893, 8894, 8991, 8992, 9046, 9047, 9259, 9260, 9274, 9275, 9511, 9512, 9710, 9711, 9732, 9733, 9785, 9786, 9872, 9922, 9923, 10029, 10030, 10041, 10042, 10090, 10091, 10226, 10227, 10280, 10281, 10306, 10307, 10416, 10417, 10502, 10503, 10535, 10536, 10545, 10546, 10730, 10731, 10840, 10841, 10856, 10857, 10930, 10931, 11008, 11009, 11040, 11041, 11114, 11115, 11262, 11263, 11287, 11288, 11481, 11482, 11555, 11556, 11632, 11633, 11691, 11692, 11714, 11715, 11731, 11732, 11883, 11884, 11901, 11902, 11987, 11988, 12061, 12062, 12135, 12136 ], "line_end_idx": [ 20, 21, 40, 41, 140, 141, 288, 289, 491, 492, 534, 535, 570, 571, 603, 604, 688, 689, 769, 770, 860, 861, 961, 962, 1056, 1057, 1323, 1324, 1478, 1479, 1530, 1652, 1653, 1712, 1818, 1819, 1935, 1936, 1972, 1973, 1989, 1999, 2000, 2217, 2218, 2318, 2319, 2442, 2458, 2459, 2582, 2583, 2668, 2669, 2724, 2756, 2757, 3004, 3005, 3133, 3134, 3271, 3408, 3493, 3569, 3653, 3704, 3705, 3744, 3745, 3819, 3820, 3858, 3859, 4101, 4102, 4179, 4180, 4394, 4395, 4472, 4473, 4574, 4575, 4781, 4782, 4850, 4851, 5116, 5117, 5298, 5299, 5501, 5502, 5522, 5523, 5529, 5530, 5568, 5569, 5800, 5801, 5924, 5925, 6038, 6039, 6058, 6059, 6143, 6144, 6265, 6266, 6312, 6313, 6371, 6372, 6490, 6491, 6640, 6641, 6710, 6711, 6738, 6739, 6758, 6759, 6845, 6846, 6970, 6971, 7031, 7032, 7068, 7069, 7187, 7188, 7340, 7341, 7410, 7411, 7433, 7434, 7650, 7651, 7700, 7701, 7841, 7842, 7955, 7956, 7974, 7975, 8122, 8123, 8209, 8210, 8262, 8263, 8332, 8333, 8345, 8346, 8410, 8411, 8673, 8674, 8689, 8690, 8703, 8704, 8794, 8795, 8842, 8843, 8893, 8894, 8991, 8992, 9046, 9047, 9259, 9260, 9274, 9275, 9511, 9512, 9710, 9711, 9732, 9733, 9785, 9786, 9872, 9922, 9923, 10029, 10030, 10041, 10042, 10090, 10091, 10226, 10227, 10280, 10281, 10306, 10307, 10416, 10417, 10502, 10503, 10535, 10536, 10545, 10546, 10730, 10731, 10840, 10841, 10856, 10857, 10930, 10931, 11008, 11009, 11040, 11041, 11114, 11115, 11262, 11263, 11287, 11288, 11481, 11482, 11555, 11556, 11632, 11633, 11691, 11692, 11714, 11715, 11731, 11732, 11883, 11884, 11901, 11902, 11987, 11988, 12061, 12062, 12135, 12136, 12163 ] }
{ "red_pajama_v2": { "ccnet_original_length": 12163, "ccnet_original_nlines": 255, "rps_doc_curly_bracket": 0.0009865999454632401, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.35657620429992676, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01795407012104988, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.17160752415657043, "rps_doc_frac_unique_words": 0.22640562057495117, "rps_doc_mean_word_length": 4.737449645996094, "rps_doc_num_sentences": 167, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.15712833404541, "rps_doc_word_count": 1992, "rps_doc_frac_chars_dupe_10grams": 0.11846984922885895, "rps_doc_frac_chars_dupe_5grams": 0.21013033390045166, "rps_doc_frac_chars_dupe_6grams": 0.17081700265407562, "rps_doc_frac_chars_dupe_7grams": 0.15312069654464722, "rps_doc_frac_chars_dupe_8grams": 0.14676274359226227, "rps_doc_frac_chars_dupe_9grams": 0.13436472415924072, "rps_doc_frac_chars_top_2gram": 0.015894880518317223, "rps_doc_frac_chars_top_3gram": 0.022040899842977524, "rps_doc_frac_chars_top_4gram": 0.011126420460641384, "rps_doc_books_importance": -1402.71142578125, "rps_doc_books_importance_length_correction": -1402.71142578125, "rps_doc_openwebtext_importance": -794.44091796875, "rps_doc_openwebtext_importance_length_correction": -794.44091796875, "rps_doc_wikipedia_importance": -669.9197387695312, "rps_doc_wikipedia_importance_length_correction": -669.9197387695312 }, "fasttext": { "dclm": 0.32426273822784424, "english": 0.848202645778656, "fineweb_edu_approx": 1.5571988821029663, "eai_general_math": 0.3706299066543579, "eai_open_web_math": 0.16804993152618408, "eai_web_code": 0.6911365389823914 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.455", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
613,049,995,612,684,400
8-Bit Operating Systems This was originally printed in the last issue of Link Magazine, and is reprinted here, with updates, by the author. I finally got off my duff and incorporated all the mail people have been sending me. A few more changes are yet to be made; keep that mail coming. Please do note that, as my consciousness of computer history expands, the title is becoming increasingly inaccurate. For example, I mention nothing of mainframe or minicomputer OSes (mostly due to ignorance) and so I should probably call this "Home Computer Operating Systems Through Time" even though not all of these OSes are purely home computer machines, particularly CP/M. The title is left for historical reasons, though. New changes were last made September 2003. If you have more information about these computer systems, or have info on other systems not mentioned, please mail the maintainer. Back to the Computer Workshops home page A BRIEF HISTORY OF OPERATING SYSTEMS THROUGH TIME by Cameron Kaiser Contrary to popular belief, God did not create the operating system in six days. If He had, it would have been much better than the ones we have now. Nonetheless, we got 'em, so we'd better learn 'em. While some operating systems, like the love-hate Unix, have been around since the early days of digital computing (read 1960's), most have appeared in the late 70's to the present time, varying from powerful multiuser OS's to little OS's that ran on 8 bit computers in under 64K of memory. This is just the briefest portion of operating systems, from then until now. To establish a point of reference, all computers must have an OS. The OS controls input and output; makes reasonable (questionable in some) effort to control peripherals; and in short acts as the interface between you the user, the software, and the hardware. Early on, OSes were individualized. Since computers were a rarity, the question of standardization was ignored, since there were so few computers to be standardized, and consequently the OSes were tied to the capabilities and purposes of each system. Not until the age of microcomputers, somewhere near the late 70's, do we begin to see any coherent pattern in the chaos. This is where our story begins, with: 8-BIT OPERATING SYSTEMS The first primary microcomputers on the block were the Commodore PET, the Tandy, and the Apple II. (There IS in fact an Apple I, but only 200 of them were ever manufactured. One of them hangs in Apple's offices with the label "Our Founder".) Perhaps it would be a good idea to look at how these respective companies fared in the OS world. Tandy is one of the great could-have-beens in the computer world. Their electronics chain, Radio Shack, is known worldwide. Their appliance clones and lines make huge profits. Yet Tandy never managed to crack the microcomputer world to any great degree because their machines were so badly underpowered. Tandy's first foray was the TRS-80 in its various incarnations. The TRS, when first introduced, was a hot seller because of (at that time) its powerful operating system and the increasing number of software applications for it. Where the TRS-80 fell flat was failing to keep state of the art: many new computers introduced enhanced video, or easier to use operating systems; the TRS kept its 80-column b&w (and damn hard to Correction: The original TRS-80 Model I had a 64x16 screen, though the Model II apparently did have the 80 column one. Thanks to Ricardo Banffy for the correction. Also, I should have been a little more circumspect when I said "underpowered" -- certainly when the TRS-80s first emerged, when their major competition was the Commodore PET and Apple I/II, they were most certainly not. Tandy's biggest problem was that they actively discouraged any third-party support for their machines, with little room for expandability and no assistance for developers. Commodore itself wasn't much better. People started gravitating towards the more hacker-friendly Apple computers about this time. Commodore realised its mistake, but Tandy, tellingly, did not. In fact, while many authorities will cite the early spreadsheet VisiCalc as the killer application for the Apple II, it was originally developed on the TRS-80. Presumably Tandy's developer-unfriendly stance made the developers start porting it, and it was on the Apple II that it started to take hold (later CP/M and MS-DOS). Thanks to Alex Censor. Neat Fact: Peter Norton's famous utilities collection, which is now sold by Symantec, was originally written for the TRS-80. Only later was it ported to DOS. (Alex encore.) read) screen and its cryptic TRS-DOS, which rapidly gained the moniker Trash-DOS. Tandy's next attempt was the CoCo line, going through the CoCo 1 to the CoCo 3. The CoCo 3 actually was a fairly good computer, with 128K, reasonable graphics and sound, complete downward compatibility with others in its line and fair support with Tandy. However, the CoCo was rapidly eclipsed by its primary competition, the Commodore 64 (which we'll see later) and when Tandy dropped it the CoCo faded away. Tandy now spends its time making underpowered PC clones. Update: Tandy no longer makes PCs, having now entered a licensing agreement with IBM to sell their Aptiva line. That seems to have folded too, though, because now I see Compaqs in my local shop. The Tandy PCs had somewhat of a different problem than the TRS-80s; by trying to top IBM's systems in features, they only succeeded in making them incompatible. (Thanks to Alex Censor.) The venerable CoCos are now officially unsupported, as near as I can determine. Color Computers were powered by the many variants of the famous Motorola 6809 and the 6847 video chip (except the CoCo 3 which used the ACVC(?) and the 68B09E), and ranged in memory sizes up to 128KB. The Dragon series of computers, made by Belgian concern Dragon Data, were at least partially compatible with the CoCos -- BASIC programs could run, but for legal reasons memory mappings were different and so most of the games, which used ML, didn't. Apparently, the CoCos could be networked together. I myself used to assist a teacher who used a CoCo 3 as a fileserver and through cassette interfaces distributed programs to CoCo 2 clients in the classroom -- pretty neat, even in 1988. Many CoCos today run OS-9 -- see Multi-Platform operating systems. Tandy also rebadged computers for sale through their stores (and, for that matter, still rebadge just about everything else, including Casio keyboards and various audio components). Most noteworthy was the Model 100, a rebadged Kyocera machine with a small LCD screen, built-in BASIC, a built-in word processor, and a built-in term program for the internal 300 baud modem. The later 102 and 200 models followed. NEC also had similar machines, notably the 8201A and 8300, which were largely BASIC compatible but had different memory layouts. I might also mention the Tandy Pocket Computers; these heterogeneous devices were rebadged Casio and Sharp devices and resemble oversized calculators, but in fact were complete computers, could save and load from tape, and some could even print to tiny plotters and dot-matrix printers. My PC-4 weighs in at a flyweight 1.5K, even with RAM expansion, but the beefy PC-2 could accomodate much more RAM and had a very complete BASIC. The Apple II series, until officially discontinued, was one of the bigger success stories in the 8-bit market. Used all over in American school systems, and frequent in American households, the Apple II, going from the plain-vanilla version to the popular Apple IIe/c, was a staple in its class. The Apple has several OS's: Integer BASIC, which was a throwback to the old 48K Apple II; DOS 3.3, which was the most common of the DOSes used on the Apple; and the sophisticated but irksome ProDOS, which was Apple's last shot. Apple had the strength of a huge number of users and its massive software library, which encompassed cheesy games to powerful applications like AppleWorks, but the weaknesses of poor graphics, dumb peripherals (meaning they did not manage themselves, but had to depend on the host computer, a very poor arrangement), no sound above beeps at various frequencies, and above all a nasty price A raft of add-on boards (like the Mockingboard for sound) could correct these deficiencies, but there wasn't much software for them. tag. Apple made an attempt at recapturing the market with the beautiful but impractical Apple IIgs, which had some takers in the school systems, but with the advent of the Macintosh Apple phased out the II line. An Apple III was also manufactured, but it was not compatible with its more successful progenitors and was a miserable failure. The Apple II series also inspired a number of clones: the Franklin Ace and the Laser 128 series, which incorporated a number of useful gadgets, like mice, numeric keypads, etc. that Apple normally bled people for. After these became increasingly popular, Apple eventually sued them but it was not a big deal since Laser went to making PC clones and Franklin to its line of pocket dictionaries and encyclopedias. Clarification: You can read ProDOS volumes on a Mac, so this is at least one use for ProDOS. Apple still has FTP support for some 8-bits (mostly the IIgs) at their FTP repository. Several alternative operating systems exist, besides Quark Catalyst and GEOS. I have now been made aware of GNO/ME, which does best on the IIgs, and apparently an OS9 post exists, but I cannot confirm this. Apple did not lose any sleep over the graphics or sound capabilities of the 8-bits. But, as was mentioned, third-party manufacturers made a bevy of them. Most of today's development continues for the IIgs, which has a considerably more multimedia-friendly architecture (up to 4096 colours, which compared favourably with the popular Amigas of that time). The IIgs doesn't belong in this listing really because it's actually a 16 bit system based around the 65C816 (the big brother to the MOS 6500 series of processors that power the 8-bit Apple IIs, the Commodore 8-bit series and the Atari 8-bit series), but it has a built-in Apple II compatibility mode which the corresponding computers (Atari ST and Amiga) do not. Interestingly, the Commodore 64 can now be powered by the 65C816 with an add-on cartridge called the SuperCPU. Applesoft BASIC was widely regarded as one of the saner implementations of BASIC (but not Integer BASIC, which was irksome). In fact, it was copied practically identically in the Coleco ADAM. Update: Steve Jobs is back. After having started the company in his garage with Steve Wozniak (the 'Woz' on early IIgs models is his zany signature), Jobs was forced out by then-executive John Sculley over a power struggle in 1985, right as the Macintosh was trying to crack the market. Apple then fell on hard times as their market share dwindled. Jobs had not been idle, as he introduced his Unix workstation, the NeXT, in the interim. NeXT machines run a unique Unix like operating system which has made them popular in universities (and popular with 3-D games giant id Software, which used them to develop Wolfenstein 3D and Doom). Apple bought NeXT as an attempt to shore up their operating system development, bringing Jobs back into the corporate board. When then-CEO Gil Amelio was forced out in 1997, Jobs became acting CEO. Apple has since survived the Mac world's disapproval over a (so far :-) benign influx of capital and development promises from Microsoft, as well as the constant predictions of the company's immiment demise. Their recent releases, the G4 series of computers, are aiming for high end markets, which is probably wise granted that the largest complaint about Apple systems is their price, and reportedly they have exceeded their expected demand by almost 50% since their introduction. The iMac, their "all in a box" computer, has skyrocketed in sales, becoming one of the most popular computers of its year of introduction, and one that even has formerly hardened PC users defecting. Apple is now posting profits, and their innovator image has come back with a new and surprising facet: affordability. Whoda thunk it? Moreover, with the successful launch of OS X, which has Macintosh owners including myself drooling over the prospect of a true, hardcore, open source BSD Unix kernel wrapped in a sweet GUI like Aqua, Apple has finally demonstrated they're willing to bring power to the people combined with adherence to standards at a good price best of all. OS X dodges the stability and multitasking flaws that plagued earlier versions of MacOS, and also is the first Unix in my opinion to successfully translate the power of a high-performance network operating system onto a home desktop and hide the depths of Unix away from novice users who think they're just using a really cool-looking computer, yet still let a power freak like myself at /bin/tcsh if I want my CLI. Eat that, Windows XP. The DVD and CD-burning issues should be corrected, if not already, very soon now. Neat Fact: The operating system for the Apple III was called SOS. Given the computer's miserable failure in the market, it looks like the name was appropriate. Neat Fact: A hardware add-on for the Commodore 64 called the Spartan Mimic could make the 64 into a fully functional Apple II. As the two systems are largely dissimilar -- even down to the CPU level, as 64s are powered by a 6502 variant called the 6510, while Apple IIs use the various classic 6502 varieties (the NMOS 6502 and the 65C02) -- the box, which occupied all the ports on the 64, was essentially an Apple II in a case without keyboard or monitor, and cost as much as you would expect (i.e., a lot). The idea was neat, but the cost was horrific. Moreover, 64 peripherals, since they are "smart" devices (see below), needed modification to work with it, making the total system cost even pricier. Consequently, the device fared badly, and is virtually forgotten. If anyone has one of these boxes, please let me know. Neat Fact: Apple Computer began life with a very, very big trademark dispute with, of all people, the Beatles. Beatles records are distributed by music conglomerate EMI (on their Parlophone line), but the Beatles mark is actually called Apple Records. Apparently, Apple Records was guaranteed by Apple Computer that they would never go into the music business, so Apple Records dropped their trademark infringement suit. But when Apple Computer brought its CD-ROM drives out for the Macintosh, Apple Records brought back the lawsuit (perceiving the CD-ROMs as evidence of existence in the music market, supposedly). Presumably it has been settled. Apple has some more history links on their very own Apple History page. In fact, they linked this one. :-) However, these two behemoths pale in comparison to what for a time was the big boy on the block: Commodore Business Machines. When Commodore first introduced the PET, it was fairly popular, but not as much as when it went into its color 8-bit line, with the VIC-20, the 64 (which even as late as 1991 was still selling at the rate of 6-7 million units worldwide), and the 64's bigger brother, the 128. The contemporary Commodore OS (read: 64) was based around its version of BASIC. All commands to peripherals, which were "smart" (having their own memory, processor and handlers), were done through BASIC; the computer started up in BASIC; and BASIC was built into ROM. The Commodore 64 wowed the world as a wonderbox when it first arrived in 1982, with the then extraordinary 16-color graphics, 3-voice sound, and bankable memory based around the efficient MOS 6500 series (specifically, the 6510). (Believe it or not, a 16-bit variant of the 6510, the 65816, powers the Super Nintendo.) Since the BASIC did not have the custom commands to manipulate many of the advanced features the 64 had, a number of add-ons appeared: fastloaders to improve (sometimes to massive ratios) the speed of the miserable 1541 disk drives; BASIC extensions of all sorts, from the pitiful Simon's Basic to bigger development systems like Epyx Programmer's Toolkit; and hardware enhancements, such as RAM expansions, high-speed RS232 boxes and interfaces to non-Commodore printers. Another key was the GEOS operating system, made by Berkeley Softworks (now GeoWorks). Although it was slow, clunky, crash-prone and belligerent, it has developed a loyal following because it presents a powerful 80-column Mac-like GUI on the 64. Huge amounts of software exist for it, from games to powerful business programs. The 64 can even GEOS gets its own entry under Multi-Platform at the end; read on. behave like a PC or Unix box: programs like CS-DOS and the powerful A64/OS and LUnix operating systems convert the 64 into smaller versions of their LUnix continues to be developed, now boasting TCP/IP abilities and a true PPP client. Visit its home page and download it. bigger competitors. The 64, while officially put to rest somewhere back in the early 1990's, finally and abruptly got the boot when CBM declared bankruptcy last year, but millions are still in use. "Last year" is 1994, although it may have actually been a bit earlier. The Commodore 128, its bigger and better cousin, did everything the 64 did, including CP/M (discussed later), 80 column video, its own The 128 probably sold as well as it did because it was 64 compatible. version of GEOS, and had all the BASIC commands necessary to take advantage of its capabilities. While not as big a seller as the 64, it has developed a big following in its own right. Commodore's other 8-bits, including the Plus/4 and the 16, were disasters because they were not compatible with the 64, and thus never hit the market with any great interest. Commodore also developed the Amiga series. Update: After Commodore's demise, the company (mostly the Amiga) was bought by Escom GmBH. Escom itself folded, and amidst an abortive attempt to buy the Amiga trademark by American company VisCorp, the Amiga line was bought by Gateway, the PC clone manufacturer. After the typical corporate dillydallying and very little actual tangible product, the license was in turn granted in January 2000 to a new Amiga Corporation (the former Amino Development), and they are, yet again, working on another Amiga. Time will tell. As for the prior Amigas, version 3.5 has since emerged. It is the last version of AmigaOS to support the 68K microprocessor; 3.9 has also been released, but it requires a PowerPC upgrade. The Commodore 64, on the other hand, is also in Gateway's bag of stuff they got from the Amiga acquistion. But the Commodore name is actually owned by Tulip Computers BV (there's a web site). Commodore Computers BV, the resurrected company, sells PC clones, but no one has really done anything about the 64 itself. Unfortunate, as the next generation of Commodore peripherals is appearing, including an expansion card that upgrades the 64 and the 128 each to 20 MHz and up to 16 MB addressable. Hard drives up to several GB in size have been available for some time as well, so maybe the time is ripe for the comeback of a new, tougher 64. Creative Micro Designs, the company responsible for much of these add-ons, has become a big name in the remaining Commodore scene for their continued hardware support. However, be sure you don't confuse the real 64 with a pretender. The Web.it Commodore 64 carries the Commodore logo and the 64 badge. Inside, it is actually a low-end 486 with ROM-based software and a specialised version of the CCS64 emulator. It doesn't use any of the Commodore peripherals, and to get it to read Commodore disks requires the X1541 cable and a Commodore disk drive. For that reason, the grizzled hackers like myself who have stuck with the old unit regard it as nothing more than an overpriced WebTV with a word processor, but to be fair it shows the amount of respect the C64 has engendered and also may introduce new people to this classic platform. Unfortunately, it has failed to sell anywhere near expected levels and the company is now apparently nowhere to be found. More Information: Jack Tramiel, the original founder of Commodore Business Machines (back when they made typewriters and calculators), defected to Atari shortly after Commodore entered its 'salad days' period and bought them from Warner Communications during the great mid-1980s video game crash. Predictably, Commodore started taking its nosedive soon after the 128 peaked. Atari, however, did not benefit from Tramiel's success at Commodore, and it too could not fight the onslaught of IBM and Microsoft. Tramiel's name was never associated with a business success story again. See the Atari entry for what happened to Jack's business acumen after. When comparing absolute brand names (not OSes, like Wintel), the Commodore 64 is still the best selling single platform in the world. No other single computer model comes close. Neat Fact: Most authorities agreed -- the Commodore 64 had probably the worst BASIC dialect ever to grace an 8-bit. In actuality, the 64 really has a very simple, unspectacular implementation with no special support for the 64's then-extraordinary graphics and sound hardware (compare with Applesoft and Atari BASIC, which had such commands from the get-go). Commodore realised this deficiency very quickly and introduced add-ons such as Simon's BASIC for the gap; future models of Commodores, including the 16, the +4, the 128, and the Amigas, would all have enhanced BASICs designed to show off Commodore's multimedia supremacy. Neat Fact: Microsoft wrote the original BASIC for the Commodore PETs, but this was back in the day when Bill Gates hadn't as much money and the struggling company agreed to offer Commodore a one-time license to use the BASIC in their computers. Boy, betcha Bill Gates kicks himself now, after all the copies of a later version of the code appeared in those millions of C64s. To be sure, Commodore significantly rewrote the BASIC for the VIC-20, and that version became the basis of the BASIC in the 64, 128, Plus/4 and others. But turn on a 128, and what do you see? (C)1977 MICROSOFT. Despite this nod to the OS's history, Gates never got a penny. Cry for him, won't you? Neat Fact: It is widely believed to be a myth that the 64 was responsible for the rise of America Online. Surprise: it's the truth. The original online service AOL came from was a 64-exclusive networked BBS system called QuantumLink, which was a merger of Steve Case's QuantumLink (ring any bells? Steve Case? Mmmm, Steve Case?) and a early online gaming service called PlayNet. QuantumLink did in fact continue until the early days of America Online, but was abruptly cancelled to the frank irritation of the 64 users on it (consequently, Steve Case is regarded as somewhat less than cow dung in most hardcore 64 groups). Proof? Most of the old PlayNet architecture was never modified. Ever wonder why you are restricted to a 10 character name? That was a PlayNet decision so that they could fit four names to a Commodore 64 40-column line. It has never been changed since. Neat Fact: The most well-known brother to the Commodore 64 is the Commodore 128, a minor hit in its own right (I have a 128DCR, one of the models with an integrated disk drive). There is, in fact, a Commodore 65, a mythical model developed in Commodore's RandD labs with Amiga-quality graphics, a C64 compatibility mode, and a built-in 3.5" disk drive. When Commodore was liquidated in '94, some of these prototypes escaped and were sold off to warehouses (several hundred or so, from complete systems to motherboards). You can get more information on them from here. Neat Fact: Most movies show the very unrealistic scenario of some computer program that can cause actual physical hardware damage to chip components. (Forcing HD crashes isn't that hard. ;-) This is just about impossible to do in real life -- except in later model Commodore PETs, where a single POKE (memory store) to a video chip location can fry the entire video subsystem. Older PETs allowed you to run the system at a higher refresh rate and get a free speed boost. When Commodore fixed this anomaly, the POKE would still run the higher refresh rate which the video controller could no longer cope with. Hence, warped screens, and after a couple of minutes, no screen at all -- even if you turned it off and back on, the damage is permanent. Yikes! Other 8-bit systems of note: Texas Instruments' TI/99 series were another of the big should-have-been-but-wasn'ts. Burdened by total incompatibility with anything else, suffering terrible graphics and sound, and a non-standard BASIC, the TI/99's developed a small following that Correction: Actually, the TI 99/4's had more than adequate graphics output. However, the 4 series was designed by TI's Consumer Products division, and therefore crippled down for the home market. None of its special features were accessible to the casual programmer. Extended BASIC addressed some of these shortcomings, and even supported sprites, but TI's lack of good support and the Commodore 64 were the knockout punch. Thanks to Tom Wills' TI mailing list for this information. Update: There is a more advanced variant of the TI 99 series called the Geneve, manufactured by Myarc. The Geneve is largely, but not wholly, compatible with its progenitor. (Full name, the Myarc 9640.) More Information: One of the most baffling things about the TI is that its CPU, the TMS 9900, is in fact a 16 bit processor, and it deals in 16-bit quantities internally; but, it only exposes eight lines to the system, and multiplexes them instead for the full 16 bits. The Tomy Tutor is in fact a TI "clone" -- it too is based on the 9900 (actually a faster variant, the 9995), but Tomy played the 16-bit angle up to ridiculous proportions, using this as their marketing ploy in the increasingly then-glutted 8-bit market. (As a note, the 9995 also has a multiplexed bus, but this is built into the chip, not handled externally as in the 99/4A.) In fact, the TI chip set powered several computers -- 9918 variants apparently powered the Tutor and the ADAM, as well as an obscure system called the Sord. Here's the only comprehensive Tomy Tutor site (if I may say so myself, since I wrote it). was quickly alienated when TI hastily cut their losses and dropped the line. TI now makes calculators, which it used to do and should have stuck with, and also a very good line of laptops, leaving a discouraged following behind. Neat Fact: TI BASIC is double-interpreted. Not only is your program interpreted by the TI BASIC interpreter, but the interpreter is itself interpreted, written in a special language called GPL (Graphics Programming Language)! Thus, TI BASIC is dog slow compared with other classic micros. The Tomy, on the other hand, has an interpreter fully written in 9995 machine language, so it blows away its progenitor. I suspect that the Tomy graphics language GBASIC is really GPL in disguise, however, so GPL lives! Another computer that might have hit it big was the Sinclair, a fairly well endowed system that would have hit it big in Europe were it not for the spectre of the Commodore 64, which in fact doomed many potential competitors in Europe during the early 1980's. The Sinclair's reasonable graphics capabilities and friendlier style of usage were eventually eclipsed by CBM UK, along with the BBC's Acorn, which should never have got out the door. Clarification: The Sinclair was sold in the States by Timex, but Timex didn't want to challenge the 64 on its home turf. Thus, the Sinclair is really only well-known in the UK. The US models were the 1000, 1500 and 2068; the 1500 and 1000 were more or less direct clones of the ZX-81 (see below; the latter with built-in RAM expansion), but the 2068 was its own beast and only marginally compatible with the UK Spectrums, its closest relative. A converter cartridge was required to allow the 2068 to use Sinclair software, and this incompatibility was the 2068's Achilles heel. More Information: Well-endowed is as well-endowed does; I oversimplified grossly. There is a massive line of Spectrums, from the ZX-80 to the QL and the top-of-the-line Spectrums. At the low end are the ZX-80 and ZX-81, with no graphics capabilities of any sort, fully B/W, and a whopping 1KB (!) of memory. The ZX-80 is very rare, but the ZX-81 was a smash hit in Britain, and was released in the States as the Timex Sinclair 1000. You could not type BASIC keywords in by hand, as it appears -- the keywords were on its horrid membrane keyboard, and you had to type them in with key combinations instead. Well, I think it's horrid on my TS1000, but Sinclair owners have been lecturing me that it was really very functional. Whatever. :-P Neat Fact: The ZX-80 series were terribly slow, despite a 3.25MHz Z80 CPU. To reduce chip count, the designers made the Z80 handle everything, including keyboard and, tellingly, display. When the ZX-81 emerged, the developers allowed the screen update to be turned off and called this FAST mode. (Another important advancement was floating point, which was not in the ZX-80 BASIC either.) Thanks to Rich Dunn. The ZX BASIC interpreter was a marvel of programming in that it worked with programs crammed into the 1KB of RAM so well -- there was even a MicroChess implementation (as was there for the old MOS KIM-1). Nevertheless, the 16KB RAM expansion was the most popular peripheral. The colour Spectrums started at 16KB of RAM and maintained the maddening BASIC keyword combination quirk of the ZX-80s. Spectrums had reasonable resolution but a bizarre colour clash quirk that became the classic hallmark of Spectrum games. In spite of its horrid I/O, the BASIC quirks, the nutty graphics and the non-existent sound, the Spectrum enjoyed popularity in the UK almost on par with the Commodore 64, much to Jack Tramiel's chagrin and Clive Sinclair's glee. In the US, Timex tried to get that same popularity by releasing the Spectrums as the Timex Sinclair 2068. Unfortunately, because of the 2068's compatibility problems and the 64's established supremacy in the US, the 2068 never achieved its potential. Most Sinclair support, thus, is limited to Europe. Later Spectrum models introduced enhanced sound, but the graphics became a byword in the Sinclair community. Neat Fact: The Spectrum+3 was noteworthy for finally allowing the user to type BASIC keywords out in full, but this was because the keywords were now no longer printed on the keyboard. A compatibility option offered users the ability to continue using key combinations for BASIC keywords, but since the keywords weren't printed anymore, users had to do them from memory! Neat Fact: The Spectrum+ has a detachable keyboard. Literally. If you turn a unit upside down, all the keys will fall out. The Sinclair QL doesn't really belong here, as it wasn't a Spectrum or ZX system (in fact, it's actually 16-bit, based on the Motorola 68008), but it is worth mentioning for its unique microcassette drives (with a pathetic 100K, mediocre in 1984 and terrible later) which though small were quite fast, and the QLAN networking system. QL was supposed to stand for 'Quantum Leap' but Sinclair's manufacturing tardiness branded it the 'Quite Late'. Its software was written by Psion. Apparently, its BASIC was quite good as well (presumably the key combinations were no longer needed). Neat Fact: Sinclair picked up quite a lot of bad blood over the QL. Although introduced January 1984, the machine did not ship until May, but orders were still taken and checks cashed anyway -- at 399 UK pounds a pop! Worse, early models had a case too small to accomodate all the components, so a tacked-on portion hanging out the back of the unit covered the remainder. Acorn is a company in its own right. Today they make the Archimedes, a wonderful computer that survives in the British education system. More Information: There are several Acorn systems as well. The Acorn Atom was a kit computer based on the 6502, introduced 1981; the BBC series of computers were based on the 6502A and differed only in memory and enhanced graphics, similar to the Spectrum series, from the model A (16K, 320x256x2 or 160x256x4) to the B+ (64K and a new 640x256x2 mode), introduced 1981 and 1985 respectively. Today's Acorns are based primarily on the ARM processors, a RISC architecture with some similarities to the 6502. Not to be outdone, Atari was probably the first computer in your home, although you might not have recognized it as such. When Nolan Bushnell released his wildly popular Pong, this primitive dedicated system wormed its way into the hearts and habits of happy Americans. The 2600, 5200 and 7800 video game series made addicts out of many a kid (including me). And, for a time, Atari did at least as well as its competitors with its hundred line: the 400, 600, 800 and 1200 series computers. Carrying fair graphics, good sound, a reasonably efficient DOS and a good number of applications, the Ataris did well until their faults started bubbling to the surface. By not adhering to the Microsoft BASIC standard (e.g. Commodore 64, Apple II), Atari seriously shot themselves in the foot, and its graphics and sound capabilities were overshadowed by the 64's. In addition, Atari just could not Clarification: People have been complaining that I don't give the Atari ANTIC graphics chip a fair shake against the Commodore 64's VIC-II. Here is my justification for the above statement. While the ANTIC has many, many more colours than the VIC-II's sixteen colour palette, the ANTIC modes are extremely limited on how many you can have on screen at once. At the highest resolution possible on the ANTIC (320x192) which is still smaller than Commodore standard hi-res (320x200), you get two colours only (one hue with two luminances according to my technical documentation), while the Commodore can still display all sixteen. Possibly a fairer comparison is Commodore multicolour (160x200) versus GRAPHICS 15 (160x192) but the ANTIC can still only keep four colours on the screen. In fact, to get sixteen colours from ANTIC onscreen requires you drop all the way to GRAPHICS 11 and 80x192; while the VIC-II does have an 8x8 colour limitation (2 colours per 8x8 cell at 320x200, 4 colours per cell at 160x200 -- but all cell colours are largely independent except for the background in 160x200, so there are no palette registers per se), all sixteen colours available to it can still be displayed simultaneously on screen in any graphics mode the chip can generate. Furthermore, interlaced graphics modes are possible on the VIC-II that completely do away with that 8x8 cell restriction and expand the palette to over 128 colours with some added CPU work. In addition, player/missile graphics, while certainly powerful, lack the flexibility of VIC-II sprites. There are only five players (vs. eight VIC-II sprites) and to get the missiles, you lose one player. Players can be 128 or 256 scanlines tall, which is definitely an improvement on the VIC-II (max size 21 scanlines or 42 in double-Y mode), but only eight wide (VIC: 24 pixels wide or 48 in double-X). The collision detection systems are roughly on par between the two systems, but Commodore sprites can also be hardware-resized (1x or 2x in X, Y or both), have flexible object priority (sprites can dynamically go behind or in front of the background independent of others), and can be either monochrome or be painted in three colours with a 2:1 reduction in horizontal resolution. And again, raster work is possible that can give you eight new sprites on every subsequent scan line -- potentially over 1600 in total, although they would be only one scan line tall, but 32-sprite effects are quite common and easy to manage with very little performance loss. One thing that the ANTIC does do very well is its display list capability, later taken by designer Jay Miner to the Amiga. You can generate complicated displays this way that at least to some degree circumvent the resolution and colour limitations in a fairly straight-forward manner. However, a Commodore can do this with a raster IRQ using interrupts generated by the VIC-II and clever code. To be sure, this is somewhat more complicated and requires more CPU overhead, but the ANTIC has no monopoly on this ability. With this all in mind, the VIC-II is by no means the winner by a mile, but I think it is the more powerful graphics chip feature vs. feature. The ANTIC is a very powerful chip as well -- make no mistake -- but the VIC-II does almost all of its features and with greater flexibility in general besides. Now, please don't start any POKEY vs. C64 SID (sound) arguments either. SID really was untouched for years until the modern OPL synths started appearing at the consumer level, and even then the SID held its own. No sound chip of that contemporary day had the SID's ADSR envelope flexibility, output quality, range of effects and hack power (as an example, a well-known voltage leak was exploited as a 4-bit digital sound output). None of this is meant to be an Atari slam -- I own two Atari 8-bits myself. Ataris have a faster clock speed than the Commodores, I like the convenience of a true MFM disk format, and Atari programmers have done ingenious things with their machines. But I think my conclusions are justified at least on this score. crack the home market (Commodore's zone), nor the school market (Apple's department). Its XL line (600XL, etc.) was also problematic in that it was almost, but not quite, compatible with its older brothers, requiring a Translator disk that did not quite fix the problem for some programs. Atari released a XE line, which was just a repackage of the 1200's, and its ST line, a 16 bit system. Correction: The difference between the XL series and the straight hundred-series is the presence of built-in Atari BASIC. The XE series required the translator disk. Thanks to Ken Bond for the correction. More Information: There are at least several alternative operating systems for the Atari that I have recently become aware of. A port(?) of Atari ST TOS (Tramiel Operating System, how egotistical ;-) existed (TOS was based on Digital Research's GEM, but I don't think the 8-bit version was), and there was also SpartaDOS, a UNIX like system that allowed external storage up to 10MB. Factory standard Atari DOS was called, with all the creativity Atari marketing could muster, "Atari DOS" and had a simple keyboard driven menu. DOS 3.0 was considered a lemon because it didn't read 2.0 disks, so Atari, which was apparently under Tramiel control at the time, released Atari DOS 2.5 with the XE line (and this seems to explain the need for the translator disk). Some neat toys that Atari never released can be seen at www.atari.nu. Thanks to "SulfurFury" for this additional information. When Atari was sold to Warner Communications, it eventually faded away. However, its video game division, Atari Games, is still out there sucking up your quarters. Update: Atari Games, including the Tengen consumer division, has been bought by Williams Corporation as part of their video games enterprise, which includes what used to be Bally Midway, but this was not the fate of Atari itself. According to the American government Securities and Exchange Commission, JTS Technologies, which owned the remainder of Atari after it folded (hint: JTS stands for Jack ...), sold their remaining interest to Hasbro, the American toy manufacturer, for $5 million on 23 February 1998. Hasbro created a new division of their Hasbro Interactive line for their new properties; the new subsidiary had the Atari name and carried the rights to the 2600 through 7800 consoles, the Lynx Jaguar, the Atari 800, the ST (and TOS), the 8-bit operating systems (thus Atari DOS) and the Portfolio palmtop. More significantly, most of the classic Atari games, including Centipede, Asteroids, Battlezone, Missile Command, Tempest and the venerable Pong, became service marks of Hasbro (apparently these were not sold to Williams with the rest of the video games division) and the new Hasbro-powered Atari wasted no time in licensing or converting many of them into new PC games. Check them out at your local software store, as many are still available. There still seems to be some issues on JTS's absorption of Atari's debt (apparently JTS took more than $50 million in debt absorbed from Atari) -- shareholders questioned the low sale price to Hasbro as evidence of skulduggery or a straight-out fire sale. After several years in the software business, Hasbro decided they didn't like the market either and sold off Hasbro Interactive on 29 January 2001 for $100 million to French software concern Infogrames. The deal not only included all the old Atari service marks and games, but also legendary developer MicroProse and over 250 software titles. Infogrames also gained exclusive rights to develop software based on Hasbro properties as part of a long-term licensing arrangement. Infogrames has not announced what they intend to do with Atari, but it seems unlikely the hardware will be resurrected. "Catch-All Department" People have told me about computers I totally forgot. Since most of these ran their own proprietary operating systems, I'll put them here. Coleco ADAM Thanks to Gavin Gregor Young. The ADAM computer was the followup to Coleco's fairly successful ColecoVision machine -- in the true sense of the word, too, as apparently it came as both an upgrade to the ColecoVision and as a standalone machine, powered by a Z80A system that was CP/M-like (fairly probable given the processor), and a CP/M for it is known to exist -- there is even a WordStar version hacked for the 32-characters per row display! It used the infamous TMS9918A video chip, variants of which powered the Sord (!), the TI series and the elusive Tomy Tutor, and had 64K of RAM. ADAM was noteworthy for having a large amount of ROM, mostly for its built-in word processor (but you had to read in BASIC from disk or tape -- puzzle), the power supply built into the printer (in fact, ADAM didn't work without it, so it came with one :-), and two built-in digital cassette drives. These drives were also a source of some frustration as they could use regular audio cassettes, but you needed to get them formatted by Coleco first. However, they could hold a whopping 256KB on each cassette, and if you connected up floppies at 320KB a pop, you would have a gargantuan (in 1983) 832KB of mass storage. Not bad! More intriguing was that the ADAM's cassettes had probably the world's only random access tape system -- it had a directory placed strategically on the cassette in such a way that the drives could spin through to it and locate things at almost disk-drive speed, a novelty then and pretty neat now. ADAM's BASIC was based on (of all things) Applesoft BASIC, so if you typed 10 HOME on an ADAM, it would do what you expect when you RUN it. Neat Fact: ADAM apparently generated a massive electromagnetic surge on start up. You won't go into warp yourself, but any data on the tapes inside your tape drives might. ADAM was terribly unsuccessful, since it lost big to the rampaging 64. However, it enjoys a terrific amount of support (check out The ADAM Resource), and people have supposedly created IDE hard drives, 2MB RAM disks, 80-column cards, and additional printers for it. Even more startling was a note from Scott Gordon who told me about the 40MB (!) hard drives designed for the ADAM. Wow! Ohio Scientific Challenger IP Russ Adams tells me about this unusual 6502 based system from the late 1970s. Its operating system was BASIC, but had a built-in ML monitor and could generate a black-and-white TV display with its 4K of RAM (max 8K). In 1978, it was succeeded by the IIP. 8-BIT MULTI-PLATFORM OPERATING SYSTEMS All the previous systems were localized to one computer, and often hardcoded into memory. Here are those operating systems that managed to make the jump from single-system to multi-system. GEOS, which was previously mentioned in reference to the Commodore 64, also had an incarnation for the Apple II, which was done in by Quark Catalyst. Catalyst was sponsored by Apple itself, which was probably the reason for Apple GEOS's demise, even though Catalyst was even clunkier than GEOS was. GEOS was also released for the MS-DOS line, since it would run on older systems scorned by Windows, but PC-GEOS, as phenomenally powerful as it is, was eventually run down into a footnote in the PC GUI wars. Update: After stagnating in abandonware hell, PC-GEOS developer Berkeley Softworks (later GeoWorks) sold the core and applications to New Deal. Today's New Deal is everything the original PC-GEOS was, but now includes Internet applications and a sophisticated desktop. A free evaluation version is now available. Do note that PC-GEOS is related to its 8-bit cousins in name only. Apple GEOS was actually supposed to be compatible with Commodore GEOS, but this was never realised. Commodore GEOS survives today. It is still manufactured and sold by licensee Creative Micro Designs, and two new versions have appeared: Wheels and MegaPatch 3. Both of these are unofficial upgrades and require an older version of GEOS. The MSX standard was another multisystem standard that was supposed to be the Japanese invasion during the mid 80's. Computers like the Tomy Tutor (the what? well, I have one of them ;-), the Yamaha XS, and a number of other systems adhering to this standard were doomed by none other than the 64, which in a fit of marketing expertise or dumb luck was selling at its peak when the MSX line was introduced. More Information: The MSX was a chipset standard based around the Z80 CPU, and all inherited similar music and graphics capabilities. Paul te Bokkel writes that the ROM BIOS was also standardized between generations. The first three MSX generations (MSX, MSX2 and MSX2+) were all based around varying CPU speeds and RAM size with the MSX2 carrying 128K of RAM and 128K of video RAM, better video (I would guess the TMS 9958 by this time) and sound, and with help the Z80 could run as fast as 7MHz (stock speed 3.5). The MSX2+ was even faster. The original MSX had 32K BASIC ROM (written by Microsoft!), 32K RAM minimum (with 64K you could run CP/M or MSX-DOS) and 16K video RAM, presumably powered through a version of the TMS 9918. The later Turbo-R doesn't really belong here as it had a 32-bit Zilog CPU and Paul notes that the series had pretty much died by this point in Europe. Paul adds that they were in general cross-compatible with two major exceptions: Philips' MSX2 systems had a different memory layout from Sony systems, for one, and the Spectravideo, which was advertised as MSX compatible, wasn't fully such although many programs would still run on it. The SV was notable for including CP/M, not MSX-DOS. Sharp, Mitsubishi and Panasonic were other MSX manufacturers. MSX stands for MicroSoft eXtended. Correction: The Tomy Tutor is not an MSX box. It is a TI-like architecture. OS9 was an operating system that was one of the few, if not the only, multitasking, multithreading, and, if you're lucky, multi-user operating systems extant for an 8-bit system. Running in Correction: It is singlethreading only, although later versions might have fixed this (?). Someome with more info, please mail me. some versions for 6809 based systems, like CoCos, where it has attracted a fierce fan club, for 68000 systems like Atari STs, and even for the Apple II, OS9's fault was being branded a CoCo system only (which it was primarily) and attracting a bad rep. In addition, applications were not cross compatible. OS9 nowadays runs on almost all of the TRS-80 line that is still in use, and on the occasional ST (mostly in Europe). Actually, CoCos, not TRS-80s. An OS-9 clone is emerging called Nitros-9 which promises faster speeds and 99% compatibility. The big mama of the multi-platform 8-bit OSes was CP/M, however, which nearly replaced MS-DOS as the default OS for the PC were it not for an upstart software company from Redmond, Washington that did a better PR job (guess who?). Developed by Gary Kildall's Digital Research in the mid 1970's, CP/M was the first standardized OS ever created for microcomputers. CP/M had a standard set of commands, (eventually) a standardized DOS, and even standardized system utilities from one implementation to another. In its heyday, CP/M was supported by companies as diverse as Kaypro, Cromemco Correction: Well, no, not Cromemco; Cromemco's CDOS was only roughly based on CP/M. While CP/M's standard complement of twenty-seven I/O calls were supported by CDOS, Cromemco further extended it to the point where CDOS could run CP/M applications, but not vice versa. This was further complicated by the fact that programs written specifically for the 4MHz Z80 in the Cromemco would not run on earlier 8080s, even those that did not use the extra CDOS I/O calls, and, because of format-level incompatibilities, CDOS could read other CP/M disks only in single-sided, single-density mode. Thanks to Helmut Liftin, a former Cromemco engineer, who should know. By the way, someone is out there using the Cromemco name, but it has nothing to do with the original company. and even Apples and Commodores, which could emulate it with an add-on in the 64 and Apple II and could be a full-on CP/M box on the 128. Disks between these systems (with the exception of the 64 and Apple II) were even cross-platform readable, and because CP/M ran on the 8088 and Oops -- that's 8080. Z-80 processor series, the software would run exactly the same on all of the systems. CP/M even had versions for other processors, including CP/M-86, and other computers, such as the Apple II. With all this going for it, CP/M ought to have succeeded, but was beaten to the punch when it annoyed IBM, who was looking for someone to create the operating system for its new XT series, and gave the contract to Microsoft instead. The rest is history. Digital Research made an abortive attempt to return to the market with its GEM graphical system (which DID make a big hit on the ST, however), and now markets DR-DOS, a pleasant alternative to MS-DOS, albeit uncommon. Update: CP/M is now owned by Caldera. My most current information indicates that Digital Research as it was no longer exists. Charles Richmond points out that it is freely distributable for non-commercial use, but it is not PD or freeware. Gary Kildall passed away, apparently in 1994. We'll miss him. Back to the Computer Workshops Home Page 255790
{ "url": "http://www.armory.com/~spectre/tech.html", "source_domain": "www.armory.com", "snapshot_id": "crawl=CC-MAIN-2015-40", "warc_metadata": { "Content-Length": "52977", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:7U3PMMI7VV6MG26UG7Q27FOLHAUTVBHW", "WARC-Concurrent-To": "<urn:uuid:89dedc30-323a-4d8c-8e23-ee1604827b4c>", "WARC-Date": "2015-10-09T13:57:07Z", "WARC-IP-Address": "192.122.209.28", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:XXE3QOVFMTNPMR37BNWYVWH3PF2RBI5H", "WARC-Record-ID": "<urn:uuid:435ae4c1-db77-4443-b453-d19193dd2b39>", "WARC-Target-URI": "http://www.armory.com/~spectre/tech.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:312af57d-174e-41ed-b6fb-2b5594244d77>" }, "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, 24, 25, 288, 289, 717, 718, 893, 894, 935, 936, 937, 987, 1005, 1006, 1074, 1138, 1207, 1272, 1336, 1401, 1463, 1531, 1574, 1575, 1641, 1709, 1771, 1835, 1902, 1967, 2032, 2100, 2168, 2231, 2245, 2246, 2270, 2271, 2336, 2404, 2466, 2533, 2600, 2610, 2670, 2735, 2803, 2872, 2939, 2999, 3067, 3135, 3203, 3271, 3339, 3503, 3504, 4438, 4439, 4612, 4613, 4676, 4741, 4808, 4874, 4938, 5004, 5067, 5131, 5162, 5543, 5544, 6379, 6380, 7353, 7354, 7415, 7483, 7549, 7617, 7687, 7750, 7816, 7879, 7944, 8005, 8072, 8138, 8205, 8269, 8402, 8464, 8531, 8597, 8665, 8733, 8800, 8867, 8930, 8997, 9062, 9122, 9154, 9334, 9335, 9542, 9543, 10373, 10374, 10566, 10567, 10916, 10917, 11402, 11403, 12218, 12219, 13081, 13082, 13242, 13243, 14069, 14070, 14718, 14719, 14826, 14827, 14884, 14944, 15009, 15071, 15139, 15205, 15271, 15339, 15398, 15461, 15531, 15591, 15659, 15728, 15789, 15857, 15924, 15989, 16050, 16115, 16178, 16242, 16310, 16376, 16442, 16501, 16566, 16632, 16698, 16773, 16847, 16970, 17037, 17102, 17168, 17239, 17307, 17374, 17444, 17510, 17578, 17641, 17703, 17768, 17833, 17847, 18368, 18369, 18557, 18558, 19366, 19367, 20159, 20160, 20740, 20741, 20812, 20813, 20991, 20992, 21623, 21624, 22297, 22298, 23173, 23174, 23742, 23743, 24497, 24498, 24528, 24585, 24649, 24714, 24779, 25262, 25263, 25466, 25467, 25737, 25738, 26272, 26273, 26363, 26364, 26431, 26498, 26563, 26593, 27102, 27155, 27221, 27289, 27355, 27415, 27483, 27547, 28125, 28126, 28865, 28866, 29276, 29277, 29552, 29553, 30435, 30436, 30807, 30808, 30931, 30932, 31515, 31516, 31888, 31889, 32026, 32027, 32533, 32534, 32595, 32662, 32726, 32794, 32860, 32924, 32989, 33054, 33109, 33170, 33234, 33295, 33359, 33424, 33614, 33615, 34882, 34883, 35946, 35947, 36466, 36467, 36769, 36770, 37200, 37201, 37516, 37517, 37581, 37638, 37704, 37771, 37838, 37900, 37908, 38113, 38114, 38497, 38498, 39001, 39002, 39032, 39098, 39166, 39396, 39397, 40688, 40689, 41285, 41286, 41309, 41310, 41449, 41450, 41462, 41463, 43118, 43119, 43291, 43292, 43678, 43679, 43709, 43710, 43965, 43966, 44005, 44006, 44073, 44134, 44195, 44253, 44319, 44386, 44453, 44518, 44586, 44647, 44703, 45016, 45017, 45184, 45185, 45422, 45423, 45483, 45551, 45616, 45683, 45750, 45815, 45831, 45965, 45966, 46565, 46566, 46717, 46718, 47056, 47057, 47119, 47120, 47155, 47156, 47232, 47233, 47294, 47356, 47424, 47555, 47556, 47619, 47686, 47753, 47812, 47880, 47946, 47980, 48104, 48161, 48228, 48286, 48354, 48419, 48479, 48547, 48613, 48674, 48691, 49459, 49523, 49597, 49674, 49741, 49762, 49828, 49893, 49960, 50028, 50093, 50157, 50217, 50284, 50352, 50417, 50427, 50667, 50668, 50730, 50731, 50732, 50773 ], "line_end_idx": [ 24, 25, 288, 289, 717, 718, 893, 894, 935, 936, 937, 987, 1005, 1006, 1074, 1138, 1207, 1272, 1336, 1401, 1463, 1531, 1574, 1575, 1641, 1709, 1771, 1835, 1902, 1967, 2032, 2100, 2168, 2231, 2245, 2246, 2270, 2271, 2336, 2404, 2466, 2533, 2600, 2610, 2670, 2735, 2803, 2872, 2939, 2999, 3067, 3135, 3203, 3271, 3339, 3503, 3504, 4438, 4439, 4612, 4613, 4676, 4741, 4808, 4874, 4938, 5004, 5067, 5131, 5162, 5543, 5544, 6379, 6380, 7353, 7354, 7415, 7483, 7549, 7617, 7687, 7750, 7816, 7879, 7944, 8005, 8072, 8138, 8205, 8269, 8402, 8464, 8531, 8597, 8665, 8733, 8800, 8867, 8930, 8997, 9062, 9122, 9154, 9334, 9335, 9542, 9543, 10373, 10374, 10566, 10567, 10916, 10917, 11402, 11403, 12218, 12219, 13081, 13082, 13242, 13243, 14069, 14070, 14718, 14719, 14826, 14827, 14884, 14944, 15009, 15071, 15139, 15205, 15271, 15339, 15398, 15461, 15531, 15591, 15659, 15728, 15789, 15857, 15924, 15989, 16050, 16115, 16178, 16242, 16310, 16376, 16442, 16501, 16566, 16632, 16698, 16773, 16847, 16970, 17037, 17102, 17168, 17239, 17307, 17374, 17444, 17510, 17578, 17641, 17703, 17768, 17833, 17847, 18368, 18369, 18557, 18558, 19366, 19367, 20159, 20160, 20740, 20741, 20812, 20813, 20991, 20992, 21623, 21624, 22297, 22298, 23173, 23174, 23742, 23743, 24497, 24498, 24528, 24585, 24649, 24714, 24779, 25262, 25263, 25466, 25467, 25737, 25738, 26272, 26273, 26363, 26364, 26431, 26498, 26563, 26593, 27102, 27155, 27221, 27289, 27355, 27415, 27483, 27547, 28125, 28126, 28865, 28866, 29276, 29277, 29552, 29553, 30435, 30436, 30807, 30808, 30931, 30932, 31515, 31516, 31888, 31889, 32026, 32027, 32533, 32534, 32595, 32662, 32726, 32794, 32860, 32924, 32989, 33054, 33109, 33170, 33234, 33295, 33359, 33424, 33614, 33615, 34882, 34883, 35946, 35947, 36466, 36467, 36769, 36770, 37200, 37201, 37516, 37517, 37581, 37638, 37704, 37771, 37838, 37900, 37908, 38113, 38114, 38497, 38498, 39001, 39002, 39032, 39098, 39166, 39396, 39397, 40688, 40689, 41285, 41286, 41309, 41310, 41449, 41450, 41462, 41463, 43118, 43119, 43291, 43292, 43678, 43679, 43709, 43710, 43965, 43966, 44005, 44006, 44073, 44134, 44195, 44253, 44319, 44386, 44453, 44518, 44586, 44647, 44703, 45016, 45017, 45184, 45185, 45422, 45423, 45483, 45551, 45616, 45683, 45750, 45815, 45831, 45965, 45966, 46565, 46566, 46717, 46718, 47056, 47057, 47119, 47120, 47155, 47156, 47232, 47233, 47294, 47356, 47424, 47555, 47556, 47619, 47686, 47753, 47812, 47880, 47946, 47980, 48104, 48161, 48228, 48286, 48354, 48419, 48479, 48547, 48613, 48674, 48691, 49459, 49523, 49597, 49674, 49741, 49762, 49828, 49893, 49960, 50028, 50093, 50157, 50217, 50284, 50352, 50417, 50427, 50667, 50668, 50730, 50731, 50732, 50773, 50779 ] }
{ "red_pajama_v2": { "ccnet_original_length": 50779, "ccnet_original_nlines": 398, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 2, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.40297794342041016, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0542139895260334, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.18239954113960266, "rps_doc_frac_unique_words": 0.2566153109073639, "rps_doc_mean_word_length": 4.748676776885986, "rps_doc_num_sentences": 417, "rps_doc_symbol_to_word_ratio": 0.00009544999920763075, "rps_doc_unigram_entropy": 6.342290878295898, "rps_doc_word_count": 8503, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.0037148899864405394, "rps_doc_frac_chars_dupe_6grams": 0.0029719199519604445, "rps_doc_frac_chars_dupe_7grams": 0.0016840900061652064, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.004953190218657255, "rps_doc_frac_chars_top_3gram": 0.004160679876804352, "rps_doc_frac_chars_top_4gram": 0.0009658699855208397, "rps_doc_books_importance": -4047.870361328125, "rps_doc_books_importance_length_correction": -4047.870361328125, "rps_doc_openwebtext_importance": -2697.997802734375, "rps_doc_openwebtext_importance_length_correction": -2697.997802734375, "rps_doc_wikipedia_importance": -1771.3125, "rps_doc_wikipedia_importance_length_correction": -1771.3125 }, "fasttext": { "dclm": 0.15171390771865845, "english": 0.9729322195053101, "fineweb_edu_approx": 1.930734634399414, "eai_general_math": 0.4369758367538452, "eai_open_web_math": 0.3240095376968384, "eai_web_code": 0.24060791730880737 } }
{ "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.09", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
7,608,757,466,180,000,000
晓道 晓道 四川 - 成都 注册于 2021-12-23 https://github.com/daog1 技术交流:https://t.me/realDAO 向TA求助 1186学分数 453 贡献值 52个粉丝 最近动态 2022-09-07 08:40 回答问题 这样写。 import asyncio import web3 from web3 import Web3 from web3.eth import AsyncEth url = "http://127.0.0.1:8080" async def GetNumber(w3): n = await w3.eth.get_block_number() print(n) if __name__ == '__main__': w3 = Web3( 2022-08-12 09:32 回答问题 谁叫你不用websocket订阅的呢。 2022-07-10 16:16 发表了文章 2022-05-26 09:49 回答问题 参考我这个答案。 https://learnblockchain.cn/question/3452 2022-04-25 13:43 回答问题 发tx,我给你看看,说明不是一个string类型 2022-04-20 18:28 回答问题 来了,写法有问题 java String h2 = Hex.toHexString("1".getBytes(StandardCharsets.UTF_8)); System.out.println(h2); //"31" h2 = "0x"+h2; String d5 = Hash.sha3(h2); System.out.println(d5); //0xc89efdaa54c0f20c7adf612882df09 2022-04-19 13:15 回答问题 先订阅log https://learnblockchain.cn/docs/web3.js/web3-eth-subscribe.html#subscribe-logs var subscription = web3.eth.subscribe('logs', { address: '0x123456..',//合约地址 topics: ['0x12345...'] //topics地址,在ethscan上看到的topics [0] }, function(err 2022-04-17 10:47 回答问题 这个问题可以,没人解答,我来试试 2022-03-20 14:39 发表了文章 2022-03-14 16:17 关注了问题 2022-03-13 16:22 回答问题 city1.goods[_goodsID]这么用 2022-03-13 16:10 发表了文章 2022-03-06 13:54 发表了文章 2022-03-02 13:06 关注了问题 2022-03-01 20:48 回答问题 语法错误,from没填地址 2022-03-01 19:41 回答问题 一直在学习 2022-02-27 12:37 发表了文章 2022-02-19 10:38 回答问题 其实还是验证v,s,r的,只是打包了成了一个65字节的bytes而已。 怎么打包的,可以看的,ECDSA使用,实现多签 (二) | 登链社区 | 深入浅出区块链技术 (learnblockchain.cn)里面的测试用例 function getSign( address to, uint256 _amount, uint256 pri ) public returns ( 2022-02-18 20:12 回答问题 查看bsc每次合并geth的日志,把他改的地方记下来,下载geth,再这么合并上去。 2022-02-18 19:56 发表了文章
{ "url": "https://learnblockchain.cn/people/6025", "source_domain": "learnblockchain.cn", "snapshot_id": "crawl=CC-MAIN-2022-40", "warc_metadata": { "Content-Length": "30261", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:O5M4TOHQZQKVMIDZSZQS7VMVQBIBROYR", "WARC-Concurrent-To": "<urn:uuid:3cf9f916-6489-4967-be3a-572c153356ab>", "WARC-Date": "2022-09-24T19:26:00Z", "WARC-IP-Address": "101.132.169.39", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:QJ6QIF75X2WVYILGIEJ2WDNZCVSHUGX3", "WARC-Record-ID": "<urn:uuid:7767602e-ba35-4797-826d-6cf85c35e243>", "WARC-Target-URI": "https://learnblockchain.cn/people/6025", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:baeb2eb1-d557-47f9-9d45-2b8e6883a5f1>" }, "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-172\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, 3, 6, 7, 30, 31, 82, 83, 89, 97, 105, 111, 112, 117, 118, 140, 141, 146, 147, 148, 163, 164, 176, 198, 228, 258, 283, 323, 336, 363, 378, 379, 401, 402, 422, 423, 446, 447, 469, 470, 520, 521, 543, 544, 569, 570, 592, 593, 607, 608, 609, 676, 715, 737, 772, 839, 840, 862, 863, 949, 950, 951, 999, 1032, 1094, 1110, 1111, 1133, 1134, 1151, 1152, 1175, 1176, 1199, 1200, 1222, 1223, 1248, 1249, 1272, 1273, 1296, 1297, 1320, 1321, 1343, 1344, 1358, 1359, 1381, 1382, 1388, 1389, 1412, 1413, 1435, 1436, 1547, 1548, 1549, 1567, 1583, 1604, 1620, 1639, 1640, 1662, 1663, 1706, 1707 ], "line_end_idx": [ 3, 6, 7, 30, 31, 82, 83, 89, 97, 105, 111, 112, 117, 118, 140, 141, 146, 147, 148, 163, 164, 176, 198, 228, 258, 283, 323, 336, 363, 378, 379, 401, 402, 422, 423, 446, 447, 469, 470, 520, 521, 543, 544, 569, 570, 592, 593, 607, 608, 609, 676, 715, 737, 772, 839, 840, 862, 863, 949, 950, 951, 999, 1032, 1094, 1110, 1111, 1133, 1134, 1151, 1152, 1175, 1176, 1199, 1200, 1222, 1223, 1248, 1249, 1272, 1273, 1296, 1297, 1320, 1321, 1343, 1344, 1358, 1359, 1381, 1382, 1388, 1389, 1412, 1413, 1435, 1436, 1547, 1548, 1549, 1567, 1583, 1604, 1620, 1639, 1640, 1662, 1663, 1706, 1707, 1729 ] }
{ "red_pajama_v2": { "ccnet_original_length": 1729, "ccnet_original_nlines": 109, "rps_doc_curly_bracket": 0.0011567400069907308, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.025423729792237282, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.006355930119752884, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.741525411605835, "rps_doc_frac_unique_words": 0.7894736528396606, "rps_doc_mean_word_length": 8.144737243652344, "rps_doc_num_sentences": 27, "rps_doc_symbol_to_word_ratio": 0.004237290006130934, "rps_doc_unigram_entropy": 4.592809677124023, "rps_doc_word_count": 152, "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.016155090183019638, "rps_doc_frac_chars_top_3gram": 0.022617120295763016, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -230.77395629882812, "rps_doc_books_importance_length_correction": -220.28463745117188, "rps_doc_openwebtext_importance": -118.91091918945312, "rps_doc_openwebtext_importance_length_correction": -118.91091918945312, "rps_doc_wikipedia_importance": -113.29309844970703, "rps_doc_wikipedia_importance_length_correction": -106.478515625 }, "fasttext": { "dclm": 0.9693944454193115, "english": 0.05246860906481743, "fineweb_edu_approx": 2.954676628112793, "eai_general_math": 0.1121792197227478, "eai_open_web_math": 0.006571889854967594, "eai_web_code": 0.30802881717681885 } }
{ "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": "332.87", "labels": { "level_1": "Social sciences", "level_2": "Economics", "level_3": "Finance" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "2", "label": "Partially Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
-5,902,695,834,728,278,000
New to the forums? Click here to read the "How To" Guide. Developer? Click here to go to the Developer Forums. New subnautica sub zero ... VR dropped. 2 Comments • RedRizlaRedRizla Posts: 8,058 Valuable Player ohgrant said:  I have confidence that it will remain a niche market just like 3D is and always will be. What I regard as silly are those that are into it because it's the current fad.   When you talk about 3D, it just became to expensive for the film industry to make all films like Avatar 3D. VR can be vastly improved upon with things like resolution, which is one of most gripes about VR right now. I also think VR will boom in 10 years time because it will be totally different from what we are seeing today. What is not to like about VR, if it has higher resolution screens and things like foveated rendering etc?  • ohgrantohgrant Posts: 399 Trinity    I see no angry posts or folks judging what others choose to play except one. I say kudos and salute to those that vote with their purchases on what is a good game to them. Personally Subnautica is not my type of game and would not have it in VR if it wasn't free in the first place. It is their choice not not to invest in VR and I'm OK with it.   I quit buying pancake games a few years back. I could play them in 3D or VR with Vorpx, but the trend for so many game franchises that I use to play is multiplayer only, no content or controller options. When those games fail on PC, there is nothing to do but wait and hope players show up. Most of those games are over 50 GB.   Judge others all you want, your perception of a good game is not mine. If it doesn't work in VR, it has no value to me and would just cost money and SSD space.   Kudos to the Subnautica devs that decided to port the game in VR in the first place to at least test it out.   Gigabyte  AB350 Ryzen 2700x, 16gb ddr 4 3200, 1080ti. Z800 HMD, DK1, DK2, CV1, Vive wireless, Quest, HP Reverb. Viewsonic 1080p 3D projector ASUS 3D vision monitor.  UAD Apollo interface, Yamaha studio monitors.   • Nekto2Nekto2 Posts: 375 Trinity edited February 2019 ohgrant said: When those games fail on PC, there is nothing to do but wait and hope players show up. Will you pay for players? If there will be startup to allow you to pay people for playing with you will you pay for that? What amount? It could boost VR development if some people could earn money on playing multiplayer games. And you will be able to select "no children", "no hard language", "I should win" ;) • Nekto2Nekto2 Posts: 375 Trinity RedRizla said: When you talk about 3D, it just became to expensive for the film industry to make all films like Avatar 3D. Not at all. Now we have almost any film in 3D (at cinemas only! not on TV). Most of them are "fake 3D" conversion. But who cares. None could see the difference. You could not show same 3D content in cinema and on TV. But you could in VR cinema :) • Nekto2Nekto2 Posts: 375 Trinity snowdog said: For that to happen the cost of adoption is going to have to come down and there's going to have to be adoption by the film and other entertainment industries such as sport. Or you should learn to pay more for VR content :) It could be Kickstarter campaign. VR community will pay enough money before company will start VR game development. • RedRizlaRedRizla Posts: 8,058 Valuable Player edited February 2019 Nekto2 said: RedRizla said: When you talk about 3D, it just became to expensive for the film industry to make all films like Avatar 3D. Not at all. Now we have almost any film in 3D (at cinemas only! not on TV). Most of them are "fake 3D" conversion. But who cares. None could see the difference. You could not show same 3D content in cinema and on TV. But you could in VR cinema :) Not sure why you said: "Not at all". All I was saying is it became expensive to make 3D films like Avatar, which is only one of the reasons why 3D didn't work out and sell to the masses. If you can't see the difference between fake 3D and a film done properly in 3D, then all I can say say is that's good for you. I can tell by a mile it's just fake 3D and it looks crap most of the time depending on the movie.. • ohgrantohgrant Posts: 399 Trinity Nekto2 said: ohgrant said: When those games fail on PC, there is nothing to do but wait and hope players show up. Will you pay for players? If there will be startup to allow you to pay people for playing with you will you pay for that? What amount? It could boost VR development if some people could earn money on playing multiplayer games. And you will be able to select "no children", "no hard language", "I should win" ;)  No, I wouldn't. I will buy games that have better offline content and avoid buying any multi player only games. Right now I find most VR games a better bang for the buck because most have good offline content. For the few VR games I've tried online, I've found games and players quicker and had much less lag then I have with my last 4 EA/Origin purchases Gigabyte  AB350 Ryzen 2700x, 16gb ddr 4 3200, 1080ti. Z800 HMD, DK1, DK2, CV1, Vive wireless, Quest, HP Reverb. Viewsonic 1080p 3D projector ASUS 3D vision monitor.  UAD Apollo interface, Yamaha studio monitors.   • PhoenixSpyderPhoenixSpyder Posts: 413 Trinity Like I said in one of my prior posts, a pancake game needs to have an extremely compelling reason for me to buy it and play it or it's a 'no buy' for me. Metro Exodus will probably be one of those pancake games regardless of it being 'Epic store only' (though I my not buy it right away due to my obvious preference for VR). On a similar note, having another game store front doesn't bother me...I just disable it from running in the background anyway...so it won't be robbing my system of a bit of resources...LOL!!! i7 8700k @ 5ghz (water cooled), Asus Rog Strix Z370-E Gaming, Corsair 270R case, EVGA 3090 FTW3 Ultra, 32 GB Corsair Veng DDR4 2666 Ghz, Adata SX900 SSD, 1TB M.2 SSD, Adata Su800 SSD, Adata SU650 SSD, BarraCuda 2TB HD, Toshiba 3tB HD, Rift (dead), Rift S, Win 10 Pro 2004, Inateck KT4006 USB3.0 "Presently developing a VR project (outside of my profession) due to the lack of availability of what I would like to experience" Details soon...don't want to spill anything just yet!! • RedRizlaRedRizla Posts: 8,058 Valuable Player edited February 2019 I'm currently playing Red Dead Redemption 2 on the PS4 and this game is compelling enough for me to play. I've been really enjoying some 2D gaming recently and if Read Dead Redemption 2 comes to PC, then you'll be in for a treat. The games bloody great. I've been playing it for hours and I'm only 14% of the game played.. • snowdogsnowdog Posts: 8,114 Valuable Player Well I'm not angry. You can tell when I'M angry cos I always write Oculus a letter. Flat games just don't do it for me any more. I haven't even played the new Zelda, which is REALLY saying something! :o "This you have to understand. There's only one way to hurt a man who's lost everything. Give him back something broken." Thomas Covenant, Unbeliever • jamisonmillerjamisonmiller Posts: 42 Brain Burst I didn't buy subnautica bas game as it did not come with touch. otherwise what is the point of it in VR if you can't interact with your environment???  So this new being non-VR doesn't effect me at all, not until the old version gets updated at least.  • bigmike20vtbigmike20vt Posts: 4,384 Valuable Player I didn't buy subnautica bas game as it did not come with touch. otherwise what is the point of it in VR if you can't interact with your environment???  So this new being non-VR doesn't effect me at all, not until the old version gets updated at least.  So if not interacting with your environment kills it for you then you are not wrong to not buy it, however for me there is still a MASSIVE point of the game being in vr, the sense of scale and in just being there i still found incredible. however that said, the menu system being so close to your face made it made it unplayable for me on a practical level - if i played it on a monitor 1st so i knew what i was doing i could probably get by, but, like Alien isolation i just dont want to play it not in VR after having a taste of what it could be in VR.... so for me both subnautica and AI have FAR less play than they other wise would have. Fiat Coupe, gone. 350Z gone. Dirty nappies, no sleep & practical transport incoming. Thank goodness for VR :) • nroskonrosko Posts: 954 Neo In not too upset about this because I don't think it's going to be much different to the first game. I still like pancakes just as well as they are generally a higher standard and quality but I not be picking this game up as it isnt much of an innovation over the first. There is a good mod for subnaughtica that helps with vr menu and gui for those still playing if. I'm more disappointed about dirt rally 2s lack of VR support.  • Digikid1Digikid1 Posts: 2,506 Valuable Player Nekto2 said: RedRizla said: When you talk about 3D, it just became to expensive for the film industry to make all films like Avatar 3D. Not at all. Now we have almost any film in 3D (at cinemas only! not on TV). Most of them are "fake 3D" conversion. But who cares. None can see the difference.  Wha.....errr....WRONG. That is so laughably wrong that it is simply hilarious.  Try OPENING their eyes....that may help.  ROFLMAO!!!!!!!!!!! • JohnnyDioxinJohnnyDioxin Posts: 2,722 Valuable Player tbh all this "if it hasn't got VR I won't play it" and people making angry posts is just reminiscent of a child  You have that vision of a child only because you're trying to bring down our opinion ; which is just plain lame btw. We say we won't buy it because we're simply not interested in the flat version, I don't see what's childish here. Besides, there's the obvious reason that flat gaming is not immersive at all compared to VR. The strong point of Subnautica is its immersive world, hence not using VR is a huge mistake. It's not about opinion here: VR enhances immersion, and Subnautica is all about immersion, so it should use VR. If it doesn't, it may be good, but it definitely won't be as good as it could be. Also, just because we don't intend to buy the game doesn't mean we're angry. You're missng the point (deliberately? who knows...). I'm not saying that about anyone - the point I am making is the way people are refusing to buy any game that isn't VR. i5 9600k @4.5GHz; 16GB DDR4 3200; 6xSSD; RTX2080ti; Gigabyte Z390D Mobo Rift CV1; Index; Quest; Quest 2 • JohnnyDioxinJohnnyDioxin Posts: 2,722 Valuable Player Anyway - excuse me not responding to any more provocations, this thread is uninteresting to me now. i5 9600k @4.5GHz; 16GB DDR4 3200; 6xSSD; RTX2080ti; Gigabyte Z390D Mobo Rift CV1; Index; Quest; Quest 2 • DaftnDirectDaftnDirect Posts: 6,490 Volunteer Moderator I found this thread quite interesting but not surprising, both in the decision of Unknown Worlds or by the comments. I think we all know by now how difficult the road is to having the hardware we want and the software to go with it. Just like the introductions of a lot of new tech and formats. New hardware/formats are offered to us, enthusiastic early adaptors jump in. The hardware manufacturer has to initially fund a lot of content possibly as a loss leader with some developers enthusiastic enough to test the water and do the same. Then we move towards having enough of a user base to cause developers to continue providing content for profit reasons and off we go. I'm guessing we're at about the half-way stage towards a proper self-sustaining consumer PCVR environment. I'm not entirely sure though whether an increased sparsity if titles during the next year or 2 is going to tip the balance and postpone VR for a few more years. I think it's more likely though that it will just move slowly forwards for a while longer, then, with hardware that's both better and cheaper, it'll take off. That may or may not be not the next generation of hardware. In the mean time I still enjoy monitor gaming for some genres like RTS, but VR has absolutely ruined monitor FPSs for me. 3rd person games were bad enough... where you're not the player, you're just controlling the player in front of you... now monitor FPSs feel the same compared to VR. Intel 5820K [email protected], Titan X (Maxwell), 32GB Corsair Vengeance DDR4, ASRock X99 Taichi, Samsung 500Gb 960 Evo M.2, Corsair H100i v2 Cooler, Inateck KTU3FR-4P USB 3 card, Windows 10 Pro v2004 (19042.662) • Nekto2Nekto2 Posts: 375 Trinity edited February 2019 Most of them are "fake 3D" conversion. But who cares. None could see the difference. I choked at this comment. You can't make the difference between fake 3D and real 3D??? Fake 3D is a hell lot flatter, it's mainly several planes instead of a real 3rd dimension. The reason is obvious: you can't create 3D with only one point of view. The only thing you can do is put some elements on another plane via software tweaks, but those elements are still flat. :) Wha.....errr....WRONG. That is so laughably wrong that it is simply hilarious. Try OPENING their eyes....that may help. :) I could see the difference. But most of my friends will not. I have asked them after the film is it ok and they told me it's ok. Most obvious is not flat scene, but semi-transparent. You could see background sticking to glass or long hair. But you could mix real 3D on big screen (IMAX) and "real but flat" 3D on small cinema screen. Size of screen make a lot of difference. It's possible to put virtual object 1-2 meters from you in IMAX but you can't do the same most of the time on small cinema screen. I have seen Avatar in IMAX and on small screen. Second one looks like fake flat 3D but it was not. That will leed to scale/zoom error. You will see big face of a person full screen (small screen) instead of real-sized person but 2 meters from your head (IMAX film). This scale change is leading to "flat face/nose" even with real 3D camera shots. You could check web site "fake or real" and compare to your experience. It's possible that you think it was a fake conversion on some real 3D films ;) ps. distance to screen also make big difference. You could sit in a wrong place inside a cinema on real 3D film and think it is fake. Try to walk around and see how image on screen become more flat. pps. VR is better for 3D film in a lot of reasons :) • ohgrantohgrant Posts: 399 Trinity edited February 2019 RedRizla said: ohgrant said:  I have confidence that it will remain a niche market just like 3D is and always will be. What I regard as silly are those that are into it because it's the current fad.   When you talk about 3D, it just became to expensive for the film industry to make all films like Avatar 3D. VR can be vastly improved upon with things like resolution, which is one of most gripes about VR right now. I also think VR will boom in 10 years time because it will be totally different from what we are seeing today. What is not to like about VR, if it has higher resolution screens and things like foveated rendering etc?   3D film has been around since silent films. Died more times than the Blues, only to come back every generation. Each generation has theories of why it died in their generation. Mostly what I've read and seen was the fact that the ladies don't like wearing the glasses.   In my opinion, most of the time 3D movies failed because the 3D movies were made just to exhibit the novelty of 3D and some serious horrible movies were made like Robot Monster and It came from Outer Space.   I would like to be optimistic as you and believe me I hope I'm wrong but I still think the majority of the ladies aren't about to mess up their hair putting a VR thingy on their heads. There will be exceptions, the cool tom boy nerd gals, but I'm thinking the princesses will have none of it now or any time soon. I think there is a big part of the population that are simply unreachable as long as any type of head apparatus is needed. I don't see the movie industry to ever be willing to make any serious VR ventures.  I have to admit, though I much prefer real 3D, they've come along way in 3D conversion. All the 3D Star Trek, Star wars, Jurassic park are converted from my understanding.  It is really getting hard for me to tell the difference but the only giveaway to my old eyes is the slightly exaggerated facial depth of the actors. I have the original Jurassic Park and Wizard of Oz in converted 3D. Totally brilliant conversions IMO. Kudos to those that are still using real 3D and publishers that release classics in 3D.         http://www.3dmovielist.com/list.html Gigabyte  AB350 Ryzen 2700x, 16gb ddr 4 3200, 1080ti. Z800 HMD, DK1, DK2, CV1, Vive wireless, Quest, HP Reverb. Viewsonic 1080p 3D projector ASUS 3D vision monitor.  UAD Apollo interface, Yamaha studio monitors.   • You're missng the point (deliberately? who knows...). I'm not saying that about anyone - the point I am making is the way people are refusing to buy any game that isn't VR. My point still stands, buddy. We don't refuse to buy non-VR games, we're just not interested in them, which, again, is nothing wrong or childish. Hyped for the Quest 2! My hopes for VR next gen: - Full Body Tracking. Come on, Oculus! - Eye tracking with foveated rendering. Must reduce the power needs! - More big-scale games. I need a true VRMMORPG! - Bigger community. "If you don't mind, do you want me to take you there? Where dreams come true." • bigmike20vtbigmike20vt Posts: 4,384 Valuable Player You're missng the point (deliberately? who knows...). I'm not saying that about anyone - the point I am making is the way people are refusing to buy any game that isn't VR. My point still stands, buddy. We don't refuse to buy non-VR games, we're just not interested in them, which, again, is nothing wrong or childish. indeed.... some games i play out of VR and they are just fine (truth be told i have not used my rift much the last 3 months) but for those games which ARE well suited to VR, I have tried giving them a go on a screen (65inch 4k so a decent one as well) and i just cant get into them.  I bought drive club for my playstation.... a game which is right out of the PGR book and a few years ago i would have loved it.. but it is just tedius to me now. i have tried alien isolation and subnautica in VR and then seeing on a screen just does not interest me.  It isnt spite why i am not buying the games not in VR... it is just that i have enough games which ARE in VR which i have not got around to playing so i sure as hell am not buying one i am not even interested in.  I am not a charity - even tho i may act like one sometimes - some of the VR games i have bought have been purely to support the devs even tho i have not come even close to playing yet. Fiat Coupe, gone. 350Z gone. Dirty nappies, no sleep & practical transport incoming. Thank goodness for VR :) • RedRizlaRedRizla Posts: 8,058 Valuable Player edited February 2019 ohgrant said: 3D film has been around since silent films. Died more times than the Blues, only to come back every generation. Each generation has theories of why it died in their generation. Mostly what I've read and seen was the fact that the ladies don't like wearing the glasses.    I know the Sun doesn't shine to often in the United Kingdom, but believe me, the ladies like to wear Sun glasses at every opportunity. Not sure what the Cinema glasses look like, but you could get some cool looking 3D glasses that looked like Sun Glasses, so I'm not sure the ladies would be put off by glasses.  Here's more reasons why 3D failed, but most of it came down to overall cost. https://www.lifewire.com/why-3d-tv-died-4126776 • JohnnyLeeJohnnyLee Posts: 16 NerveGear edited May 2019 Yup, no VR...no buy. There has to be an extremely compelling reason for me to buy a pancake game now. And this one just doesn't have it...yet!!!! I agree. Absolutely cannot purchase another non-VR game. Below Zero VR, would have been an instant purchase for sure. No VR, no purchase. Moving on... • Comic_Book_GuyComic_Book_Guy Posts: 1,212 3Jane I didn't buy subnautica bas game as it did not come with touch. otherwise what is the point of it in VR if you can't interact with your environment???  So this new being non-VR doesn't effect me at all, not until the old version gets updated at least.  That's a pretty narrow point of view. I guess you don't play Alien Isolation w/ the VR mod? after all, what's the point?  Subnautica needs polishing, but not being able to wave my hands around to swim is the least of its issues. It's amazing and immersive in its own right just with the head set.  • Comic_Book_GuyComic_Book_Guy Posts: 1,212 3Jane edited June 2019 Do you have a counter argument Tom? Subnautica isn't a VR game. It's a game that supports a HMD for viewing. Can't you just enjoy that? • bigmike20vtbigmike20vt Posts: 4,384 Valuable Player edited June 2019 of course subnautica is a VR game :)   it isnt a fully featured VR game, and it isnt even a finished VR game (full of bugs IME many of which the community have had to fix with hacks).. but it IS a VR game, the fact it is on the oculus store kind of suggests it. if not then that means when the oculus rift launched it was not a VR headset, which is false.. and also if you think about it means games like skyrim VR is not a vr title (sure it supports touch but you cant fully interact properly with your environment). where do you draw the line?  you could argue that right now there is no single steamVR device on the market which qualify because vive wands do not do hand tracking....... hell maybe touch does not qualify because that only has limited hand tracking, which would mean that the only full vr experiences are ones which support the as yet unreleased knuckle controllers AND support those body tracking pucks. clearly this is not the case it is just there are differing levels of VR fidelity, and subnautica is one of the more limited implementations - which is still 500% better than playing on a monitor imo. Fiat Coupe, gone. 350Z gone. Dirty nappies, no sleep & practical transport incoming. Thank goodness for VR :) • snowdogsnowdog Posts: 8,114 Valuable Player Atmos @ParadoxAnomaly is someone else that's missing out on a lot of great content by refusing to play seated gamepad controlled games. Some of these games are amongst the best available for my money. Subnautica, The Vanishing Of Ethan Carter VR, Lucky's Tale, Witchblood, Edge Of Nowhere and Chronos to name just half a dozen are top quality games that EVERY VR headset owner should play. "This you have to understand. There's only one way to hurt a man who's lost everything. Give him back something broken." Thomas Covenant, Unbeliever • Comic_Book_GuyComic_Book_Guy Posts: 1,212 3Jane I don't know how you want me to word it where we will both agree, but I'll try again; Subnautica was first a flat desktop game. They implemented VR support. It has a ton of over sites and stupid blunders that they don't fix, because they don't care, and treat us as " the 1%" who are inconsequential and a waste of dev time. With that being said it's extremely immersive and a better experience in VR then on a monitor. There is a mod that (mostly) fixes its issues in VR.  But it's lack of motion controller support absolutely does not make or break it, and expecting it to get motion controller support or you just won't play it is a narrow and silly view. • elliotttateelliotttate Posts: 10 Brain Burst Here's a VR mod for Below Zero now that brings it back to the state of the first one https://www.youtube.com/watch?v=4RD3QB83chc&t=555s Sign In or Register to comment.
{ "url": "https://forums.oculusvr.com/community/discussion/comment/660947/", "source_domain": "forums.oculusvr.com", "snapshot_id": "crawl=CC-MAIN-2021-04", "warc_metadata": { "Content-Length": "122262", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:CVYHZXX6GXBQKMUSKSDE7TENCC7RWNWN", "WARC-Concurrent-To": "<urn:uuid:197482df-6bdf-4fee-a2f0-a9f162614613>", "WARC-Date": "2021-01-19T14:23:32Z", "WARC-IP-Address": "162.159.128.79", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:XBUTLHZWAKUT6TY7EOQYLE7LJMAUKA7S", "WARC-Record-ID": "<urn:uuid:89d79607-fe04-4af0-8124-fee52df2c4e9>", "WARC-Target-URI": "https://forums.oculusvr.com/community/discussion/comment/660947/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:7198a5df-4268-4880-996b-a12f52c421c0>" }, "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-226.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 58, 59, 112, 113, 153, 154, 156, 157, 166, 167, 217, 235, 411, 412, 850, 880, 892, 1246, 1579, 1745, 1861, 2079, 2107, 2119, 2144, 2162, 2253, 2283, 2396, 2492, 2580, 2608, 2620, 2639, 2751, 2767, 2835, 2924, 3014, 3042, 3054, 3072, 3249, 3303, 3423, 3473, 3498, 3515, 3534, 3646, 3662, 3730, 3819, 3909, 3910, 4327, 4357, 4369, 4386, 4404, 4495, 4525, 4638, 4734, 4822, 5183, 5401, 5443, 5455, 5977, 5978, 6277, 6466, 6516, 6541, 6868, 6916, 7004, 7005, 7128, 7253, 7254, 7286, 7327, 7343, 7499, 7500, 7605, 7661, 7817, 7818, 7923, 8166, 8167, 8575, 8689, 8717, 8725, 9097, 9164, 9214, 9231, 9250, 9362, 9378, 9446, 9534, 9618, 9619, 9665, 9666, 9689, 9747, 9864, 9865, 9986, 10104, 10105, 10489, 10490, 10571, 10748, 10749, 10825, 10861, 10919, 11023, 11024, 11100, 11136, 11196, 11197, 11318, 11319, 11501, 11502, 11884, 11885, 12376, 12377, 12669, 12670, 12887, 12915, 12927, 12952, 13041, 13415, 13422, 13505, 13550, 13557, 13558, 13691, 13806, 13904, 14080, 14183, 14184, 14436, 14437, 14592, 14593, 14796, 14853, 14883, 14895, 14920, 14939, 14957, 15133, 15134, 15572, 15847, 16060, 16586, 16587, 17112, 17113, 17154, 17372, 17549, 17550, 17700, 17727, 17728, 17729, 17759, 17802, 17875, 17927, 17951, 17952, 18035, 18091, 18268, 18269, 18419, 18869, 18870, 19379, 19493, 19543, 19568, 19586, 19860, 19866, 19867, 20184, 20185, 20266, 20267, 20319, 20352, 20366, 20386, 20536, 20691, 20737, 20747, 20903, 20904, 21009, 21135, 21315, 21361, 21371, 21392, 21532, 21588, 21609, 21875, 21876, 22136, 22137, 22547, 22548, 22753, 22867, 22915, 23309, 23434, 23435, 23467, 23513, 23523, 23852, 24005, 24006, 24195, 24232, 24248, 24388 ], "line_end_idx": [ 58, 59, 112, 113, 153, 154, 156, 157, 166, 167, 217, 235, 411, 412, 850, 880, 892, 1246, 1579, 1745, 1861, 2079, 2107, 2119, 2144, 2162, 2253, 2283, 2396, 2492, 2580, 2608, 2620, 2639, 2751, 2767, 2835, 2924, 3014, 3042, 3054, 3072, 3249, 3303, 3423, 3473, 3498, 3515, 3534, 3646, 3662, 3730, 3819, 3909, 3910, 4327, 4357, 4369, 4386, 4404, 4495, 4525, 4638, 4734, 4822, 5183, 5401, 5443, 5455, 5977, 5978, 6277, 6466, 6516, 6541, 6868, 6916, 7004, 7005, 7128, 7253, 7254, 7286, 7327, 7343, 7499, 7500, 7605, 7661, 7817, 7818, 7923, 8166, 8167, 8575, 8689, 8717, 8725, 9097, 9164, 9214, 9231, 9250, 9362, 9378, 9446, 9534, 9618, 9619, 9665, 9666, 9689, 9747, 9864, 9865, 9986, 10104, 10105, 10489, 10490, 10571, 10748, 10749, 10825, 10861, 10919, 11023, 11024, 11100, 11136, 11196, 11197, 11318, 11319, 11501, 11502, 11884, 11885, 12376, 12377, 12669, 12670, 12887, 12915, 12927, 12952, 13041, 13415, 13422, 13505, 13550, 13557, 13558, 13691, 13806, 13904, 14080, 14183, 14184, 14436, 14437, 14592, 14593, 14796, 14853, 14883, 14895, 14920, 14939, 14957, 15133, 15134, 15572, 15847, 16060, 16586, 16587, 17112, 17113, 17154, 17372, 17549, 17550, 17700, 17727, 17728, 17729, 17759, 17802, 17875, 17927, 17951, 17952, 18035, 18091, 18268, 18269, 18419, 18869, 18870, 19379, 19493, 19543, 19568, 19586, 19860, 19866, 19867, 20184, 20185, 20266, 20267, 20319, 20352, 20366, 20386, 20536, 20691, 20737, 20747, 20903, 20904, 21009, 21135, 21315, 21361, 21371, 21392, 21532, 21588, 21609, 21875, 21876, 22136, 22137, 22547, 22548, 22753, 22867, 22915, 23309, 23434, 23435, 23467, 23513, 23523, 23852, 24005, 24006, 24195, 24232, 24248, 24388, 24419 ] }
{ "red_pajama_v2": { "ccnet_original_length": 24419, "ccnet_original_nlines": 253, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4339550733566284, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.06242863088846207, "rps_doc_frac_lines_end_with_ellipsis": 0.003937010187655687, "rps_doc_frac_no_alph_words": 0.17186905443668365, "rps_doc_frac_unique_words": 0.23979473114013672, "rps_doc_mean_word_length": 4.271518707275391, "rps_doc_num_sentences": 298, "rps_doc_symbol_to_word_ratio": 0.004758279770612717, "rps_doc_unigram_entropy": 5.949974536895752, "rps_doc_word_count": 4287, "rps_doc_frac_chars_dupe_10grams": 0.29756444692611694, "rps_doc_frac_chars_dupe_5grams": 0.3531563878059387, "rps_doc_frac_chars_dupe_6grams": 0.3424530327320099, "rps_doc_frac_chars_dupe_7grams": 0.31602227687835693, "rps_doc_frac_chars_dupe_8grams": 0.31602227687835693, "rps_doc_frac_chars_dupe_9grams": 0.30701181292533875, "rps_doc_frac_chars_top_2gram": 0.0037134101148694754, "rps_doc_frac_chars_top_3gram": 0.004914809949696064, "rps_doc_frac_chars_top_4gram": 0.004368720110505819, "rps_doc_books_importance": -2276.00390625, "rps_doc_books_importance_length_correction": -2276.00390625, "rps_doc_openwebtext_importance": -1272.5567626953125, "rps_doc_openwebtext_importance_length_correction": -1272.5567626953125, "rps_doc_wikipedia_importance": -885.22021484375, "rps_doc_wikipedia_importance_length_correction": -885.22021484375 }, "fasttext": { "dclm": 0.16441452503204346, "english": 0.9631218910217285, "fineweb_edu_approx": 1.179720401763916, "eai_general_math": 0.039862509816884995, "eai_open_web_math": 0.1263561248779297, "eai_web_code": 0.0032376099843531847 } }
{ "free_decimal_correspondence": { "primary": { "code": "004.019", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "794.816", "labels": { "level_1": "Arts", "level_2": "Amusements and Recreation", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "5", "label": "Evaluate" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "5", "label": "Comment Section" }, "secondary": { "code": "18", "label": "Q&A Forum" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "2", "label": "Partially Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
-1,970,201,134,947,918,600
Having problems with your HP PC Laptops ? Fan will not shut off and notebook runs hot \015 The fan in my HP Pavilion dv6000 runs continuous and the laptop stays hot. I don't have any processes continually run that I'm aware of that would overload the processor. Is this a hardware or software configuration/bug with a controller?\015 Answers : Laptops run Hot If you can put a cooler underneath it... My Laptop was so hot I could have moved the stickers around on it. This is what I got http://bit.ly/dv6000 ^URL shortened for convince takes you to Amazon Repair Help & Product Troubleshooting for HP PC Laptops Tips for a great answer: - Provide details, support with references or personal experience . - If you need clarification, ask it in the comment box . - It's 100% free, no registration required. Suggested Questions/Answers : Acer Aspire Shuts down when I play my on-line game A notebook can only shut down if the processor is getting HOT that is by itself. I can timagine its a virus because you said you formatted it?. You keep maintaining that it keepsshutting down. to me thats the CPU because its getting too HOT>\015 ... Acer Aspire 5100-5022 Notebook Computor cutting out.....Remedy ?? As per your description, I understand that the issue is with overheating of the Notebook because of which it is turning off after running for some time.\015\012\015\012First of all, Notebooks are not meant for heavy computing where they are des ... HP Pavilion dv6000z Notebook My Toshiba laptop TECRA A9 shuts down on second attempt only, not the first time. What can I do? Hi..Laptop shuts down? Computers may not be smarter than people, but if\015\012they’re designed properly, they will shut themselves down before\015\012overheating to the extent that they do themselves damage. If the smart\015\012per ... Toshiba Tecra A9-S9021V Notebook Overheats During Extended Use First of all pls do chk weather the fan below the laptop is functioning properly or not do u get lil vibro of the fan ??when u touch it wd ur palm ....it may be due to various reasons how much time does it take to get hot ??if it is too early then s ... HP Pavilion dv9000z Notebook Computer ranbdomly shuts down Your last question was very observant. NO, without an O/S, there is nothing to make a anti-virus program run.I suggest the problem in the beginning, was that the laptop was overheating. Once the processor becomes too hot, (Processors have ... HP Pavilion dv4015CL PC Notebook Laptop switched off while i was working on it After the notebook shuts down do not turn it back on for 15 minutes and then test it again. Will the notebook work longer if you let it cool down for a while? Isn’t it hot if you touch the bottom? Can you hear the fan running?\015\ ... Gateway 830GM PC Desktop Power shut down on the lenovo 3000 n100 laptop Pull out the battery. Open the panel on the\015\012 bottom that has the fan and remove the fan and heat sink. Clean the top\015\012 of cpu, put some thermal paste on the cpu and put it all back to \015\012gether. Thow the battery away. Run off ... Lenovo 3000 N100 0768 - Pentium Dual Core T2060 1.6 GHz - 15.4in. TFT PC Desktop Fan will not shut off and notebook runs hot Laptops run Hot If you can put a cooler underneath it... My Laptop was so hot I could have moved the stickers around on it.This is what I got http://bit.ly/dv6000^URL shortened for convince takes you to Amazon ... HP PC Laptops My durabook seems to get very hot to touch. I hear the fan running. Is there more than one fan..or is that even the problem? They tend to get hot, its not a problem unless it starts to cause problems such as random crashes or shut downs, If its an old notebook then try using a can of compressed air to get rid of some dust. Either way what surface are you using it on? becau ... Twinhead DURABOOK D14RY My laptop gets heat and shutdown - Compaq Evo N610C Notebook “My Toshiba \012laptop suddenly shuts down by itself without any warning. Sometimes it \012works fine for hours, sometimes it shuts down in 10-15 minutes.”\012 This complaint we hear from our customers over and over again. About \0 ... Compaq Evo N610C Notebook Notebook fan is not running and unit is getting hot The fan vanes are clogged, this may happen if you have pets or live in a humid region.take the unit apart and remove the heat sink from the laptop, get some arctic ice silicone from a computer store and apply an amount equal to that of a piece ... Compaq Presario C700T , Pentium Dual-Core Mobile Processor T2390 , 15.4" diagonal WXGA... PC Notebook Lenovo 3000 Notebooks : N100 Power Failure! This seems to be a common problem on Lenovo N100. Lenovo should present a solution or make a recall of the machine in order to keep their reputation ... Lenovo 3000 N100 0768 - Pentium Dual Core T2060 1.6 GHz - 15.4in. TFT PC Desktop Medion laptop shuts down itself Medion MD 96015 Notebook shuts down.\015\012Other searches you may want to try:\015\012\015\012Medion MD 960 ... Medion md40298 Notebook HP Pavillion dv4000 turns on and shuts off and turns on and shuts off - No I work on HP's all day, it is nothing to do with the OS or the BIOS. It is a problem with the motherboard fan control, in other words the mainboard is bad even with the latest BIOS update. The CPU is getting too hot, as this happens the CPU gets ... HP Pavilion dv4000 Notebook Computer Shuts Down Randomly Is the fan running.... check how hot it is on the bottom.... could very likely be thermal shut down... if it gets to hot it shuts down before there is any damage.... see if you can remove the shield around the fan and clean out the dust and dirt and ... Dell Inspiron 1501 Notebook Computer randomly shuts down in Safe Mode only I can't think of any reason why you would want to run in safe mode except if the computer crashes your system. If you have a heat problem in safe mode it is shutting down to protect you CPU and GPU which are two things you won't want to replace. If ... Acer Aspire 7720 Notebook Toshiba U205 Notebook mouse highlights and freezes Most likely your laptop is overheating and shutting down to protect itself. Is the fan running on high most of the time? That would indicate your laptop is running hot. Toshiba made a huge mistake on this model by covering the vent holes for the coo ... PC Desktops I have three problems with my hp pavilion dv5 notepook I have the same laptop but I can't help with the touchpad issue (must be a hardware issue b/c mine works fine....try unstalling the driverm then reinstall the driver). The problem with the volume I can help you with: go to start and type in MSCONFIG ... HP Pavilion dv6000z Notebook Sharp Actius MC24 PC Notebook overheating and shutting down If it under warranty I would take it back to them.\015\012If not I would open it up and check for dust build up and make sure the fan is working... ... Sharp Actius MC24 Notebook Loud fans and Shutting down I had same problem with a HP Pavillion ZD-7000. Turned out to be dust had accumulated on the cpu making it run hot. Get a can of the dust off high pressure air and blow it into the fan intakes and output vents. Cleared my problem right up. ... PC Laptops Instantaneous shutdown with no warnings! Software issue or errorErrors generated by software programs can cause a computer to reboot unexpectedly or without warning. If you are running Windows XP see the below section "For Windows XP users" before continuing. \015\012If you are not ru ... Toshiba Satellite A105 Notebook My laptop keeps shutting down at random times. I Computers may not be smarter than people, but if they’re designed\015\012properly, they will shut themselves down before overheating to the\015\012extent that they do themselves damage. If the smart person keeps\015\012turning the n ... Toshiba Satellite A100-S8111TD Notebook HP pavilion DV6700nr laptop looses power If it is (and it does sound like) a heat problem, the first thing do to would be to make sure the vents are clean and the fan and heatsink are free of dust buildup.\015\012\015\012Here is a page from HP to assist you in doing so:\01 ... HP Pavilion dv6000z Notebook Overheating with certain programs Hi jennie, \015\012One of the most common problems with older & a lot of newer notebooks has been battery's over heat & the system shuts down. I suggest you remove the battery & run off the AC power cord. Run the programs you mentio ... PC Laptops My dell inspiron notebook 6400 shuts down and starts up automatically...what is going on...I don't use a battery so its not that...just use the ac By your description it sounds like your laptop is overheating. Many a laptop faces this issues because the Air Intake Duct is dirty, and the internal hardware.When a processor in a computer becomes too hot, it shuts off. (More specificall ... Dell Inspiron 6400 Notebook • Start your question with What, Why, How, When, etc. and end with a "?" • Be clear and specific • Use proper spelling and grammar all rights reserved to the respective owners || www.electronic-servicing.com || Terms of Use || Contact || Privacy Policy Load time: 0.6284 seconds
{ "url": "http://www.electronic-servicing.com/hp_pc_laptops/q1401569-fan_will_not_shut_off_notebook_runs_hot", "source_domain": "www.electronic-servicing.com", "snapshot_id": "crawl=CC-MAIN-2016-50", "warc_metadata": { "Content-Length": "26049", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:TQDIGISRLXPRDBJMF4BYQ6E47FRSYDSA", "WARC-Concurrent-To": "<urn:uuid:74aa1579-a72f-497b-82b4-7a7e516ff01e>", "WARC-Date": "2016-12-10T15:14:55Z", "WARC-IP-Address": "104.27.178.222", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:TXNGDRR6A4TWP66OAOCZ4BT5NUB6MJXB", "WARC-Record-ID": "<urn:uuid:0c79310c-9999-4b6f-a80f-ce626491e61c>", "WARC-Target-URI": "http://www.electronic-servicing.com/hp_pc_laptops/q1401569-fan_will_not_shut_off_notebook_runs_hot", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:031a4174-6de9-43cd-bb0e-c7370175f5f7>" }, "warc_info": "robots: classic\r\nhostname: ip-10-31-129-80.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-50\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for November 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }
{ "line_start_idx": [ 0, 1, 43, 44, 88, 89, 337, 338, 348, 349, 473, 474, 514, 515, 563, 619, 620, 645, 646, 714, 771, 815, 816, 846, 847, 898, 899, 900, 1181, 1182, 1217, 1218, 1219, 1497, 1498, 1595, 1596, 1597, 1867, 1868, 1898, 1899, 1900, 2183, 2184, 2214, 2215, 2216, 2492, 2493, 2539, 2540, 2541, 2802, 2803, 2850, 2851, 2852, 3181, 3182, 3226, 3227, 3228, 3456, 3457, 3582, 3583, 3584, 3863, 3864, 3925, 3926, 3927, 4189, 4190, 4242, 4243, 4244, 4594, 4595, 4639, 4640, 4641, 4875, 4876, 4908, 4909, 4910, 5047, 5048, 5120, 5121, 5122, 5403, 5404, 5433, 5434, 5435, 5717, 5718, 5765, 5766, 5767, 6046, 6047, 6098, 6099, 6100, 6366, 6367, 6422, 6423, 6424, 6707, 6708, 6768, 6769, 6770, 6949, 6950, 6978, 6979, 6980, 7235, 7236, 7277, 7278, 7279, 7560, 7561, 7610, 7611, 7612, 7889, 7890, 7931, 7932, 7933, 8199, 8200, 8234, 8235, 8236, 8484, 8485, 8632, 8633, 8634, 8905, 8980, 9006, 9042, 9164 ], "line_end_idx": [ 1, 43, 44, 88, 89, 337, 338, 348, 349, 473, 474, 514, 515, 563, 619, 620, 645, 646, 714, 771, 815, 816, 846, 847, 898, 899, 900, 1181, 1182, 1217, 1218, 1219, 1497, 1498, 1595, 1596, 1597, 1867, 1868, 1898, 1899, 1900, 2183, 2184, 2214, 2215, 2216, 2492, 2493, 2539, 2540, 2541, 2802, 2803, 2850, 2851, 2852, 3181, 3182, 3226, 3227, 3228, 3456, 3457, 3582, 3583, 3584, 3863, 3864, 3925, 3926, 3927, 4189, 4190, 4242, 4243, 4244, 4594, 4595, 4639, 4640, 4641, 4875, 4876, 4908, 4909, 4910, 5047, 5048, 5120, 5121, 5122, 5403, 5404, 5433, 5434, 5435, 5717, 5718, 5765, 5766, 5767, 6046, 6047, 6098, 6099, 6100, 6366, 6367, 6422, 6423, 6424, 6707, 6708, 6768, 6769, 6770, 6949, 6950, 6978, 6979, 6980, 7235, 7236, 7277, 7278, 7279, 7560, 7561, 7610, 7611, 7612, 7889, 7890, 7931, 7932, 7933, 8199, 8200, 8234, 8235, 8236, 8484, 8485, 8632, 8633, 8634, 8905, 8980, 9006, 9042, 9164, 9189 ] }
{ "red_pajama_v2": { "ccnet_original_length": 9189, "ccnet_original_nlines": 152, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.39395517110824585, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.052110470831394196, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.1683168262243271, "rps_doc_frac_unique_words": 0.3539540767669678, "rps_doc_mean_word_length": 4.53507661819458, "rps_doc_num_sentences": 121, "rps_doc_symbol_to_word_ratio": 0.020323079079389572, "rps_doc_unigram_entropy": 5.573467254638672, "rps_doc_word_count": 1568, "rps_doc_frac_chars_dupe_10grams": 0.04303191974759102, "rps_doc_frac_chars_dupe_5grams": 0.09450148046016693, "rps_doc_frac_chars_dupe_6grams": 0.08212628215551376, "rps_doc_frac_chars_dupe_7grams": 0.08212628215551376, "rps_doc_frac_chars_dupe_8grams": 0.06328223645687103, "rps_doc_frac_chars_dupe_9grams": 0.052875831723213196, "rps_doc_frac_chars_top_2gram": 0.011812680400907993, "rps_doc_frac_chars_top_3gram": 0.005062580108642578, "rps_doc_frac_chars_top_4gram": 0.010547040030360222, "rps_doc_books_importance": -877.770751953125, "rps_doc_books_importance_length_correction": -877.770751953125, "rps_doc_openwebtext_importance": -479.6159973144531, "rps_doc_openwebtext_importance_length_correction": -479.6159973144531, "rps_doc_wikipedia_importance": -290.4893493652344, "rps_doc_wikipedia_importance_length_correction": -290.4893493652344 }, "fasttext": { "dclm": 0.03618853911757469, "english": 0.9002074003219604, "fineweb_edu_approx": 1.38698410987854, "eai_general_math": 0.038121700286865234, "eai_open_web_math": 0.1429387927055359, "eai_web_code": 0.021726669743657112 } }
{ "free_decimal_correspondence": { "primary": { "code": "004.17", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "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": "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": "2", "label": "Partially Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
5,777,414,608,158,381,000
[Date Prev][Date Next]   [Thread Prev][Thread Next]   [Thread Index] [Date Index] [Author Index] Re: HOW the "H" do you get the Mic working in FC8 Jim wrote: FC8/KDE I have gone into Alsamixer selected MIC, enabled, Mic 1 is selected, what else must I do to get MIC working. Are you trying to make input work with pulseaudio in your system? I have never gotten a mic to work without removing it, and after trying 14-15 methods suggested in various places I have have intention of trying again. Other wise you should see the mic on alsamixer. In Kmix all settings are enabled for MIC . The Mic is the most Frustrating thing to get working in the sound system. How do you run Pulse to check Mic Settings. yum erase PulseAudio\* ;-) The MIC is also a problem FC10, submitted messages to Fedora-test and filed bug report, no body can help. Agree, I still have one FC6 system I use when I need mic, and a laptop running FC4 for the same reason. It seems that it either works or doesn't, for no given reason, and no one really knows why, so they assume you're missing something. Anyhow back to FC 8 Mic problems. -- Bill Davidsen <davidsen tmr com> "We have more to fear from the bungling of the incompetent than from the machinations of the wicked." - from Slashdot [Date Prev][Date Next]   [Thread Prev][Thread Next]   [Thread Index] [Date Index] [Author Index]
{ "url": "https://www.redhat.com/archives/fedora-list/2008-November/msg01806.html", "source_domain": "www.redhat.com", "snapshot_id": "crawl=CC-MAIN-2018-13", "warc_metadata": { "Content-Length": "4801", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:3TODVYE4MSWWVO4IRFVWVLZHHQQPDVPI", "WARC-Concurrent-To": "<urn:uuid:f85ea7e7-5412-4ae1-919e-6e3537584001>", "WARC-Date": "2018-03-20T23:51:22Z", "WARC-IP-Address": "104.90.66.146", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:6FLKERHIY7RASSEN3MLJO7WJZWGPGVXS", "WARC-Record-ID": "<urn:uuid:b73fa66f-926e-48a8-a76b-06e9c16a0cb2>", "WARC-Target-URI": "https://www.redhat.com/archives/fedora-list/2008-November/msg01806.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3f61bba0-7d6f-488f-88a8-db553f51f549>" }, "warc_info": "robots: classic\r\nhostname: ip-10-148-29-247.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-13\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for March 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }
{ "line_start_idx": [ 0, 1, 98, 99, 149, 150, 151, 152, 163, 171, 280, 281, 500, 501, 549, 550, 593, 667, 711, 712, 740, 741, 847, 848, 1085, 1086, 1121, 1122, 1123, 1124, 1127, 1160, 1231, 1281, 1282, 1283 ], "line_end_idx": [ 1, 98, 99, 149, 150, 151, 152, 163, 171, 280, 281, 500, 501, 549, 550, 593, 667, 711, 712, 740, 741, 847, 848, 1085, 1086, 1121, 1122, 1123, 1124, 1127, 1160, 1231, 1281, 1282, 1283, 1379 ] }
{ "red_pajama_v2": { "ccnet_original_length": 1379, "ccnet_original_nlines": 35, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.35691317915916443, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.06430868059396744, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.21543407440185547, "rps_doc_frac_unique_words": 0.573221743106842, "rps_doc_mean_word_length": 4.3305439949035645, "rps_doc_num_sentences": 13, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.614007472991943, "rps_doc_word_count": 239, "rps_doc_frac_chars_dupe_10grams": 0.12946860492229462, "rps_doc_frac_chars_dupe_5grams": 0.12946860492229462, "rps_doc_frac_chars_dupe_6grams": 0.12946860492229462, "rps_doc_frac_chars_dupe_7grams": 0.12946860492229462, "rps_doc_frac_chars_dupe_8grams": 0.12946860492229462, "rps_doc_frac_chars_dupe_9grams": 0.12946860492229462, "rps_doc_frac_chars_top_2gram": 0.03864733874797821, "rps_doc_frac_chars_top_3gram": 0.03091786988079548, "rps_doc_frac_chars_top_4gram": 0.04251208156347275, "rps_doc_books_importance": -168.36090087890625, "rps_doc_books_importance_length_correction": -168.35752868652344, "rps_doc_openwebtext_importance": -87.63226318359375, "rps_doc_openwebtext_importance_length_correction": -87.63226318359375, "rps_doc_wikipedia_importance": -54.864070892333984, "rps_doc_wikipedia_importance_length_correction": -53.74911880493164 }, "fasttext": { "dclm": 0.03740781918168068, "english": 0.923862099647522, "fineweb_edu_approx": 1.0338780879974365, "eai_general_math": 0.02041042037308216, "eai_open_web_math": 0.24838030338287354, "eai_web_code": 0.0005103899748064578 } }
{ "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.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": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
1,386,567,243,850,358,500
drumkit Plugin Driven, Full Stack Web Framework for Node.js npm install drumkit 1 downloads in the last month DrumKit WARNING! This framework is currently in very early development, it may be broken or may break at any time. DrumKit is a plugin-powered, full-stack Web development framework for Node.js. Installation DrumKit is dependent on Node.js and NPM. If you have both, you can install DrumKit globally: npm install -g drumkit It is important to install this globally so that you have access to the drumkit command across your system. All DrumKit modules on the other hand will be installed locally in each of your DrumKit projects. Getting Started DrumKit will bootstrap a project directory for you with the create command: cd ~/myapps drumkit create new-app This will generate a DrumKit application in ~/myapps/new-app and will use npm to install your dependencies. Once your app is installed, you can start the server: cd new-app drumkit start By default, your app will be running at http://localhost:8765. Running the Console You also can interact with your code in a REPL by firing up the console: cd path/to/your/app drumkit console Now Build Your App! 1. Build models with dk-model (see also dk-model-couchdb and dk-couchdb). 2. Build view templates and helpers with dk-template. 3. Build routes with dk-routes. 4. Check out these other DrumKit plugins: 5. Build your own plugins with drumkit plugin [pluginName] dk-core WARNING! This framework is currently in very early development, it may be broken or may break at any time. The dk-core plugin provides core functionality for the DrumKit.js framework. Currently it has no configuration options. Installation Install the package with npm: npm install dk-core Available Commands drumkit start [env] cd into a project directory and run drumkit start to start up your DrumKit.js application. The env defaults to development. drumkit console [env] cd into a project directory and run drumkit console to start up your application in a coffeescript REPL console. The env defaults to development. drumkit consolejs [env] Works the same as drumkit console except it uses straight JavaScript rather than CoffeeScript. drumkit plugin pluginName Bootstraps a new Drumkit plugin at ./plugins/pluginName. dk-assets An Asset Manager Plugin for DrumKit.js WARNING! This framework is currently in very early development, it may be broken or may break at any time. Installation You can install dk-assets using npm: npm install dk-assets Getting Started Out of the box, dk-assets assumes that you have a public folder with js and css subdirectories: - public - css - js Any files inside the public dir are automatically served, so public/images/logo.png will be available at http://localhost:8080/images/logo.png. You can change the location or name of your public directory by specifying it with dk.assets.config. All JS and CSS files can be automatically packaged (concatenated) into single files for faster loading. You can turn packaging on by running dk.assets.config with the package option set to true. Plugin Developers Guide If you have JS and/or CSS assets that you want included in the asset packages, use the package method. It takes a the URL that you want to serve the asset at, followed by either the path to your static asset file or a function that returns JS/CSS. If you package a coffeescript or stylus file, they will be automatically compiled to JS and CSS on the fly: # Package a coffeescript file, serve at /js/my-file.js dk.assets.package "/js/my-file.js", "#{__dirname}/some-dir/my-file.coffee" # Package a stylus file, serve at /css/my-file.css dk.assets.package "/css/my-file.css", "#{__dirname}/some-dir/my-file.stylus" # Package the result of a function as a file dk.assets.package "/js/dynamic.js", -> "console.log('This could be something dynamically generated.');" For assets in your plugin that you want to serve but not package (ie images), you can use the serve method, which behaves similarly to package: # Serve a coffeescript file at /js/my-file.js dk.assets.package "/js/my-file.js", "#{__dirname}/some-dir/my-file.coffee" # Serve a stylus file at /css/my-file.css dk.assets.package "/css/my-file.css", "#{__dirname}/some-dir/my-file.stylus" # Serve the result of a function at /js/dynamic.js dk.assets.package "/js/dynamic.js", -> "console.log('This could be something dynamically generated.');" Full API dk.assets.config(options) Available options: • dir: (String) Sets the path to your public directory. All files in this directory will be automatically served. Defaults to "public" • package: (Boolean) Sets whether dk-assets should package all JS and CSS files into a single JS and CSS file (ie /js/all.js and /css/all.css). This is preferable a production environment. Defaults to false # Use a nonstandard public directory, package CSS and JS files dk.assets.config dir: "nonstandard/public-dir", package: true dk.assets.package(url, fileOrFunction, serve=true) Use the package method in order to make a JS or CSS file available at a given URL, and add it to the package. Any coffeescript or stylus file will automatically be compiled on the fly. # Package a coffeescript file, serve at /js/my-file.js dk.assets.package "/js/my-file.js", "#{__dirname}/some-dir/my-file.coffee" # Package a stylus file, serve at /css/my-file.css dk.assets.package "/css/my-file.css", "#{__dirname}/some-dir/my-file.stylus" # Package the result of a function as a file dk.assets.package "/js/dynamic.js", -> "console.log('This could be something dynamically generated.');" dk.assets.serve(url, fileOrFunction) Serves the given file (or string generated by the passed function) at the URL. This file is not added to the JS or CSS packages, and will not be automatically loaded on the page. Coffeescript and stylus code will be compiled on the fly. # Serve a coffeescript file at /js/my-file.js dk.assets.package "/js/my-file.js", "#{__dirname}/some-dir/my-file.coffee" # Serve a stylus file at /css/my-file.css dk.assets.package "/css/my-file.css", "#{__dirname}/some-dir/my-file.stylus" # Serve the result of a function at /js/dynamic.js dk.assets.package "/js/dynamic.js", -> "console.log('This could be something dynamically generated.');" dk.assets.jsFiles() Returns an array of relative URLs for all packaged JS files. If the package option is true, it will return ["/js/all.js"]. # Get all the packaged JS URLs dk.assets.jsFiles() # returns ["/js/thisFile.js", "/js/thatFile.js", etc...] dk.assets.cssFiles() Returns an array of relative URLs for all packaged CSS files. If the package option is true, it will return ["/css/all.css"]. # Get all the packaged CSS URLs dk.assets.cssFiles() # returns ["/css/thisFile.css", "/css/thatFile.css", etc...] dk-couchdb WARNING! This framework is currently in very early development, it may be broken or may break at any time. The dk-couchdb plugin gives you access to CouchDB databases in a DrumKit.js app. Installation Install the package locally with npm: npm install dk-couchdb On the Server new dk.couchdb() Create a database connection to a CouchDB instance running at http://localhost:5984 by instantiating a dk.couchdb object with your database name: db = new dk.couchdb "my-database-name" If your CouchDB is running on another host or port, you can pass these in as options: db = new dk.couchdb "my-database-name", host: "myhost.com", port: 1234 db.get(id, function(err, data){}) Single documents can be fetched by id using the get instance method. This is an asynchronous operation, so the second argument is a required callback. db.get "some-id", (err, doc) -> if err console.log "Error: #{err}" else console.log "Got doc", doc db.view(viewName, function(err, docs){}) Multiple documents can be fetched using a CouchDB view with the view instance method. This is an asynchronous operation, so the second argument is a required callback. db.view "my-design-doc/all", (err, docs) -> if err console.log "Error: #{err}" else console.log "Got docs", docs db.save(data, function(err, doc){}) You can create or update a document using the save instance method. This is an asynchronous operation, so the second argument is a required callback. If the data has an id key, it will be an update, otherwise save will create a new document. data = {firstName: "Chris", lastName: "Powers"} db.save data, (err, doc) -> if err console.log "Error: #{err}" else console.log "Saved doc", doc db.destroy(id, function(err){}) You can remove a document from the database using the destroy instance method with the document id. This is an asynchronous operation, so the second argument is a required callback. db.destroy "some-id", (err) -> if err console.log "Error: #{err}" else console.log "Removed the document" In the Browser Currently dk-couchdb is not available directly in the browser, use dk-model instead. dk-model-couchdb A CouchDB Model adapter for DrumKit. WARNING! This framework is currently in very early development, it may be broken or may break at any time. Installation Install this plugin with npm: npm install dk-model-couchdb Getting Started All you need to do is include this plugin in your package.json file and you should be good to go. dk-model-couchdb will automatically hook into dk-model and dk-couchdb for you, so no configuration should be necessary on your end. dk-model WARNING! This framework is currently in very early development, it may be broken or may break at any time. The dk-model plugin provides a database-agnositic persistence layer API to DrumKit.js that can be used both on the server and the browser. Installation Install dk-model using npm: npm install dk-model Getting Started By default, dk-model expects your project to have a models directory that will automatically load your model files from there. If you want to use a different directory, you can configure the dir option: dk.model.config dir: "#{__dirname}/nonstandardModelDir" Model classes are created using the dk.model method, which takes the model name and a callback as parameters. The callback function will be called with your new model class as the an argument. Inside the callback function is where you should add instance methods, class methods and properties to your class. For example: dk.model "User", (User) -> # These are the attributes that will be persisted User.property "firstName", String User.property "lastName", String # Class methods, this will print: # Property: firstName, Type: String # Property: lastName, Type: String User.printProperties = -> for name, type of this.properties console.log "Property: #{name}, Type: #{type}" # Instance methods (ie methods on prototype object) User::fullName = -> "#{@firstName} #{@lastName}" Model classes are generated by the CoffeeScript class construct, so you are able to use prototypal inheritance. To access your new model class in other files you can use the dk.model method without the callback: User = dk.model "User" john = new User firstName: "John", lastName: "Smith" john.fullName() # returns "John Smith" CRUD Operations The goal of dk-model is to provide the developer with a database agnostic persistence API that will proxy CRUD operations to the appropriate persistence plugin. For example, the dk-model-couchdb plugin acts as an adapter between dk-model and dk-couchdb. All the methods listed below will be available both on the server and browser, as will your custom model methods. All CRUD operations are asyncronous and require callback functions as their last parameter. The callback functions generally are passed any resulting errors as their first parameter and an object (or array of objects) as the second. Class Methods new MyModel(attributes={}) Instances of a model class are initialized using the new constructor and take an object of attributes as the first parameter. User = dk.model "User" user = new User firstName: "John", lastName: "Smith" .all(options, function(err, objects)) Fetches all records based on the options that are passed (options may be different across adapters). User = dk.model "User" User.all {}, (err, users) -> if err console.log "Error fetching users:", err else for user in users console.log "Fetched", user.fullName() .get(id, function(err, object)) Fetches a single record by its identifier. User = dk.model "User" User.get 123, (err, user) -> if err console.log "Error fetching user:", err else console.log "Fetched", user.fullName() .save(attributes, function(err, object)) Attempts to create a new record with the given attributes, or update a record if attributes has an id. User = dk.model "User" User.save firstName: "John", lastName: "Smith", (err, user) -> if err console.log "Error creating user:", err else console.log "Created", user.fullName() User.save id: 123, firstName: "Jane", lastName: "Doe", (err, user) -> if err console.log "Error updating user:", err else console.log "Updated", user.fullName() .create(attributes, function(err, object)) Right now this simply aliases save. .destroy(id, function(err)) Deletes the record with the given id. User = dk.model "User" User.destroy 123, (err) -> if err console.log "Error destroying user:", err else doSomethingElse() Instance Methods save(function(err, object)) Saves the given model object. If it is a new record, then the object passed into the callback will have its new id. User = dk.model "User" user = new User firstName: "John" user.lastName = "Smith" user.save (err, obj) -> if err console.log "Error saving user:", err else console.log "New user's id is", obj.id destroy(function(err)) Deletes the given model object from persistence (currently the JS object will remain in memory). User = dk.model "User" User.get 123, (err, user) -> user.destroy (err) -> if err console.log "Error destroying user:", err else console.log "Just destroyed", user.fullName() TODO This still needs a lot of work and love, including but not limited to: • Validation • Better error handling • Using promises rather than callbacks • More adapters dk-routes WARNING! This framework is currently in very early development, it may be broken or may break at any time. This is a DrumKit plugin that adds URL routing on both the server and browser. Installation Install dk-routes with npm: npm install dk-routes Getting Started The dk-routes plugin assumes that you have a routes.coffee file that defines all your routes. To use a different file, pass the path option to config: dk.routes.config path: "#{__dirname}/nonstandard-path.coffee" Inside this file you can define your routes, which will be available both on the server and on the browser. The routes DSL provides you with the top level methods get, post, put and del (delete). Each of these methods takes three parameters -- a route URL, an optional helper method name and a function. For example: get "/users", "users", -> dk.model("User").all {}, (err, users) => this.render "users", users: users In the above example, when either the server or the browser receives a request for the url /users, it will fetch all the User objects and use them to render the users view. Also, because "users" was passed as the second parameter to get, the helper method usersPath will be added to all templates. Note that in the example, the callback passed to the User.all method uses the double arrow => rather than the single ->. This is done to maintain the value of this inside the callback because inside routes, this points to a special RouteContext object. RouteContext Inside of any route function, this refers to a RouteContext object. These objects have two purposes: 1. Make request details available (ex. params) 2. Provide route actions (ex. rendering, redirects) Here is the current (limited) API: params(paramName) Returns the value of the request param with the given name. This param could be in the URL, the querystring or a POST message body. get "/users/:id", "user", -> dk.model("User").get this.params("id"), (err, user) => this.render "user", user: user render(templateName, locals) Renders the template with the given templateName using the given locals. get "/users/:id", "user", -> dk.model("User").get this.params("id"), (err, user) => this.render "user", user: user redirect(path) Redirect the user to the given path. post "/users", -> dk.model("User").create this.params("user"), (err, user) => this.redirect "/users/#{user.id}" title(str) Sets the value of the page title tag. get "/users/:id", "user", -> dk.model("User").get this.params("id"), (err, user) => this.title "User: #{user.fullName()}" this.description "This is a page about #{user.fullName()}" this.render "user", user: user description(str) Sets the value of the page description meta tag. get "/users/:id", "user", -> dk.model("User").get this.params("id"), (err, user) => this.title "User: #{user.fullName()}" this.description "This is a page about #{user.fullName()}" this.render "user", user: user TODO Tons of work still needed on this, especially: • Figure out how to keep browser from overwriting what server generates • Build out RouteContext to have more request data and actions • Allow routes file to be straight JS • More routing features dk-server HTTP Server Plugin for DrumKit.js WARNING! This framework is currently in very early development, it may be broken or may break at any time. Installation You can install dk-server using npm: npm install dk-server Getting Started This module is meant to be pretty low-level, so application developers should not need to ever use it directly. If you need to setup URLs and respond to HTTP requests, you should probably be using the dk-routes plugin. Plugin Developers Guide The dk-server plugin acts as a Connect compliant server to allow you to respond to requests and wire up middleware. You are given get, post, put, del and use. This module cannot be used on the browser. dk.server.get "/hello", (req, res) -> res.send "Hello there!" connect = require "connect" dk.server.use connect.logger(format: ":method :url") NOTE: If you need to serve asset files (JS, CSS, images), use dk-assets. dk-template Server and Browser Templating for DrumKit.js WARNING! This framework is currently in very early development, it may be broken or may break at any time. Installation You can install dk-template using npm: npm install dk-assets Getting Started Out of the box, dk-template assumes that you have a views directory that holds all of your templates. If you need to customize this, you can do so in your app configuration: dk.template.config dir: "/path/to/my/views" Currently dk-template supports .eco and .ejs templates. Other rendering engines can easily be added (see Plugin Developers Guide). The render method takes a template name and a context object, returning the rendered template as a string: <!-- in views/js-user.ejs --> <p>My name is <%= user.name %> and I like straight JS.</p> ```html <!-- in views/coffee-user.eco --> <p>My name is <%= @user.name %> and I prefer CoffeeScript.</p> ```coffeescript # In my CoffeeScript source dk.template.render "js-user", user: {name: "John"} # => returns "<p>My name is John and I like straight JS.</p>" dk.template.render "coffee-user", user: {name: "Jane"} # => returns "<p>My name is Jane and I prefer CoffeeScript.</p>" The `render` method is available both on the server and the browser. Please refer to the EJS and ECO projects' documentation for a full explanation of their features. ## View Helper Methods To add helper methods that will be available to all templates, use the `dk.template.helpers.add` method in your `helpers.coffee` file: ```html <!-- in views/quote.eco --> <p>Favorite Quote: "<%= @truncate @quote, 10 %>"</p> # In helpers.coffee dk.template.helpers.add truncate: (str, len) -> if str.length > len str.slice(0, len) + '...' else str # Elsewhere in the app dk.template.render "quote", quote: "Four score and seven years ago" # returns '<p>Favorite Quote: "Four score..."</p> Helper methods defined in your helpers.coffee file will be made available on both the server and browser. If you want to define your helper methods in a file other than helpers.coffee, you can do so by using the helpersPath config option: dk.template.config helpersPath: "#{__dirname}/nonstandardHelpersPath.coffee Also, you can use a helpers.js file instead if you prefer straight JS. Plugin Developers Guide Support for .ejs, .eco and .mustache files was added simply using Drumkit plugin extensions, so it is easy to create your own extensions to support other rendering engines. View the following files to see how it is done: • lib/dk-template-eco.coffee • lib/dk-template-ejs.coffee • lib/dk-template-mustache.coffee • public/js/dk-template-eco.coffee • public/js/dk-template-ejs.coffee • public/js/dk-template-mustache.coffee dk.template.layout This module is responsible for rendering full page layouts on the server. By default, dk.template.layout uses its own minimal layout, which is at ./views/layout.eco. To use your own custom layout file, use the path option of the config method. dk.template.layout.config(options) Available options: • path: (String) An absolute path to your custom layout file. Defaults to using a built-in layout. • title: (String) A default page title, defaults to "". • description: (String) A default page description, defaults to "". dk.template.layout.config path: "#{__dirname}/views/layout.eco" title: "My DrumKit App" description: "This app was built using DrumKit.js" dk.template.layout.render(templateName, context) Renders the template called templateName inside of your layout. NOTE: The layout has these additional values available in its context: • content: The rendered content of the inner view template templateName. • title: The page title. • description: The page description. # renders the 'users' template inside of the page layout dk.template.layout.render "users", users: ["Bill", "Susan"] dk-websockets WARNING! This framework is currently in very early development, it may be broken or may break at any time. The dk-websockets plugin adds Websocket functionality to your DrumKit.js application. Installation Install the package with npm: npm install dk-websockets Getting Started For general use you should not use dk-websockets directly -- use the higher-level dk-transport instead. Plugin Developers Guide The dk.websockets object is an EventEmitter, so you can listen for the following events: dk.websockets.on "connection", (client) -> # do something dk.websockets.on "message", (msg) -> # do something dk.websockets.on "disconnect", (client) -> # do something npm loves you
{ "url": "https://www.npmjs.org/package/drumkit", "source_domain": "www.npmjs.org", "snapshot_id": "crawl=CC-MAIN-2014-15", "warc_metadata": { "Content-Length": "39659", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:IIYNI5466AGVA4MBZ2RLENUOPYY6JIOB", "WARC-Concurrent-To": "<urn:uuid:9f5385c9-97f4-4a32-a68b-981ec96ff464>", "WARC-Date": "2014-04-19T09:55:22Z", "WARC-IP-Address": "199.27.76.162", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:NC2NMUD7G36RYE3S4HPEDZ5FS6ZCGRZM", "WARC-Record-ID": "<urn:uuid:08d44e4a-e706-4803-878d-18a99eb9205d>", "WARC-Target-URI": "https://www.npmjs.org/package/drumkit", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:04efafb3-9a04-464a-aa1a-0a93b3e8b73e>" }, "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, 8, 9, 61, 62, 82, 112, 113, 121, 122, 229, 230, 309, 310, 323, 324, 417, 418, 441, 442, 648, 649, 665, 666, 742, 743, 755, 778, 779, 941, 942, 953, 967, 968, 1031, 1032, 1052, 1053, 1126, 1127, 1147, 1163, 1164, 1184, 1185, 1261, 1262, 1318, 1319, 1353, 1354, 1398, 1399, 1460, 1461, 1469, 1470, 1577, 1578, 1698, 1699, 1712, 1713, 1743, 1744, 1764, 1765, 1784, 1785, 1805, 1806, 1930, 1931, 1953, 1954, 2100, 2101, 2125, 2126, 2221, 2222, 2248, 2249, 2306, 2307, 2317, 2318, 2357, 2358, 2465, 2466, 2479, 2480, 2517, 2518, 2540, 2541, 2557, 2558, 2654, 2655, 2664, 2672, 2679, 2680, 2925, 2926, 3121, 3122, 3146, 3147, 3503, 3504, 3559, 3634, 3635, 3686, 3763, 3764, 3809, 3848, 3915, 3916, 4060, 4061, 4107, 4182, 4183, 4225, 4302, 4303, 4354, 4393, 4460, 4461, 4470, 4471, 4497, 4498, 4517, 4518, 4655, 4864, 4927, 4989, 4990, 5041, 5042, 5227, 5228, 5283, 5358, 5359, 5410, 5487, 5488, 5533, 5572, 5639, 5640, 5677, 5678, 5915, 5916, 5962, 6037, 6038, 6080, 6157, 6158, 6209, 6248, 6315, 6316, 6336, 6337, 6460, 6461, 6492, 6569, 6570, 6591, 6592, 6718, 6719, 6751, 6833, 6834, 6845, 6846, 6953, 6954, 7035, 7036, 7049, 7050, 7088, 7089, 7112, 7113, 7127, 7128, 7145, 7146, 7292, 7293, 7332, 7333, 7419, 7420, 7491, 7492, 7526, 7527, 7678, 7679, 7711, 7720, 7752, 7759, 7790, 7791, 7832, 7833, 8001, 8002, 8046, 8055, 8087, 8094, 8127, 8128, 8164, 8165, 8407, 8408, 8456, 8484, 8493, 8525, 8532, 8565, 8566, 8598, 8599, 8781, 8782, 8813, 8822, 8854, 8861, 8900, 8901, 8916, 8917, 9002, 9003, 9020, 9021, 9058, 9059, 9166, 9167, 9180, 9181, 9211, 9212, 9241, 9242, 9258, 9259, 9489, 9490, 9499, 9500, 9607, 9608, 9747, 9748, 9761, 9762, 9790, 9791, 9812, 9813, 9829, 9830, 10033, 10034, 10090, 10091, 10412, 10413, 10440, 10492, 10528, 10563, 10564, 10600, 10640, 10679, 10707, 10745, 10798, 10799, 10853, 10875, 10908, 10909, 11021, 11022, 11122, 11123, 11146, 11199, 11238, 11239, 11255, 11256, 11510, 11511, 11625, 11626, 11859, 11860, 11874, 11875, 11902, 11903, 12029, 12030, 12053, 12106, 12107, 12145, 12146, 12247, 12248, 12271, 12300, 12309, 12354, 12361, 12383, 12428, 12429, 12461, 12462, 12505, 12506, 12529, 12558, 12567, 12611, 12618, 12661, 12662, 12703, 12704, 12807, 12808, 12831, 12894, 12903, 12947, 12954, 12997, 12998, 13068, 13077, 13121, 13128, 13171, 13172, 13215, 13216, 13252, 13253, 13281, 13282, 13320, 13321, 13344, 13371, 13380, 13426, 13433, 13455, 13456, 13473, 13474, 13502, 13503, 13619, 13620, 13643, 13677, 13701, 13725, 13734, 13776, 13783, 13826, 13827, 13850, 13851, 13948, 13949, 13972, 14001, 14025, 14036, 14084, 14093, 14145, 14146, 14151, 14152, 14223, 14224, 14239, 14265, 14306, 14324, 14325, 14335, 14336, 14443, 14444, 14523, 14524, 14537, 14538, 14566, 14567, 14589, 14590, 14606, 14607, 14758, 14759, 14821, 14822, 15139, 15140, 15166, 15209, 15247, 15248, 15546, 15547, 15800, 15801, 15814, 15815, 15916, 15917, 15966, 16020, 16021, 16056, 16057, 16075, 16076, 16208, 16209, 16238, 16295, 16330, 16331, 16360, 16361, 16434, 16435, 16464, 16521, 16556, 16557, 16572, 16573, 16610, 16611, 16629, 16691, 16729, 16730, 16741, 16742, 16780, 16781, 16810, 16867, 16909, 16972, 17007, 17008, 17025, 17026, 17075, 17076, 17105, 17162, 17204, 17267, 17302, 17303, 17308, 17309, 17356, 17357, 17431, 17496, 17536, 17562, 17563, 17573, 17574, 17608, 17609, 17716, 17717, 17730, 17731, 17768, 17769, 17791, 17792, 17808, 17809, 18028, 18029, 18053, 18054, 18256, 18257, 18295, 18321, 18322, 18350, 18403, 18404, 18477, 18478, 18490, 18491, 18536, 18537, 18644, 18645, 18658, 18659, 18698, 18699, 18721, 18722, 18738, 18739, 18913, 18914, 18958, 18959, 19197, 19198, 19228, 19287, 19288, 19296, 19330, 19393, 19394, 19410, 19438, 19439, 19490, 19552, 19553, 19608, 19673, 19674, 19757, 19842, 19843, 19844, 19867, 19868, 19940, 20004, 20005, 20013, 20041, 20094, 20114, 20139, 20165, 20189, 20221, 20230, 20240, 20263, 20331, 20381, 20382, 20621, 20622, 20698, 20699, 20770, 20771, 20795, 20796, 21017, 21018, 21049, 21080, 21116, 21153, 21190, 21232, 21233, 21252, 21253, 21497, 21498, 21533, 21534, 21553, 21554, 21655, 21713, 21783, 21809, 21849, 21875, 21928, 21929, 21978, 21979, 22043, 22044, 22115, 22116, 22191, 22218, 22257, 22314, 22374, 22375, 22389, 22390, 22497, 22498, 22584, 22585, 22598, 22599, 22629, 22630, 22656, 22657, 22673, 22674, 22778, 22779, 22803, 22804, 22893, 22894, 22937, 22954, 22991, 23008, 23051, 23068 ], "line_end_idx": [ 8, 9, 61, 62, 82, 112, 113, 121, 122, 229, 230, 309, 310, 323, 324, 417, 418, 441, 442, 648, 649, 665, 666, 742, 743, 755, 778, 779, 941, 942, 953, 967, 968, 1031, 1032, 1052, 1053, 1126, 1127, 1147, 1163, 1164, 1184, 1185, 1261, 1262, 1318, 1319, 1353, 1354, 1398, 1399, 1460, 1461, 1469, 1470, 1577, 1578, 1698, 1699, 1712, 1713, 1743, 1744, 1764, 1765, 1784, 1785, 1805, 1806, 1930, 1931, 1953, 1954, 2100, 2101, 2125, 2126, 2221, 2222, 2248, 2249, 2306, 2307, 2317, 2318, 2357, 2358, 2465, 2466, 2479, 2480, 2517, 2518, 2540, 2541, 2557, 2558, 2654, 2655, 2664, 2672, 2679, 2680, 2925, 2926, 3121, 3122, 3146, 3147, 3503, 3504, 3559, 3634, 3635, 3686, 3763, 3764, 3809, 3848, 3915, 3916, 4060, 4061, 4107, 4182, 4183, 4225, 4302, 4303, 4354, 4393, 4460, 4461, 4470, 4471, 4497, 4498, 4517, 4518, 4655, 4864, 4927, 4989, 4990, 5041, 5042, 5227, 5228, 5283, 5358, 5359, 5410, 5487, 5488, 5533, 5572, 5639, 5640, 5677, 5678, 5915, 5916, 5962, 6037, 6038, 6080, 6157, 6158, 6209, 6248, 6315, 6316, 6336, 6337, 6460, 6461, 6492, 6569, 6570, 6591, 6592, 6718, 6719, 6751, 6833, 6834, 6845, 6846, 6953, 6954, 7035, 7036, 7049, 7050, 7088, 7089, 7112, 7113, 7127, 7128, 7145, 7146, 7292, 7293, 7332, 7333, 7419, 7420, 7491, 7492, 7526, 7527, 7678, 7679, 7711, 7720, 7752, 7759, 7790, 7791, 7832, 7833, 8001, 8002, 8046, 8055, 8087, 8094, 8127, 8128, 8164, 8165, 8407, 8408, 8456, 8484, 8493, 8525, 8532, 8565, 8566, 8598, 8599, 8781, 8782, 8813, 8822, 8854, 8861, 8900, 8901, 8916, 8917, 9002, 9003, 9020, 9021, 9058, 9059, 9166, 9167, 9180, 9181, 9211, 9212, 9241, 9242, 9258, 9259, 9489, 9490, 9499, 9500, 9607, 9608, 9747, 9748, 9761, 9762, 9790, 9791, 9812, 9813, 9829, 9830, 10033, 10034, 10090, 10091, 10412, 10413, 10440, 10492, 10528, 10563, 10564, 10600, 10640, 10679, 10707, 10745, 10798, 10799, 10853, 10875, 10908, 10909, 11021, 11022, 11122, 11123, 11146, 11199, 11238, 11239, 11255, 11256, 11510, 11511, 11625, 11626, 11859, 11860, 11874, 11875, 11902, 11903, 12029, 12030, 12053, 12106, 12107, 12145, 12146, 12247, 12248, 12271, 12300, 12309, 12354, 12361, 12383, 12428, 12429, 12461, 12462, 12505, 12506, 12529, 12558, 12567, 12611, 12618, 12661, 12662, 12703, 12704, 12807, 12808, 12831, 12894, 12903, 12947, 12954, 12997, 12998, 13068, 13077, 13121, 13128, 13171, 13172, 13215, 13216, 13252, 13253, 13281, 13282, 13320, 13321, 13344, 13371, 13380, 13426, 13433, 13455, 13456, 13473, 13474, 13502, 13503, 13619, 13620, 13643, 13677, 13701, 13725, 13734, 13776, 13783, 13826, 13827, 13850, 13851, 13948, 13949, 13972, 14001, 14025, 14036, 14084, 14093, 14145, 14146, 14151, 14152, 14223, 14224, 14239, 14265, 14306, 14324, 14325, 14335, 14336, 14443, 14444, 14523, 14524, 14537, 14538, 14566, 14567, 14589, 14590, 14606, 14607, 14758, 14759, 14821, 14822, 15139, 15140, 15166, 15209, 15247, 15248, 15546, 15547, 15800, 15801, 15814, 15815, 15916, 15917, 15966, 16020, 16021, 16056, 16057, 16075, 16076, 16208, 16209, 16238, 16295, 16330, 16331, 16360, 16361, 16434, 16435, 16464, 16521, 16556, 16557, 16572, 16573, 16610, 16611, 16629, 16691, 16729, 16730, 16741, 16742, 16780, 16781, 16810, 16867, 16909, 16972, 17007, 17008, 17025, 17026, 17075, 17076, 17105, 17162, 17204, 17267, 17302, 17303, 17308, 17309, 17356, 17357, 17431, 17496, 17536, 17562, 17563, 17573, 17574, 17608, 17609, 17716, 17717, 17730, 17731, 17768, 17769, 17791, 17792, 17808, 17809, 18028, 18029, 18053, 18054, 18256, 18257, 18295, 18321, 18322, 18350, 18403, 18404, 18477, 18478, 18490, 18491, 18536, 18537, 18644, 18645, 18658, 18659, 18698, 18699, 18721, 18722, 18738, 18739, 18913, 18914, 18958, 18959, 19197, 19198, 19228, 19287, 19288, 19296, 19330, 19393, 19394, 19410, 19438, 19439, 19490, 19552, 19553, 19608, 19673, 19674, 19757, 19842, 19843, 19844, 19867, 19868, 19940, 20004, 20005, 20013, 20041, 20094, 20114, 20139, 20165, 20189, 20221, 20230, 20240, 20263, 20331, 20381, 20382, 20621, 20622, 20698, 20699, 20770, 20771, 20795, 20796, 21017, 21018, 21049, 21080, 21116, 21153, 21190, 21232, 21233, 21252, 21253, 21497, 21498, 21533, 21534, 21553, 21554, 21655, 21713, 21783, 21809, 21849, 21875, 21928, 21929, 21978, 21979, 22043, 22044, 22115, 22116, 22191, 22218, 22257, 22314, 22374, 22375, 22389, 22390, 22497, 22498, 22584, 22585, 22598, 22599, 22629, 22630, 22656, 22657, 22673, 22674, 22778, 22779, 22803, 22804, 22893, 22894, 22937, 22954, 22991, 23008, 23051, 23068, 23081 ] }
{ "red_pajama_v2": { "ccnet_original_length": 23081, "ccnet_original_nlines": 672, "rps_doc_curly_bracket": 0.003032800043001771, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2586437463760376, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.013753579929471016, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.2945558726787567, "rps_doc_frac_unique_words": 0.21370206773281097, "rps_doc_mean_word_length": 5.417347431182861, "rps_doc_num_sentences": 443, "rps_doc_symbol_to_word_ratio": 0.012225409969687462, "rps_doc_unigram_entropy": 5.662871360778809, "rps_doc_word_count": 3182, "rps_doc_frac_chars_dupe_10grams": 0.17908109724521637, "rps_doc_frac_chars_dupe_5grams": 0.25617820024490356, "rps_doc_frac_chars_dupe_6grams": 0.2430676370859146, "rps_doc_frac_chars_dupe_7grams": 0.22386588156223297, "rps_doc_frac_chars_dupe_8grams": 0.21475808322429657, "rps_doc_frac_chars_dupe_9grams": 0.19857291877269745, "rps_doc_frac_chars_top_2gram": 0.006265230011194944, "rps_doc_frac_chars_top_3gram": 0.009571880102157593, "rps_doc_frac_chars_top_4gram": 0.01276249997317791, "rps_doc_books_importance": -2563.748291015625, "rps_doc_books_importance_length_correction": -2563.748291015625, "rps_doc_openwebtext_importance": -1262.4903564453125, "rps_doc_openwebtext_importance_length_correction": -1262.4903564453125, "rps_doc_wikipedia_importance": -878.3158569335938, "rps_doc_wikipedia_importance_length_correction": -878.3158569335938 }, "fasttext": { "dclm": 0.054951008409261703, "english": 0.7360032200813293, "fineweb_edu_approx": 1.6909713745117188, "eai_general_math": 0.3645095229148865, "eai_open_web_math": 0.10863763093948364, "eai_web_code": 0.7766842842102051 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
3,893,590,462,917,006,000
Kubernetes教程 Kubernetes节点健康检测 节点问题检测器(Node Problem Detector)是一个守护进程,用于监视和报告节点的健康状况。它可以以DaemonSet或独立守护进程的形式在Kubernetes集群中运行。节点问题检测器会监视节点上运行的各种守护进程,例如容器运行时、kubelet、系统服务等,以便及时发现和报告节点问题。 如果节点出现问题,节点问题检测器会将这些问题以节点Condition和Event的形式报告给API服务器,管理员可以通过kubectl命令或Kubernetes Dashboard等工具查看这些信息。 一、准备 必须拥有一个 Kubernetes 的集群,同时必须配置 kubectl 命令行工具与集群通信。 建议在至少有两个不作为控制平面主机的节点的集群上运行本教程。 如果还没有集群,可以通过 Minikube 构建一个自己的集群,或者可以使用下面的 Kubernetes 练习环境之一: • Killercoda • 玩转 Kubernetes 二、局限性 节点问题检测器使用内核日志格式来报告内核问题。 内核日志是由操作系统内核生成的日志,其中包含了与内核相关的事件、错误和警告信息。节点问题检测器会通过收集和分析这些内核日志,帮助管理员了解节点的健康状况并及时采取相应的措施。 三、启用节点问题检测器 一些云供应商将节点问题检测器以插件形式启用。 还可以使用 kubectl 或创建插件 DaemonSet 来启用节点问题探测器。 1、使用 kubectl 启用节点问题检测器 kubectl 提供了节点问题探测器最灵活的管理。 可以覆盖默认配置使其适合环境或检测自定义节点问题。例如: 创建类似于 node-strought-detector.yaml 的节点问题检测器配置: apiVersion: apps/v1 kind: DaemonSet metadata: name: node-problem-detector-v0.1 namespace: kube-system labels: k8s-app: node-problem-detector version: v0.1 kubernetes.io/cluster-service: "true" spec: selector: matchLabels: k8s-app: node-problem-detector version: v0.1 kubernetes.io/cluster-service: "true" template: metadata: labels: k8s-app: node-problem-detector version: v0.1 kubernetes.io/cluster-service: "true" spec: hostNetwork: true containers: - name: node-problem-detector image: registry.k8s.io/node-problem-detector:v0.1 securityContext: privileged: true resources: limits: cpu: "200m" memory: "100Mi" requests: cpu: "20m" memory: "20Mi" volumeMounts: - name: log mountPath: /log readOnly: true volumes: - name: log hostPath: path: /var/log/ 建议检查系统日志目录是否适用于操作系统发行版本。 使用 kubectl 启动节点问题检测器: kubectl apply -f https://k8s.io/examples/debug/node-problem-detector.yaml 2、使用插件 Pod 启用节点问题检测器 如果使用的是自定义集群引导解决方案,不需要覆盖默认配置, 可以利用插件 Pod 进一步自动化部署。创建 node-strick-detector.yaml,并在控制平面节点上保存配置到插件 Pod 的目录 /etc/kubernetes/addons/node-problem-detector。 四、覆盖配置文件 构建节点问题检测器的 docker 镜像时,会嵌入默认配置。不过,可以像下面这样使用 ConfigMap 将其覆盖: 更改 config/ 中的配置文件。创建 ConfigMap node-strick-detector-config: kubectl create configmap node-problem-detector-config --from-file=config/ 更改 node-problem-detector.yaml 以使用 ConfigMap: apiVersion: apps/v1 kind: DaemonSet metadata: name: node-problem-detector-v0.1 namespace: kube-system labels: k8s-app: node-problem-detector version: v0.1 kubernetes.io/cluster-service: "true" spec: selector: matchLabels: k8s-app: node-problem-detector version: v0.1 kubernetes.io/cluster-service: "true" template: metadata: labels: k8s-app: node-problem-detector version: v0.1 kubernetes.io/cluster-service: "true" spec: hostNetwork: true containers: - name: node-problem-detector image: registry.k8s.io/node-problem-detector:v0.1 securityContext: privileged: true resources: limits: cpu: "200m" memory: "100Mi" requests: cpu: "20m" memory: "20Mi" volumeMounts: - name: log mountPath: /log readOnly: true - name: config # 使用 ConfigMap 卷中的数据覆盖 config/ 目录内容 mountPath: /config readOnly: true volumes: - name: log hostPath: path: /var/log/ - name: config # 定义 ConfigMap 卷 configMap: name: node-problem-detector-config 使用新的配置文件重新创建节点问题检测器: # 如果正在运行节点问题检测器,请先删除,然后再重新创建 kubectl delete -f https://k8s.io/examples/debug/node-problem-detector.yaml kubectl apply -f https://k8s.io/examples/debug/node-problem-detector-configmap.yaml 注意:此方法仅适用于通过 kubectl 启动的节点问题检测器。 如果节点问题检测器作为集群插件运行,则不支持覆盖配置。 插件管理器不支持 ConfigMap。 五、问题守护程序 问题守护程序是节点问题检测器的子守护程序,它监视特定类型的节点问题并报告给节点问题检测器。 支持下面几种类型的问题守护程序。 • SystemLogMonitor 类型的守护程序根据预定义的规则监视系统日志并报告问题和指标。 可以针对不同的日志源自定义配置如 filelog、 kmsg、 kernel、 abrt 和 systemd。 • SystemStatsMonitor 类型的守护程序收集各种与健康相关的系统统计数据作为指标。 可以通过更新其配置文件来自定义其行为。 • CustomPluginMonitor 类型的守护程序通过运行用户定义的脚本来调用和检查各种节点问题。 可以使用不同的自定义插件监视器来监视不同的问题,并通过更新 配置文件 来定制守护程序行为。 • HealthChecker 类型的守护程序检查节点上的 kubelet 和容器运行时的健康状况。 1、增加对其他日志格式的支持 系统日志监视器目前支持基于文件的日志、journald 和 kmsg。 可以通过实现一个新的 log watcher 来添加额外的日志源。 2、添加自定义插件监视器 可以通过开发自定义插件来扩展节点问题检测器,以执行以任何语言编写的任何监控脚本。 监控脚本必须符合退出码和标准输出的插件协议。 六、导出器 导出器(Exporter)向特定后端报告节点问题和/或指标。 支持下列导出器: 1、Kubernetes exporter:此导出器向 Kubernetes API 服务器报告节点问题。 临时问题报告为事件,永久性问题报告为节点状况。 2、Prometheus exporter:此导出器在本地将节点问题和指标报告为 Prometheus(或 OpenMetrics)指标。 可以使用命令行参数指定导出器的 IP 地址和端口。 3、Stackdriver exporter:此导出器向 Stackdriver Monitoring API 报告节点问题和指标。 七、建议和限制 建议在集群中运行节点问题检测器以监控节点运行状况。 运行节点问题检测器时,可以预期每个节点上的额外资源开销。 通常这是可接受的,因为: • 内核日志增长相对缓慢; • 已经为节点问题检测器设置了资源限制; • 即使在高负载下,资源使用也是可接受的。 广告合作 QQ群号:707632017 温馨提示: 1、本网站发布的内容(图片、视频和文字)以原创、转载和分享网络内容为主,如果涉及侵权请尽快告知,我们将会在第一时间删除。邮箱:2942802716#qq.com。(#改为@) 2、本站原创内容未经允许不得转裁,转载请注明出处“站长百科”和原文地址。 目录
{ "url": "https://www.zzbaike.com/28385.html", "source_domain": "www.zzbaike.com", "snapshot_id": "CC-MAIN-2024-30", "warc_metadata": { "Content-Length": "102045", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:MITJPNAP7FEGQPJWTHGKRIAGI4KARHPF", "WARC-Concurrent-To": "<urn:uuid:498cbd61-66fc-42df-8722-ff40a09414a8>", "WARC-Date": "2024-07-19T19:27:20Z", "WARC-IP-Address": "61.132.227.37", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:G2ERRUXUZGMXMHAXFI7VCMDO6XBMYWJP", "WARC-Record-ID": "<urn:uuid:159c0b9f-0f20-4c1f-8352-980796773d98>", "WARC-Target-URI": "https://www.zzbaike.com/28385.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:33e7b4ce-9e0a-4b0f-b647-a80029239dcf>" }, "warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-235\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, 13, 14, 31, 32, 185, 186, 287, 288, 293, 294, 435, 436, 451, 469, 470, 476, 477, 589, 590, 602, 603, 668, 669, 692, 693, 748, 749, 795, 796, 816, 832, 842, 875, 898, 906, 937, 951, 989, 995, 1005, 1018, 1050, 1064, 1102, 1112, 1122, 1130, 1161, 1175, 1213, 1219, 1237, 1249, 1279, 1329, 1346, 1363, 1374, 1382, 1394, 1410, 1420, 1431, 1446, 1460, 1472, 1488, 1503, 1512, 1524, 1534, 1550, 1551, 1576, 1577, 1599, 1600, 1674, 1675, 1696, 1697, 1846, 1847, 1856, 1857, 1916, 1917, 1977, 1978, 2052, 2053, 2098, 2099, 2119, 2136, 2147, 2181, 2205, 2214, 2246, 2261, 2300, 2307, 2318, 2332, 2364, 2379, 2418, 2429, 2440, 2449, 2481, 2496, 2535, 2542, 2561, 2574, 2605, 2656, 2674, 2691, 2702, 2711, 2724, 2741, 2752, 2764, 2780, 2795, 2808, 2825, 2841, 2893, 2913, 2928, 2938, 2950, 2960, 2977, 3009, 3021, 3056, 3057, 3078, 3079, 3108, 3183, 3267, 3268, 3301, 3302, 3350, 3351, 3360, 3361, 3424, 3425, 3533, 3605, 3707, 3760, 3761, 3776, 3777, 3847, 3848, 3861, 3862, 3926, 3927, 3933, 3934, 3974, 3975, 4053, 4054, 4150, 4151, 4218, 4219, 4227, 4228, 4296, 4297, 4313, 4336, 4360, 4365, 4380, 4381, 4387, 4388, 4476, 4477, 4514, 4515 ], "line_end_idx": [ 13, 14, 31, 32, 185, 186, 287, 288, 293, 294, 435, 436, 451, 469, 470, 476, 477, 589, 590, 602, 603, 668, 669, 692, 693, 748, 749, 795, 796, 816, 832, 842, 875, 898, 906, 937, 951, 989, 995, 1005, 1018, 1050, 1064, 1102, 1112, 1122, 1130, 1161, 1175, 1213, 1219, 1237, 1249, 1279, 1329, 1346, 1363, 1374, 1382, 1394, 1410, 1420, 1431, 1446, 1460, 1472, 1488, 1503, 1512, 1524, 1534, 1550, 1551, 1576, 1577, 1599, 1600, 1674, 1675, 1696, 1697, 1846, 1847, 1856, 1857, 1916, 1917, 1977, 1978, 2052, 2053, 2098, 2099, 2119, 2136, 2147, 2181, 2205, 2214, 2246, 2261, 2300, 2307, 2318, 2332, 2364, 2379, 2418, 2429, 2440, 2449, 2481, 2496, 2535, 2542, 2561, 2574, 2605, 2656, 2674, 2691, 2702, 2711, 2724, 2741, 2752, 2764, 2780, 2795, 2808, 2825, 2841, 2893, 2913, 2928, 2938, 2950, 2960, 2977, 3009, 3021, 3056, 3057, 3078, 3079, 3108, 3183, 3267, 3268, 3301, 3302, 3350, 3351, 3360, 3361, 3424, 3425, 3533, 3605, 3707, 3760, 3761, 3776, 3777, 3847, 3848, 3861, 3862, 3926, 3927, 3933, 3934, 3974, 3975, 4053, 4054, 4150, 4151, 4218, 4219, 4227, 4228, 4296, 4297, 4313, 4336, 4360, 4365, 4380, 4381, 4387, 4388, 4476, 4477, 4514, 4515, 4517 ] }
{ "red_pajama_v2": { "ccnet_original_length": 4517, "ccnet_original_nlines": 196, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.01818181946873665, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.004278069827705622, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.6245989203453064, "rps_doc_frac_unique_words": 0.5632529854774475, "rps_doc_mean_word_length": 11.394577980041504, "rps_doc_num_sentences": 31, "rps_doc_symbol_to_word_ratio": 0.005347589962184429, "rps_doc_unigram_entropy": 4.918882846832275, "rps_doc_word_count": 332, "rps_doc_frac_chars_dupe_10grams": 0.29024583101272583, "rps_doc_frac_chars_dupe_5grams": 0.3103356957435608, "rps_doc_frac_chars_dupe_6grams": 0.3103356957435608, "rps_doc_frac_chars_dupe_7grams": 0.3103356957435608, "rps_doc_frac_chars_dupe_8grams": 0.3103356957435608, "rps_doc_frac_chars_dupe_9grams": 0.29024583101272583, "rps_doc_frac_chars_top_2gram": 0.03965106979012489, "rps_doc_frac_chars_top_3gram": 0.05075336992740631, "rps_doc_frac_chars_top_4gram": 0.05551150068640709, "rps_doc_books_importance": -456.71673583984375, "rps_doc_books_importance_length_correction": -456.71673583984375, "rps_doc_openwebtext_importance": -272.0281677246094, "rps_doc_openwebtext_importance_length_correction": -272.0281677246094, "rps_doc_wikipedia_importance": -228.22833251953125, "rps_doc_wikipedia_importance_length_correction": -228.22833251953125 }, "fasttext": { "dclm": 0.4556007981300354, "english": 0.017945459112524986, "fineweb_edu_approx": 1.8321808576583862, "eai_general_math": 0.0014362899819388986, "eai_open_web_math": 0.02322310023009777, "eai_web_code": 0.8717556595802307 } }
{ "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.028", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
-831,862,203,192,418,000
Applying the same click function to multiple buttons Hello, I am trying to write code to apply the same function to multiple buttons. I say the ‘same’ but actually, I want to change the button colour depending on which button is clicked, so the principle is the same, but the ‘event’ is slightly different depending on which button is clicked. After reading a bit, I came up with following, but it’s not working. Would someone know what I’m doing wrong? function changeColor() { const buttons = document.querySelectorAll(".btn"); for (let i = 0; i < buttons.length; i++) { buttons[i].addEventListener("click", function () { buttons[i].style.backgroundColor = "green"; }); } I think missing => and function name in function is causing problem. @coderostro please share the html code that comes with this code, it’s needed to help you with debugging. Do you have a codepen or something like that maybe? as long as the second argument is a function it’s fine, it doesn’t need to be an arrow function 1 Like thanks, I forgot to change the function name 1 Like Yes, here it is and thank you (the blue buttons were only coloured to see if I was targeting the right elements in a separate exercise earlier). The code is very rough as I am just practising, so apologies if hard to read. please explain how to reproduce, and where is the code you are asking about Or create a different pen with the minimum code necessary to reproduce the issue you are facing Sorry, I don’t understand. You mean you can’t click on the link I sent to see the code on Codepen? I can open the pen, I don’t know where to look if you don’t explain ok, I understand what you mean now. Having looked at it a second time, I made a few changes and still wrong because I think I’m not sure where I should be trying to change the button background colour within the function either (completely omitted at the moment). I’ll send the link anyway… The (incomplete) function is on line 21: function changePomodoroColor() { const pomodoroButtons = document.querySelectorAll(".pomodoro-btn"); for (let i = 0; i < pomodoroButtons.length; i++) { pomodoroButtons[i].addEventListener("click", changePomodoroColor () { pomodoroButtons[i].style.backgroundColor = "green"; }); } It really depends on the actual functionality you are going for. You can use HTML attributes, like ids and data sets. If you make the attribute value the same as the color or class name you can apply it to the click target as inline styles, or using classs. Example code <button id="red">Red</button> <button id="green">Green</button> <button id="blue">Blue</button> .red { background-color: red; } .green { background-color: green; } .blue { background-color: blue; } document.querySelectorAll("button").forEach((btn) => { btn.addEventListener("click", ({ target }) => { // the id value is the same as the class name target.classList.toggle(target.id) }); }); thank you. I am sure I am not understanding this code properly though. I have used ‘toggle’ before, but only with the onclick attribute and not with click events (still in the very beginning stages). I have a few questions about the code if it’s okay…sorry if obvious, but just want to make sure I understand. Is ‘btn’ in the above just the JS variable I need to declare separately for each individual button? If this is so, would ‘target’ be the same as ‘btn’ in my case? And in the case of the ‘toggle’ part, how does the function know what to toggle between (what the two alternatives are)? I think I could do this for one button, it’s the applying the same function to multiple buttons that I’m not sure about. I tried to do it another way with code I found online, but that’s not working either (codepen attached, code starting at line 46). I will try your way as soon as I am sure what ‘btn’ and ‘target’ should be. I basically just want any of the multiple buttons on the right-hand side to turn green if/when clicked. Just for information, I’ve got it working . I used the following code: let buttons = document.querySelectorAll(".btn"); for (let i = 0; i < buttons.length; i++) { buttons[i].addEventListener("click", function () { buttons[i].style.backgroundColor = "green"; }); } Isn’t that the same code as in the initial post, minus the function? How does applying the color green to all the buttons achieve this? Are you not trying to apply a different color to the buttons depending on how many times they are clicked? Like the tasks’ progress (red, yellow, green). To answer your questions. btn is each button element. querySelectorAll returns a NodeList of all the elements. The forEach callback parameter will contain each of the elements. target is a property on the event object. It is the element that triggered the event (the button clicked). { target } is using object destructuring with the parameter. You can’t use a single counter for all your buttons. You could use an HTML dataset attribute to track how many times each button has been clicked. But if I understand your app, it should be data-driven with an application state. So what is shown on the page is a render of the internal state. Much like a todo app (the curriculum has a todo app tutorial you can look at). ok, thanks for the explanations. I don’t want these button to work in the same way as the tasks buttons. I simply want each individual button to turn green if clicked and to return to the original colour if clicked again. I have changed this to a toggle function now , because clicking one button was turning all buttons green. I still haven’t worked out how to get the toggle function working on all buttons though, but I have a separate post on this and just looking at someone’s suggestion to see if I can get it working. Current code is: function changeColor() { let pomButton1 = document.getElementById("pomodoro-btn-1"); pomButton1.classList.toggle("colored"); } it looks like you have multiple topics open on this question, please do not open multiple topics for the same question
{ "url": "https://forum.freecodecamp.org/t/applying-the-same-click-function-to-multiple-buttons/681828", "source_domain": "forum.freecodecamp.org", "snapshot_id": "CC-MAIN-2024-30", "warc_metadata": { "Content-Length": "50090", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:S6KENKVRXXUR2OWYNUPJWHL4TAFKKCSY", "WARC-Concurrent-To": "<urn:uuid:7eb96bce-5853-4b53-b108-34f399b8d897>", "WARC-Date": "2024-07-25T16:35:04Z", "WARC-IP-Address": "184.105.99.43", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:CFWJQHHJPRBFRCGL22Z4MG67GMWOVOT5", "WARC-Record-ID": "<urn:uuid:2a91db5f-793c-4e5c-a02d-526d846a0180>", "WARC-Target-URI": "https://forum.freecodecamp.org/t/applying-the-same-click-function-to-multiple-buttons/681828", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3f9aca67-e5a5-45bc-b9fa-bb27c71b5783>" }, "warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-168\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 53, 54, 61, 62, 346, 347, 457, 458, 483, 536, 537, 582, 637, 687, 695, 699, 700, 769, 781, 782, 928, 929, 1025, 1026, 1033, 1034, 1079, 1080, 1087, 1088, 1311, 1312, 1388, 1484, 1485, 1584, 1585, 1653, 1654, 1690, 1691, 1919, 1920, 1947, 1948, 1989, 1990, 2023, 2093, 2094, 2147, 2221, 2279, 2287, 2291, 2292, 2357, 2358, 2551, 2552, 2565, 2595, 2629, 2661, 2668, 2693, 2695, 2696, 2705, 2732, 2734, 2735, 2743, 2769, 2771, 2826, 2880, 2930, 2969, 2975, 2979, 2980, 3180, 3181, 3291, 3292, 3455, 3456, 3577, 3578, 3699, 3700, 3831, 3832, 3908, 3909, 4013, 4014, 4085, 4086, 4135, 4178, 4231, 4279, 4285, 4287, 4288, 4357, 4358, 4425, 4426, 4580, 4581, 4582, 4608, 4609, 4760, 4761, 4929, 4930, 4931, 4984, 4985, 5079, 5080, 5305, 5306, 5339, 5340, 5412, 5413, 5530, 5531, 5637, 5638, 5835, 5836, 5853, 5854, 5879, 5941, 5983, 5985, 5986 ], "line_end_idx": [ 53, 54, 61, 62, 346, 347, 457, 458, 483, 536, 537, 582, 637, 687, 695, 699, 700, 769, 781, 782, 928, 929, 1025, 1026, 1033, 1034, 1079, 1080, 1087, 1088, 1311, 1312, 1388, 1484, 1485, 1584, 1585, 1653, 1654, 1690, 1691, 1919, 1920, 1947, 1948, 1989, 1990, 2023, 2093, 2094, 2147, 2221, 2279, 2287, 2291, 2292, 2357, 2358, 2551, 2552, 2565, 2595, 2629, 2661, 2668, 2693, 2695, 2696, 2705, 2732, 2734, 2735, 2743, 2769, 2771, 2826, 2880, 2930, 2969, 2975, 2979, 2980, 3180, 3181, 3291, 3292, 3455, 3456, 3577, 3578, 3699, 3700, 3831, 3832, 3908, 3909, 4013, 4014, 4085, 4086, 4135, 4178, 4231, 4279, 4285, 4287, 4288, 4357, 4358, 4425, 4426, 4580, 4581, 4582, 4608, 4609, 4760, 4761, 4929, 4930, 4931, 4984, 4985, 5079, 5080, 5305, 5306, 5339, 5340, 5412, 5413, 5530, 5531, 5637, 5638, 5835, 5836, 5853, 5854, 5879, 5941, 5983, 5985, 5986, 6104 ] }
{ "red_pajama_v2": { "ccnet_original_length": 6104, "ccnet_original_nlines": 144, "rps_doc_curly_bracket": 0.004914809949696064, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.41247183084487915, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03380917012691498, "rps_doc_frac_lines_end_with_ellipsis": 0.006896549835801125, "rps_doc_frac_no_alph_words": 0.22839969396591187, "rps_doc_frac_unique_words": 0.34837356209754944, "rps_doc_mean_word_length": 4.861490249633789, "rps_doc_num_sentences": 80, "rps_doc_symbol_to_word_ratio": 0.0015026299515739083, "rps_doc_unigram_entropy": 5.112699031829834, "rps_doc_word_count": 953, "rps_doc_frac_chars_dupe_10grams": 0.054824091494083405, "rps_doc_frac_chars_dupe_5grams": 0.08396288007497787, "rps_doc_frac_chars_dupe_6grams": 0.08202029019594193, "rps_doc_frac_chars_dupe_7grams": 0.054824091494083405, "rps_doc_frac_chars_dupe_8grams": 0.054824091494083405, "rps_doc_frac_chars_dupe_9grams": 0.054824091494083405, "rps_doc_frac_chars_top_2gram": 0.01510899979621172, "rps_doc_frac_chars_top_3gram": 0.011655510403215885, "rps_doc_frac_chars_top_4gram": 0.016188209876418114, "rps_doc_books_importance": -627.8142700195312, "rps_doc_books_importance_length_correction": -627.8142700195312, "rps_doc_openwebtext_importance": -300.3740539550781, "rps_doc_openwebtext_importance_length_correction": -300.3740539550781, "rps_doc_wikipedia_importance": -219.66705322265625, "rps_doc_wikipedia_importance_length_correction": -219.66705322265625 }, "fasttext": { "dclm": 0.6804004907608032, "english": 0.8585917949676514, "fineweb_edu_approx": 1.3433573246002197, "eai_general_math": 0.9540765285491943, "eai_open_web_math": 0.15923207998275757, "eai_web_code": 0.9121598601341248 } }
{ "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": "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": "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" } } }
ece34605c058195ed03b4d393ef1a36c
2,034,793,915,485,050,400
Definite's Extractor My findings on Life, Linux, Open Source, and so on. Review on “Chinese Eye Tracking Study: Baidu Vs Google” Review on “Chinese Eye Tracking Study: Baidu Vs Google” Today I see an “interesting” post about Eye Tracking Study about Google and Baidu. “interesting” blog post. That post does make some valid points, such as reasoning in Q: What’s the difference in user experience between Baidu and Google? and first two factors in Q: Why choose Baidu?. However, that post has several major reasoning flaws: 1. The third factor in Q: Why choose Baidu? is misleading. Browser multi-tab viewing mode is required by all over the world, not only for Chinese. 2. The actual third factor is G.F.W. Baidu follow Chinese policy closely, and usually does show the target pages which are blocked by the firewall; Google on the other hand, does not comply as much as Baidu does, thus it’s likely that the search results lead to “dead” links, which upsets ordinary end users. 3. It claims that Chinese is hard to skim through because Chinese has too many characters without space to split the meaning in comprehensible way. It even tried to emphasize this point by providing following all-uppercase, no-space paragraph: TOTRYTOPUTINAWESTERNCONCEPTUALFRAMEWORK,IMAGINEHOW DIFFICULTITWOULDBETOSCANMEANINGFROMTHISPARAGRAPHIF OURALPHABETWASEXTENDEDTO2000CHARACTERS,PRESENTEDIN BLOCKLETTERSANDALLTHESPACESBETWEENWORDSWEREREMOVED (To try to put in a Western conceptual framework, imagine how difficult it would be to scan meaning from this paragraph if our alphabet was extended to 2000 characters, presented in block letters and all the spaces between words were removed.) That reason is quite silly. If that is true, Chinese would have abandon that writing system eons ago, as few can understand and willing to pass the writing through generations. Actually, like comment 1 said, most concepts in Chinese can be represented in no more than two characters, native name seldom exceed 3 characters; European languages on the other hand, often require you to look through much more characters for a meaningful word. Comparing display length, Chinese text looks much shorter than English, yet carries the same amount of information. Using his example: (To try to put in a Western conceptual framework, imagine how difficult it would be to scan meaning from this paragraph if our alphabet was extended to 2000 characters, presented in block letters and all the spaces between words were removed.) (以西方的概念架構來說,很難想像如果我們的字母增加至2000個,全以大寫顯示,移除空白的話,要怎麼讀這段文章。 ) As you can see, it doesn’t even occupy half the visual area if using the same font size. Shape-eyed readers might also notice that punctuation marks provide necessary space for scanning the meaning of the paragraph. 😛 Anime “Red pig” also provides another visual comparison among major languages in the beginning. 🙂 Leave a Reply Fill in your details below or click an icon to log in: WordPress.com Logo You are commenting using your WordPress.com account. Log Out /  Change ) Google photo You are commenting using your Google account. Log Out /  Change ) Twitter picture You are commenting using your Twitter account. Log Out /  Change ) Facebook photo You are commenting using your Facebook account. Log Out /  Change ) Connecting to %s %d bloggers like this:
{ "url": "https://dingyichen.wordpress.com/2010/01/22/review-on-chinese-eye-tracking-study-baidu-vs-google/", "source_domain": "dingyichen.wordpress.com", "snapshot_id": "crawl=CC-MAIN-2019-51", "warc_metadata": { "Content-Length": "70409", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:NOYDWUNLDV4NWFHASKHZTXIWTGRZ5OZG", "WARC-Concurrent-To": "<urn:uuid:1485e8a2-62b6-4d5d-b51e-eb205dc4e3be>", "WARC-Date": "2019-12-07T17:16:52Z", "WARC-IP-Address": "192.0.78.12", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:3KWXVROXGCCKSQHYAMC6VYLVTX6Z7KIZ", "WARC-Record-ID": "<urn:uuid:4c3668b7-d15c-4c08-ae84-0a690887ed49>", "WARC-Target-URI": "https://dingyichen.wordpress.com/2010/01/22/review-on-chinese-eye-tracking-study-baidu-vs-google/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:8b76d22c-c598-4d56-8ce2-643cb4d95492>" }, "warc_info": "isPartOf: CC-MAIN-2019-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-73.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, 21, 22, 74, 75, 131, 132, 188, 189, 427, 474, 475, 529, 676, 677, 986, 987, 1231, 1232, 1436, 1437, 1681, 1682, 1859, 1860, 2123, 2124, 2259, 2260, 2504, 2505, 2563, 2564, 2782, 2783, 2881, 2882, 2896, 2897, 2952, 2953, 2972, 2973, 3046, 3047, 3060, 3061, 3127, 3128, 3144, 3145, 3212, 3213, 3228, 3229, 3297, 3298, 3315, 3316 ], "line_end_idx": [ 21, 22, 74, 75, 131, 132, 188, 189, 427, 474, 475, 529, 676, 677, 986, 987, 1231, 1232, 1436, 1437, 1681, 1682, 1859, 1860, 2123, 2124, 2259, 2260, 2504, 2505, 2563, 2564, 2782, 2783, 2881, 2882, 2896, 2897, 2952, 2953, 2972, 2973, 3046, 3047, 3060, 3061, 3127, 3128, 3144, 3145, 3212, 3213, 3228, 3229, 3297, 3298, 3315, 3316, 3338 ] }
{ "red_pajama_v2": { "ccnet_original_length": 3338, "ccnet_original_nlines": 58, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3639240562915802, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.02056962065398693, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.1930379718542099, "rps_doc_frac_unique_words": 0.5256916880607605, "rps_doc_mean_word_length": 5.337944507598877, "rps_doc_num_sentences": 32, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.261219024658203, "rps_doc_word_count": 506, "rps_doc_frac_chars_dupe_10grams": 0.14661237597465515, "rps_doc_frac_chars_dupe_5grams": 0.23398740589618683, "rps_doc_frac_chars_dupe_6grams": 0.20288781821727753, "rps_doc_frac_chars_dupe_7grams": 0.18067382276058197, "rps_doc_frac_chars_dupe_8grams": 0.18067382276058197, "rps_doc_frac_chars_dupe_9grams": 0.18067382276058197, "rps_doc_frac_chars_top_2gram": 0.008885599672794342, "rps_doc_frac_chars_top_3gram": 0.023694930598139763, "rps_doc_frac_chars_top_4gram": 0.03109958954155445, "rps_doc_books_importance": -309.288330078125, "rps_doc_books_importance_length_correction": -309.288330078125, "rps_doc_openwebtext_importance": -179.61972045898438, "rps_doc_openwebtext_importance_length_correction": -179.61972045898438, "rps_doc_wikipedia_importance": -136.89573669433594, "rps_doc_wikipedia_importance_length_correction": -136.89573669433594 }, "fasttext": { "dclm": 0.36991918087005615, "english": 0.9124877452850342, "fineweb_edu_approx": 2.4353816509246826, "eai_general_math": 0.0002672100090421736, "eai_open_web_math": 0.27568119764328003, "eai_web_code": 0.00001979000080609694 } }
{ "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": "303.483", "labels": { "level_1": "Social sciences", "level_2": "", "level_3": "Social sciences — Dictionaries" } } }, "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": "14", "label": "Reviews/Critiques" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "16", "label": "Personal Blog" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "1", "label": "General Audience" } } }
ece34605c058195ed03b4d393ef1a36c
-278,152,379,310,358,900
Archian Speaks in Bacolod and Dubai A Cool mix of Real Life, Architecture, Finances, Working as an OFW, Business Alexa vs Compete vs Quantcast vs ComScore vs Hitwise vs Nielsen 3 Comments Archian - Life, Bacolod, Architecture, Finances & Dubai Want to know how to get your Website’s Rating? Webs Get Ranks Webs Get Ranks All of the mentioned above are third-party analytic services are terribly inaccurate but will continue to be used until a more accurate tool is available. Below is an overview of the methodologies used for collecting data for each of these services: Alexa Web Rankings Alexa Methodology: Captures traffic data from users who download and use the Alexa Toolbar in their web browser. They also claim to use other “diverse traffic data sources”, which is very vague. Sample Size: There is no known number of current Alexa Toolbar users, but it is said to be in the “millions.” I would bet that size continues to decline as more and more spyware programs flag the Alexa Toolbar as spyware/adware and either uninstall or completely block installation of the toolbar in the first place. Problems: Well, there are a few: 1. Easily skewed – Since the Alexa Ranking is determined by users who have the Alexa toolbar installed, it is often in the interests of a website owner to install the Alexa toolbar themselves to increase their own Alexa ranking. And that is precisely the case. That is why you will see most webmaster forums and SEO blogs have high Alexa rankings, even if they don’t get much traffic overall. 2. Easily manipulated – Even though Alexa claims they have since added measures to prevent intentional manipulation of their rankings, it is still possibly to increase your own Alexa ranking by installing the toolbar and visiting your own site. Try it out for 7 days straight and I guarantee your Alexa ranking will increase significantly. 3. Catch 22 – Most webmasters nowadays are aware that the Alexa ranking is often inaccurate and thus say “oh the Alexa ranking doesn’t mean anything.” But in reality, most of them do care about it because many advertisers use Alexa ranking data to determine which websites they want to advertise on. And people looking to buy a domain name or website will often do the same in determining the value of a site. So it’s a Catch 22 – the webmaster knows the data is inaccurate and shouldn’t care about it, but they do care about it because advertisers care about it. And that will continue to be the case until more accurate data is available. Compete Web Rankings Compete Methodology: Captures traffic data from “diverse sources” such as the Compete Toolbar and ISP logs. Sample Size: Approximately 2,000,000 U.S. users, or 1% of total market Problems: While not as easily skewed or manipulable as Alexa, the sample size is so small that the data is often wildly inaccurate. Quantcast Web Ranking Quantcast Methodology: Quantcast measures websites that have installed their tracking code directly in the HTML of the website Sample Size: They claim to have 80,000 “Quantified Publishers” who have installed the tracking code across 10 million websites. Problems: Again, the sample size. The majority of websites do not have the QuantCast tag installed on their site so it is impossible to compare the traffic of a website that is able to be directly tracked with their tracking code and ones that are not. ComScore Web Rankings ComScore, Nielsen, HitWise (I am lumping these three together for the time being) Methodology : Most of these get their data from willing participants. Their users agree to install survey software on their computers to track their usage. These companies also get data from ISPs. Sample Size: 2 million to 10 million in the US Problems : Sample size, sample size, sample size! (I will continue this post later, I just had to get something written since I’ve been meaning to for quite some time!) Nielsen Web Rankings Advertisements Author: bacolodseo I am a Search Engine Optimization Professional from Bacolod City with a Knack for finding our way to the top of the Search Engines. 3 thoughts on “Alexa vs Compete vs Quantcast vs ComScore vs Hitwise vs Nielsen 1. Pingback: Newspapers should use Compete.com and Quantcast.com to their advantage | Peter Bakke 2. Compete is garbage. Why companies like them (and nielsen and comscore) have any credibility is one of the great mysteries of the universe and speaks volumes to how utterly un-creative and ignorant most ad buyers are. Leave a Reply Fill in your details below or click an icon to log in: WordPress.com Logo You are commenting using your WordPress.com account. Log Out / Change ) Twitter picture You are commenting using your Twitter account. Log Out / Change ) Facebook photo You are commenting using your Facebook account. Log Out / Change ) Google+ photo You are commenting using your Google+ account. Log Out / Change ) Connecting to %s
{ "url": "https://archian.wordpress.com/2011/06/13/alexa-vs-compete-vs-quantcast-vs-comscore-vs-hitwise-vs-nielsen/", "source_domain": "archian.wordpress.com", "snapshot_id": "crawl=CC-MAIN-2017-26", "warc_metadata": { "Content-Length": "151048", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:4UOYQYX7THAWXVDMICEOSS33FBXJGBMC", "WARC-Concurrent-To": "<urn:uuid:e02e58be-fbea-494a-a0de-1d43c69d92e1>", "WARC-Date": "2017-06-29T07:29:05Z", "WARC-IP-Address": "192.0.78.12", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:22Z5DL2ZCHY4JUCHM3IFMYNOZNVJM2JI", "WARC-Record-ID": "<urn:uuid:d5f5b089-4cd8-4bbe-9da8-c7b29f03c95b>", "WARC-Target-URI": "https://archian.wordpress.com/2011/06/13/alexa-vs-compete-vs-quantcast-vs-comscore-vs-hitwise-vs-nielsen/", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e68ff499-2c36-4086-9d1b-e104137c49ec>" }, "warc_info": "robots: classic\r\nhostname: ip-10-166-28-124.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, 36, 37, 114, 115, 179, 180, 191, 192, 193, 249, 250, 297, 298, 313, 314, 329, 330, 580, 581, 600, 601, 607, 796, 797, 1114, 1115, 1148, 1149, 1542, 1543, 1883, 1884, 2525, 2526, 2547, 2548, 2556, 2656, 2657, 2728, 2729, 2861, 2862, 2884, 2885, 2895, 3012, 3013, 3141, 3142, 3395, 3396, 3418, 3419, 3501, 3698, 3699, 3746, 3747, 3797, 3798, 3917, 3918, 3939, 3954, 3955, 3974, 3975, 4107, 4108, 4187, 4188, 4288, 4289, 4511, 4512, 4526, 4527, 4582, 4583, 4602, 4603, 4675, 4676, 4692, 4693, 4759, 4760, 4775, 4776, 4843, 4844, 4858, 4859, 4925, 4926 ], "line_end_idx": [ 36, 37, 114, 115, 179, 180, 191, 192, 193, 249, 250, 297, 298, 313, 314, 329, 330, 580, 581, 600, 601, 607, 796, 797, 1114, 1115, 1148, 1149, 1542, 1543, 1883, 1884, 2525, 2526, 2547, 2548, 2556, 2656, 2657, 2728, 2729, 2861, 2862, 2884, 2885, 2895, 3012, 3013, 3141, 3142, 3395, 3396, 3418, 3419, 3501, 3698, 3699, 3746, 3747, 3797, 3798, 3917, 3918, 3939, 3954, 3955, 3974, 3975, 4107, 4108, 4187, 4188, 4288, 4289, 4511, 4512, 4526, 4527, 4582, 4583, 4602, 4603, 4675, 4676, 4692, 4693, 4759, 4760, 4775, 4776, 4843, 4844, 4858, 4859, 4925, 4926, 4942 ] }
{ "red_pajama_v2": { "ccnet_original_length": 4942, "ccnet_original_nlines": 96, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4050104320049286, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.015657620504498482, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.15344467759132385, "rps_doc_frac_unique_words": 0.40146878361701965, "rps_doc_mean_word_length": 4.837209224700928, "rps_doc_num_sentences": 45, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.27512788772583, "rps_doc_word_count": 817, "rps_doc_frac_chars_dupe_10grams": 0.024291500449180603, "rps_doc_frac_chars_dupe_5grams": 0.07945343852043152, "rps_doc_frac_chars_dupe_6grams": 0.039473678916692734, "rps_doc_frac_chars_dupe_7grams": 0.024291500449180603, "rps_doc_frac_chars_dupe_8grams": 0.024291500449180603, "rps_doc_frac_chars_dupe_9grams": 0.024291500449180603, "rps_doc_frac_chars_top_2gram": 0.02277328073978424, "rps_doc_frac_chars_top_3gram": 0.015182189643383026, "rps_doc_frac_chars_top_4gram": 0.02125505916774273, "rps_doc_books_importance": -422.0297546386719, "rps_doc_books_importance_length_correction": -422.0297546386719, "rps_doc_openwebtext_importance": -240.1700897216797, "rps_doc_openwebtext_importance_length_correction": -240.1700897216797, "rps_doc_wikipedia_importance": -205.87428283691406, "rps_doc_wikipedia_importance_length_correction": -205.87428283691406 }, "fasttext": { "dclm": 0.034831639379262924, "english": 0.9287800192832947, "fineweb_edu_approx": 1.6402162313461304, "eai_general_math": 0.0003273499896749854, "eai_open_web_math": 0.11411809921264648, "eai_web_code": 0.000015139999959501438 } }
{ "free_decimal_correspondence": { "primary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "658.8", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Business", "level_3": "Management" } } }, "bloom_cognitive_process": { "primary": { "code": "5", "label": "Evaluate" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-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": "16", "label": "Personal Blog" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "2", "label": "Partially Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "1", "label": "General Audience" } } }
ece34605c058195ed03b4d393ef1a36c
7,550,351,955,745,215,000
How to do conditional formatting in Excel Learn how to do conditional formatting in Excel Conditional formatting in Excel enables you to apply a format to a cell or range of cells, so you can identify important information. The video tutorial below explains.   Conditional formats are formats that vary based on cell values and the conditions you specify. Worked example In Figure 01 there is an extract from a budget input sheet. Columns H, I and J are for inputs. Column F is used to validate the input columns. Column G displays an icon to inform the user about the status of the input row. In column G, no icon means no input has been made (row 10). A green tick means the row contains valid input entries (rows 2 and 3). A red cross means the row is invalid (rows 4 to 9). Figure 01. The input rules are: • the Department and Account columns must contain valid codes (based on lists in another sheet) • the Amount column must contain a number • a valid input line must contain all three entries  Columns H and I each have in-cell drop-down lists based on lists in another sheet. Figure 02 shows the two drop-down lists. Columns A to F are used to validate the entries in columns H to J. Figure 02. In-cell drop-down lists are created using Data Validation in the Data ribbon tab. They have two issues that can lead to invalid entries. 1. Users can use Paste Special Values with a cell that has an in-cell drop-down list and cause an invalid entry in a cell. 2. Changing the source list that the in-cell drop-down is based on doesn’t change the cell entry. For example, in Figure 01, cell H2 contains DISTRIBUTION. If the source list was modified and DISTRIBUTION was deleted or changed, the input cell would not change and hence would be invalid. The Data Validation system has an option called Circle Invalid Data, which identifies cells that don’t match their validation rules. Its limitation is that it doesn’t notify you if there are any invalid entries. You have to manually examine all the data validation cells to see if any have been circled. In Figure 03, I have used Paste Special Values to enter an invalid code (DIST) in cell H2. I then used Circle Invalid Data. Figure 03. Notice that in Figure 03, cell G2 has changed to a cross (it was a tick in Figure 01). This is a dynamic indication of an error and it doesn’t require any manual intervention. Table 01 contains the formulas from row 2 and their explanations. These formulas have been copied down. Table 01. Logical tests The formulas in columns A to F are all logical tests. They return either TRUE or FALSE. Usually, these types of formulas are used with the IF function, but they can be used on their own. The small minus grouping button above column G in Figure 01 allows these validation cells to be easily and quickly hidden/unhidden. Function explanation The COUNTA function counts the number of entries in a range. The COUNTIF function counts how many times an entry appears in a range. The ISNUMBER function returns TRUE if the cell it is examining is a number or a date. The OR function returns TRUE if any of its logical tests are TRUE. The only time an OR function returns FALSE is if all the logical tests are FALSE. The AND function only returns TRUE if all its logical tests are TRUE. One or more FALSE logical tests will cause the AND function to return FALSE. Refer to the formulas in Table 01 to understand these descriptions better. What do the columns do? Column A identifies if the input range is blank/empty. If the input range is empty, then neither a tick nor a cross will be displayed in column G. Columns B and C both use the COUNTIF function to ensure that their entry is in their respective named range, either Depts or Accounts. Both ranges are in a separate sheet.  Column D ensures there are three entries in the three input cells. Column E ensures a number has been entered in column J.  Column F assumes the row is valid (or at least not invalid) if column A is TRUE. Column A is TRUE only when there are no entries in the input cells. Column A is an override column for column F. If column A has TRUE (empty input cells), then column F will return TRUE. The AND function within the OR function will return TRUE only when all the other validation columns (B to E) return TRUE. A FALSE in any of the columns from B to E will prompt a FALSE result from the AND function. Hence, if there is an entry in the input cells, then A2 will return FALSE. The second logical test in the OR function is the AND function. The AND function will only return TRUE if all the other validation columns are TRUE. The formula in cell G2 is simple and controls the correct icon to display: =A2+F2 When you use logical test results in numeric calculations, in this case adding them together, they are converted into values, TRUE = 1 and FALSE = 0. Hence the possible values returned in G2 are: • 0 (two FALSE entries) – cross required – invalid row • 1 (only one cell contains a TRUE) – tick required – valid row • 2 (both cells contain TRUE) – no icon required – empty row Conditional format Figure 04 shows the Conditional Formatting Icon option we will use to mark the rows. Figure 04. The settings for the Conditional Format in the range G2:G10 are shown in Figure 05. You will need to use the drop-downs to change the defaults in the Icon and Type sections to make the selections. Figure 05. A value of 2 means the row is blank and no icon is required. A value of 1 means the row is valid and requires a tick. A zero means the row is invalid and requires a cross. Note: the Show Icon Only tick box has been ticked. This hides the underlying values in G2:G10. The companion video and Excel files (blank & complete) will go into more detail to demonstrate these techniques. Neale Blackwood CPA runs A4 Accounting, providing Excel training, webinars and consulting services to organisations around Australia. Questions can be sent to [email protected] BONUS MATERIAL Counting invalid entries As I mentioned previously, the Circle Invalid Data option doesn’t tell you how many errors there are. In this case we can count the number of FALSE entries in column F to count how many errors there are. The following formula counts the number of invalid entries in column F: =COUNTIF(F:F,FALSE) Data validation in-cell drop-down list To insert an in-cell drop-down list, press in sequence Alt A V V. Don’t hold the keys down. This is the shortcut for the Data Validation option in the Data ribbon. See Figure 6. Figure 6. In the dialog that opens, select List from the Allow drop-down and use the Source box to select the range of the list you want to use. In Figure 7 I have used a range name called Depts as the source range. This example is from column H in Figure 1. Click OK. That’s it, done. Figure 7. Highlight invalid cells Even though the above instructions identified invalid rows with a cross, they didn’t show which input cells were invalid. We can use another type of conditional format to do that. Formula-based conditional formats Select the range H2:H10. Click the Conditional Formatting icon on the Home ribbon. Select the New Rule option near the bottom. In the dialog that opens (see Figure 8), select the last option in the top section – “Use a formula …”. In the Formula box in the bottom section enter the following formula: =$A2 Click OK. Figure 8. A formula in this section needs to return TRUE to apply the format. The formulas in column A are a logical test, so we can just refer to them directly as they return TRUE or FALSE. We have not made a format selection, so in effect it is not applying a format if A2 is TRUE. TRUE in column A means there are no entries in the three input cells. If that is the case, we don’t need to apply any formats. Click the Conditional Formatting icon again, the New Rule option and create another formula-based rule using the following formula: =$B2=FALSE Click the Format button. Click the Fill tab and choose one of the red colours and click OK and OK again – see Figure 9. This formula checks column B for FALSE. FALSE means the entry is not in the list or the cell is blank. Figure 9. Once more click the Conditional Formatting icon, but this time choose Manage Rules. Ensure the dialog looks like Figure 10. Note the tick in the Stop If True column of the first rule. You can move rules up or down by selecting them and clicking the arrow icons on the right of the Delete button. Figure 10. These rules mean if column A has TRUE, no format is applied and further conditions are ignored (Stop If True). If column A is not TRUE, then column B is examined for FALSE, which means the cell entry is not in the list or the cell is blank and requires a selection from the drop-down. If the column has FALSE, then the red fill will be applied to the corresponding cell in column H. Figure 11. This example may be over the top for three input cells, but it demonstrates techniques that highlight cells that don’t meet required conditions. See if you can apply formats to columns I and J that change their colour if they are invalid. Like what you're reading? Enter your email to receive the fortnightly INTHEBLACK e-newsletter. Recommended for You READ MORE Opening the vault on Excel, part 2 READ MORE Opening the vault on Excel, part 3 READ MORE Opening the vault on Excel, part 4 September 2019 September 2019 Read the September 2019 issue of INTHEBLACK magazine. Each month we select the must-reads from the current issue of INTHEBLACK. Read more now. CONTENTS
{ "url": "https://www.intheblack.com/articles/2019/09/01/conditional-formatting-in-excel", "source_domain": "www.intheblack.com", "snapshot_id": "crawl=CC-MAIN-2019-47", "warc_metadata": { "Content-Length": "93911", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:GE3X3N6OCVONM3ZNJJRUOM2LDISSQHBN", "WARC-Concurrent-To": "<urn:uuid:f68a9f52-fbec-4d4f-9b65-5bc8427e27d6>", "WARC-Date": "2019-11-13T00:43:02Z", "WARC-IP-Address": "52.187.211.1", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:S4RV5MCJI5FM2KLFBU4BPTA7QWTU3CCC", "WARC-Record-ID": "<urn:uuid:43d967a5-12fa-465d-b9fd-0cd4064b9184>", "WARC-Target-URI": "https://www.intheblack.com/articles/2019/09/01/conditional-formatting-in-excel", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3da7944c-1072-4bc2-91e6-35086f51cc72>" }, "warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-137.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 42, 43, 91, 92, 261, 262, 264, 265, 360, 361, 376, 377, 784, 785, 796, 797, 818, 819, 917, 961, 1016, 1017, 1208, 1209, 1220, 1221, 1358, 1359, 1484, 1775, 1776, 2080, 2081, 2205, 2206, 2217, 2218, 2498, 2499, 2509, 2510, 2524, 2525, 2712, 2713, 2845, 2846, 2867, 2868, 2929, 2930, 3002, 3003, 3089, 3090, 3239, 3240, 3387, 3388, 3463, 3464, 3488, 3489, 3636, 3637, 3810, 3811, 3878, 3879, 3936, 3937, 4327, 4328, 4644, 4645, 4720, 4721, 4728, 4729, 4925, 4926, 4983, 5049, 5112, 5113, 5132, 5133, 5218, 5219, 5230, 5231, 5428, 5429, 5440, 5441, 5613, 5614, 5709, 5710, 5823, 5824, 5999, 6000, 6015, 6016, 6041, 6042, 6318, 6319, 6339, 6340, 6379, 6380, 6558, 6559, 6569, 6570, 6846, 6847, 6857, 6858, 6882, 6883, 7063, 7064, 7098, 7099, 7400, 7401, 7406, 7407, 7417, 7418, 7428, 7429, 7830, 7831, 7963, 7964, 7975, 7976, 8199, 8200, 8210, 8211, 8507, 8508, 8519, 8520, 8903, 8904, 8915, 8916, 9061, 9062, 9156, 9157, 9158, 9253, 9254, 9274, 9275, 9285, 9286, 9321, 9322, 9323, 9333, 9334, 9369, 9370, 9371, 9381, 9382, 9417, 9418, 9419, 9434, 9449, 9450, 9504, 9505, 9594, 9595 ], "line_end_idx": [ 42, 43, 91, 92, 261, 262, 264, 265, 360, 361, 376, 377, 784, 785, 796, 797, 818, 819, 917, 961, 1016, 1017, 1208, 1209, 1220, 1221, 1358, 1359, 1484, 1775, 1776, 2080, 2081, 2205, 2206, 2217, 2218, 2498, 2499, 2509, 2510, 2524, 2525, 2712, 2713, 2845, 2846, 2867, 2868, 2929, 2930, 3002, 3003, 3089, 3090, 3239, 3240, 3387, 3388, 3463, 3464, 3488, 3489, 3636, 3637, 3810, 3811, 3878, 3879, 3936, 3937, 4327, 4328, 4644, 4645, 4720, 4721, 4728, 4729, 4925, 4926, 4983, 5049, 5112, 5113, 5132, 5133, 5218, 5219, 5230, 5231, 5428, 5429, 5440, 5441, 5613, 5614, 5709, 5710, 5823, 5824, 5999, 6000, 6015, 6016, 6041, 6042, 6318, 6319, 6339, 6340, 6379, 6380, 6558, 6559, 6569, 6570, 6846, 6847, 6857, 6858, 6882, 6883, 7063, 7064, 7098, 7099, 7400, 7401, 7406, 7407, 7417, 7418, 7428, 7429, 7830, 7831, 7963, 7964, 7975, 7976, 8199, 8200, 8210, 8211, 8507, 8508, 8519, 8520, 8903, 8904, 8915, 8916, 9061, 9062, 9156, 9157, 9158, 9253, 9254, 9274, 9275, 9285, 9286, 9321, 9322, 9323, 9333, 9334, 9369, 9370, 9371, 9381, 9382, 9417, 9418, 9419, 9434, 9449, 9450, 9504, 9505, 9594, 9595, 9603 ] }
{ "red_pajama_v2": { "ccnet_original_length": 9603, "ccnet_original_nlines": 184, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.369047611951828, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0773809477686882, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.153273805975914, "rps_doc_frac_unique_words": 0.25, "rps_doc_mean_word_length": 4.35069465637207, "rps_doc_num_sentences": 125, "rps_doc_symbol_to_word_ratio": 0.0004960300284437835, "rps_doc_unigram_entropy": 5.257777690887451, "rps_doc_word_count": 1728, "rps_doc_frac_chars_dupe_10grams": 0.009310989640653133, "rps_doc_frac_chars_dupe_5grams": 0.10574620962142944, "rps_doc_frac_chars_dupe_6grams": 0.05054536089301109, "rps_doc_frac_chars_dupe_7grams": 0.03218941017985344, "rps_doc_frac_chars_dupe_8grams": 0.022878430783748627, "rps_doc_frac_chars_dupe_9grams": 0.009310989640653133, "rps_doc_frac_chars_top_2gram": 0.011306200176477432, "rps_doc_frac_chars_top_3gram": 0.011173180304467678, "rps_doc_frac_chars_top_4gram": 0.00691673019900918, "rps_doc_books_importance": -974.2081909179688, "rps_doc_books_importance_length_correction": -974.2081909179688, "rps_doc_openwebtext_importance": -596.4259643554688, "rps_doc_openwebtext_importance_length_correction": -596.4259643554688, "rps_doc_wikipedia_importance": -350.2565612792969, "rps_doc_wikipedia_importance_length_correction": -350.2565612792969 }, "fasttext": { "dclm": 0.02474677935242653, "english": 0.859344482421875, "fineweb_edu_approx": 2.836920976638794, "eai_general_math": 0.973426103591919, "eai_open_web_math": 0.34474045038223267, "eai_web_code": 0.969674825668335 } }
{ "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": "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": "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" } } }
ece34605c058195ed03b4d393ef1a36c
8,346,971,478,713,026,000
示例#1 0 private void getAllGameApp() { List<PackageInfo> apps = new ArrayList<PackageInfo>(); PackageManager pManager = getPackageManager(); // 获取手机内所有应用 List<PackageInfo> packlist = pManager.getInstalledPackages(0); for (int i = 0; i < packlist.size(); i++) { PackageInfo pak = packlist.get(i); // if()里的值如果==0则为自己装的程序,否则为系统工程自带 if ((pak.applicationInfo.flags & ApplicationInfo.FLAG_SYSTEM) == 0) { // 添加自己已经安装的应用程序 apps.add(pak); String appName = pManager.getApplicationLabel(pak.applicationInfo).toString(); if (MyApp.gnList.contains(appName)) { AppsItemInfo aii = new AppsItemInfo(); aii.setIcon(pManager.getApplicationIcon(pak.applicationInfo)); aii.setLabel(pManager.getApplicationLabel(pak.applicationInfo).toString()); aii.setPackageName(pak.applicationInfo.packageName); String filePath = pak.applicationInfo.publicSourceDir; aii.setSize( Util.round(new File(filePath).length() * 1.0 / (1024 * 1024), 2, BigDecimal.ROUND_UP) + "MB"); appList.add(aii); } } } } 示例#2 0 @Override public View getView(int position, View convertView, ViewGroup arg2) { // TODO Auto-generated method stub ViewHolder holder; if (convertView == null) { holder = new ViewHolder(); convertView = mInflater.inflate(R.layout.item_download, null, false); holder.iv = (ImageView) convertView.findViewById(R.id.item_download_icon); holder.tv_name = (TextView) convertView.findViewById(R.id.item_download_name); holder.tv_size = (TextView) convertView.findViewById(R.id.item_download_size); holder.startBtn = (Button) convertView.findViewById(R.id.item_download_start); convertView.setTag(holder); } else { holder = (ViewHolder) convertView.getTag(); } final AppsItemInfo gi = appList.get(position); if (gi != null) { holder.iv.setImageDrawable(gi.getIcon()); holder.tv_name.setText(gi.getLabel()); holder.tv_size.setText(gi.getSize()); holder.startBtn.setText("启动"); final String pName = gi.getPackageName(); holder.startBtn.setOnClickListener( new OnClickListener() { @Override public void onClick(View v) { Util.startAppByPname(UserDownloadActivity.this, pName); } }); } return convertView; }
{ "url": "https://java.hotexamples.com/zh/examples/com.asktun.mg.bean/AppsItemInfo/-/java-appsiteminfo-class-examples.html", "source_domain": "java.hotexamples.com", "snapshot_id": "crawl=CC-MAIN-2022-40", "warc_metadata": { "Content-Length": "56097", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:UI4A5U5XKMSNQIWAQRDEKYPQVHWCEEZB", "WARC-Concurrent-To": "<urn:uuid:2a706234-8a5e-4ac5-a098-95281e0409c8>", "WARC-Date": "2022-10-02T22:32:56Z", "WARC-IP-Address": "172.67.214.6", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:XEU5TQEU3JTE5CPLNEDTZNPYI7FP6MWZ", "WARC-Record-ID": "<urn:uuid:46ee2a25-a9fa-4a51-a1bc-abc5b9865d57>", "WARC-Target-URI": "https://java.hotexamples.com/zh/examples/com.asktun.mg.bean/AppsItemInfo/-/java-appsiteminfo-class-examples.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:de2cf690-b937-4031-b6c9-96fc48ff3cad>" }, "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-12\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 5, 7, 39, 97, 147, 163, 229, 276, 316, 355, 430, 454, 476, 562, 607, 655, 727, 812, 874, 938, 960, 1059, 1085, 1112, 1121, 1128, 1133, 1136, 1141, 1143, 1157, 1231, 1272, 1297, 1330, 1365, 1443, 1526, 1613, 1700, 1787, 1823, 1838, 1890, 1898, 1951, 1975, 2025, 2072, 2118, 2157, 2207, 2251, 2287, 2288, 2312, 2356, 2428, 2444, 2460, 2468, 2469, 2495 ], "line_end_idx": [ 5, 7, 39, 97, 147, 163, 229, 276, 316, 355, 430, 454, 476, 562, 607, 655, 727, 812, 874, 938, 960, 1059, 1085, 1112, 1121, 1128, 1133, 1136, 1141, 1143, 1157, 1231, 1272, 1297, 1330, 1365, 1443, 1526, 1613, 1700, 1787, 1823, 1838, 1890, 1898, 1951, 1975, 2025, 2072, 2118, 2157, 2207, 2251, 2287, 2288, 2312, 2356, 2428, 2444, 2460, 2468, 2469, 2495, 2500 ] }
{ "red_pajama_v2": { "ccnet_original_length": 2500, "ccnet_original_nlines": 63, "rps_doc_curly_bracket": 0.00800000037997961, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.04555315151810646, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.019522780552506447, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.537960946559906, "rps_doc_frac_unique_words": 0.7364341020584106, "rps_doc_mean_word_length": 12.240309715270996, "rps_doc_num_sentences": 70, "rps_doc_symbol_to_word_ratio": 0.004338390193879604, "rps_doc_unigram_entropy": 4.427109718322754, "rps_doc_word_count": 129, "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.017732739448547363, "rps_doc_frac_chars_top_3gram": 0, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -253.41395568847656, "rps_doc_books_importance_length_correction": -253.41395568847656, "rps_doc_openwebtext_importance": -186.06869506835938, "rps_doc_openwebtext_importance_length_correction": -186.06869506835938, "rps_doc_wikipedia_importance": -138.85098266601562, "rps_doc_wikipedia_importance_length_correction": -138.85098266601562 }, "fasttext": { "dclm": 0.9973801374435425, "english": 0.21426895260810852, "fineweb_edu_approx": 2.898712635040283, "eai_general_math": 0.16255146265029907, "eai_open_web_math": 0.022061940282583237, "eai_web_code": 0.7685651779174805 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "-1", "labels": { "level_1": "", "level_2": "", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
-6,093,080,628,821,890,000
1 vote 2answers 26 views MKMapView - cant locate user location while AirPlane mode is on I'm developing with MKMapView class, When running on the device (iPhone5) and with AirPlane mode ON , Wi-Fi ON, and the property of MKMapView:showsUserLocationsetting to YES,the delegate of MKMapView ... 0 votes 1answer 92 views Add a subview to MKMapView (not an overlay) I want to add a small subview at tap point on an iOS map view in such a way that added subview also zooms and scrolls when I scroll and zoom the map view. Any help? The code I have tried is below: - ... 0 votes 1answer 57 views MKMapViewDelegate is called but Pin does not drop as I set I try to make a pin annotation to drop in MapView . But it doesn't . The view controller has one table view and I plug mapView into the header. DetailViewController - (void)viewDidLoad { ... 0 votes 0answers 147 views iOS MKMapView direction arrows I know Google Maps API v3 support to draw direction arrows over a polyline, nativelty (as of July 2012), but How could i do that in iOS MKMapView? Im creating polylines between points, and I would ... 0 votes 2answers 129 views viewForAnnotation method never called I have implemented my MKMapViewDelegate, but for some reason my viewForAnnotation method is never called. I can confirm that annotations are displayed on the MapView. I've added an NSLog() to my ... 0 votes 1answer 36 views How do I trap an event when the user taps the map with MKMapViewDelegate [duplicate] Possible Duplicate: How can i get any information like lat,long when i touch on MKMapView in iPhone/iPad? With MKMapViewDelegate, how do I get notified when the user touches a point in the ... 1 vote 1answer 291 views MKMapView setRegion: animated: crashes the app (edited) I have a MKMapView that expands (vertically) on tap (using UITapGestureRecognizer) and fires off an api call on pan (using UIPanGestureRecoginizer). Everything was working fine, until some time back, ... 0 votes 1answer 204 views Detecting panning + decelerate of MKMapView I'm trying to capture panning and the 'end of scrolling' on an MKMapView. Panning is easy to do with a gesture recognizer. However, MKMapView doesn't seem to implement a UIScrollViewDelegate in iOS 6. ... 1 vote 1answer 1k views didUpdateUserLocation not called when view for userLocation is custom I have an MKMapView that's supposed to track the user's location using a custom view (not the blue dot). In order to substitute this view for the blue dot, I return it thusly: - (MKAnnotationView ... 1 vote 2answers 138 views MKMapView doesn't scroll and doesn't not zoom I have a MapView and marked where the user's location and nearby there are other annotationView of various types regarding tourist attractions. I want the MapView is scrollable and zoomable to see all ... 0 votes 1answer 237 views ios6 visibleMapRect not correct I have an app that on startup centers on a specific location. //Calculate and set new center point CLLocationCoordinate2D zoomLocation = CLLocationCoordinate2DMake(<some lat>,<some ... 6 votes 1answer 298 views mapViewDidFinishLoadingMap: called too early My problem is simple: I'm waiting to take a screenshot of an MKMapView, and I want to do it only once the map is loaded. Unfortunately, this delegate method is almost always called before the map is ... 2 votes 1answer 935 views MKMapView Clicking on pins won't call didSelectAnnotationView I am using a mapView and am trying to make a callout pop up when you click on a pin which is shown on the map. The pins manage to be placed in the proper locations so I think the annotations work ... 5 votes 2answers 661 views Detecting when MapView tiles are displayed Since - (void)mapViewDidFinishLoadingMap:(MKMapView *)mapView is not called when the tiles are loaded from cache, is there a way to know when all the tiles have been loaded (either from cache or from ... 0 votes 1answer 142 views MKMapViewDelegate is nota called when inside a subclass of MKMapView I am quite new in Objective C, but learning fast. My project is quite complete and I have implemented as well classes than delegates etc etc. I am using an MKMapView to display things on a map. I ... 0 votes 1answer 121 views Cannot push a new view when clicking on annotation view In my iphone app, I have a controller with a view and MKMapView. I display several annotation on the map, but when I click on the annotation view the "calloutAccessoryControlTapped" is triggered but ... 1 vote 2answers 702 views viewforoverlay never gets called This is driving me nuts. I've been through all the posts on stackoveflow, but nothing fits the bill. I am trying to add a simple polyline (i.e. not a custom overlay) as an overlay to my MKMapView. ... 7 votes 2answers 415 views Smooth Movement of annotation image on Mapview I have loaded the custom annotation image for user current location.I am updating the current user location after every 1 sec in background. NSAutoreleasePool *pool = [[NSAutoreleasePool alloc] ... 5 votes 3answers 2k views Is this a bug with MKMapKitDelegate mapView:didUpdateUserLocation? I've created a test application with only one view containing an MKMapView and a controller which acts as the MapView's delegate. When I do a fresh build (removed from the device completely before ... 2 votes 2answers 364 views How to suppress the “Current Location” callout in map view Tapping the pulsating blue circle representing the userLocation brings up a "Current Location" callout. Is there a way to suppress that? 1 vote 1answer 898 views Is there a way to set z-order in the annotation view layer? I want to have some annotationView images appear on top of the others so they are easier to see. Is there a way to set the order? I thought I would try something like [theMap ... 1 vote 3answers 2k views MKMapViewDelegate mapView:didUpdateUserLocation: method not called on iOS5 MKMapViewDelegate mapView:didUpdateUserLocation: method is not called when running on the 5.0 simulator, even if all location permissions are given in the device settings. With 4.3 it's working fine. ... 0 votes 1answer 203 views Map view refresh in iPhone app I am using map functionality in my iphone app. I m showing stores for users current location on map. Whenever user scrolls the map he needs to be shown stores of new location. eg. suppose user at New ... 0 votes 1answer 395 views iOS MKMapViewDelegate - Getting UserLocation the second time I create a MKMapView and associate a MKMapViewDelegate with it. The MKMapViewDelegate gets notified correctly that DidUpdateUserLocation and other life cycle events occurred. When I create another ... 5 votes 3answers 2k views MKMapView crashes app when view controller popped I have a view controller with an MKMapView that calls [self.mapView setRegion:region animated:YES]; which repositions the map from A to B. The view controller which holds the MKMapView is set as ... 2 votes 2answers 2k views mapView:didDeselectAnnotationView: delegate method getting called before the annotation view is actually deselected I am working with a map view populated with custom pins. When the user taps somewhere on the map to deselect a pin, I want to implement the map such that the pin does not become deselected (i.e. ... 0 votes 1answer 378 views mapview blue dot not coming for second time I'm developing an app to show the stores available in a particular zipcode. I start with the current location. I'm getting a blue pulsating dot for my current location. when I enter a zipcode I'm able ... 0 votes 1answer 511 views Displaying TableView when MKAnnotation(Pin) in MKMapView touched/pressed/clicked I want to display quite a bit of demographic data for a certain pin when someone touches on it, so providing a pop-up isn't going to cut it. I figured once the pin is touched I will just stick a ... 1 vote 1answer 466 views iOS MKMapKit regionDidChangeAnimated I would like to determine the minimum + maximum visible latitude and longitude values in the MKMapViewDelegate delegate method: - (void)mapView:(MKMapView *)mapView ...
{ "url": "http://stackoverflow.com/questions/tagged/mkmapview+mkmapviewdelegate", "source_domain": "stackoverflow.com", "snapshot_id": "crawl=CC-MAIN-2013-20", "warc_metadata": { "Content-Length": "107202", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:5YQVOTG55DTIESVHYKTDHUX5QJK5ZQ5F", "WARC-Concurrent-To": "<urn:uuid:57ea397f-6862-47da-b84b-fb436e38400c>", "WARC-Date": "2013-06-20T00:19:39Z", "WARC-IP-Address": "198.252.206.16", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:Z2MDQ4WE6D643TMKTOD4Y5XJXN56UV7H", "WARC-Record-ID": "<urn:uuid:dc6bf869-3620-4224-8935-85576cebfca4>", "WARC-Target-URI": "http://stackoverflow.com/questions/tagged/mkmapview+mkmapviewdelegate", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:d1de3219-82b3-4adb-9fcd-92130aa7c698>" }, "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, 2, 7, 16, 25, 26, 90, 91, 295, 297, 303, 311, 320, 321, 365, 366, 569, 571, 577, 585, 594, 595, 654, 655, 846, 848, 854, 863, 873, 874, 905, 906, 1107, 1109, 1115, 1124, 1134, 1135, 1173, 1174, 1373, 1375, 1381, 1389, 1398, 1399, 1484, 1485, 1678, 1680, 1685, 1693, 1703, 1704, 1760, 1761, 1965, 1967, 1973, 1981, 1991, 1992, 2036, 2037, 2242, 2244, 2249, 2257, 2266, 2267, 2337, 2338, 2538, 2540, 2545, 2554, 2564, 2565, 2611, 2612, 2817, 2819, 2825, 2833, 2843, 2844, 2876, 2877, 3062, 3064, 3070, 3078, 3088, 3089, 3134, 3135, 3338, 3340, 3346, 3354, 3364, 3365, 3427, 3428, 3628, 3630, 3636, 3645, 3655, 3656, 3699, 3700, 3904, 3906, 3912, 3920, 3930, 3931, 4000, 4001, 4201, 4203, 4209, 4217, 4227, 4228, 4284, 4285, 4488, 4490, 4495, 4504, 4514, 4515, 4548, 4549, 4750, 4752, 4758, 4767, 4777, 4778, 4825, 4826, 5024, 5026, 5032, 5041, 5050, 5051, 5118, 5119, 5320, 5322, 5328, 5337, 5347, 5348, 5407, 5408, 5545, 5547, 5552, 5560, 5570, 5571, 5631, 5632, 5811, 5813, 5818, 5827, 5836, 5837, 5912, 5913, 6117, 6119, 6125, 6133, 6143, 6144, 6175, 6176, 6380, 6382, 6388, 6396, 6406, 6407, 6468, 6469, 6670, 6672, 6678, 6687, 6696, 6697, 6747, 6748, 6947, 6949, 6955, 6964, 6973, 6974, 7090, 7091, 7290, 7292, 7298, 7306, 7316, 7317, 7361, 7362, 7567, 7569, 7575, 7583, 7593, 7594, 7675, 7676, 7875, 7877, 7882, 7890, 7900, 7901, 7938, 7939 ], "line_end_idx": [ 2, 7, 16, 25, 26, 90, 91, 295, 297, 303, 311, 320, 321, 365, 366, 569, 571, 577, 585, 594, 595, 654, 655, 846, 848, 854, 863, 873, 874, 905, 906, 1107, 1109, 1115, 1124, 1134, 1135, 1173, 1174, 1373, 1375, 1381, 1389, 1398, 1399, 1484, 1485, 1678, 1680, 1685, 1693, 1703, 1704, 1760, 1761, 1965, 1967, 1973, 1981, 1991, 1992, 2036, 2037, 2242, 2244, 2249, 2257, 2266, 2267, 2337, 2338, 2538, 2540, 2545, 2554, 2564, 2565, 2611, 2612, 2817, 2819, 2825, 2833, 2843, 2844, 2876, 2877, 3062, 3064, 3070, 3078, 3088, 3089, 3134, 3135, 3338, 3340, 3346, 3354, 3364, 3365, 3427, 3428, 3628, 3630, 3636, 3645, 3655, 3656, 3699, 3700, 3904, 3906, 3912, 3920, 3930, 3931, 4000, 4001, 4201, 4203, 4209, 4217, 4227, 4228, 4284, 4285, 4488, 4490, 4495, 4504, 4514, 4515, 4548, 4549, 4750, 4752, 4758, 4767, 4777, 4778, 4825, 4826, 5024, 5026, 5032, 5041, 5050, 5051, 5118, 5119, 5320, 5322, 5328, 5337, 5347, 5348, 5407, 5408, 5545, 5547, 5552, 5560, 5570, 5571, 5631, 5632, 5811, 5813, 5818, 5827, 5836, 5837, 5912, 5913, 6117, 6119, 6125, 6133, 6143, 6144, 6175, 6176, 6380, 6382, 6388, 6396, 6406, 6407, 6468, 6469, 6670, 6672, 6678, 6687, 6696, 6697, 6747, 6748, 6947, 6949, 6955, 6964, 6973, 6974, 7090, 7091, 7290, 7292, 7298, 7306, 7316, 7317, 7361, 7362, 7567, 7569, 7575, 7583, 7593, 7594, 7675, 7676, 7875, 7877, 7882, 7890, 7900, 7901, 7938, 7939, 8107 ] }
{ "red_pajama_v2": { "ccnet_original_length": 8107, "ccnet_original_nlines": 231, "rps_doc_curly_bracket": 0.00012334999337326735, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3550031781196594, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04142766073346138, "rps_doc_frac_lines_end_with_ellipsis": 0.12068966031074524, "rps_doc_frac_no_alph_words": 0.17463351786136627, "rps_doc_frac_unique_words": 0.3468606472015381, "rps_doc_mean_word_length": 4.916539192199707, "rps_doc_num_sentences": 79, "rps_doc_symbol_to_word_ratio": 0.01784575916826725, "rps_doc_unigram_entropy": 5.319086074829102, "rps_doc_word_count": 1306, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.01993459090590477, "rps_doc_frac_chars_dupe_6grams": 0.004983650054782629, "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.012147639878094196, "rps_doc_frac_chars_top_3gram": 0.022270670160651207, "rps_doc_frac_chars_top_4gram": 0.006852520164102316, "rps_doc_books_importance": -793.8953247070312, "rps_doc_books_importance_length_correction": -793.8953247070312, "rps_doc_openwebtext_importance": -444.5037536621094, "rps_doc_openwebtext_importance_length_correction": -444.5037536621094, "rps_doc_wikipedia_importance": -282.4832763671875, "rps_doc_wikipedia_importance_length_correction": -282.4832763671875 }, "fasttext": { "dclm": 0.02034408040344715, "english": 0.9153268337249756, "fineweb_edu_approx": 1.1191447973251343, "eai_general_math": 0.004085000138729811, "eai_open_web_math": 0.11356384307146072, "eai_web_code": 0.011200790293514729 } }
{ "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": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
8,835,723,455,250,070,000
Member 420 234 entries 1041165 views  RSS Project moderator: Polytopia Contributor to projects: The great enhancement debate The Total Library Every act of rebellion expresses a nostalgia for innocence and an appeal to the essence of being. (Albert Camus) • Affiliated •  /   • Invited •  /   • Descended • Wildcat’s favorites From syncopath Simplicity From syncopath eChoes ... From Xaos Cogitating Ferocities -... From Xaos A becoming on the line:... From syncopath 4 nexT generations Recently commented on From syncopath Simplicity From Wildcat Some nothings are like... From syncopath eChoes ... From nedzen Objects with Soul:... From Wildcat Of course but Maybe, (a... Wildcat’s projects Polytopia The human species is rapidly and indisputably moving towards the technological singularity. The cadence of the flow of information and innovation in... The Total Library Text that redefines... The great enhancement debate What will happen when for the first time in ages different human species will inhabit the earth at the same time? The day may be upon us when people... Now playing SpaceCollective Where forward thinking terrestrials share ideas and information about the state of the species, their planet and the universe, living the lives of science fiction. Introduction Featuring Powers of Ten by Charles and Ray Eames, based on an idea by Kees Boeke. From Wildcat's personal cargo The Substance of ‘WE’, Polytopia Project: Polytopia "Onto what surface shall a theory of aesthetics and consciousness be mapped?" Gregory Bateson From the Gaia hypothesis to Diderot (and D’Alembert) Encyclopedism, from John of Salisbury superorganism (in policraticus) to Herbert Spencer and Paul Otlet human and machine synergy, from Valentin Turchin cybernetic visions and metasystem transitions to Theillard de Chardin noosphere and finally Kevin Kelly and Howard Bloom as well as Peter Russell global brain, it seems that whomsoever seeks a vision that is beyond yit’s* own lunch break must at a certain point reflect upon a global something. I mention all these giants of thought and intellect, as I feel compelled to reply with an essay of my own views, concerning the last entries in this cross time/space polylogue* on the global brain/mind, both by KK (see KK- the superorganism) and Nova Spivack (see here). Let me start by saying that though I agree with both KK and NS that a superorganism is arising, there is a variation on the theme that I would like to point at and maybe even hazard to predict. I believe that a number of superorganisms are arising simultaneously, which as a general notion explains why I understand the next step in human evolution to be one of a Polytopia. Some issues first, concerning evolution intelligence and consciousness. Evolution, as a principle operating on the universal scene, I see as a Rhizomatic process. Allow me a moment to explain; I am now thinking in terms of Rhizomatic dynamics, a term I have coined to describe a state of affairs that has multiple and simultaneous explorations paths, working in tandem in different dimensions and creating a dynamically emergent system for which a direction can be perceived only on the very large scale. Why is this important concerning the arising of the global mind?, because just as I do not believe that we have a structured and coherent ‘one’ self so I do not think that the emerging superorganism is (will be) one, but many. (Image caption: METROPOLIS OF TRAJECTORIES,Francesca Iovino, Sciatto Produzie) Much as I admire the coherency of the one brain, one mind, one self view/model, (local or global) I believe it is fundamentally erroneous. Life has an inherent tendency to multiply in forms and fashions, embodiments and structures, and yet our Victorian sense of elegance desires an underlying principle of unity that will merge ‘all’ this multiplicity into one elegant formula, description and explanation. We are not the first ones to desire a unifying principle/s that will explain all that we see and perceive in a cogent and easy to understand (and thus replicate and use for predicting) manner, however we are for the first time in human history of thought sitting at exactly the cross road point of emergence. Being so close to the singularity and being as capable as we have become, we are in a unique position of observation and participation. Due to a number of factors, that are being explored as we speak, the transitional system situation we are currently in is open for transformation. It is open for transformation, primarily because we have at our disposal the capacity to metamorphose our Neolithic brain/mind into a post human brain/mind. In other words the transitional system situation is open because we have finally at our disposal not only the possibility to change that which we see but to change fundamentally that, which sees (our minds). (Image caption: rhizomatic seating system Sugar Seville made for the dorkbot sessions) A Polytopian perception I therefore propose to be a perception of multiplicity, a dynamic conscious awareness to the flow of events, which does not seek to impose yit’s views on the events themselves but seeks to merge with the process of arising (of the global brain/mind). Given this conceptual understanding I therefore propose that we allow for the possibility that that which is emerging is a multidimensional phase space of possible intelligences, some of which will coalesce into a probable reality (from which some will become actual). Yes, superorganisms are arising, some of them will be equivalent to flock intelligence, some will be hybrids, some will be organic and some will be hardware/software based, some will be of a robotic nature, some will be biological enhanced systems, and some we cannot even imagine at present, that is what the singularity is all about. Allowing for all of these, is the evolutionary imperative of a conscious aware system that realizes that the “good” is neither a given, nor is it fixed. There are many solutions to many problems in many dimensions, that is the beauty of life, that it does not necessitate “one” solution for “one” problem. As the Rhizomatic view purports and possibly implies, a singularity might result in a superior super intelligence, it might just as well (and in my view probably will) result in multiple super intelligences extending human possibilities to all directions simultaneously. Such state/s of affairs I have dubbed ‘topos’ (places), and will refer to states of the one-mind/global brain. Different kinds of intelligence using different substrates, demanding different conditions to emerge and become apparent, are as an ensemble called a Polytopia. From a different perspective we may now answer Bateson's question quoted above:" "Onto what surface shall a theory of aesthetics and consciousness be mapped?" the answer to my mind is simple: we shall map our consciousness as presence and our aesthetics as existence onto the dynamic rhizomatics of an interconnected multiplicity of intelligences, the Polytopia. Some possible new definitions for Polytopia : Polytopia is a term designating the emergent surface of relevance for both minds and machines to exist within and upon. A polytopia implies the supreme value of multiplicity and the relevancy of hyperconnectivity. A polytopia allows for infinite personal sovereignty closely coupled and intimately hyperconnected with all consciously aware entities both embracing and merging with a collective intelligence. Following Deleuze, it is my view therefore that consciousness and intelligence actualizes via differentiation in states (topos). Said differentiation of states is what brought about the culture we currently inhabit and will propel us towards the next step of human evolution, the multiple global brain, composed of minds and machines, intimately hyperconnected in a fully coherent and free manifestation, a polytopia. "Deleuze posits that we may think of reality not in terms of an opposition between the possible and the real, but rather between the virtual and the actual. The distinction is that possible things do not have any sort of existence, they are empty signs, leaving the real as a realm of solid objects, akin to that of classical physics. The virtual, by contrast, persists as a sort of enfolded order of potentiality, from which things actualize by differentiating themselves. " Paul Harris The Substance of 'WE' is a polytopia, a rhizomatic dynamic system that connects any topos to any other topos, not necessarily linking nodes of the same nature, nor joining organisms necessarily relying on the same substrate for their intelligence and consciousness. notes: # YIT = you+ I+ it (not my invention but still need to find the reference) # Polylogue = The term polylogue applies to hyperconnectivity in the same sense that conversation applies to connectivity # For a more complex view of Rhizomathics see this 6 comments   Promote (11)      Add to favorites (3) Synapses (3)   Comments: Spaceweaver     Sat, Nov 1, 2008  Permanent link An excellent post Wildcat, thanks. Some issues first, concerning evolution intelligence and consciousness. Evolution, as a principle operating on the universal scene, I see as a Rhizomatic process. Allow me a moment to explain; I am now thinking in terms of Rhizomatic dynamics, a term I have coined to describe a state of affairs that has multiple and simultaneous explorations paths, working in tandem in different dimensions and creating a dynamically emergent system for which a direction can be perceived only on the very large scale. I would first make a categorical distinction between mind and brain as they are used here and in other places. A brain is definitively an organ operating in the context of a living organism, and as such it presents a coordinated and coherent activity in regards to the whole of the organism and in regards to the interaction of the organism to its environment. Though there are a few remarkable structural and functional analogues between the web and a brain, I think a brain is only a superficial metaphor to the emerging web. We use this metaphor exactly because we somehow expect the web to operate eventually as a brain: coherent, coordinated and unified to a very large degree. I agree with wildcat that this is not nearly what the combined intelligences of humans, posthumans, the web and other kinds of connected organisms artificial or otherwise is about to evolve into. The global brain analogy is misleading and veiling the full potential of an evolving intelligence. A global mind, on the other hand is a much more fit conceptualization because a mind in the wider sense of the word is indeed Rhizomatic dynamic self generative process. What we witness lately is an emergence of a new kind of mind. I think it is too early to describe this process of emergence in terms of either singular or multiple organisms. This emergence is rather the emergence of a new ecology of intelligence, a kind of mind to which we have no description as yet. This ecology, being in its very initial stages of emergence, has not differentiated itself into distinct intelligent entities or environments or states. I am not even sure the concepts of unity and multiplicity will be of any use in describing what is about to happen. I believe the emergent global mind will turn to be neither a unified super-mind nor a multiplicity of interacting super organisms. I believe consciousness and intelligence will gain a kind of multidimensional fluidity we can hardly glimpse with our current conceptual system. I can see language replaced with intelligent ontological membranes that will allow kinds of interactivity and coordination that goes beyond discrete enumeration of sources recipients, and transmissions. The difference, it seems, is about to become very different. I would suggest that Polytopia will imply multifluency instead of just multiplicity. Multifluency comes to describe an emergent property of intelligence evolving into a state which is both discrete and fluid and perhaps beyond both. I also like the connotation implying the integration of multiple languages, multiple means of description and multiple ontologies in a seamless manner. Additionally, I find most interesting Polytopia as a mapping surface, perhaps a prototype of an ontological membrane. Infinite personal sovereignty is somewhat vague especially in conjunction to merging in a collective intelligence. I think the concept of personhood will be kept in the post singularity era only for a short while and only for solving backward compatibility issues (something like COBOL). Wildcat     Mon, Nov 3, 2008  Permanent link SW: "I think a brain is only a superficial metaphor to the emerging web." WC: Definitely, I agree and from now on, all identity correlates between brain & Mind will be designated as GB (for global brain) and GM (for global mind). SW: “This emergence is rather the emergence of a new ecology of intelligence, a kind of mind to which we have no description as yet. This ecology, being in its very initial stages of emergence, has not differentiated itself into distinct intelligent entities or environments or states. I am not even sure the concepts of unity and multiplicity will be of any use in describing what is about to happen. I believe the emergent global mind will turn to be neither a unified super-mind nor a multiplicity of interacting super organisms.” WC: I really like the concept of “a new ecology of intelligence” , of course we will need to describe and then explain what this new ecology implies in terms of evolution both of the individual and of human culture in general. SW: “I believe consciousness and intelligence will gain a kind of multidimensional fluidity” WC: If I understand you correctly here you imply a metamorphosis of the very concept of localization? The term fluidity here needs expanding; do you mean that consciousness and intelligence will become one motion, one flow? Or do you mean that these will remain separate descriptive entities that will fluidly intertwine? SW: “I can see language replaced with intelligent ontological membranes that will allow kinds of interactivity and coordination that goes beyond discrete enumeration of sources recipients, and transmissions.” WC: This is an amazingly complex description, but demands elaboration, what are :” intelligent ontological membranes”? SW: “I would suggest that Polytopia will imply multifluency instead of just multiplicity. Multifluency comes to describe an emergent property of intelligence evolving into a state which is both discrete and fluid and perhaps beyond both.” WC: In multifluency I understand: multiple flows of evolving intelligence, this is an upgrade to what a Polytopia might describe, here follows my proposal for a possible new definition based on your insightful inserts: Polytopia: The emergent ecology of intelligence in which intelligences and consciousness conjoin, intertwine and co-evolve in a continuous state of dynamic multifluency. Your thoughts on the above? Spaceweaver     Thu, Nov 6, 2008  Permanent link Wildcat wrote: If I understand you correctly here you imply a metamorphosis of the very concept of localization? The term fluidity here needs expanding; do you mean that consciousness and intelligence will become one motion, one flow? Or do you mean that these will remain separate descriptive entities that will fluidly intertwine? Yes I did mean that the way we treat localization will entirely transform, though the concepts of space and locality are so very ingrained in our minds. What I meant in 'consciousness and intelligence' was rather referring a more general and holistic state of affairs that we experience as our mind. As to your question, I lean towards the second option at least till we have a deeper understanding as to what consciousness is and what is its evolutionary advantage. My guess is that consciousness is a special kind of operator that operates on intelligence producing other kinds of intelligence like arithmetic operators operate on numbers producing other numbers. Wildcat: This is an amazingly complex description, but demands elaboration, what are :” intelligent ontological membranes”? This is an idea I have regarding the diversification of intelligence. I will try to expand on that in a separate post soon. Wildcat: In multifluency I understand: multiple flows of evolving intelligence, this is an upgrade to what a Polytopia might describe, here follows my proposal for a possible new definition based on your insightful inserts: Polytopia: The emergent ecology of intelligence in which intelligences and consciousness conjoin, intertwine and co-evolve in a continuous state of dynamic multifluency. I think emergent ecology of intelligence is a very powerful and in conjunction with multifluency it brings forth a complex diversified interconnected and wide horizoned playground. I like it. Am in doubt though regarding the word consciousness here. Is Polytopia conscious as a whole? Accommodates consciousness? Allows consciousness? Promotes consciousness ? Necessitates consciousness? etc. It seems to me we are in a too early stage to answer these. starwalker     Thu, Nov 6, 2008  Permanent link Hello Wildcat, this is a very interesting post, insightful to me, actually one of the most interesting capturing I read lately. Am following for a while the project Polytopia and many of the “entries in this cross time/space polylogue”. And one of the paradoxes in my mind was the conflict in between the attractiveness of the idea of an emerging organism, and the profound out of tune sound of the “Hive projection”. I believe that metaphors, though one of our best tools of thought, can be stretched that far. And when it comes to taking into account all we as humans struggled to achieve with our rudimental reflective abilities, and project it ahead, the hive felt a bit tight..:). So am really excited by your proposition as the “substance of we”. First of all the rhizomatic dynamics as “a state of affairs that has multiple and simultaneous explorations paths, working in tandem in different dimensions and creating a dynamically emergent system for which a direction can be perceived only on the very large scale”, seems to me possibly a very potent dynamic, both in life and all large global systems. A dynamic that requires from the system adopting it both very large capacity and space for redundancy, to compute multiple and simultaneous paths bottom-up, and great integration ability, to instantaneously compose them top-down into a complex whole showing emerging direction. It makes sense that whatever may globally emerge will show a use of our diversity and multiplicity in more creative ways than categorizing it into different parts of a one strictly coherent whole. We are different from each other as humans, though it is probably the most difficult thing for us to capture and hold in our perception, and at least some traits of this difference are not going to disappear into some one panaceatic uni-verse. This simultaneously does not have to imply an irreducible and inevitable factional separation followed by negation of connective properties and access (thus sooner or later a kind of death..). Polytopia, in your description, seems to me eyeing the open corridor into a realistically positive future. Borrowing the words of Pierre Levy (see here) from the context of semantic, it seems pointing to “a space common to all the possible interpretations” of human evolution. What rise in my mind is that the word Uni-verse has partially reached its limitations, and maybe the word Polytopia will begin to replace it in all the multiple uses we have for it in our language, would you agree? Wildcat     Mon, Nov 17, 2008  Permanent link Spaceweaver:" Am in doubt though regarding the word consciousness here. Is Polytopia conscious as a whole? Accommodates consciousness? Allows consciousness? Promotes consciousness ? Necessitates consciousness? etc. It seems to me we are in a too early stage to answer these." Regarding this very difficult subject I am in the process of writing an extended post concerning the term consciousness, as I believe it could be understood in a Polytopia situation. However for the present here are some of my thoughts on this subject. I do not think that we can predict with a high enough degree of accuracy what a Polytopia will be like if only for the simple fact that we are at present (still, unfortunately) under the spell and illusion of the never ending process of (trying to) objectifying consciousness. As I understand a Polytopia situation, it implies a fractal nature of existence within which different levels of existence can be related to as topos. If we take the view, as indeed I do, that different dimensions of existence can be called topos if and when these receive a coherent set of characteristics, loosely defined under a given designation, we maybe could redefine what consciousness means. As I see it, consciousness is not an (inherently definable) object but a set of relations across dimensions. The set of relations I refer to here is the manner in which and by which information flows across dimensions both in space and in time. For example in the process of watching a film, there cannot be made a total distinction between me (the watcher, a topos) and the film (that which is being watched, a topos), I am not a consciousness watching a film, rather, the consciousness that can be said to exist (if it can be said to exist at all) will exist on the plane of interactivity topos/me+topos/film. Using this example as a template, I can now say with a fair amount of certainty that if consciousness can be found in a Polytopia situation it will operate on the plane of interactivity between topos. Given that the Polytopia is fractal and dynamic, emergent and continuously merging (your multifluency is a good point to insert here) it could, with a generous amount of salt added for good measure, be said that a Polytopia is conscious as a whole via the interactivity (see dynamic rhizomatics) of its components. More on this when I finish the paper Wildcat     Thu, Jun 11, 2009  Permanent link Hi Starwalker, I apologize for the time it took me to respond to this comment of yours, somehow I missed it in the on-going flow of hyperconnectivity. Starwalker: "Polytopia, in your description, seems to me eyeing the open corridor into a realistically positive future. Borrowing the words of Pierre Levy (see here) from the context of semantic, it seems pointing to “a space common to all the possible interpretations” of human evolution." I definitely agree with Pierre Levy take on the issue, though I would in a sense rephrase it:" a space common to all possible interpretations" I will rephrase as : " Multiple and indefinite spaces, that may allow, all possible interpretations" This is in my view a paramount issue for unleashing the possible from its potential, into the actual. Starwalker: What rise in my mind is that the word Uni-verse has partially reached its limitations, and maybe the word Polytopia will begin to replace it in all the multiple uses we have for it in our language, would you agree? I am not sure how you understand the word Uni-verse, but in general I use the term multiverse, not only in its physical/materialist connotation but also in the sense that different states (topos) operate under different conditions of emergence and thus imply different rules of behavior/attitude and so on, implying multiple versions of the thematic reality. In this case yes, I agree that the term polytopia might be an adequate change of language.         Cancel
{ "url": "http://spacecollective.org/Wildcat/4434/The-Substance-of-WE-Polytopia", "source_domain": "spacecollective.org", "snapshot_id": "crawl=CC-MAIN-2015-11", "warc_metadata": { "Content-Length": "67850", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:OUTVJR57ABLQD2ZBUWQMQSAUS33WMLLJ", "WARC-Concurrent-To": "<urn:uuid:b6be47e3-3309-495a-9b81-ad6bb3eac69b>", "WARC-Date": "2015-03-03T04:39:56Z", "WARC-IP-Address": "72.47.223.67", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:TEA2DR7CMORMTWYY5IUJCG43G3OJDBKE", "WARC-Record-ID": "<urn:uuid:64fb32c3-d84b-43da-8916-1f1974283dd6>", "WARC-Target-URI": "http://spacecollective.org/Wildcat/4434/The-Substance-of-WE-Polytopia", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:940c454e-82ae-493c-a4d4-35c74fdd4e94>" }, "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, 11, 23, 37, 38, 43, 62, 72, 73, 98, 127, 145, 258, 273, 282, 294, 303, 317, 341, 360, 375, 394, 409, 423, 454, 468, 499, 518, 541, 567, 586, 601, 618, 648, 667, 682, 698, 724, 741, 772, 795, 809, 965, 966, 988, 1015, 1016, 1049, 1205, 1237, 1418, 1504, 1538, 1539, 1576, 1599, 1681, 1701, 1702, 1703, 2208, 2209, 2484, 2485, 2864, 2865, 3374, 3605, 3606, 3607, 3608, 3691, 3692, 4104, 4105, 4701, 4702, 5071, 5072, 5073, 5074, 5165, 5166, 5445, 5718, 5719, 6636, 6637, 6913, 6914, 6915, 6916, 7283, 7284, 7334, 7458, 7556, 7754, 7755, 8177, 8178, 8658, 8674, 8675, 8945, 8946, 8947, 8958, 8959, 9038, 9164, 9219, 9220, 9221, 9236, 9255, 9262, 9289, 9306, 9312, 9326, 9327, 9328, 9381, 9420, 9421, 9930, 9931, 9932, 10914, 10915, 12201, 12202, 12591, 12592, 13002, 13003, 13004, 13005, 13054, 13132, 13133, 13293, 13294, 13832, 13833, 14064, 14065, 14162, 14163, 14489, 14490, 14703, 14704, 14827, 14828, 15071, 15072, 15295, 15296, 15470, 15471, 15503, 15504, 15505, 15506, 15507, 15508, 15561, 15580, 15902, 15903, 15904, 16574, 16575, 16588, 16707, 16708, 16709, 16837, 16838, 16851, 17070, 17071, 17245, 17246, 17247, 17443, 17444, 17709, 17710, 17711, 17712, 17764, 17783, 18458, 18529, 19168, 19806, 20087, 20306, 20356, 20636, 20637, 20894, 20895, 21176, 21581, 21582, 21831, 22403, 22722, 22723, 22724, 22765, 22766, 22816, 22971, 22972, 23267, 23268, 23516, 23622, 23623, 23624, 23855, 23856, 24219, 24314, 24320 ], "line_end_idx": [ 11, 23, 37, 38, 43, 62, 72, 73, 98, 127, 145, 258, 273, 282, 294, 303, 317, 341, 360, 375, 394, 409, 423, 454, 468, 499, 518, 541, 567, 586, 601, 618, 648, 667, 682, 698, 724, 741, 772, 795, 809, 965, 966, 988, 1015, 1016, 1049, 1205, 1237, 1418, 1504, 1538, 1539, 1576, 1599, 1681, 1701, 1702, 1703, 2208, 2209, 2484, 2485, 2864, 2865, 3374, 3605, 3606, 3607, 3608, 3691, 3692, 4104, 4105, 4701, 4702, 5071, 5072, 5073, 5074, 5165, 5166, 5445, 5718, 5719, 6636, 6637, 6913, 6914, 6915, 6916, 7283, 7284, 7334, 7458, 7556, 7754, 7755, 8177, 8178, 8658, 8674, 8675, 8945, 8946, 8947, 8958, 8959, 9038, 9164, 9219, 9220, 9221, 9236, 9255, 9262, 9289, 9306, 9312, 9326, 9327, 9328, 9381, 9420, 9421, 9930, 9931, 9932, 10914, 10915, 12201, 12202, 12591, 12592, 13002, 13003, 13004, 13005, 13054, 13132, 13133, 13293, 13294, 13832, 13833, 14064, 14065, 14162, 14163, 14489, 14490, 14703, 14704, 14827, 14828, 15071, 15072, 15295, 15296, 15470, 15471, 15503, 15504, 15505, 15506, 15507, 15508, 15561, 15580, 15902, 15903, 15904, 16574, 16575, 16588, 16707, 16708, 16709, 16837, 16838, 16851, 17070, 17071, 17245, 17246, 17247, 17443, 17444, 17709, 17710, 17711, 17712, 17764, 17783, 18458, 18529, 19168, 19806, 20087, 20306, 20356, 20636, 20637, 20894, 20895, 21176, 21581, 21582, 21831, 22403, 22722, 22723, 22724, 22765, 22766, 22816, 22971, 22972, 23267, 23268, 23516, 23622, 23623, 23624, 23855, 23856, 24219, 24314, 24320, 24336 ] }
{ "red_pajama_v2": { "ccnet_original_length": 24336, "ccnet_original_nlines": 229, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4591813385486603, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.023553619161248207, "rps_doc_frac_lines_end_with_ellipsis": 0.043478261679410934, "rps_doc_frac_no_alph_words": 0.1250857561826706, "rps_doc_frac_unique_words": 0.261655330657959, "rps_doc_mean_word_length": 5.054478645324707, "rps_doc_num_sentences": 154, "rps_doc_symbol_to_word_ratio": 0.002972790040075779, "rps_doc_unigram_entropy": 5.789426326751709, "rps_doc_word_count": 3818, "rps_doc_frac_chars_dupe_10grams": 0.2850036323070526, "rps_doc_frac_chars_dupe_5grams": 0.2950564920902252, "rps_doc_frac_chars_dupe_6grams": 0.28749093413352966, "rps_doc_frac_chars_dupe_7grams": 0.2850036323070526, "rps_doc_frac_chars_dupe_8grams": 0.2850036323070526, "rps_doc_frac_chars_dupe_9grams": 0.2850036323070526, "rps_doc_frac_chars_top_2gram": 0.005181880202144384, "rps_doc_frac_chars_top_3gram": 0.008705570362508297, "rps_doc_frac_chars_top_4gram": 0.0037309599574655294, "rps_doc_books_importance": -1713.6356201171875, "rps_doc_books_importance_length_correction": -1713.6356201171875, "rps_doc_openwebtext_importance": -880.04296875, "rps_doc_openwebtext_importance_length_correction": -880.04296875, "rps_doc_wikipedia_importance": -631.1300048828125, "rps_doc_wikipedia_importance_length_correction": -631.1300048828125 }, "fasttext": { "dclm": 0.09944338351488113, "english": 0.9402886033058167, "fineweb_edu_approx": 1.7201085090637207, "eai_general_math": 0.6805939078330994, "eai_open_web_math": 0.3644310235977173, "eai_web_code": 0.14271432161331177 } }
{ "free_decimal_correspondence": { "primary": { "code": "004.019", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "128", "labels": { "level_1": "Philosophy and psychology", "level_2": "", "level_3": "Soul, Philosophical anthropology, and Human beings" } } }, "bloom_cognitive_process": { "primary": { "code": "4", "label": "Analyze" }, "secondary": { "code": "5", "label": "Evaluate" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "4", "label": "Metacognitive" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "0", "label": "No missing content" } }, "document_type_v2": { "primary": { "code": "16", "label": "Personal Blog" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "4", "label": "Advanced Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
-5,622,589,860,484,462,000
Skip to content September 1, 2009 / mommsen Gorillas on Facebook 5000 friends on facebook in 3 month. No, it´s not Obama I´m talking about. It´s a Gorilla from Givskud Zoo in Denmark. Together with the Zoo I put Samson the Gorilla on Facebook to create an alternative way of getting in to dialogue with the guests and an alternative way of promoting the Zoo. It´s a big success and we are surprised by the huge activity from its friends. Each update from Samson is commented from at least 5 friends. So why do people want to be friends with a Gorilla that they know is controlled by someone? My guess is that it´s because it´s a fun way of getting information and because you through his friendship can become a part of a social community that shares the love for Gorillas and makes conversations with others possible. I often use this as an example to pin point the social importance of digital marketing and compares it to the use of a traditional newsletter. Imagine what it would take for Givskud Zoo to get 5000 sign ups for their newsletter in 3 month! I got inspired to write this post because I read an article today about the introduction of a rare Ugandan Gorilla on Facebook. So maybe the Ugandan Gorilla and Samson could be friends? I´m sure they will have some great discussions about humans. Become a fan of Samson Advertisements Leave a Reply Fill in your details below or click an icon to log in: WordPress.com Logo You are commenting using your WordPress.com account. Log Out / Change ) Twitter picture You are commenting using your Twitter account. Log Out / Change ) Facebook photo You are commenting using your Facebook account. Log Out / Change ) Google+ photo You are commenting using your Google+ account. Log Out / Change ) Connecting to %s %d bloggers like this:
{ "url": "https://mommsen.wordpress.com/2009/09/01/gorillas-on-facebook/", "source_domain": "mommsen.wordpress.com", "snapshot_id": "crawl=CC-MAIN-2017-22", "warc_metadata": { "Content-Length": "51097", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:TNIWQV6SYJLCRLISSLHZQVGG6QMRP37F", "WARC-Concurrent-To": "<urn:uuid:e4501936-f9ad-4910-a063-2186b89d0f9c>", "WARC-Date": "2017-05-24T02:07:19Z", "WARC-IP-Address": "192.0.78.12", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:XEK5L64R4DSRP37HMV6VB6H37KQZDQ2Z", "WARC-Record-ID": "<urn:uuid:5f2464a8-412f-42e8-b1f4-bca54ed6477e>", "WARC-Target-URI": "https://mommsen.wordpress.com/2009/09/01/gorillas-on-facebook/", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3a00cafb-2bfc-4b59-a7d1-b44d01fba73f>" }, "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, 16, 44, 45, 66, 67, 594, 1061, 1189, 1308, 1309, 1332, 1333, 1348, 1349, 1363, 1364, 1419, 1420, 1439, 1440, 1512, 1513, 1529, 1530, 1596, 1597, 1612, 1613, 1680, 1681, 1695, 1696, 1762, 1763, 1780, 1781 ], "line_end_idx": [ 16, 44, 45, 66, 67, 594, 1061, 1189, 1308, 1309, 1332, 1333, 1348, 1349, 1363, 1364, 1419, 1420, 1439, 1440, 1512, 1513, 1529, 1530, 1596, 1597, 1612, 1613, 1680, 1681, 1695, 1696, 1762, 1763, 1780, 1781, 1803 ] }
{ "red_pajama_v2": { "ccnet_original_length": 1803, "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.4490358233451843, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.016528930515050888, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.13774104416370392, "rps_doc_frac_unique_words": 0.5176848769187927, "rps_doc_mean_word_length": 4.604501724243164, "rps_doc_num_sentences": 20, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.785102844238281, "rps_doc_word_count": 311, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.0768156424164772, "rps_doc_frac_chars_dupe_6grams": 0.041899438947439194, "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.02793296054005623, "rps_doc_frac_chars_top_3gram": 0.044692739844322205, "rps_doc_frac_chars_top_4gram": 0.05865921825170517, "rps_doc_books_importance": -162.86532592773438, "rps_doc_books_importance_length_correction": -158.5537109375, "rps_doc_openwebtext_importance": -78.92398834228516, "rps_doc_openwebtext_importance_length_correction": -78.92398834228516, "rps_doc_wikipedia_importance": -55.84382629394531, "rps_doc_wikipedia_importance_length_correction": -55.644187927246094 }, "fasttext": { "dclm": 0.07279843091964722, "english": 0.8961567878723145, "fineweb_edu_approx": 1.619402289390564, "eai_general_math": -0.000010009999641624745, "eai_open_web_math": 0.02732514962553978, "eai_web_code": -0.000010009999641624745 } }
{ "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": "639.95", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Agriculture", "level_3": "Hunting, Fishing, Trapping, and Fish culture" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "9", "label": "Personal/Misc" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "16", "label": "Personal Blog" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
-3,073,409,089,964,752,000
typescript typescript不检查node_moduls 月盾 tsconfig.json 中 exclude node_modules,但 tsc 还是报错。 node_modules/connect-mongo/src/types.d.ts:113:66 - error TS2694: Namespace 'global.Express' has no exported member 'SessionData'. 113 get: (sid: string, callback: (err: any, session: Express.SessionData | null) => void) => void; ~~~~~~~~~~~ node_modules/connect-mongo/src/types.d.ts:114:45 - error TS2694: Namespace 'global.Express' has no exported member 'SessionData'. 114 set: (sid: string, session: Express.SessionData, callback?: (err: any) => void) => void; ~~~~~~~~~~~ node_modules/connect-mongo/src/types.d.ts:118:47 - error TS2694: Namespace 'global.Express' has no exported member 'SessionData'. 118 touch: (sid: string, session: Express. 关于svelte框架——sapper和sveltekit的发展 月盾 虽然您可能现在还没有听说过svelte,但是其实svelte的发展速度超过了你的想象。 本文主要讲的是关于sapper和sveltekit这两款框架的发展。 svelte作者里奇·哈里斯(Rich Harris)在2020年10月的svelte峰会上表示:sapper永远不会发布1.0版本。 也就是说sapper不会发布正式版,一直处于非稳定版本。也可能放弃更新。 主要原因是sapper多年来代码库变得凌乱,但更主要的原因是最近网络发生了很大变化。 而作者放弃sapper后的另一种选择是开发SvelteKit。 Sapper和SvelteKit都是svelte的开发框架,类似于vue的nuxt框架。 sveltekit包含的功能有: 服务端渲染(SSR) 路由 typescript支持 less, scss支持 serverless vite打包 可以看到,sveltekit几乎包含了所有我们想要的功能,既能高效开发,又有高性能。 创建sveltekit的方法: mkdir my-app cd my-app npm init svelte@next npm install npm run dev 需要注意,您的nodejs版本需要更新到v12以上,否则可能出现以下错误: $ npm run dev -- --open > [email protected] dev D:\workspace\sveltekit-app > svelte-kit dev "--open" D:\workspace\sveltekit-app\node_modules\@sveltejs\kit\svelte-kit.js:2 import './dist/cli.js'; SyntaxError: Unexpected string at Module._compile (internal/modules/cjs/loader.js:723:23) at Object.Module._extensions..js (internal/modules/cjs/loader.js:789:10) at Module.load (internal/modules/cjs/loader.js:653:32) at tryModuleLoad (internal/modules/cjs/loader.js:593:12) at Function.Module._load (internal/modules/cjs/loader.js:585:3) at Function.Module.runMain (internal/modules/cjs/loader.js:831:12) at startup (internal/bootstrap/node. typescript开发sequelize返回ModelInstance或null值无法获取属性值 月盾 从图片中的代码可以看出 let userRecord = await item.getUser();获取到的是Bluebird<UserInstance | null>类型,然后在下面获取对象属性的时候报错,错误信息是: [ts] Object is possibly 'null'. let userRecord: UserInstance | null 说对象可能是null,所以无法获取其中的属性。遇到这种情况请设置typescript的编译选项,tsconfig.json文件中的 "strictNullChecks": true, /* Enable strict null checks. */ 默认是true,即严格null检查,设置为falsse即可。 typescript泛型的使用方法 月盾 typescript(以下简称ts)中泛型如何使用?(以下代码为ts书写) 个人认为开发语言中一些高级特性如果在不太理解的情况下不使用也无妨,无非是代码写的多一点,烂一点。但是我想作为程序猿大家还是会有所追求的。就以泛型来说,不使用也能正常开发,只不过在个别情况下需要写几份看起来相同的代码。比如在不使用泛型的情况下要求函数参数为number类型,并且返回number。 function a(args: number ): number { return args; } console.log(a(123)); 又有另外一个要求,参数为string类型,并且返回string function b(args: string ): string { return args; } console.log(b("sdg")); 如果还有其他类似的要求,就要不停的写类似格式的代码,那么改进一下: function c(args: any ): any { return args; } console.log(c("sdg")); 这样是可以接受任何类型参数并且返回,但缺点是可以知道能传入任何类型而不知道返回的具体类型是什么,只知道是any类型。将上面的c函数稍作修改: function c(args: any ): any { let n = args + "变成了字符串"; //甚至更多的处理 return n; } console.log(c(1)); c函数参数是数字,返回的可能是其他类型。 知道前面几种写法的不足再对比一下泛型的写法: function d<A>(args: A ): A { let n = args + "变成了字符串"; //甚至更多的处理 return n; } console. 使用typescript开发nodejs的环境搭建(二) 月盾 完成了最基本的项目框架以后就是配置编辑器和编译选项,在没有特别配置的情况下,根目录下执行tsc会在ts后缀文件同级目录下生成js后缀的文件, 这样也没什么不可以,但是在编辑器列表中看着有点混乱,生成的js文件是不建议直接修改的,就算修改了下次修改ts文件编译后也会重置文件内容。 所以还是单独有个文件夹存放生成的js文件,这时就要配置tsconfig.json文件了。tsconfig.json文件可以通过tsc --init命令生成,自动生成内容比较简单,是可以直接使用的。 以下的配置是经过一些特别需求配置的,可以直接复制一下内容到tsconfig.json文件中,然后根据自己的需求加减内容。 其余参数可以参考:http://www.tslang.cn/docs/handbook/compiler-options.html typescript编译配置 { "compilerOptions": { "module": "commonjs",//模块化规范 "target": "es5",//生成js "noImplicitAny": true,//在表达式和声明上有隐含的'any'类型时报错 "noImplicitReturns": true,//函数没有返回值提示 "noFallthroughCasesInSwitch": true,//switch没有break提示 "removeComments": true,//输出文件移除注释 "noEmitOnError": true,//ts文件错误时不生成js "rootDir": "./",//需要编译的根目录 "outDir": "./build",//编译文件输出目录 "sourceMap": ture//是否生成.map文件,用于ts debug调试 }, "include": [ "*/**/*.ts" ], "exclude": [ //默认排除了node_modules ] } 为了能抛开在命令行中执行tsc命令,能直接通过vscode编辑器来编译,可以使用ctrl+shift+B快捷方式来编译ts文件。第一次使用会有提示 选择TypeScript - Watch-Mode,会在项目根目录下创建.vscode文件夹和tasks.json文件,内容如下: vscode编译typescript配置 { // See https://go.microsoft.com/fwlink/?LinkId=733558 // for the documentation about the tasks.json format "version": "0.1.0", "command": "tsc", "isShellCommand": true, "args": ["-w", "-p", "."], "showOutput": "silent", "isWatching": true, "problemMatcher": "$tsc-watch" } 这样就不用每次编译了,只要文件有修改就会自动编译 TypeScript中的装饰器Decorato什么时候执行? 月盾 ES6引入了类的概念,同时也引入了类似于java的注解概念,我们称之为装饰器,用于在某些场景下修改类和类成员。typescript要支持装饰器需要手动开启experimentalDecorators。 命令行编译 tsc --target ES5 --experimentalDecorators /test.ts 或者配置文件设置: tsconfig.json: { "compilerOptions": { "experimentalDecorators": true } } 那么这个装饰器到底什么原理呢?它是什么时候执行的?用下面代码为例: //test.ts class Route { greeting: string; constructor(greet: string){ this.greeting = greet; } @route("hello") default(): any { console.log(this.greeting); } } function route(name: string) { return function (target: Object, value: string, desc: PropertyDescriptor) { console.log('>>>>', name); } } 生成的js代码: //test.js var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) { var c = arguments. 使用typescript开发nodejs的环境搭建(一) 月盾 在一切开始之前先具备的开发环境: nodejs4.0+ 推荐的开发工具vscode 我希望通过本文介绍能直接做出一个最简单的项目框架,以便日后参考,这也是我想把之前纯nodejs写的博用typescript客重写一遍。 还是以expressjs为框架来搭建 使用express-generator来生成项目基本框架,需要全局安装 npm install -g express-generator express -e mpro 参数-e是以ejs为模板引擎,mpor为项目目录名,最后生成这样的目录结构: . ├── app.js ├── bin │ └── www ├── package.json ├── public │ ├── images │ ├── javascripts │ └── stylesheets │ └── style.css ├── routes │ ├── index.js │ └── users.js └── views ├── error.ejs └── index.ejs 然后是全局安装typescript,便于在任何目录下编译,也可以安装在项目目录下。 npm install -g typescript 安装完以后初始化typescript: tsc –init 会在根目录下生成tsconfig.json文件,用于配置ts的编译选项。 有了基本目录以后就可以着手编写代码了,为了使用ts开发,可以手动将routes目录下的js文件 和app.js后缀名改成.ts. 做完以上步骤以后可以试着在项目根目录下执行> tsc命令,可能什么都没发生, 这个命令会默认编译当前目录下的ts文件,但是我们项目中并没有这样的文件, 你可以自己新建一个后缀为.ts的文件再执行> tsc还是什么都没有发生一样,但是如果我们把app.ts (已经改过后缀的app.js文件)中的 var bodyParser = require('body-parser'); 改成 使用半年TypeScript后的感受 月盾 初识TypeScript 从入职新公司开始算,使用typescript已经有半年多了,这是一个创业公司使用nodejs开发的后台业务管理系统,已经做的很大了,支撑着公司每月千万人民币的业务处理。很多怀疑nodejs是否可以开发后台管理,作为一个过来人告诉你可以放心使用,现在的javascript早已不是10年前用来写前端特效的js了。美中不足的是nodejs对报表这类数据处理量较大的功能有点力不从心,经常拖垮系统,当然也不是完全不能用nodejs来处理报表,可以合理的使用子进程单独处理数据而不影响主进程。但还是不推荐。 使用感受 其实起初对于typescript开发nodejs我是拒绝的,原因是建立起这个项目的人都走了,而这个项目结构实在是复杂,在windows下环境搭建费了好大精力,尤其是为了使用一个bcrypt加密包,需要安装Python,C++来编译,还不能使用nodejs0.12以上版本,最烦人的是每次修改文件后编译速度非常慢,这让我重新体验了开发JAVA时期的痛苦。而且服务启动方法也是前人自己编写shell脚本来同时编译前端文件和后端文件。并没有使用nodemon,supervisor这种监控工具。后来折腾发现可以直接使用vscode单独编译ts文件,一般12秒就编译完成,这与我之前的项目1秒修改重启相比还是慢了很多,不过也免强只能接受,此时只觉得如此麻烦和JAVA开发有什么区别!所以基于这些不好的体验我很不喜欢typescript。 重新认识 最近又折腾了下我用纯nodejs开发的博客,突然发现,写起来确实不如typescript爽,主要是纯nodejs在webstorm和vscode上语法提示和错误提示较弱,而typescript则可以很好的提示并且在开发过程中就能发现一些很低级错误,不用等到运行时才发现。尤其是对ES6的支持比较完整,甚至可以使用async,await这些ES7提案中的特性。虽然现在高版本的nodejs已经支持一些新特性,但是并不是所有项目都可以使用高版本。如果说为什么要使用typescript,那就是typescript集合了js的快速和强类型语言的安全稳定,用于开发一些较大的项目绝对利大于弊。 尤其是对于一些多人合作的项目来说,typescript的强类型能够很好约束对象属性,参数传递,对后续的重构也起到至关重要的作用。 有人可能会担心降低开发效率,这一点大可不必担心,你定义类型消耗的时间会从强类型提示上补回来的。 接下来会写一篇完整的环境搭建教程:使用typescript开发nodejs的环境搭建(一)
{ "url": "https://www.yuedun.wang/tags/typescript/", "source_domain": "www.yuedun.wang", "snapshot_id": "CC-MAIN-2024-30", "warc_metadata": { "Content-Length": "45419", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:2U2SCB5CJ2OCWMFMONMWXXEYXINTQNYU", "WARC-Concurrent-To": "<urn:uuid:2682bbb9-76ee-4498-a0d5-299b325e5c4f>", "WARC-Date": "2024-07-22T13:12:36Z", "WARC-IP-Address": "185.199.111.153", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:YRDUZX6CIXPRTN33IQKPINGKZJL5PI35", "WARC-Record-ID": "<urn:uuid:ff578ce0-dab1-4f98-94f1-631aa7d76668>", "WARC-Target-URI": "https://www.yuedun.wang/tags/typescript/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e11c3d58-1460-4e3c-8082-de2a7f1eed50>" }, "warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-148\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 11, 12, 37, 38, 41, 739, 740, 772, 773, 776, 1960, 1961, 2011, 2012, 2015, 2350, 2351, 2369, 2370, 2373, 3135, 3136, 3165, 3166, 3169, 4464, 4465, 4496, 4497, 4500, 5200, 5201, 5230, 5231, 5234, 6082, 6083, 6102, 6103, 6106 ], "line_end_idx": [ 11, 12, 37, 38, 41, 739, 740, 772, 773, 776, 1960, 1961, 2011, 2012, 2015, 2350, 2351, 2369, 2370, 2373, 3135, 3136, 3165, 3166, 3169, 4464, 4465, 4496, 4497, 4500, 5200, 5201, 5230, 5231, 5234, 6082, 6083, 6102, 6103, 6106, 7195 ] }
{ "red_pajama_v2": { "ccnet_original_length": 7195, "ccnet_original_nlines": 40, "rps_doc_curly_bracket": 0.004308550152927637, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.0476190485060215, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.010660979896783829, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.5920398235321045, "rps_doc_frac_unique_words": 0.6603325605392456, "rps_doc_mean_word_length": 14.299287796020508, "rps_doc_num_sentences": 95, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.376560211181641, "rps_doc_word_count": 421, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.040697671473026276, "rps_doc_frac_chars_dupe_6grams": 0.040697671473026276, "rps_doc_frac_chars_dupe_7grams": 0.040697671473026276, "rps_doc_frac_chars_dupe_8grams": 0.03139534965157509, "rps_doc_frac_chars_dupe_9grams": 0.03139534965157509, "rps_doc_frac_chars_top_2gram": 0.002657809993252158, "rps_doc_frac_chars_top_3gram": 0.009966780431568623, "rps_doc_frac_chars_top_4gram": 0.016445180401206017, "rps_doc_books_importance": -588.9676513671875, "rps_doc_books_importance_length_correction": -588.9676513671875, "rps_doc_openwebtext_importance": -351.24603271484375, "rps_doc_openwebtext_importance_length_correction": -351.24603271484375, "rps_doc_wikipedia_importance": -217.0390625, "rps_doc_wikipedia_importance_length_correction": -217.0390625 }, "fasttext": { "dclm": 0.909433901309967, "english": 0.02034791000187397, "fineweb_edu_approx": 1.785551905632019, "eai_general_math": 0.0721471905708313, "eai_open_web_math": 0.009707090444862843, "eai_web_code": 0.7550343871116638 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.13322", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
-3,446,453,029,290,799,600
Slant Height calculator Created by Vishnuvardhan Shakthibala Reviewed by Anna Szczepanek, PhD and Jack Bowater Last updated: May 17, 2022 Do you want to calculate the slant height of a right circular cone or a right-angled pyramid? If you said "Yes," then our slant height calculator is the right match. Please read the article below to learn about: • What is a slant height? • How to calculate slant height for a right circular cone and a right-angled pyramid? • How to use our calculator effectively. What is slant height? Slant height is the side of a right angle triangle opposite to the right angle. It is also known as the hypotenuse. For right-angled pyramids, the slant height is the shortest distance measured from the apex to the boundary points located at the base. Particularly, the slant height connects the midpoint of the base to the pyramid's apex. Some examples of slant height are shown in the figures below. The figure shows the right circular cone. Right circular cone The figure shows the right square pyramid. Right square pyramid. To learn more about the right square pyramid, check out our right square pyramid calculator. ⚠️ For a right polygon based pyramid with height hh and base width 2b2b, slant height is not equivalent to the lateral edge. In terms of equations, we have: • Slant height: l=h2+b2l=h^2+b^2, • Lateral edge d=h2+2b2d=h^2+2b^2. As you can see, the lateral edge is greater than the slant height. How to calculate the slant height? Now, let us try to understand how to calculate slant height for different geometric shapes. You can use the following steps to calculate the slant height for different shapes: 1. Find the height hh and base length bb of the shape for which you want to calculate the slant height ll. 2. Use the Pythagorean theorem to find the slant height: l=h2+b2\footnotesize \qquad l=\sqrt{h^2+b^2} • You can apply this procedure to different geometric shapes: • Right circular cone - You need height hh and base radius rr to compute the slant height; and • Right angle pyramid - You need height hh and base length bb to compute the slant height. The only restriction you need to keep in mind is that the opposite sides of the slant height need to be at 9090 degrees to each other (at right angles). Cool! Now you know how to calculate the slant height! If you are curious to learn different ways to calculate the slant height of a cone, please check out our slant height of a cone calculator. Angle of elevation and depression Let us consider a hypothetical situation: two persons (P and Q) are in the park. Person PP has climbed up the tree, and Person QQ is on the ground at a distance of bb from the tree. You can find schematics of this problem in the figure below. The figure shows a person Q who is on the tree and another person P who is on the ground and looking at the person Q. Example for angle of elevation and depression. Now the stage is set to solve several problems which involve slant height and other new parameters (you will see them soon 😉) First problem - We want to calculate how high hh Person P is in the tree. To do that, we need to know: • The distance between the Person P and the tree bb; • The angle from the horizontal θ\theta Person P is looking at the person Q; and • The distance tt between Person P's eye-level and the ground. 1. By using simple trigonometry, we can find out the height (ht)(h-t) between Person Q and Person P's eye level: (ht)=btanθ\qquad \footnotesize (h-t) = b\tan{\theta} 1. Rearranging the above equation, we can obtain the height Person Q is above the ground: h=btanθ+t\qquad \footnotesize h= b\tan{\theta}+t Angle θ\theta is called the elevation angle. You notice that Person Q looks down at Person P at the angle ϕ\phi from the horizontal, known as the angle of depression. To know about the angle of depression, please check out our angle of depression calculator. In the figure above, the angle of elevation and angle of depression are equal, but this is not always the case. Second problem - We want to determine the distance between Persons P and Q. You can see from the above figure that we have a right-angle triangle. Therefore, this problem involves slant height ll. As a result, this problem is essentially a slant height (distance between P and Q) calculation problem. 1. Find at least two out of the following three parameters: (ht)(h-t), bb, and θ\theta. 2. Depending on what is given, you can calculate slant height ll, or the distance between P and Q, in 3 different cases using the following equations: • Given height (ht)(h-t) and angle of elevation θ\theta: l=(ht)/sinθl= {(h-t)}/{\sin{\theta}} • Given base bb and angle of elevation θ\theta: l=b/cosθl= {b}/{\cos{\theta}} • Given height (ht)(h-t) and base bb: make use of Pythagoras theorem to obtain slant height: l=(ht)2+b2l=\sqrt{(h-t)^2+b^2}. How to use our slant height calculator? To use our calculator effectively, please follow the steps below: 1. Choose the type of shape you want to find the slant height of using the Choose the shape option. 2. Insert the base bb or base radius rr and height hh into the respective fields. 3. Our calculator will give you the slant height ll right away. FAQ How do you calculate the slant height of a right circular cone? To calculate the slant height of a right circular cone, follow the steps below: 1. Obtain the radius of the circular base r and the height h of the cone. 2. Square both values and add them together. 3. Find the square root of the resulting value. 4. That's your slant height. What is angle of elevation? Angle of elevation, or elevation angle, is defined as the angle between the line connecting the observer and the observed object and the horizontal. What is the elevation angle from point (1,5) to the point (5,8)? The elevation angle is 36.86 degrees. Use the following steps to calculate this: 1. Find the distance l between the points (1,5) and (5,8) using Pythagoras: l=√((x₂-x₁)²+(y₂-y₁)²)=√((5-1)²+(8-5)²)=5. This is our slant height. 2. Construct a right angle triangle by keeping slant height as its hypotenuse. 3. Calculate height: h=(y₂-y₁)=3. 4. Take arcsin of the ratio of height h=3 and hypotenuse l=5 to obtain the angle of elevation as 36.86 degrees. How do you find a triangle's height with its slant height and base? To calculate the height of a triangle given its slant height and base, follow the instructions below: 1. Make sure the triangle is a right angle triangle - the height and the base are perpendicular to each other. 2. Use Pythagoras theorem to calculate the height: height=√((slant height)²-(base)²). Vishnuvardhan Shakthibala Shape type Right circular cone Image of a right circular cone Base radius (r) ft Height (h) ft Slant height (l) ft Check out 20 similar 3d geometry calculators 📦 Area of a hemisphereCubeCube Calc: find v, a, d… 17 more People also viewed… Helium balloons Wondering how many helium balloons it would take to lift you up in the air? Try this helium balloons calculator! 🎈 LCD - Least Common Denominator With this LCD calculator you can find the lowest common denominator of up to five fractions. Latus rectum Find the length of the latus rectum of a parabola, hyperbola, or ellipse with our latus rectum calculator. Social Media Time Alternatives Check what you could have accomplished if you get out of your social media bubble. Omni Calculator Copyright by Omni Calculator sp. z o.o. Privacy policy & cookies main background
{ "url": "https://www.omnicalculator.com/math/slant-height", "source_domain": "www.omnicalculator.com", "snapshot_id": "crawl=CC-MAIN-2022-27", "warc_metadata": { "Content-Length": "574001", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:GXFFLZ47RWPT55655ZASAMJZCFW6ROUO", "WARC-Concurrent-To": "<urn:uuid:35b58e64-ec57-40f9-a48a-24e419966b64>", "WARC-Date": "2022-07-06T20:25:39Z", "WARC-IP-Address": "68.70.205.4", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:EXBS4PF4KX2CJXPAWPKE5IW3KOHWBZLB", "WARC-Record-ID": "<urn:uuid:80a2e289-ec68-439b-a8b0-153d69306726>", "WARC-Target-URI": "https://www.omnicalculator.com/math/slant-height", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:ecd8394b-ca25-4141-a503-da07bdddb62c>" }, "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-34\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 24, 25, 62, 112, 139, 140, 306, 307, 353, 354, 382, 470, 513, 514, 536, 537, 653, 654, 878, 879, 941, 942, 984, 1004, 1047, 1069, 1070, 1163, 1164, 1321, 1322, 1358, 1395, 1396, 1463, 1464, 1499, 1500, 1676, 1677, 1786, 1845, 1890, 1954, 2053, 2148, 2149, 2302, 2303, 2497, 2498, 2532, 2533, 2776, 2777, 2895, 2942, 2943, 3069, 3070, 3173, 3174, 3229, 3312, 3377, 3492, 3545, 3637, 3686, 3687, 4058, 4059, 4360, 4361, 4451, 4604, 4702, 4784, 4913, 4914, 4954, 4955, 5021, 5022, 5124, 5208, 5274, 5275, 5279, 5280, 5344, 5345, 5425, 5426, 5502, 5549, 5599, 5630, 5631, 5659, 5660, 5809, 5810, 5875, 5876, 5957, 5958, 6105, 6186, 6222, 6336, 6337, 6405, 6406, 6508, 6509, 6622, 6710, 6736, 6747, 6767, 6798, 6814, 6817, 6828, 6831, 6848, 6851, 6898, 6955, 6975, 6976, 6992, 6993, 7108, 7109, 7140, 7141, 7234, 7235, 7248, 7249, 7356, 7357, 7388, 7389, 7472, 7488, 7528, 7553 ], "line_end_idx": [ 24, 25, 62, 112, 139, 140, 306, 307, 353, 354, 382, 470, 513, 514, 536, 537, 653, 654, 878, 879, 941, 942, 984, 1004, 1047, 1069, 1070, 1163, 1164, 1321, 1322, 1358, 1395, 1396, 1463, 1464, 1499, 1500, 1676, 1677, 1786, 1845, 1890, 1954, 2053, 2148, 2149, 2302, 2303, 2497, 2498, 2532, 2533, 2776, 2777, 2895, 2942, 2943, 3069, 3070, 3173, 3174, 3229, 3312, 3377, 3492, 3545, 3637, 3686, 3687, 4058, 4059, 4360, 4361, 4451, 4604, 4702, 4784, 4913, 4914, 4954, 4955, 5021, 5022, 5124, 5208, 5274, 5275, 5279, 5280, 5344, 5345, 5425, 5426, 5502, 5549, 5599, 5630, 5631, 5659, 5660, 5809, 5810, 5875, 5876, 5957, 5958, 6105, 6186, 6222, 6336, 6337, 6405, 6406, 6508, 6509, 6622, 6710, 6736, 6747, 6767, 6798, 6814, 6817, 6828, 6831, 6848, 6851, 6898, 6955, 6975, 6976, 6992, 6993, 7108, 7109, 7140, 7141, 7234, 7235, 7248, 7249, 7356, 7357, 7388, 7389, 7472, 7488, 7528, 7553, 7568 ] }
{ "red_pajama_v2": { "ccnet_original_length": 7568, "ccnet_original_nlines": 150, "rps_doc_curly_bracket": 0.00264270999468863, "rps_doc_ldnoobw_words": 3, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.35604265332221985, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.015402840450406075, "rps_doc_frac_lines_end_with_ellipsis": 0.006622519809752703, "rps_doc_frac_no_alph_words": 0.23222748935222626, "rps_doc_frac_unique_words": 0.2715179920196533, "rps_doc_mean_word_length": 4.541471004486084, "rps_doc_num_sentences": 94, "rps_doc_symbol_to_word_ratio": 0.0011848299764096737, "rps_doc_unigram_entropy": 4.939334392547607, "rps_doc_word_count": 1278, "rps_doc_frac_chars_dupe_10grams": 0.01550654973834753, "rps_doc_frac_chars_dupe_5grams": 0.17160579562187195, "rps_doc_frac_chars_dupe_6grams": 0.07736043632030487, "rps_doc_frac_chars_dupe_7grams": 0.03445899114012718, "rps_doc_frac_chars_dupe_8grams": 0.022915229201316833, "rps_doc_frac_chars_dupe_9grams": 0.022915229201316833, "rps_doc_frac_chars_top_2gram": 0.0758097916841507, "rps_doc_frac_chars_top_3gram": 0.04100620001554489, "rps_doc_frac_chars_top_4gram": 0.03170226886868477, "rps_doc_books_importance": -912.1781616210938, "rps_doc_books_importance_length_correction": -912.1781616210938, "rps_doc_openwebtext_importance": -507.3354187011719, "rps_doc_openwebtext_importance_length_correction": -507.3354187011719, "rps_doc_wikipedia_importance": -343.7928161621094, "rps_doc_wikipedia_importance_length_correction": -343.7928161621094 }, "fasttext": { "dclm": 0.9138241410255432, "english": 0.8696011900901794, "fineweb_edu_approx": 3.2259511947631836, "eai_general_math": 0.9954560995101929, "eai_open_web_math": 0.6587897539138794, "eai_web_code": 0.05809986963868141 } }
{ "free_decimal_correspondence": { "primary": { "code": "516.22", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Geometry, Algebraic" } }, "secondary": { "code": "516.2", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Geometry, Algebraic" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "1", "label": "General Audience" } } }
ece34605c058195ed03b4d393ef1a36c
808,175,152,197,713,700
Как удалить знак доллара в R (с примерами) Вы можете легко удалить знаки доллара и запятые из столбцов фрейма данных в R, используя функцию gsub().В этом руководстве показаны три примера использования этой функции на практике. Удалить знаки доллара в R В следующем коде показано, как удалить знаки доллара из определенного столбца во фрейме данных в R: #create data frame df1 <- data.frame(ID=1:5, sales=c('$14.45', '$13.39', '$17.89', '$18.99', '$20.88'), stringsAsFactors= FALSE ) df1 ID sales 1 1 $14.45 2 2 $13.39 3 3 $17.89 4 4 $18.99 5 5 $20.88 #remove dollar signs from *sales* column df1$sales = as.numeric ( gsub ("\\$", "", df1$sales)) df1 ID sales 1 1 14.45 2 2 13.39 3 3 17.89 4 4 18.99 5 5 20.88 Удалить знаки доллара и запятые в R В следующем коде показано, как удалить знаки доллара и столбцы из определенного столбца во фрейме данных в R: #create data frame df2 <- data.frame(ID=1:3, sales=c('$14,000', '$13,300', '$17,890'), stringsAsFactors= FALSE ) df2 ID sales 1 1 $14,000 2 2 $13,300 3 3 $17,890 #remove dollar signs and commas from *sales* column df2$sales = as.numeric ( gsub ("[\\$,]", "", df2$sales)) df2 ID sales 1 1 14000 2 2 13300 3 3 17890 Обратите внимание, что теперь вы можете выполнять вычисления в столбце продаж, так как знаки доллара и запятые удалены. Например, теперь мы можем вычислить сумму столбца продаж: #calculate sum of sales sum(df2$sales) [1] 45190 Дополнительные ресурсы Как выполнить ВПР (аналогично Excel) в R Как извлечь год из даты в R Как добавить строки во фрейм данных в R Замечательно! Вы успешно подписались. Добро пожаловать обратно! Вы успешно вошли Вы успешно подписались на кодкамп. Срок действия вашей ссылки истек. Ура! Проверьте свою электронную почту на наличие волшебной ссылки для входа. Успех! Ваша платежная информация обновлена. Ваша платежная информация не была обновлена.
{ "url": "https://www.codecamp.ru/blog/remove-dollar-sign-in-r/", "source_domain": "www.codecamp.ru", "snapshot_id": "crawl=CC-MAIN-2022-40", "warc_metadata": { "Content-Length": "36260", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:FLUW6T2DNHMH7YYYBJ33NW5HODRMPMPW", "WARC-Concurrent-To": "<urn:uuid:6b286c39-dba3-4af5-90eb-6e1810cecda0>", "WARC-Date": "2022-10-06T17:08:05Z", "WARC-IP-Address": "146.75.35.7", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:QP5SYKURAAEGZJVUMHU6W6EKU53PPTVF", "WARC-Record-ID": "<urn:uuid:7e36776f-167e-4be0-93aa-82dc6be68671>", "WARC-Target-URI": "https://www.codecamp.ru/blog/remove-dollar-sign-in-r/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:1963a737-dd1f-43f3-94e0-59d05699e4ce>" }, "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-230\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, 43, 44, 45, 229, 230, 256, 257, 357, 358, 378, 404, 464, 491, 495, 496, 506, 517, 528, 539, 550, 561, 562, 603, 657, 658, 662, 663, 673, 683, 693, 703, 713, 723, 724, 760, 761, 871, 872, 892, 918, 961, 988, 992, 993, 1003, 1015, 1027, 1039, 1040, 1092, 1149, 1150, 1154, 1155, 1165, 1175, 1185, 1195, 1196, 1316, 1317, 1375, 1376, 1400, 1415, 1416, 1426, 1427, 1450, 1451, 1492, 1520, 1560, 1561, 1599, 1642, 1677, 1711, 1788, 1832 ], "line_end_idx": [ 43, 44, 45, 229, 230, 256, 257, 357, 358, 378, 404, 464, 491, 495, 496, 506, 517, 528, 539, 550, 561, 562, 603, 657, 658, 662, 663, 673, 683, 693, 703, 713, 723, 724, 760, 761, 871, 872, 892, 918, 961, 988, 992, 993, 1003, 1015, 1027, 1039, 1040, 1092, 1149, 1150, 1154, 1155, 1165, 1175, 1185, 1195, 1196, 1316, 1317, 1375, 1376, 1400, 1415, 1416, 1426, 1427, 1450, 1451, 1492, 1520, 1560, 1561, 1599, 1642, 1677, 1711, 1788, 1832, 1876 ] }
{ "red_pajama_v2": { "ccnet_original_length": 1876, "ccnet_original_nlines": 80, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.017977530136704445, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04719100892543793, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.8202247023582458, "rps_doc_frac_unique_words": 0.48239436745643616, "rps_doc_mean_word_length": 4.901408672332764, "rps_doc_num_sentences": 32, "rps_doc_symbol_to_word_ratio": 0.011235959827899933, "rps_doc_unigram_entropy": 4.62517786026001, "rps_doc_word_count": 284, "rps_doc_frac_chars_dupe_10grams": 0.24568966031074524, "rps_doc_frac_chars_dupe_5grams": 0.2844827473163605, "rps_doc_frac_chars_dupe_6grams": 0.24568966031074524, "rps_doc_frac_chars_dupe_7grams": 0.24568966031074524, "rps_doc_frac_chars_dupe_8grams": 0.24568966031074524, "rps_doc_frac_chars_dupe_9grams": 0.24568966031074524, "rps_doc_frac_chars_top_2gram": 0.012931030243635178, "rps_doc_frac_chars_top_3gram": 0.06824713200330734, "rps_doc_frac_chars_top_4gram": 0.0258620698004961, "rps_doc_books_importance": -198.94635009765625, "rps_doc_books_importance_length_correction": -198.9380340576172, "rps_doc_openwebtext_importance": -139.66615295410156, "rps_doc_openwebtext_importance_length_correction": -139.66615295410156, "rps_doc_wikipedia_importance": -86.31644439697266, "rps_doc_wikipedia_importance_length_correction": -86.31643676757812 }, "fasttext": { "dclm": 0.17999643087387085, "english": 0.0003829099878203124, "fineweb_edu_approx": 0.8085789680480957, "eai_general_math": 0.00009179000335279852, "eai_open_web_math": 0.20868271589279175, "eai_web_code": 0.498717725276947 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "519.5", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Probabilities; or, Mathematical statistics" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
-8,107,685,015,164,533,000
Skip to content This repository has been archived by the owner. It is now read-only. master Go to file Code Latest commit   Git stats Files Permalink Failed to load latest commit information. Type Name Latest commit message Commit time                         README.md airsprint-sinatra A lightweight Airbrake to Sprint.ly WebHook bridge implemented with Sinatra. About airsprint-sinatra publishes exceptions received by Airbrake to Sprint.ly. When Airbrake receives exceptions from your application, the WebHook defined on Airbrake is triggered and calls airsprint, which then creates a defect on Sprint.ly using the Sprint.ly REST API. Airbrake is an exception detection and reporting service that can be used with many languages and platforms. I personally use it with Rails by using their airbrake gem. Sprint.ly is an agile sprint tracking feature planning tool that also offers the ability to track tests and defects (bugs). It is a relatively new but popular alternative to Pivotal Tracker with the advantages of a clean, attractive interface and a simpler workflow. Project Status Functional initial hack release, but could use improvement. This lightweight application is functional and will receive error notifications from Airbrake for multiple applications (you will create a separate WebHook for each application). Additionally, airsprint is relatively secure because it supports a password that must be defined in the app config so it can not be called by arbitrary unauthorized users (still need https support to make this more secure). Consider this application a base for your own Airbrake to Sprint.ly (or other target endpoints). I do intend to improve this over time, as well as integrate user contributions. Installation 1. Check out the repository. git clone https://github.com/kevinelliott/airsprint-sinatra.git 2. Change into the cloned directory. cd airsprint-sinatra 3. Copy the sample.config.yml to config.yml. cp sample.config.yml config.yml 4. Edit the new config.yml. Set a password for the Airbrake WebHooks, as well as your Sprint.ly credentials. Deployment on Heroku 1. Set the Heroku production environment variables heroku config:set AIRSPRINT_PASSWORD=1234567890 heroku config:set [email protected] heroku config:set SPRINTLY_API_KEY=ABCDEFGHIJKLMNOPQRSTUVWXYZ heroku config:set SPRINTLY_DEFAULT_PRODUCT_ID=12345 Sprint.ly product_id's can be passed in each Airbrake WebHook, but it will fall back to the SPRINTLY_DEFAULT_PRODUCT_ID if none is provided. 2. Create the heroku app to correspond with my_app (whatever your app name is). This name can be anything you want. heroku create my-app-airsprint 3. Deploy airsprint to heroku. git push heroku master Setup Airbrake 1. On your project page on Airbrake, click on the Add Integration button. 2. Choose Webhook. 3. Enter the URL to your airsprint installation along with the correct integration endpoint, specifying the password you set above for AIRSPRINT_PASSWORD as an argument on the URL. http://my-app-airsprint.herokuapp.com/integrations/airbrake?password=1234567890 Optionally, you may specify the Sprint.ly project_id that this particular Airbrake project corresponds with. This allows you to have multiple Airbrake projects create defects on multiple Sprint.ly projects that your email/api_key has access to. http://my-app-airsprint.herokuapp.com/integrations/airbrake?password=1234567890&project_id=12345 That's It! Now anytime your Airbrake project receives exceptions from your actual application, you will receive requests to airsprint, which will then forward to Sprint.ly and create a defect. Future Plans Whenever I can muscle up the free time, I intend to expand this to support other destination endpoints that Airbrake doesn't support, and perhaps even some inbound services besides Airbrake (such as Sentry, etc). More importantly, I'd like to make the Sprint.ly item creation more configurable, perhaps via templating. Maintainer Contributors As contributions come in via pull requests, I will update this list to credit the kind souls who help out. License (The MIT License) Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the ‘Software’), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED ‘AS IS’, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. About A lightweight Airbrake to Sprint.ly WebHook bridge implemented with Sinatra Resources Releases No releases published Packages No packages published Languages You can’t perform that action at this time.
{ "url": "https://github.com/kevinelliott/airsprint-sinatra", "source_domain": "github.com", "snapshot_id": "crawl=CC-MAIN-2020-45", "warc_metadata": { "Content-Length": "129448", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:75WEFMPMDH6LQKMRARETHF4VBUKPALNF", "WARC-Concurrent-To": "<urn:uuid:d2f6566f-8a67-41a2-84b0-ae883933e00d>", "WARC-Date": "2020-10-20T15:32:38Z", "WARC-IP-Address": "140.82.112.4", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:UODL7S4QEBV3OITE5S4L6LO3QPMGH422", "WARC-Record-ID": "<urn:uuid:8f50f74f-0b9b-4db5-9114-9e0ff1c4fb2a>", "WARC-Target-URI": "https://github.com/kevinelliott/airsprint-sinatra", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:d6179060-4f04-4fca-82b6-1e08e4b3d08f>" }, "warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-128.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, 16, 85, 92, 103, 108, 109, 123, 124, 126, 127, 137, 138, 144, 145, 155, 197, 202, 207, 229, 241, 243, 245, 247, 249, 251, 253, 255, 257, 259, 261, 263, 265, 266, 276, 277, 295, 296, 373, 374, 380, 381, 649, 650, 819, 820, 1087, 1088, 1103, 1104, 1164, 1165, 1568, 1569, 1746, 1747, 1760, 1761, 1792, 1793, 1861, 1862, 1901, 1902, 1927, 1928, 1975, 1976, 2012, 2013, 2124, 2125, 2146, 2147, 2200, 2201, 2253, 2307, 2373, 2429, 2434, 2435, 2580, 2581, 2699, 2700, 2735, 2736, 2769, 2770, 2797, 2798, 2813, 2814, 2890, 2891, 2912, 2913, 3096, 3097, 3181, 3182, 3431, 3432, 3533, 3534, 3545, 3546, 3728, 3729, 3742, 3743, 3956, 3957, 4063, 4064, 4075, 4076, 4089, 4090, 4197, 4198, 4206, 4207, 4225, 4226, 4659, 4660, 4787, 4788, 5249, 5250, 5256, 5257, 5333, 5334, 5344, 5345, 5354, 5355, 5377, 5378, 5387, 5388, 5410, 5411, 5421, 5422 ], "line_end_idx": [ 16, 85, 92, 103, 108, 109, 123, 124, 126, 127, 137, 138, 144, 145, 155, 197, 202, 207, 229, 241, 243, 245, 247, 249, 251, 253, 255, 257, 259, 261, 263, 265, 266, 276, 277, 295, 296, 373, 374, 380, 381, 649, 650, 819, 820, 1087, 1088, 1103, 1104, 1164, 1165, 1568, 1569, 1746, 1747, 1760, 1761, 1792, 1793, 1861, 1862, 1901, 1902, 1927, 1928, 1975, 1976, 2012, 2013, 2124, 2125, 2146, 2147, 2200, 2201, 2253, 2307, 2373, 2429, 2434, 2435, 2580, 2581, 2699, 2700, 2735, 2736, 2769, 2770, 2797, 2798, 2813, 2814, 2890, 2891, 2912, 2913, 3096, 3097, 3181, 3182, 3431, 3432, 3533, 3534, 3545, 3546, 3728, 3729, 3742, 3743, 3956, 3957, 4063, 4064, 4075, 4076, 4089, 4090, 4197, 4198, 4206, 4207, 4225, 4226, 4659, 4660, 4787, 4788, 5249, 5250, 5256, 5257, 5333, 5334, 5344, 5345, 5354, 5355, 5377, 5378, 5387, 5388, 5410, 5411, 5421, 5422, 5465 ] }
{ "red_pajama_v2": { "ccnet_original_length": 5465, "ccnet_original_nlines": 147, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.296999990940094, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.09700000286102295, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.1860000044107437, "rps_doc_frac_unique_words": 0.4743083119392395, "rps_doc_mean_word_length": 5.725955009460449, "rps_doc_num_sentences": 78, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.366682529449463, "rps_doc_word_count": 759, "rps_doc_frac_chars_dupe_10grams": 0.029912559315562248, "rps_doc_frac_chars_dupe_5grams": 0.029912559315562248, "rps_doc_frac_chars_dupe_6grams": 0.029912559315562248, "rps_doc_frac_chars_dupe_7grams": 0.029912559315562248, "rps_doc_frac_chars_dupe_8grams": 0.029912559315562248, "rps_doc_frac_chars_dupe_9grams": 0.029912559315562248, "rps_doc_frac_chars_top_2gram": 0.01771743968129158, "rps_doc_frac_chars_top_3gram": 0.016566960141062737, "rps_doc_frac_chars_top_4gram": 0.010124250315129757, "rps_doc_books_importance": -528.891845703125, "rps_doc_books_importance_length_correction": -528.891845703125, "rps_doc_openwebtext_importance": -258.4758605957031, "rps_doc_openwebtext_importance_length_correction": -258.4758605957031, "rps_doc_wikipedia_importance": -270.0709533691406, "rps_doc_wikipedia_importance_length_correction": -270.0709533691406 }, "fasttext": { "dclm": 0.023429809138178825, "english": 0.8249019384384155, "fineweb_edu_approx": 1.028717041015625, "eai_general_math": 0.04151898995041847, "eai_open_web_math": 0.10265470296144485, "eai_web_code": 0.1910681128501892 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.452", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
2,332,763,804,020,510,000
четверг, 2 июля 2015 г. Установка MariaDB + Nginx + PHP-FPM на CentOS 7 (Часть 2) Продолжение статьи об установке MariaDB + Nginx + PHP-FPM на сервер под управлением CentOS 7. Предыдущая часть: Часть 1. В принципе, все то, что было описано в предыдущей статье - это саморазумеющиеся настройки системы, которые можно было бы пропустить. Каждый сам для себя уже установил все необходимое для работы системы (и в системе). Однако, на сколько бы ты хорошо не знал эти опции, при установке нового сервера, начинаешь лазить по всем конфигами и искать то, что ты сам уже давным давно сделал. Думаю, что такой "узелок на память" никогда не помешает. Собственно, с подобными настройками можно ставить точку и переходить уже к "тяжелой артиллерии", а точнее к сути дела. Содержание: 1. Проверка текущей версии CentOS 2. Установка FTP сервера (vsFTPd) 3. Создание пользователя с правами root 4. Настройка строки приглашения 5. Установка MariaDB (MySQL) 6. Настройка MariaDB 7. Установка PHP 8. Настройка PHP-FPM 9. Установка NGINX 10. Ключ на старт... 11. Послесловие 5. Установка MariaDB (MySQL). MariaDB является полноценным fork-ом MySQL, но только таким, каким его хотел видеть сам разработчик MySQL. Подробности я опущу, кому интересно могут перейти по ссылке [1] и найти всю нужную информацию, а так же сходства и различия между MariaDB и MySQL[2] [3]. В данном контексте я всего лишь ограничусь тем, что вместо всем известного MySQL, я буду ставить MariaDB. Так же, все рекомендации по установке вы сможете прочитать по ссылке [4]. Однако, чтобы вас не загружать поиском нужной информации, можете следовать моего мануала (если его можно так назвать). Первым делом, чтобы установить сервер БД из репозитария yum, нужно создать конфигурацию, чтобы система знала что и откуда брать для установки и обновления данного сервера базы данных. Создаем файл и открываем его на редактирование. [00:59 ebabenko@centos7 ~]$ cd /etc/yum.repos.d [01:00 ebabenko@centos7 /etc/yum.repos.d]$ ll total 24 -rw-r--r--. 1 root root 1664 Apr 1 01:27 CentOS-Base.repo -rw-r--r--. 1 root root 1309 Apr 1 01:27 CentOS-CR.repo -rw-r--r--. 1 root root 649 Apr 1 01:27 CentOS-Debuginfo.repo -rw-r--r--. 1 root root 290 Apr 1 01:27 CentOS-fasttrack.repo -rw-r--r--. 1 root root 1331 Apr 1 01:27 CentOS-Sources.repo -rw-r--r--. 1 root root 1002 Apr 1 01:27 CentOS-Vault.repo [01:00 ebabenko@centos7 /etc/yum.repos.d]$ sudo touch MariaDB.repo [sudo] password for ebabenko: [01:00 ebabenko@centos7 /etc/yum.repos.d]$ ll total 24 -rw-r--r--. 1 root root 1664 Apr 1 01:27 CentOS-Base.repo -rw-r--r--. 1 root root 1309 Apr 1 01:27 CentOS-CR.repo -rw-r--r--. 1 root root 649 Apr 1 01:27 CentOS-Debuginfo.repo -rw-r--r--. 1 root root 290 Apr 1 01:27 CentOS-fasttrack.repo -rw-r--r--. 1 root root 1331 Apr 1 01:27 CentOS-Sources.repo -rw-r--r--. 1 root root 1002 Apr 1 01:27 CentOS-Vault.repo -rw-r--r--. 1 root root 0 Jul 1 01:00 MariaDB.repo [01:00 ebabenko@centos7 /etc/yum.repos.d]$ sudo vi MariaDB.repo Прописываем в нем следующие данные с учетом того, что на момент установки последняя версия была 10.1.5 и версия операционной системы 64-битная. Для того, чтобы репозиторий поддерживал обновления MariaDB, нужно указать только мажорную и минорную части версии (то есть 10.1). [mariadb] name=MariaDB baseurl=http://yum.mariadb.org/10.1/centos7-amd64 gpgkey=https://yum.mariadb.org/RPM-GPG-KEY-MariaDB gpgcheck=1 Запускаем установку [01:12 ebabenko@centos7 /etc/yum.repos.d]$ sudo yum install MariaDB-server MariaDB-client [...skipped...] Install 2 Packages (+37 Dependent packages) Total download size: 144 M Is this ok [y/d/N]: y [...skipped...] Retrieving key from https://yum.mariadb.org/RPM-GPG-KEY-MariaDB Importing GPG key 0x1BB943DB: Userid : "MariaDB Package Signing Key <[email protected]>" Fingerprint: 1993 69e5 404b d5fc 7d2f e43b cbcb 082a 1bb9 43db From : https://yum.mariadb.org/RPM-GPG-KEY-MariaDB Is this ok [y/N]: y [...skipped...] Replaced: mariadb-libs.x86_64 1:5.5.41-2.el7_0 Complete! Я не зря обратил ваше внимание на последние строки установки (обычно у меня они завершаются через skipped...comleted). Суть заключается в том, что даже если у вас была установлена какая-то версия MySQL или предыдущая версия MariaDB, она будет деинсталирована и заменена новой версией MariaDB. В данном случае была уже предуставновлена MariaDB версии 5.5.41. Не знаю как кому, а мне данный момент очень понравился. Нет излишнего выноса мозга "А все ли было удалено перед установкой? А не будет ли каких либо конфликтов при установке?". Инсталятор сам разобрался со всеми конфликтующими версиями и произвел все нужные для нормальной работы действия. 6. Настройка MariaDB. Итак, сервер установлен. Посмотрим, что же есть внутри конфигурации сервера [01:21 ebabenko@centos7 /etc/yum.repos.d]$ cd /etc [01:21 ebabenko@centos7 /etc]$ cat my.cnf # # This group is read both both by the client and the server # use it for options that affect everything # [client-server] # # include all files from the config directory # !includedir /etc/my.cnf.d Увы и ах, ничего толкового. Просто пустышка, но с маленьким отклонением: конфиг обращается к другим конфигурационным файлам, которые распределены по своим задачам, что дает ещё больше плюсов в сторону MariaDB. По правде говоря, такой конфиг мне даже больше нравится: нет никаких излишеств, все требуемые настройки администратор может установить сам. "Тонкую настройку" я сейчас производить не буду, да и вообще никогда не занимался тонкой настройкой нового сервера БД, если конечно это небыло связано с расширением предыдущего рабочего сервера. Причина проста: для того чтобы нормально настроить сервер, ему нужно некоторое время поработать и собрать данные, и по ним уже ориентироваться какие настройки стоит добавить или исправить. Поэтому, сейчас я этот момент упускаю, остановлюсь только на установке работы сервера с кодировкой по умолчанию UTF-8. Добавляем строчку в mysql-clients.cnf [01:23 ebabenko@centos7 /etc]$ sudo vi my.cnf.d/mysql-clients.cnf [...skipped...] [mysql] default-character-set=utf8 [...skipped...] А так же добавляем подобный параметр в файле server.cnf, только он будет выглядеть немного иначе [01:23 ebabenko@centos7 /etc]$ sudo vi my.cnf.d/server.cnf [...skipped...] # this is only for the mysqld standalone daemon [mysqld] character-set-server=utf8 [...skipped...] Запускаем сервер и проверяем, что же получилось в итоге. Если вы ещё не успели установить пароль для пользователя root, при входе на сервер он его у вас не должен запросить. [01:28 ebabenko@centos7 /etc]$ sudo systemctl start mysql [01:28 ebabenko@centos7 /etc]$ mysql -u root Welcome to the MariaDB monitor. Commands end with ; or \g. Your MariaDB connection id is 3 Server version: 10.1.5-MariaDB MariaDB Server Copyright (c) 2000, 2015, Oracle, MariaDB Corporation Ab and others. Type 'help;' or '\h' for help. Type '\c' to clear the current input statement. MariaDB [(none)]> use mysql; Reading table information for completion of table and column names You can turn off this feature to get a quicker startup with -A Database changed MariaDB [mysql]> show variables like "%character%"; show variables like "%collation%"; +--------------------------+----------------------------+ | Variable_name | Value | +--------------------------+----------------------------+ | character_set_client | utf8 | | character_set_connection | utf8 | | character_set_database | utf8 | | character_set_filesystem | binary | | character_set_results | utf8 | | character_set_server | utf8 | | character_set_system | utf8 | | character_sets_dir | /usr/share/mysql/charsets/ | +--------------------------+----------------------------+ 8 rows in set (0.00 sec) +----------------------+-----------------+ | Variable_name | Value | +----------------------+-----------------+ | collation_connection | utf8_general_ci | | collation_database | utf8_general_ci | | collation_server | utf8_general_ci | +----------------------+-----------------+ 3 rows in set (0.00 sec) MariaDB [mysql]> quit Bye То, что и требовалось получить в результате. Теперь "ужесточим" правила для авторизации на сервере. Нужно установить пароль для пользователя root сервера БД, а так же указать, что вход на сервер возможен только из локального хоста. Все эти настройки можно и произвести в ручную методом редактирования таблицы mysql.user. Однако, для этого существует скрипт, который выполняет все перечисленные настройки. [01:32 ebabenko@centos7 /etc]$ sudo mysql_secure_installation NOTE: RUNNING ALL PARTS OF THIS SCRIPT IS RECOMMENDED FOR ALL MariaDB SERVERS IN PRODUCTION USE! PLEASE READ EACH STEP CAREFULLY! In order to log into MariaDB to secure it, we'll need the current password for the root user. If you've just installed MariaDB, and you haven't set the root password yet, the password will be blank, so you should just press enter here. Enter current password for root (enter for none): Для внесения изменений, потребуется ввести текущий пароль root. Если уже установлен какой-то пароль, вводим его. Но так как у меня это новая установка, то пароль ещё никакой не установлен, просто нажимаем Enter. OK, successfully used password, moving on... Setting the root password ensures that nobody can log into the MariaDB root user without the proper authorisation. Set root password? [Y/n] y New password: Re-enter new password: Password updated successfully! Reloading privilege tables.. ... Success! Следующий этап скрипта попросит установить новый пароль для root. Если вам не требуется его менять, отвечаем "n" и данный этап скрипт пропустит. Однако, если пароль никакой не установлен, или вы его все таки желаете поменять, отвечаете "y". После чего на запрос New password: вводите новый пароль, в запросе Re-enter new password: повторяете его. После ввода повтора пароля, скрипт автоматически перегрузит привилегии. By default, a MariaDB installation has an anonymous user, allowing anyone to log into MariaDB without having to have a user account created for them. This is intended only for testing, and to make the installation go a bit smoother. You should remove them before moving into a production environment. Remove anonymous users? [Y/n] y ... Success! Следующий этап спросит, стоит ли удалять анонимных пользователей. Отвечаем "y" (не нужны нам анонимусы) Normally, root should only be allowed to connect from 'localhost'. This ensures that someone cannot guess at the root password from the network. Disallow root login remotely? [Y/n] y ... Success! Следующий шаг спросит, запретить ли удаленный доступ к серверу пользователем root. Если вы хотите получать доступ к серверу из-под пользователя root с удаленного компьютера, ответьте на этот вопрос "n" (разрешить удаленный доступ). Лично я всегда запрещаю подобные подключения, поэтому отвечаю на данный вопрос "y" (то есть запретить). Даже скажу больше, сколько пользовался сервером MySQL, а так же MariaDB, у меня ни разу не возникало необходимости использовать логин root как таковой, не то что удаленно, даже локально. Поэтому, крайне не рекомендую вам предоставлять удаленный доступ для root. By default, MariaDB comes with a database named 'test' that anyone can access. This is also intended only for testing, and should be removed before moving into a production environment. Remove test database and access to it? [Y/n] n ... skipping. Данный шаг спросит, нужно ли удалять таблицу test, которая ставится по умолчанию во время установки сервера баз данных. Я не вижу в этом особой необходимости даже на боевом сервере. Очень часто приходится делать какие-то эксперименты над таблицами. На боевой БД этого делать, понятное дело, нельзя, а каждый раз для экспериментов создавать новую БД, то же как-то не очень хорошо. Поэтому, я эту БД оставляю как раз для таких случаев. Отвечаем "n", если хотим оставить ее в покое, или "y", если хотим удалить ее. Reloading the privilege tables will ensure that all changes made so far will take effect immediately. Reload privilege tables now? [Y/n] y ... Success! После внесенных изменений, требуется перегрузить привилегии. Поэтому отвечаем на следующий запрос "y". Cleaning up... All done! If you've completed all of the above steps, your MariaDB installation should now be secure. Thanks for using MariaDB! Проверим введенные изменения. [01:38 ebabenko@centos7 /etc]$ mysql -u root ERROR 1045 (28000): Access denied for user 'root'@'localhost' (using password: NO) [01:38 ebabenko@centos7 /etc]$ mysql -u root -p Enter password: Welcome to the MariaDB monitor. Commands end with ; or \g. Your MariaDB connection id is 11 Server version: 10.0.11-MariaDB MariaDB Server Copyright (c) 2000, 2014, Oracle, SkySQL Ab and others. Type 'help;' or '\h' for help. Type '\c' to clear the current input statement. MariaDB [(none)]> use mysql; Reading table information for completion of table and column names You can turn off this feature to get a quicker startup with -A Database changed MariaDB [mysql]> select Host, User, Password from user; +-----------+------+-------------------------------------------+ | Host | User | Password | +-----------+------+-------------------------------------------+ | localhost | root | *81F5E21E35407D884A6CD4A731AEBFB6AF209E1B | | 127.0.0.1 | root | *81F5E21E35407D884A6CD4A731AEBFB6AF209E1B | | ::1 | root | *81F5E21E35407D884A6CD4A731AEBFB6AF209E1B | +-----------+------+-------------------------------------------+ 3 rows in set (0.00 sec) MariaDB [mysql]> show databases; +--------------------+ | Database | +--------------------+ | information_schema | | mysql | | performance_schema | | test | +--------------------+ 4 rows in set (0.00 sec) MariaDB [mysql]> quit Bye Как видим, при попытке подключиться root-ом без пароля, сервер отказал в авторизации, вход теперь возможен только с паролем. Так же, в таблице user, остался только пользователь root с возможностью подключения по локальному хосту, а в списке баз данных test осталась не тронутой. Сервер настроен, осталось только проверить, когда он будет запускаться. Есть небольшая недоработка со стороны MariaDB: [01:43 ebabenko@centos7 /etc]$ sudo systemctl enable mysql mysql.service is not a native service, redirecting to /sbin/chkconfig. Executing /sbin/chkconfig mysql on The unit files have no [Install] section. They are not meant to be enabled using systemctl. Possible reasons for having this kind of units are: 1) A unit may be statically enabled by being symlinked from another unit's .wants/ or .requires/ directory. 2) A unit's purpose may be to act as a helper for some other unit which has a requirement dependency on it. 3) A unit may be started when needed via activation (socket, path, timer, D-Bus, udev, scripted systemctl call, ...). Другими словами, mysql.service не является полноценным сервисом для systemctl, поэтому система рекомендует использовать старый добрый chkconfig вместо systemctl. Но при этом: [01:44 ebabenko@centos7 /etc]$ sudo chkconfig --list mysql Note: This output shows SysV services only and does not include native systemd services. SysV configuration data might be overridden by native systemd configuration. If you want to list systemd services use 'systemctl list-unit-files'. To see services enabled on particular target use 'systemctl list-dependencies [target]'. mysql 0:off 1:off 2:on 3:on 4:on 5:on 6:off Хоть система и ругнулась, на автозагрузку mysql был установлен. Думаю, что разработчики MariaDB доработают этот недочет. Но тем не менее, данный момент не столь критичен и вполне рабочеспособный. Продолжение статьи "Установка MariaDB + Nginx + PHP-FPM на CentOS 7 (Часть 3)". Источники: [1] https://mariadb.org/en/ (вернутсья к тексту) [2] https://mariadb.com/kb/en/mariadb/mariadb-vs-mysql-features/ (вернутсья к тексту) [3] https://mariadb.com/kb/en/mariadb/mariadb-vs-mysql-compatibility/ (вернутсья к тексту) [4] https://mariadb.com/kb/en/mariadb/yum/ (вернутсья к тексту) Комментариев нет : Отправить комментарий
{ "url": "http://patttern.blogspot.com/2015/07/mariadb-nginx-php-fpm-centos-7-page2.html", "source_domain": "patttern.blogspot.com", "snapshot_id": "crawl=CC-MAIN-2019-09", "warc_metadata": { "Content-Length": "97081", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:5OQMJTQ5KD2N3D7QA2ZBJUHNWEZGCMDR", "WARC-Concurrent-To": "<urn:uuid:eddebff6-9247-4450-bbce-a2e77c747e0c>", "WARC-Date": "2019-02-18T12:45:36Z", "WARC-IP-Address": "216.58.217.129", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:NA5ZBABMCJYIZ44PZZX2ZSLCRQ7QFWOE", "WARC-Record-ID": "<urn:uuid:eef1c5ad-60e7-4a11-af51-3cae3cdb9149>", "WARC-Target-URI": "http://patttern.blogspot.com/2015/07/mariadb-nginx-php-fpm-centos-7-page2.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:85309cf6-a691-417b-82c4-6e7f9d6f360b>" }, "warc_info": "isPartOf: CC-MAIN-2019-09\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-154-78-3.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 24, 25, 83, 84, 205, 206, 645, 646, 765, 766, 767, 779, 780, 816, 852, 894, 928, 959, 982, 1001, 1024, 1045, 1068, 1086, 1087, 1117, 1118, 1678, 1679, 1911, 1912, 1960, 2006, 2015, 2074, 2131, 2195, 2259, 2321, 2381, 2448, 2478, 2524, 2533, 2592, 2649, 2713, 2777, 2839, 2899, 2954, 3018, 3019, 3293, 3294, 3304, 3317, 3367, 3418, 3429, 3430, 3450, 3451, 3541, 3542, 3558, 3559, 3604, 3605, 3632, 3654, 3655, 3671, 3672, 3736, 3766, 3844, 3908, 3966, 3986, 3987, 4003, 4004, 4014, 4053, 4054, 4064, 4065, 4713, 4714, 4736, 4737, 4813, 4814, 4865, 4907, 4909, 4969, 5013, 5015, 5031, 5032, 5034, 5080, 5082, 5108, 5109, 5962, 5963, 6001, 6002, 6068, 6069, 6085, 6086, 6094, 6121, 6122, 6138, 6139, 6236, 6237, 6296, 6297, 6313, 6314, 6362, 6371, 6397, 6398, 6414, 6415, 6589, 6590, 6648, 6693, 6753, 6785, 6831, 6832, 6901, 6902, 6981, 6982, 7011, 7078, 7141, 7142, 7159, 7246, 7304, 7362, 7420, 7478, 7536, 7594, 7652, 7710, 7768, 7826, 7884, 7942, 7967, 7968, 8011, 8054, 8097, 8140, 8183, 8226, 8269, 8294, 8295, 8317, 8321, 8322, 8727, 8728, 8790, 8791, 8861, 8928, 8929, 8995, 9062, 9129, 9166, 9167, 9217, 9218, 9430, 9431, 9476, 9477, 9548, 9592, 9593, 9620, 9634, 9657, 9688, 9717, 9731, 9732, 10151, 10152, 10226, 10296, 10367, 10431, 10455, 10456, 10488, 10502, 10503, 10607, 10608, 10681, 10754, 10755, 10793, 10807, 10808, 11406, 11407, 11478, 11549, 11594, 11595, 11642, 11657, 11658, 12170, 12171, 12243, 12273, 12274, 12311, 12325, 12326, 12429, 12430, 12445, 12446, 12514, 12549, 12550, 12576, 12577, 12607, 12608, 12653, 12736, 12784, 12800, 12860, 12893, 12940, 12941, 12997, 12998, 13077, 13078, 13107, 13174, 13237, 13238, 13255, 13311, 13376, 13441, 13506, 13571, 13636, 13701, 13766, 13791, 13792, 13825, 13848, 13871, 13894, 13917, 13940, 13963, 13986, 14009, 14034, 14035, 14057, 14061, 14062, 14460, 14461, 14520, 14591, 14626, 14701, 14718, 14770, 14845, 14881, 14957, 14992, 15066, 15113, 15114, 15289, 15290, 15349, 15350, 15421, 15499, 15528, 15529, 15605, 15660, 15706, 15707, 15777, 15778, 15974, 15975, 16055, 16056, 16067, 16116, 16202, 16293, 16357, 16358, 16377, 16378 ], "line_end_idx": [ 24, 25, 83, 84, 205, 206, 645, 646, 765, 766, 767, 779, 780, 816, 852, 894, 928, 959, 982, 1001, 1024, 1045, 1068, 1086, 1087, 1117, 1118, 1678, 1679, 1911, 1912, 1960, 2006, 2015, 2074, 2131, 2195, 2259, 2321, 2381, 2448, 2478, 2524, 2533, 2592, 2649, 2713, 2777, 2839, 2899, 2954, 3018, 3019, 3293, 3294, 3304, 3317, 3367, 3418, 3429, 3430, 3450, 3451, 3541, 3542, 3558, 3559, 3604, 3605, 3632, 3654, 3655, 3671, 3672, 3736, 3766, 3844, 3908, 3966, 3986, 3987, 4003, 4004, 4014, 4053, 4054, 4064, 4065, 4713, 4714, 4736, 4737, 4813, 4814, 4865, 4907, 4909, 4969, 5013, 5015, 5031, 5032, 5034, 5080, 5082, 5108, 5109, 5962, 5963, 6001, 6002, 6068, 6069, 6085, 6086, 6094, 6121, 6122, 6138, 6139, 6236, 6237, 6296, 6297, 6313, 6314, 6362, 6371, 6397, 6398, 6414, 6415, 6589, 6590, 6648, 6693, 6753, 6785, 6831, 6832, 6901, 6902, 6981, 6982, 7011, 7078, 7141, 7142, 7159, 7246, 7304, 7362, 7420, 7478, 7536, 7594, 7652, 7710, 7768, 7826, 7884, 7942, 7967, 7968, 8011, 8054, 8097, 8140, 8183, 8226, 8269, 8294, 8295, 8317, 8321, 8322, 8727, 8728, 8790, 8791, 8861, 8928, 8929, 8995, 9062, 9129, 9166, 9167, 9217, 9218, 9430, 9431, 9476, 9477, 9548, 9592, 9593, 9620, 9634, 9657, 9688, 9717, 9731, 9732, 10151, 10152, 10226, 10296, 10367, 10431, 10455, 10456, 10488, 10502, 10503, 10607, 10608, 10681, 10754, 10755, 10793, 10807, 10808, 11406, 11407, 11478, 11549, 11594, 11595, 11642, 11657, 11658, 12170, 12171, 12243, 12273, 12274, 12311, 12325, 12326, 12429, 12430, 12445, 12446, 12514, 12549, 12550, 12576, 12577, 12607, 12608, 12653, 12736, 12784, 12800, 12860, 12893, 12940, 12941, 12997, 12998, 13077, 13078, 13107, 13174, 13237, 13238, 13255, 13311, 13376, 13441, 13506, 13571, 13636, 13701, 13766, 13791, 13792, 13825, 13848, 13871, 13894, 13917, 13940, 13963, 13986, 14009, 14034, 14035, 14057, 14061, 14062, 14460, 14461, 14520, 14591, 14626, 14701, 14718, 14770, 14845, 14881, 14957, 14992, 15066, 15113, 15114, 15289, 15290, 15349, 15350, 15421, 15499, 15528, 15529, 15605, 15660, 15706, 15707, 15777, 15778, 15974, 15975, 16055, 16056, 16067, 16116, 16202, 16293, 16357, 16358, 16377, 16378, 16399 ] }
{ "red_pajama_v2": { "ccnet_original_length": 16399, "ccnet_original_nlines": 333, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.11061286181211472, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.023318389430642128, "rps_doc_frac_lines_end_with_ellipsis": 0.008982039988040924, "rps_doc_frac_no_alph_words": 0.6352765560150146, "rps_doc_frac_unique_words": 0.44711992144584656, "rps_doc_mean_word_length": 5.662417411804199, "rps_doc_num_sentences": 249, "rps_doc_symbol_to_word_ratio": 0.00956652034074068, "rps_doc_unigram_entropy": 6.325221061706543, "rps_doc_word_count": 2118, "rps_doc_frac_chars_dupe_10grams": 0.09505545347929001, "rps_doc_frac_chars_dupe_5grams": 0.1454181671142578, "rps_doc_frac_chars_dupe_6grams": 0.12265487760305405, "rps_doc_frac_chars_dupe_7grams": 0.11731843650341034, "rps_doc_frac_chars_dupe_8grams": 0.10998082160949707, "rps_doc_frac_chars_dupe_9grams": 0.10072541981935501, "rps_doc_frac_chars_top_2gram": 0.005836740136146545, "rps_doc_frac_chars_top_3gram": 0.009755689650774002, "rps_doc_frac_chars_top_4gram": 0.01409155037254095, "rps_doc_books_importance": -1229.001953125, "rps_doc_books_importance_length_correction": -1229.001953125, "rps_doc_openwebtext_importance": -721.2230224609375, "rps_doc_openwebtext_importance_length_correction": -721.2230224609375, "rps_doc_wikipedia_importance": -702.01025390625, "rps_doc_wikipedia_importance_length_correction": -702.01025390625 }, "fasttext": { "dclm": 0.3494619131088257, "english": 0.01010059006512165, "fineweb_edu_approx": 1.9673173427581787, "eai_general_math": 0.0007159099914133549, "eai_open_web_math": 0.08755450695753098, "eai_web_code": 0.44870585203170776 } }
{ "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.452", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
-6,145,176,618,304,522,000
Kusto 连接字符串Kusto connection strings Kusto 连接字符串可以为 Kusto 客户端应用程序提供与 Kusto 服务终结点建立连接所需的信息。Kusto connection strings can provide the information necessary for a Kusto client application to establish a connection to a Kusto service endpoint. Kusto 连接字符串借鉴了 ADO.NET 连接字符串。Kusto connection strings are modeled after the ADO.NET connection strings. 也就是说,连接字符串是一个以分号分隔的名称/值参数对列表,可以用单个 URI 作为前缀。That is, the connection string is a semicolon-delimited list of name/value parameter pairs, optionally prefixed by a single URI. 示例:Example: https://help.chinaeast2.kusto.chinacloudapi.cn/Samples; Fed=true; Accept=true URI 提供要与之通信的服务终结点:The URI provides the service endpoint to communicate with: • (https://help.chinaeast2.kusto.chinacloudapi.cn) - Data Source 属性的值。(https://help.chinaeast2.kusto.chinacloudapi.cn) - value of the Data Source property. • Samples(默认数据库)- Initial Catalog 属性的值。Samples(default database) - value of theInitial Catalog property. 使用名称/值语法提供两个附加属性:Two additional properties are provided using the name/value syntax: • Fed 属性(也称为 AAD Federated Security)设置为 trueFed property (also called AAD Federated Security) set to true. • Accept 属性设置为 trueAccept property set to true. 备注 • 属性名称不区分大小写,并且忽略名称/值对之间的空格。Property names are not case sensitive, and spaces between name/value pairs are ignored. • 属性值 区分 大小写。Property values are case sensitive. 包含分号 (;)、单引号 (') 或双引号 (") 的属性值必须用双引号引起来。A property value that contains a semicolon (;), a single quotation mark ('), or a double quotation mark (") must be enclosed between double quotation marks. 多个 Kusto 客户端工具支持基于连接字符串的 URI 前缀进行扩展,因为它们允许使用简写格式 @ ClusterName / InitialCatalogSeveral Kusto client tools support an extension over the URI prefix of the connection string, in that they allow the shorthand format @ ClusterName / InitialCatalog to be used. 例如,这些工具将连接字符串 @help/Samples 转换为 https://help.chinaeast2.kusto.chinacloudapi.cn/Samples; Fed=true,后者指示三个属性(Data SourceInitial CatalogAAD Federated Security)。For example, the connection string @help/Samples is translated by these tools to https://help.chinaeast2.kusto.chinacloudapi.cn/Samples; Fed=true, which indicates three properties (Data Source, Initial Catalog, and AAD Federated Security). 可以采用编程方式通过 C# Kusto.Data.KustoConnectionStringBuilder 类分析和操作 Kusto 连接字符串。Programmatically, Kusto connection strings can be parsed and manipulated by the C# Kusto.Data.KustoConnectionStringBuilder class. 此类验证所有连接字符串,并在验证失败时生成运行时异常。This class validates all connection strings and generates a runtime exception if validation fails. 此功能存在于所有形式的 Kusto SDK 中。This functionality is present in all flavors of Kusto SDK. 连接字符串属性Connection string properties 下表列出了可以在 Kusto 连接字符串中指定的所有属性。The following table lists all the properties you can specify in a Kusto connection string. 它列出了编程名称(属性在 Kusto.Data.KustoConnectionStringBuilder 对象中的名称)以及作为别名的其他属性名称。It lists programmatic names (which is the name of the property in the Kusto.Data.KustoConnectionStringBuilder object) as well as additional property names that are aliases. 常规属性General properties 属性名称Property name 别名Alternative names 编程名称Programmatic name 说明Description 跟踪的客户端版本Client Version for Tracing TraceClientVersionTraceClientVersion 跟踪客户端版本时,请使用此值When tracing the client version, use this value 数据源Data Source 地址、网络地址、服务器Addr, Address, Network Address, Server 数据源DataSource 指定 Kusto 服务终结点的 URI。The URI specifying the Kusto service endpoint. 例如,https://mycluster.kusto.chinacloudapi.cnnet.tcp://localhostFor example, https://mycluster.kusto.chinacloudapi.cn or net.tcp://localhost 初始目录Initial Catalog 数据库Database InitialCatalogInitialCatalog 将在默认情况下使用的数据库的名称。The name of the database to be used by default. 例如 MyDatabaseFor example, MyDatabase 查询一致性Query Consistency QueryConsistencyQueryConsistency QueryConsistencyQueryConsistency 设置为 strongconsistencyweakconsistency,用于决定查询在运行之前是否应与元数据同步Set to either strongconsistency or weakconsistency to determine if the query should synchronize with the metadata before running 用户身份验证属性User authentication properties 属性名称Property name 别名Alternative names 编程名称Programmatic name 说明Description AAD 联合安全性AAD Federated Security 联合安全性、联合、AADFedFederated Security, Federated, Fed, AADFed FederatedSecurityFederatedSecurity 一个布尔值,指示客户端执行 Azure Active Directory (AAD) 联合身份验证A Boolean value that instructs the client to perform Azure Active 强制执行 MFAEnforce MFA MFA、EnforceMFAMFA,EnforceMFA EnforceMfaEnforceMfa 一个布尔值,指示客户端获取多重身份验证令牌A Boolean value that instructs the client to acquire a multifactor-authentication token 用户 IDUser ID UID、用户UID, User UserIDUserID 一个字符串值,指示客户端使用指定的用户名执行用户身份验证A String value that instructs the client to perform user authentication with the indicated user name 跟踪的用户名User Name for Tracing TraceUserNameTraceUserName 一个字符串值,用于向服务报告在内部跟踪请求时使用的用户名A String value that reports to the service which user name to use when tracing the request internally 用户令牌User Token UsrToken、UserTokenUsrToken, UserToken UserTokenUserToken 一个字符串值,指示客户端使用指定的持有者令牌执行用户身份验证。A String value that instructs the client to perform user authentication with the specified bearer token. 替代 ApplicationClientId、ApplicationKey 和 ApplicationToken。Overrides ApplicationClientId, ApplicationKey, and ApplicationToken. (如果指定了此项,则会跳过实际的客户端身份验证流,转而使用提供的令牌。)(If specified, skips the actual client authentication flow in favor of the provided token.) 命名空间Namespace NSNS 命名空间Namespace (供将来使用)(For future use) 应用程序身份验证属性Application authentication properties 属性名称Property name 别名Alternative names 编程名称Programmatic name 说明Description AAD 联合安全性AAD Federated Security 联合安全性、联合、AADFedFederated Security, Federated, Fed, AADFed FederatedSecurityFederatedSecurity 一个布尔值,指示客户端执行 Azure Active Directory (AAD) 联合身份验证A Boolean value that instructs the client to perform Azure Active Directory (AAD) federated authentication 应用程序证书指纹Application Certificate Thumbprint AppCertAppCert ApplicationCertificateThumbprintApplicationCertificateThumbprint 一个字符串值,该值提供使用应用程序客户端证书身份验证流时要使用的客户端证书的指纹A String value that provides the thumbprint of the client certificate to use when using an application client certificate authenticating flow 应用程序客户端 IDApplication Client Id AppClientIdAppClientId ApplicationClientIdApplicationClientId 一个字符串值,该值提供进行身份验证时要使用的应用程序客户端 IDA String value that provides the application client ID to use when authenticating 应用程序密钥Application Key AppKeyAppKey ApplicationKeyApplicationKey 一个字符串值,该值提供使用应用程序机密流进行身份验证时要使用的应用程序密钥A String value that provides the application key to use when authenticating using an application secret flow 跟踪的应用程序名称Application Name for Tracing TraceAppNameTraceAppName ApplicationNameForTracingApplicationNameForTracing 一个字符串值,用于向服务报告在内部跟踪请求时使用的应用程序名称A String value that reports to the service which application name to use when tracing the request internally 应用程序令牌Application Token AppTokenAppToken ApplicationTokenApplicationToken 一个字符串值,指示客户端使用指定的持有者令牌执行应用程序身份验证A String value that instructs the client to perform application authenticating with the specified bearer token 颁发机构 IDAuthority Id TenantIdTenantId 颁发机构Authority 一个字符串值,该值提供在其中注册应用程序的租户的名称或 IDA String value that provides the name or ID of the tenant in which the application is registered ManagedServiceIdentityManagedServiceIdentity 空值N/A EmbeddedManagedIdentityEmbeddedManagedIdentity 一个字符串值,指示客户端使用哪个应用程序标识进行托管标识身份验证;使用 system 来指示系统分配的标识。A String value that instructs the client which application identity to use with managed identity authentication; use system to indicate the system-assigned identity. 此属性不能通过连接字符串进行设置,只能以编程方式设置。This property cannot be set with a connection string, only programmatically. 应用程序证书使用者可分辨名称Application Certificate Subject Distinguished Name 应用程序证书使用者Application Certificate Subject ApplicationCertificateSubjectDistinguishedNameApplicationCertificateSubjectDistinguishedName 应用程序证书颁发者可分辨名称Application Certificate Issuer Distinguished Name 应用程序证书颁发者Application Certificate Issuer ApplicationCertificateIssuerDistinguishedNameApplicationCertificateIssuerDistinguishedName 应用程序证书发送公共证书Application Certificate Send Public Certificate 应用程序证书 SendX5c、SendX5cApplication Certificate SendX5c, SendX5c ApplicationCertificateSendPublicCertificateApplicationCertificateSendPublicCertificate 客户端通信属性Client communication properties 属性名称Property name 别名Alternative names 编程名称Programmatic name 说明Description AcceptAccept AcceptAccept 一个布尔值,它请求失败时返回的详细错误对象。A Boolean value that requests detailed error objects to be returned on failure. 流式处理Streaming 流式处理Streaming 一个布尔值,它请求客户端在将数据提供给调用方之前不累积数据。A Boolean value that requests the client will not accumulate data before providing it to the caller. 未压缩Uncompressed 未压缩Uncompressed 一个布尔值,它请求客户端不要求进行传输级压缩。A Boolean value that requests the client will not ask for transport-level compression. 身份验证属性(详细信息)Authentication properties (details) 连接字符串的重要任务之一是告诉客户端如何向服务进行身份验证。One of the important tasks of the connection string is to tell the client how to authenticate to the service. 客户端针对 HTTP/HTTPS 终结点进行身份验证时通常使用以下算法:The following algorithm is generally used by clients for authentication against HTTP/HTTPS endpoints: 1. 如果 AadFederatedSecurity 为 true:If AadFederatedSecurity is true: 1. 如果指定了 UserToken,则使用指定的令牌进行 AAD 联合身份验证If UserToken is specified, use AAD federated authentication with the specified token 2. 否则,如果指定了 ApplicationToken,则使用指定的令牌执行联合身份验证Otherwise, if ApplicationToken is specified, perform federated authentication with the specified token 3. 否则,如果指定了 ApplicationClientId 和 ApplicationKey,则使用指定的应用程序客户端 ID 和密钥执行联合身份验证Otherwise, if ApplicationClientId and ApplicationKey are specified, perform federated authentication with the specified application client ID and key 4. 否则,如果指定了 ApplicationClientId 和 ApplicationCertificateThumbprint,则使用指定的应用程序客户端 ID 和证书执行联合身份验证Otherwise, if ApplicationClientId and ApplicationCertificateThumbprint are specified, perform federated authentication with the specified application client ID and certificate 5. 否则,将使用当前登录用户的标识执行联合身份验证(如果这是会话中的第一次身份验证,系统会提示用户)Otherwise, perform federated authentication with the current logged-on user's identity (user will be prompted if this is the first authentication in the session) 2. 否则,不进行身份验证。Otherwise do not authenticate. 使用应用程序证书的 AAD 联合应用程序身份验证AAD federated application authentication with application certificate 1. 基于应用程序证书的身份验证仅支持 Web 应用程序(不支持原生客户端应用程序)。Authentication based on an application's certificate is supported only for web applications (and not for native client applications). 2. 应将 Web 应用程序配置为接受给定的证书。The web application should be configured to accept the given certificate. 如何基于 AAD 应用程序的证书进行身份验证How to authentication based-on AAD application's certificate 3. 应将 Web 应用程序配置为相关 Kusto 群集中的经授权主体。The web application should be configured as an authorized principal in the relevant Kusto cluster. 4. 应安装具有给定指纹的证书(安装位置为本地计算机存储或当前用户存储)。The certificate with the given thumbprint should be installed (in Local Machine store or in Current User store). 5. 证书的公钥应至少包含 2048 位。The certificate's public key should contain at least 2048 bits. 基于 AAD 的身份验证示例AAD-based authentication examples 使用当前登录用户标识的 AAD 联合身份验证(系统会根据需要提示用户)AAD Federated authentication using the currently logged-on user identity (user will be prompted if required) var serviceUri = "Service URI, typically of the form https://cluster.region.kusto.chinacloudapi.cn"; var authority = "contoso.com"; // Or the AAD tenant GUID: "..." // Recommended syntax var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) .WithAadUserPromptAuthentication(authority); // Legacy syntax var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) { FederatedSecurity = true, InitialCatalog = "NetDefaultDB", Authority = authority, }; // Equivalent Kusto connection string: $"Data Source={serviceUri};Database=NetDefaultDB;Fed=True;Authority Id={authority}" 使用用户 ID 提示的 AAD 联合身份验证(系统会根据需要提示用户)AAD Federated authentication with user id hint (user will be prompted if required) var serviceUri = "Service URI, typically of the form https://cluster.region.kusto.chinacloudapi.cn"; var authority = "contoso.com"; // Or the AAD tenant GUID: "..." var userUPN = "[email protected]"; // Recommended syntax var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) .WithAadUserPromptAuthentication(authority); kustoConnectionStringBuilder.UserID = userUPN; // Legacy syntax var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) { FederatedSecurity = true, InitialCatalog = "NetDefaultDB", UserID = userUPN, Authority = authority, }; // Equivalent Kusto connection string: $"Data Source={serviceUri};Database=NetDefaultDB;Fed=True;User ID={userUPN};Authority Id={authority}" 使用 ApplicationClientId 和 ApplicationKey 的 AAD 联合应用程序身份验证AAD Federated application authentication using ApplicationClientId and ApplicationKey var serviceUri = "Service URI, typically of the form https://cluster.region.kusto.chinacloudapi.cn"; var authority = "contoso.com"; // Or the AAD tenant GUID: "..." var applicationClientId = <ApplicationClientId>; var applicationKey = <ApplicationKey>; // Recommended syntax var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) .WithAadApplicationKeyAuthentication(applicationClientId, applicationKey, authority); // Legacy syntax var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) { FederatedSecurity = true, InitialCatalog = "NetDefaultDB", ApplicationClientId = applicationClientId, ApplicationKey = applicationKey, Authority = authority, }; // Equivalent Kusto connection string: $"Data Source={serviceUri};Database=NetDefaultDB;Fed=True;AppClientId={applicationClientId};AppKey={applicationKey};Authority Id={authority}" 使用用户/应用程序令牌的 AAD 联合身份验证AAD Federated authentication using user / application token var serviceUri = "Service URI, typically of the form https://cluster.region.kusto.chinacloudapi.cn"; var authority = "contoso.com"; // Or the AAD tenant GUID: "..." var access_token = "<access token obtained from AAD>" // Recommended syntax - AAD User token var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) .WithAadUserTokenAuthentication(access_token, authority); // Legacy syntax - AAD User token var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) { FederatedSecurity = true, UserToken = access_token, Authority = authority, }; // Equivalent Kusto connection string: "Data Source={serviceUri};Database=NetDefaultDB;Fed=True;UserToken={access_token};Authority Id={authority}" // Recommended syntax - AAD Application token var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) .WithAadApplicationTokenAuthentication(access_token, authority); // Legacy syntax - AAD Application token var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) { FederatedSecurity = true, ApplicationToken = access_token, Authority = authority, }; // Equivalent Kusto connection string: $"Data Source={serviceUri};Database=NetDefaultDB;Fed=True;AppToken={applicationToken};Authority Id={authority}" 使用令牌提供程序回调(将在每次需要令牌时调用)Using token provider callback (will be invoked each time a token is required) var serviceUri = "Service URI, typically of the form https://cluster.region.kusto.chinacloudapi.cn"; Func<string> tokenProviderCallback; // User-defined method to retrieve the access token // Recommended syntax var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) .WithAadTokenProviderAuthentication(tokenProviderCallback); // Legacy syntax var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) { FederatedSecurity = true, TokenProviderCallback = () => Task.FromResult(tokenProviderCallback()), }; 使用托管标识Using Managed Identity var serviceUri = "Service URI, typically of the form https://cluster.region.kusto.chinacloudapi.cn"; var managedIdentity = "<managed identity>"; // For system-assigned identity use "system" // Recommended syntax var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) .WithAadManagedIdentity(managedIdentity); // Legacy syntax var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) { FederatedSecurity = true, EmbeddedManagedIdentity = managedIdentity, }; 使用 X.509 证书Using X.509 certificate var serviceUri = "Service URI, typically of the form https://cluster.region.kusto.chinacloudapi.cn"; var authority = "contoso.com"; // Or the AAD tenant GUID: "..." string applicationClientId = "<applicationClientId>"; X509Certificate2 applicationCertificate = "<certificate blob>"; bool sendX5c = <desired value>; // Set too 'True' to use Trusted Issuer feature of AAD // Recommended syntax var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) .WithAadApplicationCertificateAuthentication(applicationClientId, applicationCertificate, authority, sendX5c); // Legacy syntax var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) { FederatedSecurity = true, ApplicationClientId = applicationClientId, ApplicationCertificateBlob = applicationCertificate, ApplicationCertificateSendX5c = sendX5c, Authority = authority, }; 使用 X.509 证书的指纹(客户端会尝试从本地存储加载证书)Using X.509 certificate by thumbprint (client will attempt to load the certificate from local store) var serviceUri = "Service URI, typically of the form https://cluster.region.kusto.chinacloudapi.cn"; var authority = "contoso.com"; // Or the AAD tenant GUID: "..." string applicationClientId = "<applicationClientId>"; string applicationCertificateThumbprint = "<ApplicationCertificateThumbprint>"; // Recommended syntax var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) .WithAadApplicationThumbprintAuthentication(applicationClientId, applicationCertificateThumbprint, authority); // Legacy syntax var kustoConnectionStringBuilder = new KustoConnectionStringBuilder(serviceUri) { FederatedSecurity = true, ApplicationClientId = applicationClientId, ApplicationCertificateThumbprint = applicationCertificateThumbprint, Authority = authority, }; // Equivalent Kusto connection string: $"Data Source={serviceUri};Database=NetDefaultDB;Fed=True;AppClientId={applicationClientId};AppCert={applicationCertificateThumbprint};Authority Id={authority}"
{ "url": "https://docs.azure.cn/zh-cn/data-explorer/kusto/api/connection-strings/kusto", "source_domain": "docs.azure.cn", "snapshot_id": "crawl=CC-MAIN-2021-25", "warc_metadata": { "Content-Length": "78138", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:VNV4XKJSVJMK5RNPGLJB73DZJ6F6BSB2", "WARC-Concurrent-To": "<urn:uuid:d573233d-cab1-48c7-97c9-48baf760bb26>", "WARC-Date": "2021-06-20T01:09:01Z", "WARC-IP-Address": "23.5.236.38", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:YX56NNMFRWJ766P4FH3XNRVEPIK2T3XU", "WARC-Record-ID": "<urn:uuid:8d98340a-72a3-4a3f-b004-21ab7a7356a6>", "WARC-Target-URI": "https://docs.azure.cn/zh-cn/data-explorer/kusto/api/connection-strings/kusto", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:91a7b9fa-8b29-4b3e-b962-d1beaf8e23ab>" }, "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-93.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, 36, 37, 516, 517, 529, 530, 608, 609, 686, 687, 845, 952, 953, 1038, 1039, 1148, 1198, 1199, 1202, 1203, 1321, 1569, 1570, 2222, 2223, 2635, 2636, 2672, 2673, 3040, 3041, 3064, 3065, 3139, 3273, 3558, 3721, 3996, 3997, 4036, 4037, 4111, 4351, 4530, 4701, 4886, 5094, 5348, 5405, 5406, 5454, 5455, 5529, 5810, 6115, 6323, 6533, 6787, 7004, 7182, 7604, 7803, 7998, 8208, 8209, 8248, 8249, 8323, 8451, 8610, 8752, 8753, 8801, 8802, 9080, 9081, 9150, 9151, 9280, 9432, 9663, 9938, 10155, 10202, 10203, 10297, 10298, 10477, 10661, 10798, 10950, 11037, 11038, 11086, 11087, 11231, 11232, 11333, 11397, 11398, 11420, 11500, 11547, 11548, 11565, 11645, 11647, 11677, 11714, 11741, 11744, 11745, 11868, 11869, 11987, 11988, 12089, 12153, 12190, 12191, 12213, 12293, 12340, 12387, 12388, 12405, 12485, 12487, 12517, 12554, 12576, 12603, 12606, 12607, 12748, 12749, 12891, 12892, 12993, 13057, 13106, 13145, 13146, 13168, 13248, 13338, 13339, 13356, 13436, 13438, 13468, 13505, 13552, 13589, 13616, 13619, 13620, 13801, 13802, 13885, 13886, 13987, 14051, 14105, 14106, 14145, 14225, 14287, 14288, 14322, 14402, 14404, 14434, 14464, 14491, 14494, 14495, 14642, 14643, 14689, 14769, 14838, 14839, 14880, 14960, 14962, 14992, 15029, 15056, 15059, 15060, 15211, 15212, 15313, 15314, 15415, 15503, 15504, 15526, 15606, 15670, 15671, 15688, 15768, 15770, 15800, 15876, 15879, 15880, 15909, 15910, 16011, 16100, 16101, 16123, 16203, 16249, 16250, 16267, 16347, 16349, 16379, 16426, 16429, 16430, 16465, 16466, 16567, 16631, 16685, 16749, 16836, 16837, 16859, 16939, 17054, 17055, 17072, 17152, 17154, 17184, 17231, 17288, 17333, 17360, 17363, 17364, 17496, 17497, 17598, 17662, 17716, 17796, 17797, 17819, 17899, 18014, 18015, 18032, 18112, 18114, 18144, 18191, 18264, 18291, 18294, 18295 ], "line_end_idx": [ 36, 37, 516, 517, 529, 530, 608, 609, 686, 687, 845, 952, 953, 1038, 1039, 1148, 1198, 1199, 1202, 1203, 1321, 1569, 1570, 2222, 2223, 2635, 2636, 2672, 2673, 3040, 3041, 3064, 3065, 3139, 3273, 3558, 3721, 3996, 3997, 4036, 4037, 4111, 4351, 4530, 4701, 4886, 5094, 5348, 5405, 5406, 5454, 5455, 5529, 5810, 6115, 6323, 6533, 6787, 7004, 7182, 7604, 7803, 7998, 8208, 8209, 8248, 8249, 8323, 8451, 8610, 8752, 8753, 8801, 8802, 9080, 9081, 9150, 9151, 9280, 9432, 9663, 9938, 10155, 10202, 10203, 10297, 10298, 10477, 10661, 10798, 10950, 11037, 11038, 11086, 11087, 11231, 11232, 11333, 11397, 11398, 11420, 11500, 11547, 11548, 11565, 11645, 11647, 11677, 11714, 11741, 11744, 11745, 11868, 11869, 11987, 11988, 12089, 12153, 12190, 12191, 12213, 12293, 12340, 12387, 12388, 12405, 12485, 12487, 12517, 12554, 12576, 12603, 12606, 12607, 12748, 12749, 12891, 12892, 12993, 13057, 13106, 13145, 13146, 13168, 13248, 13338, 13339, 13356, 13436, 13438, 13468, 13505, 13552, 13589, 13616, 13619, 13620, 13801, 13802, 13885, 13886, 13987, 14051, 14105, 14106, 14145, 14225, 14287, 14288, 14322, 14402, 14404, 14434, 14464, 14491, 14494, 14495, 14642, 14643, 14689, 14769, 14838, 14839, 14880, 14960, 14962, 14992, 15029, 15056, 15059, 15060, 15211, 15212, 15313, 15314, 15415, 15503, 15504, 15526, 15606, 15670, 15671, 15688, 15768, 15770, 15800, 15876, 15879, 15880, 15909, 15910, 16011, 16100, 16101, 16123, 16203, 16249, 16250, 16267, 16347, 16349, 16379, 16426, 16429, 16430, 16465, 16466, 16567, 16631, 16685, 16749, 16836, 16837, 16859, 16939, 17054, 17055, 17072, 17152, 17154, 17184, 17231, 17288, 17333, 17360, 17363, 17364, 17496, 17497, 17598, 17662, 17716, 17796, 17797, 17819, 17899, 18014, 18015, 18032, 18112, 18114, 18144, 18191, 18264, 18291, 18294, 18295, 18494 ] }
{ "red_pajama_v2": { "ccnet_original_length": 18494, "ccnet_original_nlines": 267, "rps_doc_curly_bracket": 0.00302801001816988, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.1717902421951294, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.039421338587999344, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.3482820987701416, "rps_doc_frac_unique_words": 0.32510536909103394, "rps_doc_mean_word_length": 9.347983360290527, "rps_doc_num_sentences": 145, "rps_doc_symbol_to_word_ratio": 0.0028933100402355194, "rps_doc_unigram_entropy": 5.523254871368408, "rps_doc_word_count": 1661, "rps_doc_frac_chars_dupe_10grams": 0.16802987456321716, "rps_doc_frac_chars_dupe_5grams": 0.34256455302238464, "rps_doc_frac_chars_dupe_6grams": 0.32491788268089294, "rps_doc_frac_chars_dupe_7grams": 0.28183165192604065, "rps_doc_frac_chars_dupe_8grams": 0.24299606680870056, "rps_doc_frac_chars_dupe_9grams": 0.16918915510177612, "rps_doc_frac_chars_top_2gram": 0.03593739867210388, "rps_doc_frac_chars_top_3gram": 0.039415210485458374, "rps_doc_frac_chars_top_4gram": 0.0834675133228302, "rps_doc_books_importance": -1120.057373046875, "rps_doc_books_importance_length_correction": -1120.057373046875, "rps_doc_openwebtext_importance": -684.4832763671875, "rps_doc_openwebtext_importance_length_correction": -684.4832763671875, "rps_doc_wikipedia_importance": -545.4111938476562, "rps_doc_wikipedia_importance_length_correction": -545.4111938476562 }, "fasttext": { "dclm": 0.25503993034362793, "english": 0.3810924291610718, "fineweb_edu_approx": 2.4455201625823975, "eai_general_math": 0.08785461634397507, "eai_open_web_math": 0.05159217119216919, "eai_web_code": 0.9279952645301819 } }
{ "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": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
7,390,964,263,305,505,000
JavaScript/WebGL Aus SELFHTML-Wiki Wechseln zu: Navigation, Suche WebGL (Web Graphics Library) ist eine Programmierschnittstelle, mit der Sie hardwarebeschleunigte 3D-Grafiken im canvas-Element direkt im Browser – ohne zusätzliche Erweiterungen – darstellen können. Während die steuernden Scripte aus JavaScript bestehen, werden die Shader in speziellen Sprachen wie GLSL geschrieben und in Maschinencode für die GPU übersetzt. WebGL ist keine Spezifikation der W3C, sondern wird von der KhronosGroup und Mozilla aus OpenGL ES (Version 2.0) im Zusammenspiel mit JavaScript als lizenzfreier Standard entwickelt. Beachten Sie: Da WebGL auf hardwarebeschleunigten 3D-Grafiken beruht, müssen neben den Browsern auch die Videotreiber auf aktuellem Stand sein. Anwendung Aufruf Beispiel function initWebGL() { gl = null; try { gl = canvas.getContext("webgl"); } catch(e) { } // Fehlermeldung if (!gl) { alert("WebGL konnte nicht initialisiert werden."); gl = null; } return gl; } Jupiter und seine Monde Ein Beispiel von Orlok[1] Jupiter und seine Monde in WebGL ansehen … <script id="vertexshader" type="shader/x-glsl"> attribute vec4 aVertexPosition; attribute vec3 aVertexNormal; attribute vec2 aTextureCoord; uniform mat4 uProjectionMatrix; uniform mat4 uWorldMatrix; uniform mat3 uNormalMatrix; varying vec4 vPosition; varying vec3 vTransformedNormal; varying vec2 vTextureCoord; void main (void) { vTextureCoord = aTextureCoord; vTransformedNormal = uNormalMatrix * aVertexNormal; vPosition = uWorldMatrix * aVertexPosition; gl_Position = uProjectionMatrix * vPosition; } </script> <script id="fragmentshader" type="shader/x-glsl"> precision highp float; uniform sampler2D uSampler; uniform bool uLightingEnabled; uniform vec3 uLightPosition; varying vec4 vPosition; varying vec3 vTransformedNormal; varying vec2 vTextureCoord; const vec3 ambientColor = vec3(0.1, 0.1, 0.1); const vec3 diffuseColor = vec3(0.8, 0.8, 0.8); void main (void) { vec3 lightWeighting; if (uLightingEnabled) { vec3 direction = normalize(uLightPosition - vPosition.xyz); float diffuse = max(dot(normalize(vTransformedNormal), direction), 0.0); lightWeighting = ambientColor + diffuseColor * diffuse; } else { lightWeighting = vec3(0.3, 0.3, 0.3); } vec4 fragmentColor = texture2D(uSampler, vTextureCoord); gl_FragColor = vec4(fragmentColor.rgb * lightWeighting, 1.0); } </script> <script> var SCENE = { getWebGLContext : function (canvas) { var i, context = null; var names = ['webgl', 'experimental-webgl', 'moz-webgl', 'webkit-3d']; for (i = 0; i < names.length; i += 1) { try { context = canvas.getContext(names[i]); if (context) { break; } } catch (e) { }; } return context; }, getShaderSource : function (id) { var script = document.getElementById(id); var source = ''; var child = script.firstChild; while (child) { if (child.nodeType === 3) { source += child.textContent; } child = child.nextSibling; } return source; }, getSphere : function (bands, radius) { radius = radius || 1; var longitudeBands = bands || 50, latitudeBands = bands || 50; var l, m; var sphere = { vertices : [ ], normals : [ ], texCoords : [ ] }; for (l = 0; l <= latitudeBands; l += 1) { var theta = l * Math.PI / latitudeBands; var sinTheta = Math.sin(theta), cosTheta = Math.cos(theta); for (m = 0; m <= longitudeBands; m += 1) { var phi = m * 2 * Math.PI / longitudeBands; var sinPhi = Math.sin(phi), cosPhi = Math.cos(phi); var x = cosPhi * sinTheta, y = cosTheta, z = sinPhi * sinTheta; var u = 1 - (m / longitudeBands), v = 1 - (l / latitudeBands); sphere.vertices.push(radius * x, radius * y, radius * z); sphere.normals.push(x, y, z); sphere.texCoords.push(u, v); } } sphere.indices = [ ]; for (l = 0; l < latitudeBands; l += 1) { for (m = 0; m < longitudeBands; m += 1) { var a = (l * (longitudeBands + 1)) + m; var b = a + longitudeBands + 1; sphere.indices.push(a, b, a + 1, b, b + 1, a + 1); } } return sphere; }, createMat3 : function ( ) { var mat3 = new Float32Array(9); mat3[0] = 1; mat3[1] = 0; mat3[2] = 0; mat3[3] = 0; mat3[4] = 1; mat3[5] = 0; mat3[6] = 0; mat3[7] = 0; mat3[8] = 1; return mat3; }, identityMat3 : function (mat3) { mat3[0] = 1; mat3[1] = 0; mat3[2] = 0; mat3[3] = 0; mat3[4] = 1; mat3[5] = 0; mat3[6] = 0; mat3[7] = 0; mat3[8] = 1; return mat3; }, normalMat3FromMat4 : function (mat4, mat3) { var a00 = mat4[0], a01 = mat4[1], a02 = mat4[2], a03 = mat4[3], a10 = mat4[4], a11 = mat4[5], a12 = mat4[6], a13 = mat4[7], a20 = mat4[8], a21 = mat4[9], a22 = mat4[10], a23 = mat4[11], a30 = mat4[12], a31 = mat4[13], a32 = mat4[14], a33 = mat4[15]; var b00 = a00 * a11 - a01 * a10, b01 = a00 * a12 - a02 * a10, b02 = a00 * a13 - a03 * a10, b03 = a01 * a12 - a02 * a11, b04 = a01 * a13 - a03 * a11, b05 = a02 * a13 - a03 * a12, b06 = a20 * a31 - a21 * a30, b07 = a20 * a32 - a22 * a30, b08 = a20 * a33 - a23 * a30, b09 = a21 * a32 - a22 * a31, b10 = a21 * a33 - a23 * a31, b11 = a22 * a33 - a23 * a32; var det = b00 * b11 - b01 * b10 + b02 * b09 + b03 * b08 - b04 * b07 + b05 * b06; if (!det) { return null; } det = 1.0 / det; mat3[0] = (a11 * b11 - a12 * b10 + a13 * b09) * det; mat3[1] = (a12 * b08 - a10 * b11 - a13 * b07) * det; mat3[2] = (a10 * b10 - a11 * b08 + a13 * b06) * det; mat3[3] = (a02 * b10 - a01 * b11 - a03 * b09) * det; mat3[4] = (a00 * b11 - a02 * b08 + a03 * b07) * det; mat3[5] = (a01 * b08 - a00 * b10 - a03 * b06) * det; mat3[6] = (a31 * b05 - a32 * b04 + a33 * b03) * det; mat3[7] = (a32 * b02 - a30 * b05 - a33 * b01) * det; mat3[8] = (a30 * b04 - a31 * b02 + a33 * b00) * det; return mat3; }, createMat4 : function ( ) { var mat4 = new Float32Array(16); mat4[0] = 1; mat4[1] = 0; mat4[2] = 0; mat4[3] = 0; mat4[4] = 0; mat4[5] = 1; mat4[6] = 0; mat4[7] = 0; mat4[8] = 0; mat4[9] = 0; mat4[10] = 1; mat4[11] = 0; mat4[12] = 0; mat4[13] = 0; mat4[14] = 0; mat4[15] = 1; return mat4; }, identityMat4 : function (mat4) { mat4[0] = 1; mat4[1] = 0; mat4[2] = 0; mat4[3] = 0; mat4[4] = 0; mat4[5] = 1; mat4[6] = 0; mat4[7] = 0; mat4[8] = 0; mat4[9] = 0; mat4[10] = 1; mat4[11] = 0; mat4[12] = 0; mat4[13] = 0; mat4[14] = 0; mat4[15] = 1; return mat4; }, translateMat4 : function (vec3, mat4) { var x = vec3[0], y = vec3[1], z = vec3[2]; var a = mat4; mat4[12] = a[0] * x + a[4] * y + a[8] * z + a[12]; mat4[13] = a[1] * x + a[5] * y + a[9] * z + a[13]; mat4[14] = a[2] * x + a[6] * y + a[10] * z + a[14]; mat4[15] = a[3] * x + a[7] * y + a[11] * z + a[15]; return mat4; }, rotateMat4 : function (angle, vec3, mat4) { var x = vec3[0], y = vec3[1], z = vec3[2]; var len = Math.sqrt(x * x + y * y + z * z); if (!len) { return null; } if (len != 1) { len = 1 / len; x *= len; y *= len; z *= len; } var s = Math.sin(angle * Math.PI / 180), c = Math.cos(angle * Math.PI / 180), t = 1 - c; var a00 = mat4[0], a01 = mat4[1], a02 = mat4[2], a03 = mat4[3], a10 = mat4[4], a11 = mat4[5], a12 = mat4[6], a13 = mat4[7], a20 = mat4[8], a21 = mat4[9], a22 = mat4[10], a23 = mat4[11]; var b00 = x * x * t + c, b01 = y * x * t + z * s, b02 = z * x * t - y * s, b10 = x * y * t - z * s, b11 = y * y * t + c, b12 = z * y * t + x * s, b20 = x * z * t + y * s, b21 = y * z * t - x * s, b22 = z * z * t + c; mat4[0] = a00 * b00 + a10 * b01 + a20 * b02; mat4[1] = a01 * b00 + a11 * b01 + a21 * b02; mat4[2] = a02 * b00 + a12 * b01 + a22 * b02; mat4[3] = a03 * b00 + a13 * b01 + a23 * b02; mat4[4] = a00 * b10 + a10 * b11 + a20 * b12; mat4[5] = a01 * b10 + a11 * b11 + a21 * b12; mat4[6] = a02 * b10 + a12 * b11 + a22 * b12; mat4[7] = a03 * b10 + a13 * b11 + a23 * b12; mat4[8] = a00 * b20 + a10 * b21 + a20 * b22; mat4[9] = a01 * b20 + a11 * b21 + a21 * b22; mat4[10] = a02 * b20 + a12 * b21 + a22 * b22; mat4[11] = a03 * b20 + a13 * b21 + a23 * b22; return mat4; }, scaleMat4 : function (vec3, mat4) { var x = vec3[0], y = vec3[1], z = vec3[2], a = mat4; mat4[0] = a[0] * x; mat4[1] = a[1] * x; mat4[2] = a[2] * x; mat4[3] = a[3] * x; mat4[4] = a[4] * y; mat4[5] = a[5] * y; mat4[6] = a[6] * y; mat4[7] = a[7] * y; mat4[8] = a[8] * z; mat4[9] = a[9] * z; mat4[10] = a[10] * z; mat4[11] = a[11] * z; return mat4; }, multiplyMat4 : function (a, b, mat4) { var a00 = a[0], a01 = a[1], a02 = a[2], a03 = a[3], a10 = a[4], a11 = a[5], a12 = a[6], a13 = a[7], a20 = a[8], a21 = a[9], a22 = a[10], a23 = a[11], a30 = a[12], a31 = a[13], a32 = a[14], a33 = a[15]; var b00 = b[0], b01 = b[1], b02 = b[2], b03 = b[3], b10 = b[4], b11 = b[5], b12 = b[6], b13 = b[7], b20 = b[8], b21 = b[9], b22 = b[10], b23 = b[11], b30 = b[12], b31 = b[13], b32 = b[14], b33 = b[15]; mat4[0] = b00 * a00 + b01 * a10 + b02 * a20 + b03 * a30; mat4[1] = b00 * a01 + b01 * a11 + b02 * a21 + b03 * a31; mat4[2] = b00 * a02 + b01 * a12 + b02 * a22 + b03 * a32; mat4[3] = b00 * a03 + b01 * a13 + b02 * a23 + b03 * a33; mat4[4] = b10 * a00 + b11 * a10 + b12 * a20 + b13 * a30; mat4[5] = b10 * a01 + b11 * a11 + b12 * a21 + b13 * a31; mat4[6] = b10 * a02 + b11 * a12 + b12 * a22 + b13 * a32; mat4[7] = b10 * a03 + b11 * a13 + b12 * a23 + b13 * a33; mat4[8] = b20 * a00 + b21 * a10 + b22 * a20 + b23 * a30; mat4[9] = b20 * a01 + b21 * a11 + b22 * a21 + b23 * a31; mat4[10] = b20 * a02 + b21 * a12 + b22 * a22 + b23 * a32; mat4[11] = b20 * a03 + b21 * a13 + b22 * a23 + b23 * a33; mat4[12] = b30 * a00 + b31 * a10 + b32 * a20 + b33 * a30; mat4[13] = b30 * a01 + b31 * a11 + b32 * a21 + b33 * a31; mat4[14] = b30 * a02 + b31 * a12 + b32 * a22 + b33 * a32; mat4[15] = b30 * a03 + b31 * a13 + b32 * a23 + b33 * a33; return mat4; }, perspectiveMat4 : function (aspect, angle, near, far, mat4) { var top = near * Math.tan(angle * Math.PI / 360.0); var bottom = -top; var right = top * aspect; var left = -right; var a = (near * 2) / (right - left), b = (near * 2) / (top - bottom), c = (right + left) / (right - left), d = (top + bottom) / (top - bottom), e = -(far + near) / (far - near), f = -(far * near * 2) / (far - near); mat4[0] = a; mat4[1] = 0; mat4[2] = 0; mat4[3] = 0; mat4[4] = 0; mat4[5] = b; mat4[6] = 0; mat4[7] = 0; mat4[8] = c; mat4[9] = d; mat4[10] = e; mat4[11] = -1; mat4[12] = 0; mat4[13] = 0; mat4[14] = f; mat4[15] = 0; return mat4; }, init : function (canvas) { var gl = this.getWebGLContext(canvas); var that = this, i; var getShader = function (type, source) { var shader = gl.createShader(type); gl.shaderSource(shader, source); gl.compileShader(shader); if (!gl.getShaderParameter(shader, gl.COMPILE_STATUS)) { console.log(gl.getShaderInfoLog(shader)); } return shader; }; var getShaderProgram = function (vertexshader, fragmentshader) { var program = gl.createProgram( ); gl.attachShader(program, vertexshader); gl.attachShader(program, fragmentshader); gl.linkProgram(program); if (!gl.getProgramParameter(program, gl.LINK_STATUS)) { console.log(gl.getProgramInfoLog(program)); } else { gl.useProgram(program); } return program; }; var program = getShaderProgram( getShader(gl.VERTEX_SHADER, that.getShaderSource('vertexshader')), getShader(gl.FRAGMENT_SHADER, that.getShaderSource('fragmentshader')) ); var attributes = ['aVertexPosition', 'aVertexNormal', 'aTextureCoord']; attributes.forEach(function (attribute) { program[attribute] = gl.getAttribLocation(program, attribute); gl.enableVertexAttribArray(program[attribute]); }); var uniforms = [ 'uProjectionMatrix', 'uWorldMatrix', 'uNormalMatrix', 'uSampler', 'uLightingEnabled', 'uLightPosition' ]; uniforms.forEach(function (uniform) { program[uniform] = gl.getUniformLocation(program, uniform); }); var textureImagesLoaded = 0, numTextureImages = 6; var handleLoadedTexture = function (texture) { gl.pixelStorei(gl.UNPACK_FLIP_Y_WEBGL, true); gl.bindTexture(gl.TEXTURE_2D, texture); gl.texImage2D(gl.TEXTURE_2D, 0, gl.RGBA, gl.RGBA, gl.UNSIGNED_BYTE, texture.image); gl.texParameteri( gl.TEXTURE_2D, gl.TEXTURE_MAG_FILTER, gl.LINEAR ); gl.texParameteri( gl.TEXTURE_2D, gl.TEXTURE_MIN_FILTER, gl.LINEAR_MIPMAP_LINEAR ); gl.generateMipmap(gl.TEXTURE_2D); gl.bindTexture(gl.TEXTURE_2D, null); }; var loadTexture = function (texture, source) { texture.image = new Image( ); texture.image.addEventListener('load', function ( ) { handleLoadedTexture(texture); textureImagesLoaded += 1; if (textureImagesLoaded === numTextureImages) { start( ); } }); texture.image.src = source; }; var projectionMatrix = this.createMat4( ); var worldMatrix = this.createMat4( ); var setWorldMatrix = function (mat4) { if (mat4) { that.identityMat4(worldMatrix); that.multiplyMat4(cameraMatrix, mat4, worldMatrix); } else { worldMatrix = cameraMatrix; } }; var normalMatrix = this.createMat3( ); var setNormalMatrix = function ( ) { that.identityMat3(normalMatrix); that.normalMat3FromMat4(worldMatrix, normalMatrix); }; var cameraMatrix = this.createMat4( ); var setCameraMatrix = function ( ) { that.identityMat4(cameraMatrix); that.translateMat4([0, 0, translateZ], cameraMatrix); that.rotateMat4(rotateX, [1, 0, 0], cameraMatrix); }; var lightPosition = [10.0, 0.0, 3.0]; var setShaderUniforms = function (lighting) { gl.uniformMatrix4fv(program.uProjectionMatrix, false, projectionMatrix); gl.uniformMatrix4fv(program.uWorldMatrix, false, worldMatrix); gl.uniformMatrix3fv(program.uNormalMatrix, false, normalMatrix); gl.uniform3f( program.uLightPosition, parseFloat(lightPosition[0]), parseFloat(lightPosition[1]), parseFloat(lightPosition[2]) ); gl.uniform1i(program.uLightingEnabled, lighting); }; var getBuffer = function (type, data, size) { var buffer = gl.createBuffer( ); gl.bindBuffer(type, buffer); data = type === gl.ARRAY_BUFFER ? new Float32Array(data) : new Uint16Array(data); gl.bufferData(type, data, gl.STATIC_DRAW); buffer.numItems = data.length / size; buffer.itemSize = size; return buffer; }; var objects = [ ], images = [ ]; var Sphere = function (animation) { var localMatrix = that.createMat4( ); this.lightingEnabled = true; var texture = gl.createTexture( ); this.initTexture = function (source) { loadTexture(texture, source); }; this.bindTexture = function ( ) { gl.activeTexture(gl.TEXTURE0); gl.bindTexture(gl.TEXTURE_2D, texture); gl.uniform1i(program.uSampler, 0); }; var geometry = that.getSphere( ); var buffers = [ getBuffer(gl.ARRAY_BUFFER, geometry.vertices, 3), getBuffer(gl.ARRAY_BUFFER, geometry.normals, 3), getBuffer(gl.ARRAY_BUFFER, geometry.texCoords, 2), getBuffer(gl.ELEMENT_ARRAY_BUFFER, geometry.indices, 1) ]; var elements = buffers[3].numItems; this.bindBuffers = function ( ) { buffers.forEach(function (buffer, index) { if (buffer.itemSize !== 1) { gl.bindBuffer(gl.ARRAY_BUFFER, buffer); gl.vertexAttribPointer( program[attributes[index]], buffer.itemSize, gl.FLOAT, false, 0, 0 ); } else { gl.bindBuffer(gl.ELEMENT_ARRAY_BUFFER, buffer); } }); }; this.animation = animation || false; if (animation) { this.animation.matrix = localMatrix; } var last = 0; this.animate = function ( ) { if (this.animation) { var elapsed, now = new Date( ).getTime( ); if (last !== 0) { elapsed = (last - now) * speed; this.animation.run(elapsed); } last = now; } }; this.drawElements = function ( ) { setCameraMatrix( ); if (this.animation) { setWorldMatrix(localMatrix); } else { setWorldMatrix( ); } setNormalMatrix( ); setShaderUniforms(this.lightingEnabled); this.bindBuffers( ); gl.drawElements(gl.TRIANGLES, elements, gl.UNSIGNED_SHORT, 0); }; }; var milkyway = new Sphere({ run : function ( ) { that.identityMat4(this.matrix); that.scaleMat4([30.0, 30.0, 30.0], this.matrix); } }); milkyway.lightingEnabled = false; objects.push(milkyway); images.push('http://wiki.selfhtml.org/images/4/4e/Milkyway.jpg'); var jupiter = new Sphere({ angle : 0.0, speed : 10.0, run : function (elapsed) { this.angle -= (this.speed * elapsed) / 1000.0; that.identityMat4(this.matrix); that.rotateMat4(this.angle, [0, 1, 0], this.matrix); } }); objects.push(jupiter); images.push('http://wiki.selfhtml.org/images/e/e2/Jupiter.jpg'); var io = new Sphere({ angle : 0.0, run : function (elapsed) { this.angle -= 0.05 * elapsed; that.identityMat4(this.matrix); that.rotateMat4(this.angle, [0, 1, 0], this.matrix); that.translateMat4([-1.5, 0, 0], this.matrix); that.scaleMat4([0.07, 0.07, 0.07], this.matrix); } }); objects.push(io); images.push('http://wiki.selfhtml.org/images/8/87/Io.jpg'); var europa = new Sphere({ angle : 0.0, run : function (elapsed) { this.angle -= 0.04 * elapsed; that.identityMat4(this.matrix); that.rotateMat4(this.angle, [0, 1, 0], this.matrix); that.translateMat4([2.5, 0, 0], this.matrix); that.scaleMat4([0.06, 0.06, 0.06], this.matrix); } }); objects.push(europa); images.push('http://wiki.selfhtml.org/images/e/e0/Europa.jpg'); var ganymede = new Sphere({ angle : 0.0, run : function (elapsed) { this.angle -= 0.02 * elapsed; that.identityMat4(this.matrix); that.rotateMat4(this.angle, [0, 1, 0], this.matrix); that.translateMat4([3.2, 0, 0], this.matrix); that.scaleMat4([0.08, 0.08, 0.08], this.matrix); } }); objects.push(ganymede); images.push('http://wiki.selfhtml.org/images/1/14/Ganymede.jpg'); var callisto = new Sphere({ angle : 0.0, run : function (elapsed) { this.angle -= 0.01 * elapsed; that.identityMat4(this.matrix); that.rotateMat4(this.angle, [0, 1, 0], this.matrix); that.translateMat4([0, 0, -4.5], this.matrix); that.scaleMat4([0.1, 0.1, 0.1], this.matrix); } }); objects.push(callisto); images.push('http://wiki.selfhtml.org/images/e/e9/Callisto.jpg'); for (i = 0; i < objects.length; i += 1) { objects[i].initTexture(images[i]); } var rotateX = 10.0, translateZ = -10.0, speed = 0.5; var activeKeys = { }; var handleKeyEvents = function (e) { if (e.keyCode === 37 || e.keyCode === 38 || e.keyCode === 39 || e.keyCode === 40) { e.preventDefault( ); } activeKeys[e.keyCode] = e.type === 'keydown' ? true : false; }; window.addEventListener('keydown', handleKeyEvents, true); window.addEventListener('keyup', handleKeyEvents, true); var handleKeys = function ( ) { if ((activeKeys[37] || activeKeys[65]) && translateZ <= -2.0) { translateZ += 0.05; lightPosition[2] += 0.05; } else if ((activeKeys[39] || activeKeys[68]) && translateZ >= -30.0) { translateZ -= 0.05; lightPosition[2] -= 0.05; } if (activeKeys[38] || activeKeys[87]) { rotateX += 0.5; } else if (activeKeys[40] || activeKeys[83]) { rotateX -= 0.5; } }; var slider = document.getElementById('slider'); slider.addEventListener('input', function ( ) { speed = slider.value / 100; }); var draw = function ( ) { gl.clear(gl.COLOR_BUFFER_BIT | gl.DEPTH_BUFFER_BIT); gl.viewport(0, 0, gl.drawingBufferWidth, gl.drawingBufferHeight); var aspect = canvas.clientWidth / canvas.clientHeight; that.perspectiveMat4(aspect, 45, 0.1, 100.0, projectionMatrix); objects.forEach(function (object) { object.animate( ); object.bindTexture( ); object.drawElements( ); }); }; var resize = function ( ) { var height = canvas.clientHeight, width = canvas.clientWidth; if (canvas.height !== height || canvas.width !== width) { canvas.height = height; canvas.width = width; } }; var tick = function ( ) { handleKeys( ); resize( ); draw( ); window.requestAnimationFrame(tick); }; var start = function ( ) { gl.clearColor(0.0, 0.0, 0.0, 1.0); gl.enable(gl.DEPTH_TEST); tick( ); }; } }; document.addEventListener('DOMContentLoaded', function ( ) { var canvas = document.createElement('canvas'); document.body.appendChild(canvas); SCENE.init(canvas); }); Weblinks Tutorials: Demos: • SELF-Forum: Jupiter von Orlok vom 14.10.2015
{ "url": "https://wiki.selfhtml.org/wiki/JavaScript/WebGL", "source_domain": "wiki.selfhtml.org", "snapshot_id": "CC-MAIN-2024-26", "warc_metadata": { "Content-Length": "170862", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:6TVM5BT2IP4H3HUH4KB7ZG3KDHPUJGER", "WARC-Concurrent-To": "<urn:uuid:7e1b7d13-8d73-4881-8574-41a47cf6f8d8>", "WARC-Date": "2024-06-19T00:11:19Z", "WARC-IP-Address": "89.238.67.49", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:5QSFXIHOOTSBBMSZQN45VFSV6HNPH2PJ", "WARC-Record-ID": "<urn:uuid:a39ecfa3-bb04-4452-a9ad-074b384a6b45>", "WARC-Target-URI": "https://wiki.selfhtml.org/wiki/JavaScript/WebGL", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:9243aeac-f56f-41a7-b75d-8ac1b98e50f9>" }, "warc_info": "isPartOf: CC-MAIN-2024-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-116\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 17, 18, 36, 67, 68, 430, 431, 614, 615, 759, 760, 770, 771, 778, 779, 788, 811, 824, 827, 835, 872, 876, 889, 893, 896, 915, 918, 931, 986, 1001, 1005, 1006, 1019, 1021, 1022, 1046, 1047, 1073, 1074, 1117, 1165, 1166, 1204, 1240, 1276, 1277, 1315, 1348, 1382, 1383, 1413, 1452, 1486, 1487, 1512, 1551, 1611, 1663, 1664, 1717, 1725, 1726, 1740, 1794, 1795, 1824, 1825, 1859, 1896, 1931, 1932, 1962, 2001, 2035, 2036, 2089, 2142, 2143, 2168, 2197, 2229, 2299, 2382, 2448, 2465, 2513, 2523, 2588, 2589, 2659, 2667, 2668, 2682, 2695, 2696, 2716, 2762, 2795, 2876, 2926, 2944, 2997, 3026, 3049, 3065, 3094, 3106, 3132, 3143, 3185, 3237, 3264, 3305, 3331, 3371, 3414, 3428, 3467, 3479, 3504, 3515, 3562, 3594, 3638, 3681, 3701, 3776, 3828, 3881, 3925, 3969, 4024, 4082, 4124, 4166, 4207, 4239, 4280, 4328, 4375, 4447, 4491, 4534, 4548, 4560, 4592, 4643, 4697, 4751, 4797, 4862, 4876, 4888, 4913, 4924, 4960, 5002, 5051, 5100, 5149, 5172, 5183, 5224, 5273, 5322, 5371, 5394, 5405, 5458, 5535, 5612, 5690, 5768, 5840, 5912, 5984, 6056, 6128, 6200, 6291, 6313, 6338, 6350, 6377, 6440, 6503, 6566, 6629, 6692, 6755, 6818, 6881, 6944, 6967, 6978, 7014, 7057, 7123, 7189, 7255, 7321, 7344, 7355, 7396, 7462, 7528, 7594, 7660, 7683, 7694, 7742, 7795, 7819, 7881, 7943, 8005, 8067, 8090, 8101, 8153, 8206, 8260, 8282, 8307, 8319, 8345, 8402, 8414, 8465, 8516, 8541, 8617, 8693, 8770, 8805, 8844, 8883, 8922, 8957, 8996, 9035, 9074, 9109, 9165, 9221, 9277, 9333, 9389, 9445, 9501, 9557, 9613, 9669, 9725, 9781, 9804, 9815, 9859, 9922, 9954, 9986, 10018, 10050, 10082, 10114, 10146, 10178, 10210, 10242, 10274, 10306, 10329, 10340, 10387, 10452, 10517, 10583, 10649, 10714, 10779, 10845, 10911, 10979, 11047, 11115, 11183, 11251, 11319, 11387, 11455, 11523, 11591, 11659, 11727, 11795, 11863, 11931, 11999, 12022, 12033, 12103, 12165, 12194, 12230, 12259, 12306, 12353, 12404, 12455, 12503, 12555, 12622, 12689, 12756, 12823, 12846, 12857, 12892, 12941, 12971, 13023, 13071, 13116, 13154, 13223, 13279, 13293, 13320, 13333, 13408, 13455, 13507, 13561, 13598, 13666, 13724, 13745, 13783, 13797, 13825, 13838, 13880, 13959, 14041, 14054, 14136, 14188, 14263, 14323, 14337, 14364, 14430, 14491, 14504, 14552, 14624, 14638, 14699, 14756, 14814, 14866, 14962, 14992, 15021, 15058, 15082, 15097, 15127, 15156, 15193, 15231, 15246, 15292, 15341, 15354, 15411, 15453, 15519, 15563, 15603, 15665, 15691, 15707, 15723, 15763, 15776, 15829, 15877, 15926, 15950, 15996, 16062, 16083, 16125, 16139, 16152, 16201, 16248, 16293, 16357, 16370, 16419, 16466, 16511, 16577, 16640, 16653, 16701, 16757, 16842, 16917, 16994, 17020, 17058, 17102, 17146, 17189, 17204, 17266, 17279, 17335, 17380, 17421, 17515, 17570, 17620, 17656, 17683, 17696, 17739, 17785, 17835, 17876, 17923, 17974, 18018, 18033, 18079, 18124, 18178, 18227, 18242, 18288, 18316, 18380, 18443, 18508, 18578, 18593, 18641, 18687, 18744, 18789, 18847, 18889, 18937, 18996, 19017, 19042, 19108, 19126, 19144, 19159, 19208, 19237, 19288, 19302, 19328, 19370, 19406, 19465, 19499, 19549, 19596, 19614, 19642, 19658, 19673, 19720, 19754, 19790, 19835, 19858, 19893, 19909, 19943, 19998, 20033, 20110, 20125, 20138, 20176, 20209, 20255, 20318, 20332, 20346, 20390, 20424, 20500, 20537, 20562, 20588, 20627, 20688, 20734, 20801, 20815, 20829, 20862, 20937, 20969, 20994, 21033, 21077, 21123, 21190, 21251, 21314, 21328, 21342, 21370, 21440, 21476, 21501, 21540, 21584, 21630, 21697, 21757, 21820, 21834, 21848, 21880, 21954, 21992, 22017, 22056, 22100, 22146, 22213, 22273, 22336, 22350, 22364, 22398, 22474, 22512, 22537, 22576, 22620, 22666, 22733, 22794, 22854, 22868, 22882, 22916, 22992, 23044, 23091, 23103, 23166, 23198, 23245, 23341, 23376, 23390, 23463, 23476, 23545, 23612, 23654, 23730, 23764, 23804, 23888, 23922, 23962, 23976, 24028, 24058, 24117, 24147, 24161, 24174, 24232, 24290, 24330, 24344, 24380, 24445, 24523, 24590, 24666, 24714, 24747, 24784, 24822, 24838, 24851, 24889, 24935, 24979, 25049, 25087, 25123, 25137, 25150, 25186, 25213, 25236, 25257, 25305, 25318, 25355, 25402, 25440, 25461, 25474, 25484, 25493, 25494, 25561, 25616, 25659, 25687, 25697, 25698, 25707, 25708, 25709, 25720, 25721, 25722, 25729, 25730 ], "line_end_idx": [ 17, 18, 36, 67, 68, 430, 431, 614, 615, 759, 760, 770, 771, 778, 779, 788, 811, 824, 827, 835, 872, 876, 889, 893, 896, 915, 918, 931, 986, 1001, 1005, 1006, 1019, 1021, 1022, 1046, 1047, 1073, 1074, 1117, 1165, 1166, 1204, 1240, 1276, 1277, 1315, 1348, 1382, 1383, 1413, 1452, 1486, 1487, 1512, 1551, 1611, 1663, 1664, 1717, 1725, 1726, 1740, 1794, 1795, 1824, 1825, 1859, 1896, 1931, 1932, 1962, 2001, 2035, 2036, 2089, 2142, 2143, 2168, 2197, 2229, 2299, 2382, 2448, 2465, 2513, 2523, 2588, 2589, 2659, 2667, 2668, 2682, 2695, 2696, 2716, 2762, 2795, 2876, 2926, 2944, 2997, 3026, 3049, 3065, 3094, 3106, 3132, 3143, 3185, 3237, 3264, 3305, 3331, 3371, 3414, 3428, 3467, 3479, 3504, 3515, 3562, 3594, 3638, 3681, 3701, 3776, 3828, 3881, 3925, 3969, 4024, 4082, 4124, 4166, 4207, 4239, 4280, 4328, 4375, 4447, 4491, 4534, 4548, 4560, 4592, 4643, 4697, 4751, 4797, 4862, 4876, 4888, 4913, 4924, 4960, 5002, 5051, 5100, 5149, 5172, 5183, 5224, 5273, 5322, 5371, 5394, 5405, 5458, 5535, 5612, 5690, 5768, 5840, 5912, 5984, 6056, 6128, 6200, 6291, 6313, 6338, 6350, 6377, 6440, 6503, 6566, 6629, 6692, 6755, 6818, 6881, 6944, 6967, 6978, 7014, 7057, 7123, 7189, 7255, 7321, 7344, 7355, 7396, 7462, 7528, 7594, 7660, 7683, 7694, 7742, 7795, 7819, 7881, 7943, 8005, 8067, 8090, 8101, 8153, 8206, 8260, 8282, 8307, 8319, 8345, 8402, 8414, 8465, 8516, 8541, 8617, 8693, 8770, 8805, 8844, 8883, 8922, 8957, 8996, 9035, 9074, 9109, 9165, 9221, 9277, 9333, 9389, 9445, 9501, 9557, 9613, 9669, 9725, 9781, 9804, 9815, 9859, 9922, 9954, 9986, 10018, 10050, 10082, 10114, 10146, 10178, 10210, 10242, 10274, 10306, 10329, 10340, 10387, 10452, 10517, 10583, 10649, 10714, 10779, 10845, 10911, 10979, 11047, 11115, 11183, 11251, 11319, 11387, 11455, 11523, 11591, 11659, 11727, 11795, 11863, 11931, 11999, 12022, 12033, 12103, 12165, 12194, 12230, 12259, 12306, 12353, 12404, 12455, 12503, 12555, 12622, 12689, 12756, 12823, 12846, 12857, 12892, 12941, 12971, 13023, 13071, 13116, 13154, 13223, 13279, 13293, 13320, 13333, 13408, 13455, 13507, 13561, 13598, 13666, 13724, 13745, 13783, 13797, 13825, 13838, 13880, 13959, 14041, 14054, 14136, 14188, 14263, 14323, 14337, 14364, 14430, 14491, 14504, 14552, 14624, 14638, 14699, 14756, 14814, 14866, 14962, 14992, 15021, 15058, 15082, 15097, 15127, 15156, 15193, 15231, 15246, 15292, 15341, 15354, 15411, 15453, 15519, 15563, 15603, 15665, 15691, 15707, 15723, 15763, 15776, 15829, 15877, 15926, 15950, 15996, 16062, 16083, 16125, 16139, 16152, 16201, 16248, 16293, 16357, 16370, 16419, 16466, 16511, 16577, 16640, 16653, 16701, 16757, 16842, 16917, 16994, 17020, 17058, 17102, 17146, 17189, 17204, 17266, 17279, 17335, 17380, 17421, 17515, 17570, 17620, 17656, 17683, 17696, 17739, 17785, 17835, 17876, 17923, 17974, 18018, 18033, 18079, 18124, 18178, 18227, 18242, 18288, 18316, 18380, 18443, 18508, 18578, 18593, 18641, 18687, 18744, 18789, 18847, 18889, 18937, 18996, 19017, 19042, 19108, 19126, 19144, 19159, 19208, 19237, 19288, 19302, 19328, 19370, 19406, 19465, 19499, 19549, 19596, 19614, 19642, 19658, 19673, 19720, 19754, 19790, 19835, 19858, 19893, 19909, 19943, 19998, 20033, 20110, 20125, 20138, 20176, 20209, 20255, 20318, 20332, 20346, 20390, 20424, 20500, 20537, 20562, 20588, 20627, 20688, 20734, 20801, 20815, 20829, 20862, 20937, 20969, 20994, 21033, 21077, 21123, 21190, 21251, 21314, 21328, 21342, 21370, 21440, 21476, 21501, 21540, 21584, 21630, 21697, 21757, 21820, 21834, 21848, 21880, 21954, 21992, 22017, 22056, 22100, 22146, 22213, 22273, 22336, 22350, 22364, 22398, 22474, 22512, 22537, 22576, 22620, 22666, 22733, 22794, 22854, 22868, 22882, 22916, 22992, 23044, 23091, 23103, 23166, 23198, 23245, 23341, 23376, 23390, 23463, 23476, 23545, 23612, 23654, 23730, 23764, 23804, 23888, 23922, 23962, 23976, 24028, 24058, 24117, 24147, 24161, 24174, 24232, 24290, 24330, 24344, 24380, 24445, 24523, 24590, 24666, 24714, 24747, 24784, 24822, 24838, 24851, 24889, 24935, 24979, 25049, 25087, 25123, 25137, 25150, 25186, 25213, 25236, 25257, 25305, 25318, 25355, 25402, 25440, 25461, 25474, 25484, 25493, 25494, 25561, 25616, 25659, 25687, 25697, 25698, 25707, 25708, 25709, 25720, 25721, 25722, 25729, 25730, 25778 ] }
{ "red_pajama_v2": { "ccnet_original_length": 25778, "ccnet_original_nlines": 637, "rps_doc_curly_bracket": 0.007603379897773266, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.06830790638923645, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0084951501339674, "rps_doc_frac_lines_end_with_ellipsis": 0.00156739994417876, "rps_doc_frac_no_alph_words": 0.606796145439148, "rps_doc_frac_unique_words": 0.30263814330101013, "rps_doc_mean_word_length": 6.212543487548828, "rps_doc_num_sentences": 368, "rps_doc_symbol_to_word_ratio": 0.00017337000463157892, "rps_doc_unigram_entropy": 5.6892595291137695, "rps_doc_word_count": 2009, "rps_doc_frac_chars_dupe_10grams": 0.05312073975801468, "rps_doc_frac_chars_dupe_5grams": 0.11833988130092621, "rps_doc_frac_chars_dupe_6grams": 0.11537536978721619, "rps_doc_frac_chars_dupe_7grams": 0.11040782183408737, "rps_doc_frac_chars_dupe_8grams": 0.08492909371852875, "rps_doc_frac_chars_dupe_9grams": 0.0671420618891716, "rps_doc_frac_chars_top_2gram": 0.007050720043480396, "rps_doc_frac_chars_top_3gram": 0.00560852000489831, "rps_doc_frac_chars_top_4gram": 0.006409740075469017, "rps_doc_books_importance": -2851.00146484375, "rps_doc_books_importance_length_correction": -2851.00146484375, "rps_doc_openwebtext_importance": -1812.34716796875, "rps_doc_openwebtext_importance_length_correction": -1812.34716796875, "rps_doc_wikipedia_importance": -885.6991577148438, "rps_doc_wikipedia_importance_length_correction": -885.6991577148438 }, "fasttext": { "dclm": 0.9999995231628418, "english": 0.25563445687294006, "fineweb_edu_approx": 3.711268663406372, "eai_general_math": 0.7759698629379272, "eai_open_web_math": 0.12752026319503784, "eai_web_code": 0.9974762201309204 } }
{ "free_decimal_correspondence": { "primary": { "code": "004.035", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "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": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "4", "label": "Advanced Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "5", "label": "Exceptionally Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
-4,567,090,654,832,883,700
6.00 Introduction to Computer Science and Programming MIT OpenCourseWare Fall 2008 advertisement MIT OpenCourseWare http://ocw.mit.edu 6.00 Introduction to Computer Science and Programming Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 6.00 Handout, Lecture 22 (Not intended to make sense outside of lecture) mport random, pylab fair = [1,2,3,4,5,6] def throwPair(vals1, vals2): d1 = random.choice(vals1) d2 = random.choice(vals2) return d1, d2 def conductTrials(numThrows, die1, die2): throws = [] for i in range(numThrows): d1, d2 = throwPair(die1, die2) throws.append(d1+d2) return throws numThrows = 100000 throws = conductTrials(numThrows, fair, fair) pylab.hist(throws, 11) pylab.xticks(range(2,13), ['2','3','4','5','6','7','8','9','10','11','12']) pylab.title('Distribution of Values') pylab.xlabel('Sum of Two Die') pylab.ylabel('Number of Throws') #Get probabilities for fair dice pylab.figure() sums = pylab.array([0]*14) for val in range(2, 13): sums[val] = throws.count(val) probs = sums[2:13]/float(numThrows) xVals = pylab.arange(2, 13) pylab.plot(xVals, probs, label='Fair Dice') pylab.xticks(range(2,13), ['2','3','4','5','6','7','8','9','10','11','12']) pylab.title('Probability of a Value') pylab.xlabel('Sum of Two Die') pylab.ylabel('Probability') def craps(die1, die2): &quot;&quot;&quot;Return True if shooter wins at craps by betting pass line&quot;&quot;&quot; d1, d2 = throwPair(die1, die2) tot = d1 + d2 if tot in [7, 11]: return True if tot in [2, 3, 12]: return False point = tot while True: d1, d2 = throwPair(fair, fair) tot = d1 + d2 if tot == point: return True if tot == 7: return False def simCraps(numBets, die1, die2): wins, losses = (0, 0) for i in range(numBets): if craps(die1, die2): wins += 1 else: losses += 1 print wins, losses houseWin = float(losses)/float(numBets) print houseWin print 'House winning percentage: ' + str(100*houseWin) + '%' print 'House profits per $%d bet: $%d' % (numBets, losses - wins) simCraps(100000, fair, fair) #Try some unfair dice weighted = [1,2,3,4,5,5,6] throws = conductTrials(numThrows, fair, weighted) sums = pylab.array([0]*14) for val in range(2, 13): sums[val] = throws.count(val) probs = sums[2:13]/float(numThrows) xVals = pylab.arange(2, 13) pylab.plot(xVals, probs, label = 'Weighted Dice') pylab.legend() simCraps(100000, fair, weighted) pylab.show() Download
{ "url": "https://studylib.net/doc/13743558/6.00-introduction-to-computer-science-and-programming--mi...", "source_domain": "studylib.net", "snapshot_id": "crawl=CC-MAIN-2021-17", "warc_metadata": { "Content-Length": "40957", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:G75RAFJ5C7LZAOZNJXJJ7LE4IQLAFYAF", "WARC-Concurrent-To": "<urn:uuid:177f1ef0-f174-4b3d-8cd0-26405f251c2b>", "WARC-Date": "2021-04-13T20:23:23Z", "WARC-IP-Address": "172.67.175.240", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:WH7EQGZR7Y2AEWFC6TLQ2LTCQT2WUYTR", "WARC-Record-ID": "<urn:uuid:3604876b-a357-4197-9e17-f8bec158e9ea>", "WARC-Target-URI": "https://studylib.net/doc/13743558/6.00-introduction-to-computer-science-and-programming--mi...", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:ab1beac5-fcd0-4bd8-a5b9-cbf294902544>" }, "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-14.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, 83, 84, 98, 117, 136, 190, 200, 299, 324, 372, 392, 413, 442, 468, 494, 508, 550, 562, 589, 620, 641, 655, 674, 720, 743, 819, 857, 888, 921, 954, 969, 996, 1021, 1051, 1087, 1115, 1159, 1235, 1273, 1304, 1332, 1355, 1449, 1480, 1494, 1525, 1560, 1572, 1584, 1615, 1629, 1658, 1684, 1719, 1741, 1766, 1798, 1816, 1835, 1875, 1890, 1951, 2017, 2046, 2068, 2095, 2145, 2172, 2197, 2227, 2263, 2291, 2341, 2356, 2389, 2402 ], "line_end_idx": [ 83, 84, 98, 117, 136, 190, 200, 299, 324, 372, 392, 413, 442, 468, 494, 508, 550, 562, 589, 620, 641, 655, 674, 720, 743, 819, 857, 888, 921, 954, 969, 996, 1021, 1051, 1087, 1115, 1159, 1235, 1273, 1304, 1332, 1355, 1449, 1480, 1494, 1525, 1560, 1572, 1584, 1615, 1629, 1658, 1684, 1719, 1741, 1766, 1798, 1816, 1835, 1875, 1890, 1951, 2017, 2046, 2068, 2095, 2145, 2172, 2197, 2227, 2263, 2291, 2341, 2356, 2389, 2402, 2410 ] }
{ "red_pajama_v2": { "ccnet_original_length": 2410, "ccnet_original_nlines": 76, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.06811594218015671, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0028985498938709497, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.5333333015441895, "rps_doc_frac_unique_words": 0.5073529481887817, "rps_doc_mean_word_length": 6.286764621734619, "rps_doc_num_sentences": 32, "rps_doc_symbol_to_word_ratio": 0.0028985498938709497, "rps_doc_unigram_entropy": 4.677779674530029, "rps_doc_word_count": 272, "rps_doc_frac_chars_dupe_10grams": 0.13801169395446777, "rps_doc_frac_chars_dupe_5grams": 0.20584794878959656, "rps_doc_frac_chars_dupe_6grams": 0.19181287288665771, "rps_doc_frac_chars_dupe_7grams": 0.19181287288665771, "rps_doc_frac_chars_dupe_8grams": 0.13801169395446777, "rps_doc_frac_chars_dupe_9grams": 0.13801169395446777, "rps_doc_frac_chars_top_2gram": 0.014035089872777462, "rps_doc_frac_chars_top_3gram": 0.019883040338754654, "rps_doc_frac_chars_top_4gram": 0.029239770025014877, "rps_doc_books_importance": -248.2468719482422, "rps_doc_books_importance_length_correction": -248.2468719482422, "rps_doc_openwebtext_importance": -159.6865997314453, "rps_doc_openwebtext_importance_length_correction": -159.6865997314453, "rps_doc_wikipedia_importance": -102.9332504272461, "rps_doc_wikipedia_importance_length_correction": -102.9332504272461 }, "fasttext": { "dclm": 0.8861092925071716, "english": 0.5454471111297607, "fineweb_edu_approx": 3.10227632522583, "eai_general_math": 0.8955684304237366, "eai_open_web_math": 0.19352179765701294, "eai_web_code": 0.8339859843254089 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "519.2", "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": "2", "label": "Academic/Research" } }, "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": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
2,915,906,385,978,407,400
$30,131 pledged of $50,000 goal 423 backers 0seconds to go Funding Unsuccessful The project's funding goal was not reached on Mon, January 26 2015 4:00 AM UTC +00:00 Molecular Jig GamesBy Molecular Jig Games First created Molecular Jig GamesBy Molecular Jig Games First created $30,131 pledged of $50,000 goal 423 backers 0seconds to go Funding Unsuccessful The project's funding goal was not reached on Mon, January 26 2015 4:00 AM UTC +00:00 Use this space to cheer the creator along, and talk to your fellow backers. Have a question? Only backers can post comments. Log In 1. Molecular Jig Games Creator on Our Linux build is on the way! I will post here when it is ready!!! 2. Missing avatar Rhys Noble on Glad you're trying again. Already backed it 3. eda on Awesome work, great project! I hope you catch the goal! 4. Jaime on I just heard of (and backed) this last night. I have been pasting links everywhere I can and being a scientist, talking it up to all of my science friends. I really hope you reach your goal! 5. Mike V. Superbacker on My suggestion is to reach out to the STEM folks in each state. Pretty cheap BIG bang for the buck. Licensing might be a "Statewide" deal. 6. Molecular Jig Games Creator on Hey Everybody! We are almost to 50% funded! Thank you all! Someone pledged $10,000 to buy a pathogen... This pathogen's identity remains a mystery, until this campaign is funded! So if you want to know what pathogen someone was willing to pay $10,000 for you'll have to get this project funded!!! Melanie 7. Philly Cashion on I pasted this every where I could think of that night get peoplr, I hope it helped, I'd love to see this become real so baby, plus I love games like of which there aren't enough of,,! 8. Mike Stegman on Please help push this up, up, up! It is great to think of people playing video games and learning!!! 9. Chris Parsons on Looks brilliant: really hoping you succeed! :) 10. Missing avatar Melissa on There's so much to learn from this game. After you play it, you keep thinking about how you can influence the fight and what else is going on in your body at that level. Very cool stuff! 11. Missing avatar Howard Young on As an immunologist, having educational games like this is essential to helping people learn how their body functions and reacts to challenge by pathogenic viruses and bacteria 12. Alfia Wallace on Immune Defense is quality edutainment. Level up! :) 13. Missing avatar Antoine Taly on As someone interested in serious games I think Immune Defense is a superb example: not a fake game to trick learners but a real game that use game mechanics to have players learn important subjects, subject that can hardly be tackled otherwise. It is a so good example that I asked my students involved in serious games to review it! 14. David Ballard Superbacker on I look forward to playing this game, and to giving copies of the game to my kids so that they can play it, but the Friendly Gamer tier only comes with two keys. Will we be able to over-pledge to get additional copies of the game? Also, have you considered including support for Window Phone and Windows tablets? Unity supports Windows universal apps, so this should be do-able. 15. Beth Stegman on What I like about Immune Defense: 1. it's a fun video game that actually teaches real things - a combination of fun and learning (2 of my favorite things!) 2. it's challenging! 3. it's my sister's passion...and I like my sister. 16. Greg on I'm really excited to get Immune Defense in the hands of my kids. Anything I can give them to help them learn and make science come alive is amazing. I can't wait. 17. Missing avatar David Mier on What I like about Immune Defense is that it makes micro-biology more accessible for everyone to understand. 18. Mike Stegman on Great job pounding the pavement and getting the word out!!! Keep up the great work!!!
{ "url": "https://www.kickstarter.com/projects/melaniestegman/immune-defense-video-game-join-the-oldest-battle-o/comments", "source_domain": "www.kickstarter.com", "snapshot_id": "crawl=CC-MAIN-2018-30", "warc_metadata": { "Content-Length": "230349", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:B2IJPNTPAOWX3HIMQBEWOYFWQ546YCKN", "WARC-Concurrent-To": "<urn:uuid:65771dac-5d74-4c01-ad28-a6e8a65b77b7>", "WARC-Date": "2018-07-20T03:28:07Z", "WARC-IP-Address": "151.101.202.202", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:PYGXJ7PFWHJ5CGAXFEMSIX2XXMQCJ4XR", "WARC-Record-ID": "<urn:uuid:dfc05f93-b1b2-41a4-8b67-4ab7cc35fdef>", "WARC-Target-URI": "https://www.kickstarter.com/projects/melaniestegman/immune-defense-video-game-join-the-oldest-battle-o/comments", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:4181f1a4-1344-4bb8-94ab-acd7badbb461>" }, "warc_info": "robots: classic\r\nhostname: ip-10-79-230-204.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, 8, 32, 36, 44, 59, 80, 166, 208, 222, 264, 278, 286, 310, 314, 322, 337, 358, 444, 445, 521, 522, 539, 540, 579, 617, 618, 692, 693, 715, 716, 736, 737, 787, 788, 802, 803, 865, 866, 882, 883, 1080, 1081, 1096, 1114, 1123, 1124, 1268, 1269, 1307, 1308, 1358, 1379, 1623, 1624, 1638, 1639, 1664, 1665, 1855, 1856, 1879, 1880, 1987, 1988, 2012, 2013, 2066, 2067, 2090, 2091, 2108, 2109, 2302, 2303, 2326, 2327, 2349, 2350, 2532, 2533, 2558, 2559, 2617, 2618, 2641, 2642, 2664, 2665, 2916, 3011, 3012, 3034, 3052, 3061, 3062, 3298, 3299, 3453, 3454, 3478, 3479, 3519, 3647, 3674, 3732, 3733, 3749, 3750, 3920, 3921, 3944, 3945, 3965, 3966, 4080, 4081, 4105, 4106 ], "line_end_idx": [ 8, 32, 36, 44, 59, 80, 166, 208, 222, 264, 278, 286, 310, 314, 322, 337, 358, 444, 445, 521, 522, 539, 540, 579, 617, 618, 692, 693, 715, 716, 736, 737, 787, 788, 802, 803, 865, 866, 882, 883, 1080, 1081, 1096, 1114, 1123, 1124, 1268, 1269, 1307, 1308, 1358, 1379, 1623, 1624, 1638, 1639, 1664, 1665, 1855, 1856, 1879, 1880, 1987, 1988, 2012, 2013, 2066, 2067, 2090, 2091, 2108, 2109, 2302, 2303, 2326, 2327, 2349, 2350, 2532, 2533, 2558, 2559, 2617, 2618, 2641, 2642, 2664, 2665, 2916, 3011, 3012, 3034, 3052, 3061, 3062, 3298, 3299, 3453, 3454, 3478, 3479, 3519, 3647, 3674, 3732, 3733, 3749, 3750, 3920, 3921, 3944, 3945, 3965, 3966, 4080, 4081, 4105, 4106, 4197 ] }
{ "red_pajama_v2": { "ccnet_original_length": 4197, "ccnet_original_nlines": 118, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3720657229423523, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03169013932347298, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.2124413102865219, "rps_doc_frac_unique_words": 0.48843932151794434, "rps_doc_mean_word_length": 4.371387481689453, "rps_doc_num_sentences": 67, "rps_doc_symbol_to_word_ratio": 0.0023474199697375298, "rps_doc_unigram_entropy": 5.357453346252441, "rps_doc_word_count": 692, "rps_doc_frac_chars_dupe_10grams": 0.08528926223516464, "rps_doc_frac_chars_dupe_5grams": 0.15338842570781708, "rps_doc_frac_chars_dupe_6grams": 0.13619835674762726, "rps_doc_frac_chars_dupe_7grams": 0.13619835674762726, "rps_doc_frac_chars_dupe_8grams": 0.11702478677034378, "rps_doc_frac_chars_dupe_9grams": 0.08528926223516464, "rps_doc_frac_chars_top_2gram": 0.02380165085196495, "rps_doc_frac_chars_top_3gram": 0.022479340434074402, "rps_doc_frac_chars_top_4gram": 0.012561979703605175, "rps_doc_books_importance": -292.08795166015625, "rps_doc_books_importance_length_correction": -292.08795166015625, "rps_doc_openwebtext_importance": -215.84295654296875, "rps_doc_openwebtext_importance_length_correction": -215.84295654296875, "rps_doc_wikipedia_importance": -147.99302673339844, "rps_doc_wikipedia_importance_length_correction": -147.99302673339844 }, "fasttext": { "dclm": 0.024492379277944565, "english": 0.9566358923912048, "fineweb_edu_approx": 1.1194255352020264, "eai_general_math": 0.004404069855809212, "eai_open_web_math": 0.06328427791595459, "eai_web_code": 0.0001930599974002689 } }
{ "free_decimal_correspondence": { "primary": { "code": "004.0194", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "616.075", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Medicine", "level_3": "Pathology and Diseases" } } }, "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": "6", "label": "Promotional/Advertisement" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "5", "label": "Comment Section" }, "secondary": { "code": "17", "label": "Product Page" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "1", "label": "No Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
-8,265,785,067,108,400,000
[Docs] [txt|pdf] [draft-rfced-inf...] [Tracker] [Diff1] [Diff2] INFORMATIONAL Network Working Group D. Spinellis Request for Comments: 1947 SENA S.A. Category: Informational May 1996 Greek Character Encoding for Electronic Mail Messages Status of This Memo This memo provides information for the Internet community. This memo does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Overview and Rational This document describes a standard encoding for electronic mail [RFC822] containing Greek text and provides implementation guide- lines. The standard is based on MIME [RFC1521] and the ISO 8859-7 character encoding. Although the implementation of this standard is straightforward several non-standard but "functional" - though unlikely to inter-operate - alternatives are in common use. For this reason we highlight common implementation and mail user agent setup errors. Description In order to transfer Greek text via electronic mail the text is first translated into the ISO 8859-7 character set, and then encoded using either the Base64 (preferable for text that is mainly Greek) or the Quoted-Printable (justifiable in cases where some Greek words appear inside predominately Latin text) method, as defined in MIME. The following table provides most common Greek encodings (see also [RFC1345]): 0646 37 M7 51 MC 23 69 LG L1 G7 GO GC 28 97 Description ---- -- -- -- -- -- -- -- -- -- -- -- -- -- ----------- 0386 ea a2 86 cd 71 86 b6 Capital alpha with acute 0388 eb b8 8d ce 72 8d b8 Capital epsilon with acute 0389 ec b9 8f d7 73 8f b9 Capital eta with acute 038a ed ba 90 d8 75 90 ba Capital iota with acute 038c ee bc 92 d9 76 92 bc Capital omicron with acute 038e ef be 95 da 77 95 be Capital upsilon with acute 038f f0 bf 98 df 78 98 bf Capital omega with acute 0390 c0 a1 fd a1 c0 Small iota with acute and Spinellis Informational [Page 1] RFC 1947 Greek Encoding for E-mail Messages May 1996 diaeresis 0391 80 c1 a4 b0 41 a4 61 41 61 41 41 c1 Capital alpha 0392 81 c2 a5 b5 42 a5 62 42 62 42 42 c2 Capital beta 0393 82 c3 a6 a1 43 a6 67 23 43 67 43 44 c3 Capital gamma 0394 83 c4 a7 a2 44 a7 64 40 44 64 44 45 c4 Capital delta 0395 84 c5 a8 b6 45 a8 65 45 65 45 46 c5 Capital epsilon 0396 85 c6 a9 b7 46 a9 7a 46 7a 46 49 c6 Capital zeta 0397 86 c7 aa b8 47 aa 68 47 68 47 4a c7 Capital eta 0398 87 c8 ac a3 48 ac 75 5c 48 75 48 4b c8 Capital theta 0399 88 c9 ad b9 49 ad 69 49 69 49 4c c9 Capital iota 039a 89 ca b5 ba 51 b5 6b 4b 6b 4a 4d ca Capital kappa 039b 8a cb b6 a4 52 b6 6c 5e 4c 6c 4b 4e cb Capital lamda 039c 8b cc b8 bb 53 b7 6d 4d 6d 4c 4f cc Capital mu 039d 8c cd b7 c1 54 b8 6e 4e 6e 4d 50 cd Capital nu 039e 8d ce bd a5 55 bd 6a 21 4f 6a 4e 51 ce Capital xi 039f 8e cf be c3 56 be 6f 50 6f 4f 52 cf Capital omicron 03a0 8f d0 c6 a6 57 c6 70 3f 51 70 50 53 d0 Capital pi 03a1 90 d1 c7 c4 58 c7 72 52 72 51 55 d1 Capital rho 03a3 91 d3 cf aa 59 cf 73 5f 53 73 53 56 d3 Capital sigma 03a4 92 d4 d0 c6 62 d0 74 54 74 54 58 d4 Capital tau 03a5 93 d5 d1 cb 63 d1 79 55 79 55 59 d5 Capital upsilon 03a6 94 d6 d2 bc 64 d2 66 5d 56 66 56 5a d6 Capital phi 03a7 95 d7 d3 cc 65 d3 78 58 78 57 5b d7 Capital chi 03a8 96 d8 d4 be 66 d4 63 3a 59 63 58 5c d8 Capital psi 03a9 97 d9 d5 bf 67 d5 76 5b 5a 76 59 5d d9 Capital omega 03aa da ab 91 da Capital iota with diaeresis 03ab db bd 96 db Capital upsilon with diaeresis 03ac e1 dc 9b c0 b1 9b dc Small alpha with acute 03ad e2 dd 9d db b2 9d dd Small epsilon with acute 03ae e3 de 9e dc b3 9e de Small eta with acute 03af e5 df 9f dd b5 9f df Small iota with acute 03b0 e0 fc fe fc e0 Small upsilon with acute and diaeresis 03b1 98 e1 d6 e1 8a d6 61 41 61 61 e1 Small alpha 03b2 99 e2 d7 e2 8b d7 62 42 62 62 e2 Small beta 03b3 9a e3 d8 e7 8c d8 63 47 63 64 e3 Small gamma 03b4 9b e4 dd e4 8d dd 64 44 64 65 e4 Small delta 03b5 9c e5 de e5 8e de 65 45 65 66 e5 Small epsilon 03b6 9d e6 e0 fa 8f e0 66 5a 66 69 e6 Small zeta 03b7 9e e7 e1 e8 9a e1 67 48 67 6a e7 Small eta 03b8 9f e8 e2 f5 9b e2 68 55 68 6b e8 Small theta 03b9 a0 e9 e3 e9 9c e3 69 49 69 6c e9 Small iota 03ba a1 ea e4 eb 9d e4 6b 4b 6a 6d ea Small kappa 03bb a2 eb e5 ec 9e e5 6c 4c 6b 6e eb Small lamda 03bc a3 ec e6 ed 9f e6 6d 4d 6c 6f ec Small mu 03bd a4 ed e7 ee aa e7 6e 4e 6d 70 ed Small nu Spinellis Informational [Page 2] RFC 1947 Greek Encoding for E-mail Messages May 1996 03be a5 ee e8 ea ab e8 6f 4a 6e 71 ee Small xi 03bf a6 ef e9 ef ac e9 70 4f 6f 72 ef Small omicron 03c0 a7 f0 ea f0 ad ea 71 50 70 73 f0 Small pi 03c1 a8 f1 eb f2 ae eb 72 52 71 75 f1 Small rho 03c2 aa f2 ed f7 af ed 77 57 72 77 f2 Small final sigma 03c3 a9 f3 ec f3 ba ec 73 53 73 76 f3 Small sigma 03c4 ab f4 ee f4 bb ee 74 54 74 78 f4 Small tau 03c5 ac f5 f2 f9 bc f2 75 59 75 79 f5 Small upsilon 03c6 ad f6 f3 e6 bd f3 76 46 76 7a f6 Small phi 03c7 ae f7 f4 f8 be f4 78 58 77 7b f7 Small chi 03c8 af f8 f6 e3 bf f6 79 43 78 7c f8 Small psi 03c9 e0 f9 fa f6 db fa 7a 56 79 7d f9 Small omega 03ca e4 fa a0 fb b4 a0 fa Small iota with diaeresis 03cb e8 fb fb fc b8 fb fb Small upsilon with diaeresis 03cc e6 fc a2 de b6 a2 fc Small omicron with acute 03cd e7 fd a3 e0 b7 a3 fd Small upsilon with acute 03ce e9 fe fd f1 b9 fd fe Small omega with acute Note: All values are in hexadecimal. The column headers refer to the following character sets: 0646 The ISO 2DIS 10646 code. 37 PC code page 737 also known as 437G. Note that some implementa- tions of this code page do not include capital letters with acute. M7 Character set 8859-7 as implemented in Microsoft Windows 3.1, Microsoft Windows 3.11, and Microsoft Windows 95. 51 IBM code page 851. MC The Greek code page implemented on the Apple Macintosh computers. 23 IBM code page 423 (EBCDIC-CP-GR). 69 IBM code page 869. LG Latin Greek (iso-ir-19). L1 Latin Greek 1 (iso-ir-27). This page only contains the Greek cap- ital letters whose glyphs do not exist in the Latin alphabet. The other capital letters are rendered using the equivalent Latin let- ter (e.g. "Greek capital letter alpha" is rendered as "Latin capi- tal letter A"). When mapping "Latin Greek 1" text to ISO 8859-7 the Latin capital letters should only be transcribed to the equivalent Greek ones if a suitable heuristic determines that the Spinellis Informational [Page 3] RFC 1947 Greek Encoding for E-mail Messages May 1996 specific Latin letters are used to represent Greek glyphs. G7 7 bit Greek (iso-ir-88). GO Old 7 bit Greek (iso-ir-18). GC Greek CCITT (iso-ir-150). 28 Character set ISO 5428:1980 (iso-ir-55). 97 The target character set ISO 8859-7:1987 (ELOT-928) (iso-ir-126). MIME Headers A mail message that contains Greek text must contain at least the following MIME headers: MIME-Version: 1.0 Content-type: text/plain; charset=ISO-8859-7 Content-transfer-encoding: BASE64 | Quoted-Printable In the future, when all email systems implement fully transparent 8-bit e-mail as defined in RFC 1425 and RFC 1426 the message body encoding phase described in this standard will be no longer needed. In this case the requisite MIME headers are modified as follows: MIME-Version: 1.0 Content-type: text/plain; charset=ISO-8859-7 Content-transfer-encoding: 8BIT Even when RFC 1425 is used, Q or B encoding will continue to apply to message headers as detailed in the following section. Optional It is recommended, although not required, to support Greek encod- ing in mail headers as specified in RFC 1522. Specifically, the B-encoding format is to be the default method used for encoding Greek text in RFC-822 mail headers, and the Q-encoding format the method to use for the exceptional case of encoding a single Greek word or letter in an otherwise Latin-character-based header. Spinellis Informational [Page 4] RFC 1947 Greek Encoding for E-mail Messages May 1996 Example Below is a short example of Quoted-Printable encoded Greek email: Date: Wed, 31 Jan 96 20:15:03 EET From: Diomidis Spinellis <[email protected]> Subject: Sample Greek mail To: Achilleas Voliotis <[email protected]> MIME-Version: 1.0 Content-ID: <Wed_Feb_14_18_49_50_EET_1996_0@senanet> Content-Type: Text/plain; charset=ISO-8859-7 Content-Transfer-Encoding: Base64 yuHr5+zd8eEsCgrU7yDl6+vn7enq/CDh6/bc4uf07yDh8O/05evl3/Th6SDh8PwgMjYg4/Hc 7Ozh9OEuCg== Discussion It is possible [RFC1428] (and unfortunately common practice) to set up an arrangement of mail user and transfer agents that allow end users to communicate with Greek e-mail messages while violating a number of standards. Such arrangements are unlikely to offer wide scale interoperability. One common error is to arrange the rendering and composition of Greek messages by rigging a mail user agent hosted in an ISO 8859-1 environment to use a presentation font that contains Greek glyphs and a keyboard input method that generates Greek text using those glyphs. The resulting messages begin with header items indicating contents in the ISO 8859-1 character set and include text in a totally different encoding. Unfortunately this "solution" appears to "work" across similar systems and is widely used. One other error is to tag Greek text generated on Microsoft Windows platforms as ISO 8859-7 without an intermediate translation phase. It is important to note that the character set used by the Microsoft Windows Greek implementations is NOT the same as the ISO 8859-7 representation. First of all, the character set used to represent Greek characters differs slightly from the ISO 8859-7 encoding (this difference was instrumented in order to rectify the appearance of an early version of Microsoft Word for Windows in which the end-of-section symbol clashed with the "Greek capital alpha with acute" glyph). In addition, a number of 8-bit characters available on Greek Windows implementations are not part of the ISO 8859-7 character set. Spinellis Informational [Page 5] RFC 1947 Greek Encoding for E-mail Messages May 1996 Note that the ISO 8859-7 encoding is equivalent to the Greek Standards Organisation ELOT-928 encoding. References [ISO-8859] Information Processing -- 8-bit Single-Byte Coded Graphic Character Sets, Part 7: Latin/Greek alphabet, ISO 8859-7, 1987. [RFC822] Crocker, D., "Standard for the Format of ARPA Internet Text Messages", STD 11, RFC 822, UDEL, August 1982. [RFC1345] Simonsen, K., "Character Mnemonics & Character Sets" RFC 1345, Rationel Almen Planlaegning, June 1992. [RFC1425] Klensin, J., Freed N., Rose M., Stefferud E., and D. Crocker, "SMTP Service Extensions", RFC 1425, United Nations University, Innosoft International, Inc., Dover Beach Consulting, Inc., Network Management Associates, Inc., The Branch Office, February 1993. [RFC1426] Klensin, J., Freed N., Rose M., Stefferud E., and D. Crocker, "SMTP Service Extension for 8bit-MIME Transport", RFC 1426, United Nations University, Innosoft International, Inc., Dover Beach Consulting, Inc., Network Management Associates, Inc., The Branch Office, February 1993. [RFC1428] Vaudreuil, G., "Transition of Internet Mail from Just-Send-8 to 8bit-SMTP/MIME", RFC 1428, CNRI, February 1993. [RFC1521] Borenstein N., and N. Freed, "MIME (Multipurpose Internet Mail Extensions) Part One: Mechanisms for Specifying and Describing the Format of Internet Message Bodies", Bellcore, Innosoft, September 1993. [RFC1522] Moore K., "MIME Part Two: Message Header Extensions for Non-ASCII Text", University of Tennessee, September 1993. Spinellis Informational [Page 6] RFC 1947 Greek Encoding for E-mail Messages May 1996 Security Considerations Security issues are not discussed in this memo. Author's Address Diomidis Spinellis SENA S.A. Kyprou 27 GR-152 47 Filothei GREECE Phone: +30 (1) 6854535 Fax: +30 (1) 6840631 EMail: [email protected] Spinellis Informational [Page 7] Html markup produced by rfcmarkup 1.129c, available from https://tools.ietf.org/tools/rfcmarkup/
{ "url": "https://tools.ietf.org/html/rfc1947", "source_domain": "tools.ietf.org", "snapshot_id": "crawl=CC-MAIN-2019-43", "warc_metadata": { "Content-Length": "27081", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:YIROJ4S77RNJM6QGTUEOQHMFAXE2ICVT", "WARC-Concurrent-To": "<urn:uuid:f3e20c4a-e81a-4e01-88eb-7b73a87cbe29>", "WARC-Date": "2019-10-22T03:12:58Z", "WARC-IP-Address": "4.31.198.62", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:F3FJDSLM4AL4YNXLP2QVHEXE7LL3QLIC", "WARC-Record-ID": "<urn:uuid:3e3c5d90-de20-43c7-8df5-fc5a3550d698>", "WARC-Target-URI": "https://tools.ietf.org/html/rfc1947", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:625d6009-6008-43e2-9b46-0223b649d52e>" }, "warc_info": "isPartOf: CC-MAIN-2019-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-166.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, 64, 65, 79, 80, 153, 226, 299, 300, 301, 364, 365, 385, 386, 459, 530, 557, 558, 580, 581, 648, 717, 787, 859, 925, 998, 1069, 1080, 1081, 1096, 1097, 1170, 1242, 1313, 1385, 1449, 1450, 1520, 1535, 1536, 1595, 1654, 1726, 1794, 1847, 1917, 1988, 2056, 2109, 2177, 2230, 2302, 2375, 2376, 2377, 2378, 2451, 2452, 2453, 2526, 2527, 2528, 2585, 2646, 2706, 2767, 2828, 2891, 2951, 3010, 3071, 3131, 3192, 3253, 3311, 3369, 3427, 3490, 3548, 3607, 3668, 3727, 3790, 3849, 3908, 3967, 4028, 4093, 4150, 4218, 4275, 4345, 4417, 4485, 4554, 4626, 4687, 4746, 4804, 4863, 4922, 4983, 5041, 5098, 5157, 5215, 5274, 5333, 5389, 5445, 5446, 5447, 5448, 5521, 5522, 5523, 5596, 5597, 5598, 5654, 5715, 5771, 5828, 5893, 5952, 6009, 6070, 6127, 6184, 6241, 6300, 6373, 6439, 6496, 6568, 6640, 6710, 6711, 6751, 6752, 6813, 6814, 6845, 6846, 6917, 6990, 6991, 7059, 7115, 7116, 7141, 7142, 7214, 7215, 7255, 7256, 7281, 7282, 7313, 7314, 7387, 7460, 7533, 7606, 7677, 7743, 7815, 7816, 7817, 7818, 7891, 7892, 7893, 7966, 7967, 7968, 8033, 8034, 8065, 8066, 8101, 8102, 8134, 8135, 8182, 8183, 8255, 8256, 8269, 8270, 8342, 8372, 8373, 8406, 8466, 8534, 8535, 8607, 8679, 8745, 8816, 8831, 8864, 8924, 8971, 9044, 9107, 9108, 9118, 9119, 9191, 9262, 9332, 9404, 9476, 9543, 9544, 9545, 9546, 9547, 9548, 9549, 9550, 9551, 9552, 9553, 9554, 9627, 9628, 9629, 9702, 9703, 9704, 9712, 9713, 9778, 9791, 9792, 9843, 9903, 9944, 10013, 10040, 10102, 10156, 10199, 10200, 10273, 10286, 10287, 10298, 10299, 10369, 10441, 10505, 10576, 10620, 10621, 10691, 10758, 10830, 10903, 10971, 11041, 11105, 11177, 11189, 11190, 11256, 11318, 11391, 11460, 11524, 11596, 11668, 11739, 11810, 11877, 11937, 12005, 12006, 12007, 12008, 12009, 12082, 12083, 12084, 12157, 12158, 12159, 12226, 12274, 12275, 12286, 12287, 12359, 12431, 12451, 12452, 12521, 12587, 12588, 12659, 12719, 12720, 12787, 12854, 12924, 12993, 13047, 13048, 13115, 13188, 13248, 13321, 13392, 13412, 13413, 13476, 13547, 13567, 13568, 13640, 13711, 13776, 13826, 13827, 13897, 13969, 13970, 13971, 13972, 13973, 13974, 13975, 13976, 13977, 13978, 13979, 13980, 13981, 14054, 14055, 14056, 14129, 14130, 14131, 14155, 14156, 14207, 14208, 14225, 14226, 14248, 14261, 14274, 14296, 14306, 14307, 14333, 14357, 14391, 14392, 14393, 14394, 14395, 14396, 14397, 14398, 14399, 14400, 14401, 14402, 14403, 14404, 14405, 14406, 14407, 14408, 14409, 14410, 14411, 14412, 14413, 14414, 14415, 14416, 14417, 14418, 14419, 14420, 14421, 14422, 14423, 14424, 14425, 14426, 14427, 14500, 14501, 14502 ], "line_end_idx": [ 64, 65, 79, 80, 153, 226, 299, 300, 301, 364, 365, 385, 386, 459, 530, 557, 558, 580, 581, 648, 717, 787, 859, 925, 998, 1069, 1080, 1081, 1096, 1097, 1170, 1242, 1313, 1385, 1449, 1450, 1520, 1535, 1536, 1595, 1654, 1726, 1794, 1847, 1917, 1988, 2056, 2109, 2177, 2230, 2302, 2375, 2376, 2377, 2378, 2451, 2452, 2453, 2526, 2527, 2528, 2585, 2646, 2706, 2767, 2828, 2891, 2951, 3010, 3071, 3131, 3192, 3253, 3311, 3369, 3427, 3490, 3548, 3607, 3668, 3727, 3790, 3849, 3908, 3967, 4028, 4093, 4150, 4218, 4275, 4345, 4417, 4485, 4554, 4626, 4687, 4746, 4804, 4863, 4922, 4983, 5041, 5098, 5157, 5215, 5274, 5333, 5389, 5445, 5446, 5447, 5448, 5521, 5522, 5523, 5596, 5597, 5598, 5654, 5715, 5771, 5828, 5893, 5952, 6009, 6070, 6127, 6184, 6241, 6300, 6373, 6439, 6496, 6568, 6640, 6710, 6711, 6751, 6752, 6813, 6814, 6845, 6846, 6917, 6990, 6991, 7059, 7115, 7116, 7141, 7142, 7214, 7215, 7255, 7256, 7281, 7282, 7313, 7314, 7387, 7460, 7533, 7606, 7677, 7743, 7815, 7816, 7817, 7818, 7891, 7892, 7893, 7966, 7967, 7968, 8033, 8034, 8065, 8066, 8101, 8102, 8134, 8135, 8182, 8183, 8255, 8256, 8269, 8270, 8342, 8372, 8373, 8406, 8466, 8534, 8535, 8607, 8679, 8745, 8816, 8831, 8864, 8924, 8971, 9044, 9107, 9108, 9118, 9119, 9191, 9262, 9332, 9404, 9476, 9543, 9544, 9545, 9546, 9547, 9548, 9549, 9550, 9551, 9552, 9553, 9554, 9627, 9628, 9629, 9702, 9703, 9704, 9712, 9713, 9778, 9791, 9792, 9843, 9903, 9944, 10013, 10040, 10102, 10156, 10199, 10200, 10273, 10286, 10287, 10298, 10299, 10369, 10441, 10505, 10576, 10620, 10621, 10691, 10758, 10830, 10903, 10971, 11041, 11105, 11177, 11189, 11190, 11256, 11318, 11391, 11460, 11524, 11596, 11668, 11739, 11810, 11877, 11937, 12005, 12006, 12007, 12008, 12009, 12082, 12083, 12084, 12157, 12158, 12159, 12226, 12274, 12275, 12286, 12287, 12359, 12431, 12451, 12452, 12521, 12587, 12588, 12659, 12719, 12720, 12787, 12854, 12924, 12993, 13047, 13048, 13115, 13188, 13248, 13321, 13392, 13412, 13413, 13476, 13547, 13567, 13568, 13640, 13711, 13776, 13826, 13827, 13897, 13969, 13970, 13971, 13972, 13973, 13974, 13975, 13976, 13977, 13978, 13979, 13980, 13981, 14054, 14055, 14056, 14129, 14130, 14131, 14155, 14156, 14207, 14208, 14225, 14226, 14248, 14261, 14274, 14296, 14306, 14307, 14333, 14357, 14391, 14392, 14393, 14394, 14395, 14396, 14397, 14398, 14399, 14400, 14401, 14402, 14403, 14404, 14405, 14406, 14407, 14408, 14409, 14410, 14411, 14412, 14413, 14414, 14415, 14416, 14417, 14418, 14419, 14420, 14421, 14422, 14423, 14424, 14425, 14426, 14427, 14500, 14501, 14502, 14598 ] }
{ "red_pajama_v2": { "ccnet_original_length": 14598, "ccnet_original_nlines": 400, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.13377925753593445, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.05016722157597542, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.29394277930259705, "rps_doc_frac_unique_words": 0.35694316029548645, "rps_doc_mean_word_length": 4.253028869628906, "rps_doc_num_sentences": 94, "rps_doc_symbol_to_word_ratio": 0.00037160998908802867, "rps_doc_unigram_entropy": 6.14107084274292, "rps_doc_word_count": 2146, "rps_doc_frac_chars_dupe_10grams": 0.03900514915585518, "rps_doc_frac_chars_dupe_5grams": 0.09554070234298706, "rps_doc_frac_chars_dupe_6grams": 0.08283115923404694, "rps_doc_frac_chars_dupe_7grams": 0.06727293133735657, "rps_doc_frac_chars_dupe_8grams": 0.06727293133735657, "rps_doc_frac_chars_dupe_9grams": 0.06727293133735657, "rps_doc_frac_chars_top_2gram": 0.01774952933192253, "rps_doc_frac_chars_top_3gram": 0.019940830767154694, "rps_doc_frac_chars_top_4gram": 0.013147800229489803, "rps_doc_books_importance": -1184.0738525390625, "rps_doc_books_importance_length_correction": -1184.0738525390625, "rps_doc_openwebtext_importance": -664.5263061523438, "rps_doc_openwebtext_importance_length_correction": -664.5263061523438, "rps_doc_wikipedia_importance": -466.2273254394531, "rps_doc_wikipedia_importance_length_correction": -466.2273254394531 }, "fasttext": { "dclm": 0.019066449254751205, "english": 0.603986918926239, "fineweb_edu_approx": 2.2338690757751465, "eai_general_math": 0.2951449155807495, "eai_open_web_math": 0.7075735926628113, "eai_web_code": 0.21791982650756836 } }
{ "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.467", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
-1,426,541,937,729,157,600
R/matrix_plot.R Defines functions matrix_plot Documented in matrix_plot #' Draws an image plot of a contact matrix with a legend strip and the numeric values in the cells. #' #' This function combines the R image.plot function with numeric contact rates in the matrix cells. #' #' @param mij a contact matrix containing contact rates between participants of age i (rows) with contacts of age j (columns). This is the default matrix format of [contact_matrix()]. #' @param min.legend the color scale minimum (default = 0). Set to NA to use the minimium value of `mij`. #' @param max.legend the color scale maximum (default = NA). Set to NA to use the maximum value of `mij`. #' @param num.digits the number of digits when rounding the contact rates (default = 2). Use NA to disable this. #' @param num.colors the number of color breaks (default = 50) #' @param main the figure title #' @param legend.width width of the legend strip in characters. Default is 1. #' @param cex.lab size of the x and y labels (default: 1.2) #' @param cex.axis size of the axis labels (default: 0.8) #' @param cex.text size of the numeric values in the matrix (default: 1) #' @param xlab a title for the x axis (default: "Age group (years)") #' @param ylab a title for the y axis (default: "Contact age group (years)") #' @param color.palette the color palette to use (default: [heat.colors()]). Other examples are [topo.colors()], [terrain.colors()] and [hcl.colors()]. User-defined functions are also possible if they take the number of colors to be in the palette as function argument. #' @param ... further arguments to pass to [image.plot()] #' @importFrom fields image.plot #' @importFrom grDevices heat.colors #' @importFrom graphics axis text #' @details This is a function using the basic R graphics to make it easier for users of socialmixr to visualise social contact matrices. #' @export #' @examples #' \dontrun{ #' data(polymod) #' mij <- contact_matrix(polymod, countries = "United Kingdom", age.limits = c(0, 18, 65))$matrix #' matrix_plot(mij) #' } #' @author Lander Willem matrix_plot <- function(mij, min.legend = 0, max.legend = NA, num.digits = 2, num.colors = 50, main, xlab, ylab, legend.width, cex.lab, cex.axis, cex.text, color.palette = heat.colors, ...) { # check funtion arguments xlab <- ifelse(!missing(xlab), xlab, "Age group (year)") ylab <- ifelse(!missing(ylab), ylab, "Contact age group (year)") main <- ifelse(!missing(main), main, "Contact rates") cex.lab <- ifelse(!missing(cex.lab), cex.lab, 1.2) cex.axis <- ifelse(!missing(cex.axis), cex.axis, 0.8) cex.text <- ifelse(!missing(cex.text), cex.text, 1) legend.width <- ifelse(!missing(legend.width), legend.width, 1) # set colors redc <- rev(color.palette(num.colors)) # set legend scale legend_scale <- range(pretty(mij), na.rm = TRUE) if (!is.na(min.legend)) legend_scale[1] <- min.legend if (!is.na(max.legend)) legend_scale[2] <- max.legend # adjust legend breaks breaks <- seq(legend_scale[1], legend_scale[2], length = num.colors + 1) # plot matrix image.plot(mij, col = redc, xlab = xlab, ylab = ylab, main = main, zlim = legend_scale, legend.width = legend.width, cex.lab = cex.lab, breaks = breaks, xaxt = "n", yaxt = "n", ... ) # add axis labels plt_ticks <- seq(0, 1, length = nrow(mij)) axis(2, at = plt_ticks, labels = c(colnames(mij)), cex.axis = cex.axis, tick = FALSE, las = 1) axis(1, at = plt_ticks, labels = c(colnames(mij)), cex.axis = cex.axis, tick = FALSE) # add numeric values if num.digits != NA and cex.text > 0 if (!is.na(num.digits) && !is.na(cex.text) && cex.text > 0) { # format results (rounding/scientific) if (any(max(mij, na.rm = TRUE) > 1)) { mij <- round(mij, digits = num.digits) } else { mij <- format(mij, digits = num.digits) } # get grid centers and add values e_grid <- expand.grid(plt_ticks, plt_ticks) text(e_grid, labels = mij, cex = cex.text) } } Try the socialmixr package in your browser Any scripts or data that you put into this service are public. socialmixr documentation built on Oct. 26, 2023, 9:06 a.m.
{ "url": "https://rdrr.io/cran/socialmixr/src/R/matrix_plot.R", "source_domain": "rdrr.io", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "44390", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:Q7RRHQK32A527BANCTFOIGZAHST2VFST", "WARC-Concurrent-To": "<urn:uuid:ab923d34-557f-47f6-a8b8-a36fa22b1ba6>", "WARC-Date": "2024-05-22T15:14:27Z", "WARC-IP-Address": "51.81.83.12", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:V7L75332ZHWJNC2MSKEMZTGIUJEEVLLT", "WARC-Record-ID": "<urn:uuid:37c8f37b-209d-4bcd-b21a-d44c90b59d59>", "WARC-Target-URI": "https://rdrr.io/cran/socialmixr/src/R/matrix_plot.R", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:fe500bf8-92e7-4773-ac91-2002c18ad138>" }, "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-253\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, 16, 17, 47, 48, 74, 75, 175, 178, 278, 281, 465, 571, 677, 790, 853, 885, 963, 1023, 1081, 1154, 1223, 1300, 1570, 1628, 1661, 1698, 1732, 1870, 1881, 1894, 1907, 1924, 2022, 2042, 2047, 2072, 2264, 2292, 2351, 2418, 2474, 2527, 2583, 2637, 2703, 2704, 2719, 2760, 2761, 2782, 2833, 2889, 2945, 2946, 2971, 3046, 3047, 3063, 3081, 3097, 3114, 3131, 3148, 3173, 3206, 3229, 3250, 3266, 3282, 3290, 3294, 3295, 3315, 3360, 3457, 3545, 3546, 3606, 3670, 3713, 3756, 3801, 3814, 3860, 3866, 3867, 3905, 3953, 4000, 4004, 4006, 4007, 4050, 4051, 4114, 4115 ], "line_end_idx": [ 16, 17, 47, 48, 74, 75, 175, 178, 278, 281, 465, 571, 677, 790, 853, 885, 963, 1023, 1081, 1154, 1223, 1300, 1570, 1628, 1661, 1698, 1732, 1870, 1881, 1894, 1907, 1924, 2022, 2042, 2047, 2072, 2264, 2292, 2351, 2418, 2474, 2527, 2583, 2637, 2703, 2704, 2719, 2760, 2761, 2782, 2833, 2889, 2945, 2946, 2971, 3046, 3047, 3063, 3081, 3097, 3114, 3131, 3148, 3173, 3206, 3229, 3250, 3266, 3282, 3290, 3294, 3295, 3315, 3360, 3457, 3545, 3546, 3606, 3670, 3713, 3756, 3801, 3814, 3860, 3866, 3867, 3905, 3953, 4000, 4004, 4006, 4007, 4050, 4051, 4114, 4115, 4173 ] }
{ "red_pajama_v2": { "ccnet_original_length": 4173, "ccnet_original_nlines": 96, "rps_doc_curly_bracket": 0.0023963600397109985, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.12535080313682556, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.013096350245177746, "rps_doc_frac_lines_end_with_ellipsis": 0.010309279896318913, "rps_doc_frac_no_alph_words": 0.4405986964702606, "rps_doc_frac_unique_words": 0.43195265531539917, "rps_doc_mean_word_length": 5.573964595794678, "rps_doc_num_sentences": 111, "rps_doc_symbol_to_word_ratio": 0.03928906098008156, "rps_doc_unigram_entropy": 4.987814426422119, "rps_doc_word_count": 507, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.06157112866640091, "rps_doc_frac_chars_dupe_6grams": 0.04670913144946098, "rps_doc_frac_chars_dupe_7grams": 0.036093421280384064, "rps_doc_frac_chars_dupe_8grams": 0.036093421280384064, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.007077139802277088, "rps_doc_frac_chars_top_3gram": 0.011677280068397522, "rps_doc_frac_chars_top_4gram": 0.012738849967718124, "rps_doc_books_importance": -495.87847900390625, "rps_doc_books_importance_length_correction": -495.87847900390625, "rps_doc_openwebtext_importance": -265.0845642089844, "rps_doc_openwebtext_importance_length_correction": -265.0845642089844, "rps_doc_wikipedia_importance": -141.46421813964844, "rps_doc_wikipedia_importance_length_correction": -141.46421813964844 }, "fasttext": { "dclm": 0.9393443465232849, "english": 0.3640289604663849, "fineweb_edu_approx": 3.3429746627807617, "eai_general_math": 0.9916095733642578, "eai_open_web_math": 0.6229349970817566, "eai_web_code": 0.9847699999809265 } }
{ "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": "302.2", "labels": { "level_1": "Social sciences", "level_2": "", "level_3": "Social psychology" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "3", "label": "Academic Writing" } }, "reasoning_depth": { "primary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
-6,265,882,051,707,572,000
Skip to content master Go to file Code Latest commit Bumps [junit](https://github.com/junit-team/junit4) from 4.12 to 4.13.1. - [Release notes](https://github.com/junit-team/junit4/releases) - [Changelog](https://github.com/junit-team/junit4/blob/main/doc/ReleaseNotes4.12.md) - [Commits](junit-team/[email protected]) Signed-off-by: dependabot[bot] <[email protected]> Co-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com> 8740500 Git stats Files Permalink Failed to load latest commit information. README.md Proj4J Proj4J is a Java library for converting coordinates between different geospatial coordinate reference systems. It is designed to be compatible with proj.4 parameters and derives some of its implementation from the proj.4 sources. Building, Testing and installing locally mvn clean install You can’t perform that action at this time.
{ "url": "https://github.com/locationtech/proj4j", "source_domain": "github.com", "snapshot_id": "crawl=CC-MAIN-2020-50", "warc_metadata": { "Content-Length": "151401", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:7YKWIDQPLASD5MATAOXIRC6IMGOSTOXU", "WARC-Concurrent-To": "<urn:uuid:118f882a-5852-4f7f-94ae-8f0a822e20f4>", "WARC-Date": "2020-11-30T09:05:20Z", "WARC-IP-Address": "140.82.113.4", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:2PSK2MXK64CAZA7K2DN75Z7NUVOUFFQM", "WARC-Record-ID": "<urn:uuid:be167fe0-e98d-4fd3-ba47-0fbfbcecb8fe>", "WARC-Target-URI": "https://github.com/locationtech/proj4j", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:f77702d8-18d2-44a5-bc8a-4b1f6e4629d9>" }, "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-29.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 16, 23, 34, 39, 40, 54, 55, 128, 193, 279, 326, 327, 379, 380, 464, 472, 473, 483, 484, 490, 491, 501, 543, 544, 554, 555, 562, 563, 793, 794, 835, 836, 854, 855 ], "line_end_idx": [ 16, 23, 34, 39, 40, 54, 55, 128, 193, 279, 326, 327, 379, 380, 464, 472, 473, 483, 484, 490, 491, 501, 543, 544, 554, 555, 562, 563, 793, 794, 835, 836, 854, 855, 898 ] }
{ "red_pajama_v2": { "ccnet_original_length": 898, "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.1538461446762085, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0045248898677527905, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.4162895977497101, "rps_doc_frac_unique_words": 0.8636363744735718, "rps_doc_mean_word_length": 8, "rps_doc_num_sentences": 24, "rps_doc_symbol_to_word_ratio": 0.0045248898677527905, "rps_doc_unigram_entropy": 4.259864807128906, "rps_doc_word_count": 88, "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.034090910106897354, "rps_doc_frac_chars_top_3gram": 0, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -83.19318389892578, "rps_doc_books_importance_length_correction": -83.19318389892578, "rps_doc_openwebtext_importance": -42.30266189575195, "rps_doc_openwebtext_importance_length_correction": -33.26124954223633, "rps_doc_wikipedia_importance": -29.888303756713867, "rps_doc_wikipedia_importance_length_correction": -29.888303756713867 }, "fasttext": { "dclm": 0.022130370140075684, "english": 0.7116991281509399, "fineweb_edu_approx": 1.4577547311782837, "eai_general_math": 0.0020191099029034376, "eai_open_web_math": 0.07700949907302856, "eai_web_code": -0.0000036999999792897142 } }
{ "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": "526.01", "labels": { "level_1": "Science and Natural history", "level_2": "Astronomy", "level_3": "Geodesy" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "17", "label": "Product Page" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
-4,822,339,375,007,291,000
Export (0) Print Expand All Integration Services Paths A path connects two components in a data flow by connecting the output of one data flow component to the input of another component. A path has a source and a destination. For example, if a path connects an OLE DB source and a Sort transformation, the OLE DB source is the source of the path, and the Sort transformation is the destination of the path. The source is the component where the path starts, and the destination is the component where the path ends. The SSIS Designer provides the Data Flow Path Editor dialog box for setting path properties, viewing the metadata of the data columns that pass through the path, and configuring data viewers. The configurable path properties include the name, description, and annotation of the path. You can also configure paths programmatically. For more information, see Connecting Data Flow Components Programmatically. A path annotation displays the name of the path source or the path name on the design surface of the Data Flow tab in SSIS Designer. Path annotations are similar to the annotations you can add to data flows, control flows, and event handlers. The only difference is that a path annotation is attached to a path, whereas other annotations appear on the Data Flow, Control Flow, and Event Handler tabs of SSIS Designer. The metadata shows the name, data type, precision, scale, length, code page, and source component of each column in the output of the previous component. The source component is the data flow component that created the column. This may or may not be the first component in the data flow. For example, the Union All and Sort transformations create their own columns, and they are the sources of their output columns. In contrast, a Copy Column transformation can pass through columns without changing them or can create new columns by copying input columns. The Copy Column transformation is the source component only of the new columns. If you run a package in SSIS Designer, you can view the data in a data flow by attaching data viewers to a path. A data viewer can be configured to display data in a grid, histogram, scatter plot, or column chart. A data viewer is a useful debugging tool. For more information, see Debugging Data Flow. You can set properties through SSIS Designer or programmatically. For more information about the properties that you can set in the Data Flow Path Editor dialog box, click one of the following topics: For more information about the properties that you can set programmatically, see Path Properties. For more information about how to set the properties, click one of the following topics: Was this page helpful? (1500 characters remaining) Thank you for your feedback Community Additions ADD Show: © 2014 Microsoft
{ "url": "http://technet.microsoft.com/en-us/library/ms139791(v=sql.90).aspx", "source_domain": "technet.microsoft.com", "snapshot_id": "crawl=CC-MAIN-2014-52", "warc_metadata": { "Content-Length": "50272", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:JYHYL4PKOIQK47SSL7WQXMUIIIYYOHMO", "WARC-Concurrent-To": "<urn:uuid:4189dc49-15a2-4239-beb2-828b355782ff>", "WARC-Date": "2014-12-17T20:36:55Z", "WARC-IP-Address": "157.56.148.23", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:JM2YE74K42ZJ7O7RMRKKRNWUOGG3BBZ2", "WARC-Record-ID": "<urn:uuid:1b98abe4-ede1-4652-995c-900153ac39cb>", "WARC-Target-URI": "http://technet.microsoft.com/en-us/library/ms139791(v=sql.90).aspx", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:76a6fbc8-3acc-4140-aaf9-1b7638b43690>" }, "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, 17, 28, 29, 56, 57, 519, 520, 712, 713, 928, 929, 1347, 1348, 1985, 1986, 2289, 2290, 2356, 2357, 2492, 2493, 2591, 2592, 2681, 2682, 2705, 2733, 2761, 2762, 2782, 2783, 2787, 2793 ], "line_end_idx": [ 17, 28, 29, 56, 57, 519, 520, 712, 713, 928, 929, 1347, 1348, 1985, 1986, 2289, 2290, 2356, 2357, 2492, 2493, 2591, 2592, 2681, 2682, 2705, 2733, 2761, 2762, 2782, 2783, 2787, 2793, 2809 ] }
{ "red_pajama_v2": { "ccnet_original_length": 2809, "ccnet_original_nlines": 33, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.37406015396118164, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.028195489197969437, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.12406014651060104, "rps_doc_frac_unique_words": 0.3361701965332031, "rps_doc_mean_word_length": 4.817021369934082, "rps_doc_num_sentences": 25, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.417884349822998, "rps_doc_word_count": 470, "rps_doc_frac_chars_dupe_10grams": 0.043286219239234924, "rps_doc_frac_chars_dupe_5grams": 0.1289752721786499, "rps_doc_frac_chars_dupe_6grams": 0.11749117076396942, "rps_doc_frac_chars_dupe_7grams": 0.06978798657655716, "rps_doc_frac_chars_dupe_8grams": 0.043286219239234924, "rps_doc_frac_chars_dupe_9grams": 0.043286219239234924, "rps_doc_frac_chars_top_2gram": 0.038869261741638184, "rps_doc_frac_chars_top_3gram": 0.02915194071829319, "rps_doc_frac_chars_top_4gram": 0.03047703020274639, "rps_doc_books_importance": -118.12366485595703, "rps_doc_books_importance_length_correction": -118.12366485595703, "rps_doc_openwebtext_importance": -155.61875915527344, "rps_doc_openwebtext_importance_length_correction": -155.61875915527344, "rps_doc_wikipedia_importance": -115.35974884033203, "rps_doc_wikipedia_importance_length_correction": -115.35974884033203 }, "fasttext": { "dclm": 0.02243030071258545, "english": 0.8498606085777283, "fineweb_edu_approx": 2.976794719696045, "eai_general_math": 0.8097870945930481, "eai_open_web_math": 0.3345029354095459, "eai_web_code": 0.2964503765106201 } }
{ "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": "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": "2", "label": "Click Here References" }, "secondary": { "code": "0", "label": "No missing content" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
4,294,000,514,796,096,000
Chapter 1. About This Book 1.1. Why This Book Soon after its introduction, C++ became a de facto standard in object-oriented programming. This led to the goal of standardization. Only by having a standard could programs be written that would run on different platforms — from PCs to mainframes. Furthermore, a standard library would enable programmers to use general components and a higher level of abstraction without losing portability rather than having to develop all code from scratch. Now, with the second standard, called C++11 (see Section 2.1, page 7, for the detailed history of C++ standards), we have a huge C++ standard library whose specification requires more than double the size of the core language features. The library enables the ... Get The C++ Standard Library: A Tutorial and Reference, Second Edition now with O’Reilly online learning. O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.
{ "url": "https://www.oreilly.com/library/view/the-c-standard/9780132978286/ch01.html", "source_domain": "www.oreilly.com", "snapshot_id": "crawl=CC-MAIN-2020-45", "warc_metadata": { "Content-Length": "34182", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:ABUAGSMYIDD4QLOSHTW4XZP7G35ZRFFV", "WARC-Concurrent-To": "<urn:uuid:dc033669-ca26-4bac-a1e0-0a912cd897f3>", "WARC-Date": "2020-10-25T17:29:31Z", "WARC-IP-Address": "23.78.200.188", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:76X44SEXBBUT47H6HUTS5HPP22L77HX2", "WARC-Record-ID": "<urn:uuid:1ae3ed06-52a0-4517-a8d0-d8eaf716764c>", "WARC-Target-URI": "https://www.oreilly.com/library/view/the-c-standard/9780132978286/ch01.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:cb945ffe-c21e-4610-ba67-7014e7e15c16>" }, "warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-44.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 27, 28, 47, 48, 494, 495, 759, 760, 866, 867 ], "line_end_idx": [ 27, 28, 47, 48, 494, 495, 759, 760, 866, 867, 978 ] }
{ "red_pajama_v2": { "ccnet_original_length": 978, "ccnet_original_nlines": 10, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2916666567325592, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0416666716337204, "rps_doc_frac_lines_end_with_ellipsis": 0.09090909361839294, "rps_doc_frac_no_alph_words": 0.2239583283662796, "rps_doc_frac_unique_words": 0.7105263471603394, "rps_doc_mean_word_length": 5.138157844543457, "rps_doc_num_sentences": 12, "rps_doc_symbol_to_word_ratio": 0.005208330228924751, "rps_doc_unigram_entropy": 4.479923248291016, "rps_doc_word_count": 152, "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.05761843919754028, "rps_doc_frac_chars_top_3gram": 0.040973108261823654, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -72.39614868164062, "rps_doc_books_importance_length_correction": -72.39614868164062, "rps_doc_openwebtext_importance": -43.4708137512207, "rps_doc_openwebtext_importance_length_correction": -29.58910369873047, "rps_doc_wikipedia_importance": -24.577030181884766, "rps_doc_wikipedia_importance_length_correction": -24.577030181884766 }, "fasttext": { "dclm": 0.14080482721328735, "english": 0.9120442867279053, "fineweb_edu_approx": 2.448979139328003, "eai_general_math": 0.48830556869506836, "eai_open_web_math": 0.09418296813964844, "eai_web_code": 0.2930498719215393 } }
{ "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": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "1", "label": "Truncated Snippets" }, "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": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
8,776,822,253,359,159,000
Blockchain Forks | Paul Puey Welcome to the “Blockchain Forks” with Paul Puey. This presentation was delivered on Friday, August 30th 2019. This session will help you understand the implications of a hard fork, what exactly it means, and how it affects the average bitcoin and cryptocurrency user. This session is suitable for a non-technical crowd and will go over the differences between hard forks such as Bitcoin Cash, Bitcoin SV, and Ethereum Classic. You will get a thorough understanding of what replay attacks are and the various forms of replay protection that can and have been implemented to minimize the impact of hard forks. Most importantly, you will learn how to prevent possible loss of funds with proper pre- and post-fork precautions on various wallet types. ==== Paul Puey (@paullinator) is the CEO and Co-Founder of Edge (formerly Airbitz), a non-custodial exchange and security platform for blockchain applications. He held lead engineering positions with Nvidia and Chromatic Research and holds a BS in Electrical Engineering and Computer Science from UC Berkeley. Update Steve Rich's Exciting New Book: A Journey into the World of Forex Trading! Interview Follow the CryptoCurrency Certification Consortium (C4) at: https://cryptoconsortium.org/ https://twitter.com/_CFour_ Follow the Blockchain Training Conference at: https://blockchaintraining.org https://twitter.com/TrainBlockchain Note: Downloadable slides for this presentation are not available.
{ "url": "https://www.steverichfx.com/blockchain-forks-paul-puey/", "source_domain": "www.steverichfx.com", "snapshot_id": "CC-MAIN-2024-10", "warc_metadata": { "Content-Length": "74225", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:7Y7TCCD4AF7DSASSD3FRBNRZDJHEQSPQ", "WARC-Concurrent-To": "<urn:uuid:0ff3058b-48bf-4dbe-b7da-0294ce899d69>", "WARC-Date": "2024-02-21T21:38:04Z", "WARC-IP-Address": "107.6.164.183", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:PMOAHKIV6GW2LDAWGJOK7X5VLMTEO6SP", "WARC-Record-ID": "<urn:uuid:3ba09517-cabd-4bb6-b058-0ea2d5f62ff9>", "WARC-Target-URI": "https://www.steverichfx.com/blockchain-forks-paul-puey/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:0f3c7481-c201-457e-98d9-03e74f4c8bf3>" }, "warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-69\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, 30, 141, 142, 779, 780, 785, 786, 1091, 1092, 1099, 1100, 1175, 1176, 1186, 1187, 1247, 1277, 1305, 1306, 1352, 1383, 1419, 1420 ], "line_end_idx": [ 29, 30, 141, 142, 779, 780, 785, 786, 1091, 1092, 1099, 1100, 1175, 1176, 1186, 1187, 1247, 1277, 1305, 1306, 1352, 1383, 1419, 1420, 1486 ] }
{ "red_pajama_v2": { "ccnet_original_length": 1486, "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.3369963467121124, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.021978020668029785, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.17582418024539948, "rps_doc_frac_unique_words": 0.6635071039199829, "rps_doc_mean_word_length": 5.706161022186279, "rps_doc_num_sentences": 14, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.685159206390381, "rps_doc_word_count": 211, "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.01993354968726635, "rps_doc_frac_chars_top_3gram": 0, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -122.13221740722656, "rps_doc_books_importance_length_correction": -114.37004852294922, "rps_doc_openwebtext_importance": -88.35832214355469, "rps_doc_openwebtext_importance_length_correction": -88.35832214355469, "rps_doc_wikipedia_importance": -52.28622817993164, "rps_doc_wikipedia_importance_length_correction": -41.19898223876953 }, "fasttext": { "dclm": 0.055976688861846924, "english": 0.8872821927070618, "fineweb_edu_approx": 2.014652967453003, "eai_general_math": 0.030055219307541847, "eai_open_web_math": 0.2565702199935913, "eai_web_code": 0.0008933499921113253 } }
{ "free_decimal_correspondence": { "primary": { "code": "004.072", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "332.874", "labels": { "level_1": "Social sciences", "level_2": "Economics", "level_3": "Finance" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "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": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
-2,660,343,743,361,135,000
1. 31 1. 8 In C++, this can be done in zero-copy fashion with string_view. In C, every string has to be null-terminated. Thus, you need to either manipulate the original buffer, or copy it over. I elected the latter. I don’t see the reasoning behind using C instead of Rust or C++, but of course you can define a string view/slice type in C (struct { size_t len; char *s; }). Sure, it won’t be interoperable with the standard string manipulation functions (except printf %.*s and sometimes maybe some strn* functions), but forcing usage of different functions should be fine in high performance applications. Also: simdcsv 1. 2 I wonder how pandas’ CSV parser (which is pretty optimized) compares. Whenever I have to parse huge CSV files in Python, I use pandas just for that. 1. 3 I’ve never benchmarked pandas in particular, but have loosely benchmarked Python’s CSV parser. The inherent problem is measurement. What is your benchmark? Let’s say your benchmark is to count the sum of the lengths of all the fields. Well, that means Python will need to materialize objects for every record and every field. And that is probably what’s going to either dominate or greatly impact the benchmark, even if the underlying parser is written in C and could theoretically go faster. Pandas’ CSV parser is written in C, and if the comment at the top is true, it’s derived from Python’s csv module. Like the csv module, Pandas’ CSV parser is your run of the mill NFA embedded in code. This is about twice as slow as using a DFA, which is what my CSV parser uses. And the DFA approaches are slower than more specialized SIMD approaches. I’m less sure about the OP’s approach. 1. 2 Thanks! Love Ripgrep! I tried cargo build --release and time ./target/release/xsv index /tmp/DOHUI_NOH_scaled_data.csv, it took about 24 seconds for index to complete (I assume xsv index find all begins / ends of all cells, which approximately is what I am trying to do here for csv parsing). Didn’t do xsv entirely due to my unfamiliarity to Rust ecosystem. Sorry! 1. 1 Thanks. How do I run an equivalent benchmark using your CSV parser? I don’t think I see any instructions. 1. 1 It is not packaged separately, and ccv can be built with zero-dependency (meaning you may not have OpenMP enabled) so it is a bit more involved to make sure OpenMP is enabled. You can first install apt install libomp-dev clang, and then checkout https://github.com/liuliu/ccv repo. cd lib && ./configure to configure it with OpenMP (there should be a USE_OPENMP macro enabled, configure script should give you exact output of flags). cd ../bin/nnc && make -j would compile the demo csv program under ./bin/nnc 2. 1 Recently the guys from Julia started claiming that they have the fastest parser (link). 1. 4 It kind of looks like Julia’s CSV parser is cheating: https://github.com/JuliaData/CSV.jl/blob/9f6ef108d195f85daa535d23d398253a7ca52e20/src/detection.jl#L304-L309 It’s doing parallel parsing, but I’m pretty sure their technique won’t work for all inputs. Namely, they try to hop around the CSV data and chunk it up, and then parse each chunk in a separate thread AIUI. But you can’t do this in general because of quoting. If you read the code around where I linked, you can see they try to be a bit speculative and avoid common failures (“now we read the next 5 rows and see if we get the right # of columns”), but that isn’t going to be universally correct. It might be a fair trade off to make, since CSV data that fails there is probably quite rare. But either I’m misunderstanding their optimization or they aren’t being transparent about it. I don’t see this downside anywhere in the README or the benchmark article. 3. 1 I’d be really interested to see how this compares to the approach available in the Haskell hw-dsv library. The benchmarks show much slower performance than discussed in the article, but the benefit hw-dsv is that it can generate extremely efficient indices, with an overhead of (IIRC) just over 1% of the size of the input CSV. If you know you need to look at the data multiple times, then the overhead of generating the rank-select indices should be offset by having constant time indexing into any cell in the CSV in the future. 1. 1 Why don‘t you use Dask or Apache Spark? They all read csv files in parallel. cudf does it even with the help of the GPU, reading from disk directly into GPU memory. It‘s an interesting article nonetheless :) 1. 6 I am not the author, but because it’s an interesting engineering problem? I’d rather read something like this than how to install and run Spark. 1. 1 I get that and that‘s why I said it‘s an interesting read, but the author should‘ve at least mentioned or even benchmarked already parallized implementations 1. 5 I’ve been working on CSV stuff for a long time (I’m the author of xsv), and I’ve never even heard of cudf. So I wouldn’t fault the OP. And just from quickly glancing at cudf, benchmarking its CSV parser looks non-trivial because the happy path is to go through Python. So you’d have to be really careful there. And what happens if the task you want to do with the CSV data can’t be done on the GPU? Similarly, I’ve never used Apache Spark. How much time, effort and work would be required to get up to speed on how it works and produce a benchmark you’d be confident in? Moreover, if I want to use a CSV library in C++ in my application, is Apache Spark really a reasonable choice in that circumstance? 1. 1 I didn‘t want to be rude. From my perspective (mainly data science) everything is obvious and the tools I mentioned are very popular. I think the main difference between our „views“ is that the post focused on libraries and I‘m focused on frameworks. The solutions I proposed are fully fledged data processing frameworks like Pandas, R dataframes if you know those. Its basically Excel as a programming framework, but much faster and more capable. The abstraction level usually is very high. You would not iterate over rows in a column, but apply a function to the whole column. These are no solutions to be just used for their csv implementation, but as the solution for a complete data processing pipeline. And what happens if the task you want to do with the CSV data can’t be done on the GPU? cudf, dask and pandas all belong to the Python scientific ecosystem and are well integrated. You would convert it to Dask or pandas (numpy, cupy). Spark belongs to the Hadoop ecosystem and is used by many companies to process large amounts of data. Again nobody would use it just for the csv implementation. because the happy path is to go through Python In all frameworks Python is just glue code. All numeric code is written in faster languages. 1. 2 No worries. I get all of that. I guess my comment was more a circuitous response to your initial question: “why not use {tools optimized for data science pipelines}” where the OP is more specifically focused on a csv library. But I also tried to address it by pointing out that a direct comparison at the abstraction level on display in the OP is quite difficult on its own. But yeah, while I’m aware that data science has csv parsers in them, and they are probably formidable in their own right in terms of speed, I’m also aware that they are optimized for data science. Pandas is a good example, because its API is clearly optimized for cases where all of the data fits into memory. While the API has some flexibility there, it’s clear in my mind that it won’t and isn’t supposed to be a general purpose csv library. It may seem like a cop-out, but constraints will differ quite a bit which typically influences the design space of the implementation. 2. 1 Dask is an interesting omission, definitely on me! It would be tricky to do though, as @burntsushi pointed out. Dask tries to be as lazy as possible, and that can be a real challenge. OTOH, Pandas’ csv implementation is uninteresting. It is the reason I started to explore in the first place (it drives me crazy to save / load csv in Pandas!). I love Pandas for other reasons. As of Spark, I simply don’t know it has an interesting csv reader implementation!
{ "url": "https://lobste.rs/s/zksa0f/loading_csv_file_at_speed_limit_nvme", "source_domain": "lobste.rs", "snapshot_id": "crawl=CC-MAIN-2022-49", "warc_metadata": { "Content-Length": "38565", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:GFPXGLD5CZ6SYFK7VL7VMKRIPMFDSGLG", "WARC-Concurrent-To": "<urn:uuid:17a5fbd0-4a07-4e60-bd72-a8011e677ef8>", "WARC-Date": "2022-12-01T16:32:09Z", "WARC-IP-Address": "67.205.128.5", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:4ZPMHSCD3L5WQYZCJXFDPOPFL5OVTFIZ", "WARC-Record-ID": "<urn:uuid:67c03bba-de27-4a0a-a7dc-94dedd4f96d0>", "WARC-Target-URI": "https://lobste.rs/s/zksa0f/loading_csv_file_at_speed_limit_nvme", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:dd60fb7a-d62c-4ffc-ad2d-3d1f983f54ba>" }, "warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-177\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 8, 15, 16, 226, 227, 623, 624, 625, 643, 644, 653, 654, 809, 810, 821, 822, 1323, 1324, 1722, 1723, 1736, 1737, 2040, 2041, 2124, 2125, 2140, 2141, 2259, 2260, 2277, 2278, 2468, 2469, 2817, 2818, 2831, 2832, 2930, 2931, 2946, 2947, 3122, 3123, 3631, 3632, 3907, 3908, 3921, 3922, 4463, 4464, 4479, 4480, 4700, 4701, 4718, 4719, 4878, 4879, 4898, 4899, 5073, 5074, 5095, 5096, 5249, 5250, 5532, 5533, 5855, 5856, 5879, 5880, 6609, 6610, 6718, 6719, 6886, 6887, 7068, 7069, 7136, 7137, 7250, 7251, 7276, 7277, 7674, 7675, 8276, 8277, 8296, 8297, 8690, 8691 ], "line_end_idx": [ 8, 15, 16, 226, 227, 623, 624, 625, 643, 644, 653, 654, 809, 810, 821, 822, 1323, 1324, 1722, 1723, 1736, 1737, 2040, 2041, 2124, 2125, 2140, 2141, 2259, 2260, 2277, 2278, 2468, 2469, 2817, 2818, 2831, 2832, 2930, 2931, 2946, 2947, 3122, 3123, 3631, 3632, 3907, 3908, 3921, 3922, 4463, 4464, 4479, 4480, 4700, 4701, 4718, 4719, 4878, 4879, 4898, 4899, 5073, 5074, 5095, 5096, 5249, 5250, 5532, 5533, 5855, 5856, 5879, 5880, 6609, 6610, 6718, 6719, 6886, 6887, 7068, 7069, 7136, 7137, 7250, 7251, 7276, 7277, 7674, 7675, 8276, 8277, 8296, 8297, 8690, 8691, 8788 ] }
{ "red_pajama_v2": { "ccnet_original_length": 8788, "ccnet_original_nlines": 96, "rps_doc_curly_bracket": 0.0004551699967123568, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4290502667427063, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04972067102789879, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.1798882633447647, "rps_doc_frac_unique_words": 0.3854239583015442, "rps_doc_mean_word_length": 4.499649524688721, "rps_doc_num_sentences": 111, "rps_doc_symbol_to_word_ratio": 0.0011173200327903032, "rps_doc_unigram_entropy": 5.595807075500488, "rps_doc_word_count": 1427, "rps_doc_frac_chars_dupe_10grams": 0.020869020372629166, "rps_doc_frac_chars_dupe_5grams": 0.039246220141649246, "rps_doc_frac_chars_dupe_6grams": 0.039246220141649246, "rps_doc_frac_chars_dupe_7grams": 0.032705191522836685, "rps_doc_frac_chars_dupe_8grams": 0.032705191522836685, "rps_doc_frac_chars_dupe_9grams": 0.032705191522836685, "rps_doc_frac_chars_top_2gram": 0.004983650054782629, "rps_doc_frac_chars_top_3gram": 0.007475470192730427, "rps_doc_frac_chars_top_4gram": 0.005295129958540201, "rps_doc_books_importance": -623.2014770507812, "rps_doc_books_importance_length_correction": -623.2014770507812, "rps_doc_openwebtext_importance": -407.97943115234375, "rps_doc_openwebtext_importance_length_correction": -407.97943115234375, "rps_doc_wikipedia_importance": -411.30377197265625, "rps_doc_wikipedia_importance_length_correction": -411.30377197265625 }, "fasttext": { "dclm": 0.3989584445953369, "english": 0.9265134334564209, "fineweb_edu_approx": 1.7657382488250732, "eai_general_math": 0.9232826828956604, "eai_open_web_math": 0.317760705947876, "eai_web_code": 0.4600922465324402 } }
{ "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": "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": "-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": "5", "label": "Comment Section" }, "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" } } }
ece34605c058195ed03b4d393ef1a36c
-7,139,553,082,530,484,000
Are you one of those people who wonder what the different types of hackers are and why they’re classified based on their hat color? hacker (1) You might not know that hackers’ hat colors can be traced back to the good old days when Western movies were super popular, the bad guys wore black, and the good men wore white hats. .Hackers are now wearing the colors of their hats as a symbol of their trade. The top hat and bowler hat have green and purple pom-poms, respectively. This is a brilliant illustration of the unseen connections in our world. There are six famous hackers hat colors and they are: 1. Black Hat Hackers 2. White Hat Hackers 3. Grey Hat Hackers 4. Red Hat Hackers 5. Blue Hat Hackers 6. Green Hat Hackers In the world of hacking there are six different colors that you can be, which usually indicates what you are going to do in order to hack into a system. These colors range from Black Hat hackers, who break into systems with a malicious intent, all the way through to Green Hat hackers who are trying to improve a system by getting in and learning how it works. .  BLACK HAT HACKERS Black hat hackers have often been known for breaking into computers and networks without permission. However, they are also sometimes referred to as white-hat hackers because they use their skills for good purposes. The term “black hat hackers” is defined as malicious cybercriminals who use illegal and destructive tactics to infiltrate systems and make profits. Black hat hackers are just one type of cybercriminal. Black hat hackers have been around for years, but in more recent years, their prevalence has increased due to technological developments that serve as a benefit to them. While the powerful innovations in technology are making it easier for black hat hackers to break into computer systems, this is causing companies to keep a more vigilant stance on cybersecurity. To avoid losing valuable data and important resources, it’s important that you work together with your company experts to ensure that your company doesn’t fall prey to such problems. Many new developments have occurred over the past few years, one of which is a deep dive into preventing organizations from having their sites hacked by black hat hackers. Implementing a cybersecurity program can be an effective way to keep employees safe and secure. You’ll need to partner with a third party like data protection professionals to make this happen, but the benefit will be worth it. Hackers who use Black Hat techniques are only able to do so by using malicious intent, work to destroy data, and hold a business or individual for ransom. They steal confidential personal information in order to make it more difficult for them. The Dark Web is a market for illegal products and services, everything from hacking tools to weapons &amp; drugs . It’s difficult or impossible to know what these tools might be used for. Anyone who begins their career in AI should make sure they understand the potential risks. A renowned hacker named Mike Calce launched the Project Rivolta series of attacks on websites like Amazon, CNN, Yahoo, and FIFA – bringing these sites to a standstill. This hacker didn’t reveal his identity for years until high school. It was then revealed that he had evidence of a crime to an online chat room. Because of the evidence against him, he served 8 months in jail when it was already too late for him to prove he was not involved.  WHITE HAT HACKERS There are many types of hackers in the world, but they all have one thing in common: the desire to help keep their computers and networks secure. They’ve been called white hat hackers or ethical hackers because they purposefully avoid illegal activities such as stealing information or causing damage. Hacking is usually harmless, and groups often follow the law when doing it. They use open-source software and authorized systems and programs to conduct research. Bug bounty programs are, as the name implies, programs in which companies pay people to find security flaws. AI writers can help detect these flaws before they become a problem. They also aid in overall protection of the company’s wellbeing and security. Kevin Mitnick is credited with being one of the most famous white hat hackers in history. He was on the FBI’s list of most wanted for hacking into over 40 major corporations. Kevin Mitnick was once one of the most infamous cybercriminals. He spent a few years in jail and now recommends companies Cybersecurity solutions and trusted consultants to government. He is CEO &amp; Chief “White Hat” Hacker of Mitnick Security Consulting Inc., an Advanced boutique security firm worldwide. GREY HAT HACKERS Grey hat hackers find bugs and vulnerabilities in software and networks. They might not tell the owners of those networks, but when they find problems, they go out of their way to fix them rather than exploit them. Unfortunately, most organizations are more inclined to trust white hat hackers as they see their entrance and exploration as a sign of security and protection. A “Gray Hat” hacker released a private conversation on Mark Zuckerberg’s Facebook page, faked his identity to post, and hopes to get more press so he can show off a vulnerability he found. The motives behind this are a little ambiguous, but overall it seems less harmful than traditional hacking means. Since our author found a loophole in Facebook that could have been exploited, the social network eventually fixed it and ensured it wouldn’t happen again. Facebook’s decision to not compensate Khalil is questionable. They did a lot of good and saved millions in the process, but this decision didn’t offer any recognition or reward – which seems counterintuitive. RED HAT HACKERS (HACKTIVISTS) Red Hat hackers are a distinct and separate entity than white hat hackers. They have the same goals as white, but they have the skills of black hat hackers. They also have a different motive- they’re trying to identify and dismantle attackers, regardless if they are attacking with DDoS waves or conventional malware/viruses. Red Hat hackers can disguise their location while they move throughout. The most famous example of politically motivated hackers is the infamous group “Anonymous.” The most well-known example of an Anonymous cyberattack was one that affected PayPal in 2011. They have also been a part of political turmoil by threatening, causing, or claiming to have caused damage. Anonymous has gained quite a reputation for the way they operate. People think of them as acting out of chaotic impulses rather than deliberate actions–and for good reason. Recently, Anonymous is known to have threatened to release documents from the Russian government during their war with Ukraine and in Operation Tunisia, which was against the various governments involved. BLUE HAT HACKERS (PENETRATION TESTERS) Hacking software development in a way that doesn’t cause damage is what blue hat hackers do best. Many companies have begun to hire these “ethical” hackers to test out their software before publishing it or selling it on the market. They are becoming increasingly common for a good reason. Microsoft was well known for its sustainable “blue hat” initiatives. Microsoft finds bugs in software products, helps them identify vulnerabilities and develop solutions before providing a platform for hackers to test. GREEN HAT HACKERS (NEOPHYTE OR NOOB ATTACKERS) Green hat hackers sometimes confuse newbies with script kiddies. They are considered to be skilled hackers because they don’t rely on scripts, but kids who buy attacks. Green hats are determined to learn, and in the meantime launch their hacks while trying not to make mistakes. These guys provide both content &amp; quality that is necessary for your business needs! They’re eager to learn and try different strategies. This can be dangerous for your business, so it’s important you watch them closely. A 13-year-old boy, David Dennis, learned how to write a new command on PLATO terminals. It would cause terminals to lock up – requiring a shutdown and power down. The most-used attack for computers over the last 45 years is to simply power down user machines. This form of attack is not new and has been around for a long time, but it’s becoming more prevalent and much more damaging now. HOW TO BEAT HACKERS DDoS and DDoS attacks increase in popularity because hackers exploit vulnerable networks for profit. Hackers neglect their own security to focus on the attack rather than getting an answer. With the importance of networks increasing, businesses are left vulnerable to attacks like DDOS. The solutions they’re provided with to fix the issue don’t turn on and off as they should, leaving them with a 48% risk of being taken down. The best way to mitigate the risk of DDoS hits is by ensuring your DDoS protection is adequate. As long as you take the necessary precautions, it’s difficult for potential hackers to find your weaknesses. BLOG related articles Eget nulla phasellus odio sit porttitor enatibus aliquam blandit gravida ultricies eleifend varius tempor vulputate malesuada tristique. comments post a comment Eget nulla phasellus odio sit porttitor enatibus aliquam blandit gravida ultricies eleifend varius tempor vulputate malesuada tristique. Leave a Reply Your email address will not be published.
{ "url": "https://www.lectron.com/are-you-one-of-those-people-who-wonder-what-the-different-types-of-hackers-are-and-why-theyre-classified-based-on-their-hat-color/", "source_domain": "www.lectron.com", "snapshot_id": "crawl=CC-MAIN-2022-49", "warc_metadata": { "Content-Length": "154313", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:M27DCRXFGDMSYQK643GYYFXDPRF4NGGY", "WARC-Concurrent-To": "<urn:uuid:86022d33-6dd1-4630-a7ce-4de7e12b3eb7>", "WARC-Date": "2022-12-09T23:04:23Z", "WARC-IP-Address": "104.18.24.140", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:ZAVNYAIVSD2CKZVKGNJ46MUMRTQNCPGV", "WARC-Record-ID": "<urn:uuid:3fbd9694-70e5-475c-ae62-945ec2e20d1a>", "WARC-Target-URI": "https://www.lectron.com/are-you-one-of-those-people-who-wonder-what-the-different-types-of-hackers-are-and-why-theyre-classified-based-on-their-hat-color/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:acface7d-d047-4002-aa72-7f0e145b406b>" }, "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-73\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, 132, 133, 144, 145, 552, 553, 607, 608, 631, 654, 676, 697, 719, 742, 743, 1106, 1107, 1126, 1127, 1343, 1344, 2094, 2095, 2495, 2496, 2741, 2742, 3465, 3466, 3485, 3486, 3951, 3952, 4691, 4692, 4709, 4710, 5085, 5086, 5753, 5754, 5784, 5785, 6183, 6184, 6856, 6857, 6896, 6897, 7187, 7188, 7407, 7408, 7455, 7456, 8349, 8350, 8370, 8371, 8799, 8800, 9005, 9006, 9011, 9012, 9029, 9030, 9167, 9176, 9177, 9192, 9193, 9330, 9331, 9345, 9346 ], "line_end_idx": [ 132, 133, 144, 145, 552, 553, 607, 608, 631, 654, 676, 697, 719, 742, 743, 1106, 1107, 1126, 1127, 1343, 1344, 2094, 2095, 2495, 2496, 2741, 2742, 3465, 3466, 3485, 3486, 3951, 3952, 4691, 4692, 4709, 4710, 5085, 5086, 5753, 5754, 5784, 5785, 6183, 6184, 6856, 6857, 6896, 6897, 7187, 7188, 7407, 7408, 7455, 7456, 8349, 8350, 8370, 8371, 8799, 8800, 9005, 9006, 9011, 9012, 9029, 9030, 9167, 9176, 9177, 9192, 9193, 9330, 9331, 9345, 9346, 9387 ] }
{ "red_pajama_v2": { "ccnet_original_length": 9387, "ccnet_original_nlines": 76, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4207557737827301, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.02312465012073517, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.12069938331842422, "rps_doc_frac_unique_words": 0.41580310463905334, "rps_doc_mean_word_length": 4.941061973571777, "rps_doc_num_sentences": 87, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.746553897857666, "rps_doc_word_count": 1544, "rps_doc_frac_chars_dupe_10grams": 0.031196750700473785, "rps_doc_frac_chars_dupe_5grams": 0.031196750700473785, "rps_doc_frac_chars_dupe_6grams": 0.031196750700473785, "rps_doc_frac_chars_dupe_7grams": 0.031196750700473785, "rps_doc_frac_chars_dupe_8grams": 0.031196750700473785, "rps_doc_frac_chars_dupe_9grams": 0.031196750700473785, "rps_doc_frac_chars_top_2gram": 0.038012851029634476, "rps_doc_frac_chars_top_3gram": 0.01769563928246498, "rps_doc_frac_chars_top_4gram": 0.004456679802387953, "rps_doc_books_importance": -910.0051879882812, "rps_doc_books_importance_length_correction": -910.0051879882812, "rps_doc_openwebtext_importance": -458.2505187988281, "rps_doc_openwebtext_importance_length_correction": -458.2505187988281, "rps_doc_wikipedia_importance": -352.5162353515625, "rps_doc_wikipedia_importance_length_correction": -352.5162353515625 }, "fasttext": { "dclm": 0.3857300877571106, "english": 0.9571159482002258, "fineweb_edu_approx": 2.387665033340454, "eai_general_math": 0.012520190328359604, "eai_open_web_math": 0.18070262670516968, "eai_web_code": 0.005501150153577328 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.8", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "363.12", "labels": { "level_1": "Social sciences", "level_2": "Social service and Societies", "level_3": "Political activists" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
-6,822,663,947,561,878,000
Insights What is Microsoft Flow? What is Microsoft Flow? Microsoft Flow is a new workflow management tool for automating workflows across applications and services by connecting web services, files, and cloud-based data. It empowers users to create workflows to decrease time-consuming tasks or processes that automate approvals, send/receive notifications, synchronize files, or collect, organize and update data. Microsoft Flow can bridge the gap between many scenarios by bringing together two or more cloud services with the creation of workflows. You can also create your own flows if you need to connect Microsoft services with non-Microsoft services, or vice-versa. There are many pre-built templates you can use if they satisfy current business needs. You will need to sign-in so that the pre-built templates can connect to the services you are trying to access. After access is granted, you can view all of the triggers, actions, and settings that make the flow function. Don’t be afraid to add, change, or delete actions to create your own flow! You can also create flows from scratch using various data sources such as SharePoint lists, Excel files, Azure SQL tables, and more. Example: In this example we’ll create our own Flow from scratch to approve or reject items in a SharePoint list and notify users with the outcome. You can use this example in any scenario that you may require an item to be approved or rejected. Here is the overall view of our Flow: Step 1: We’ll pick the list where the item is created. Step 2: Send an email requesting approval or rejection. Step 3: We’ll establish our condition to email the requestor if the item was approved or rejected. Step 4.1: If approved, send an approval email. Step 4.2: If rejected, send a rejected email. Microsoft Flow offers other approaches and functionality. You can create flows to carry out various steps/actions to different services, run on a schedule, require an approval, or even add a flow to an app. You can also use the mobile apps for iPhone and Android (beta release) to monitor and manage your flows. Office 365 is not required and you can have up to 25 flows in your account. Anyone with a work or school email address can sign up to use Microsoft Flow at no cost. Helpful Links Microsoft Flow Homepage: https://flow.microsoft.com/en-us/ Pre-Built Templates: https://flow.microsoft.com/en-us/templates/ Services: https://flow.microsoft.com/en-us/services/ Microsoft Flow iOS App: https://itunes.apple.com/us/app/microsoft-flow/id1094928825?mt=8
{ "url": "https://concurrency.com/blog/what-is-microsoft-flow/", "source_domain": "concurrency.com", "snapshot_id": "CC-MAIN-2024-38", "warc_metadata": { "Content-Length": "118119", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:5BQ3EDLR5VO5CWMHWVDVV4WUIGVF2UIJ", "WARC-Concurrent-To": "<urn:uuid:d06fbcd4-afc4-4f91-909c-6020c426c917>", "WARC-Date": "2024-09-17T19:32:14Z", "WARC-IP-Address": "141.193.213.10", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:7JFILYVPZ2DIHTKVTSVKABX2QVUB4BSZ", "WARC-Record-ID": "<urn:uuid:c0719a20-b1e6-461a-9c17-e5e3f08bc2b4>", "WARC-Target-URI": "https://concurrency.com/blog/what-is-microsoft-flow/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:df2be442-3f73-4b56-9c88-91885d4ab4a7>" }, "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-37\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, 33, 34, 58, 59, 417, 418, 1192, 1193, 1202, 1203, 1477, 1478, 1533, 1534, 1590, 1591, 1690, 1691, 1738, 1739, 1785, 1786, 2263, 2264, 2278, 2279, 2338, 2339, 2404, 2405, 2458, 2459 ], "line_end_idx": [ 33, 34, 58, 59, 417, 418, 1192, 1193, 1202, 1203, 1477, 1478, 1533, 1534, 1590, 1591, 1690, 1691, 1738, 1739, 1785, 1786, 2263, 2264, 2278, 2279, 2338, 2339, 2404, 2405, 2458, 2459, 2547 ] }
{ "red_pajama_v2": { "ccnet_original_length": 2547, "ccnet_original_nlines": 32, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3401108980178833, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0018484300235286355, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.20702402293682098, "rps_doc_frac_unique_words": 0.4898989796638489, "rps_doc_mean_word_length": 5.126262664794922, "rps_doc_num_sentences": 35, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.853095531463623, "rps_doc_word_count": 396, "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.05123152956366539, "rps_doc_frac_chars_top_3gram": 0.014778329990804195, "rps_doc_frac_chars_top_4gram": 0.018719209358096123, "rps_doc_books_importance": -274.7591857910156, "rps_doc_books_importance_length_correction": -274.7591857910156, "rps_doc_openwebtext_importance": -144.52163696289062, "rps_doc_openwebtext_importance_length_correction": -144.52163696289062, "rps_doc_wikipedia_importance": -121.00406646728516, "rps_doc_wikipedia_importance_length_correction": -121.00406646728516 }, "fasttext": { "dclm": 0.1932917833328247, "english": 0.8840312957763672, "fineweb_edu_approx": 2.1773009300231934, "eai_general_math": 0.04069126024842262, "eai_open_web_math": 0.08439146727323532, "eai_web_code": 0.12668150663375854 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.4", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "658.403", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Business", "level_3": "Management" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "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": "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" } } }
ece34605c058195ed03b4d393ef1a36c
176,787,914,728,700,480
blob: 5d5f748fe145ebfcdb45a5411b8226aa66a8f241 [file] [log] [blame] // Copyright 2014 The Chromium Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #include "ui/base/material_design/material_design_controller.h" #include "ui/native_theme/native_theme_mac.h" #include "base/mac/mac_util.h" #include "testing/gtest/include/gtest/gtest.h" namespace ui { class NativeThemeMacTest : public testing::Test { public: static void SetUpTestCase() { MaterialDesignController::Initialize(); } }; // Test to ensure any system colors that are looked up by name exist on all Mac // platforms Chrome supports, and that their colorspace and component count is // sane. TEST_F(NativeThemeMacTest, SystemColorsExist) { NativeTheme* native_theme = NativeThemeMac::instance(); ASSERT_TRUE(native_theme); for (int i = 0; i < NativeTheme::kColorId_NumColors; ++i) { // While 0 is a valid color, no system color should be fully transparent. // This is also to probe for CHECKs. EXPECT_NE( static_cast<SkColor>(0), native_theme->GetSystemColor(static_cast<NativeTheme::ColorId>(i))) << "GetSystemColor() unexpectedly gave a fully transparent color."; } } // Spot-check some system colours that can't be changed through System // Preferences. TEST_F(NativeThemeMacTest, SystemColorSpotChecks) { NativeTheme* native_theme = NativeThemeMac::instance(); const SkColor kWindowColorCatsMavericks = SkColorSetARGB(255, 232, 232, 232); const SkColor kWindowColorYosemite = SkColorSetARGB(255, 236, 236, 236); SkColor dialogColor = native_theme->GetSystemColor(NativeTheme::kColorId_WindowBackground); if (base::mac::IsAtLeastOS10_10()) EXPECT_EQ(dialogColor, kWindowColorYosemite); else EXPECT_EQ(dialogColor, kWindowColorCatsMavericks); } } // namespace ui
{ "url": "https://chromium.googlesource.com/chromium/src/+/c22b492fb34a285c5182154ea6fe7782e7b18f72/ui/native_theme/native_theme_mac_unittest.cc", "source_domain": "chromium.googlesource.com", "snapshot_id": "crawl=CC-MAIN-2022-40", "warc_metadata": { "Content-Length": "22349", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:XTCA54SVSLPVGE2PANFG2Q7CF5ZJ36IW", "WARC-Concurrent-To": "<urn:uuid:c552430b-9603-48f6-889b-266f3269dd9a>", "WARC-Date": "2022-10-05T08:58:21Z", "WARC-IP-Address": "172.253.62.82", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:GUG5HYWVJVSF23QQ2D2QHACLBZ67EIGV", "WARC-Record-ID": "<urn:uuid:18426c19-ff93-4356-a499-9737ff2231e2>", "WARC-Target-URI": "https://chromium.googlesource.com/chromium/src/+/c22b492fb34a285c5182154ea6fe7782e7b18f72/ui/native_theme/native_theme_mac_unittest.cc", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:f7835c1d-9072-4a9a-8ff0-315d737e0b88>" }, "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-120\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, 68, 129, 203, 233, 297, 343, 374, 421, 436, 486, 494, 524, 564, 566, 569, 649, 728, 737, 785, 841, 868, 928, 1002, 1039, 1050, 1075, 1143, 1211, 1213, 1215, 1286, 1302, 1354, 1410, 1488, 1561, 1583, 1653, 1688, 1734, 1739, 1790, 1792 ], "line_end_idx": [ 68, 129, 203, 233, 297, 343, 374, 421, 436, 486, 494, 524, 564, 566, 569, 649, 728, 737, 785, 841, 868, 928, 1002, 1039, 1050, 1075, 1143, 1211, 1213, 1215, 1286, 1302, 1354, 1410, 1488, 1561, 1583, 1653, 1688, 1734, 1739, 1790, 1792, 1809 ] }
{ "red_pajama_v2": { "ccnet_original_length": 1809, "ccnet_original_nlines": 43, "rps_doc_curly_bracket": 0.006633500102907419, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.14739884436130524, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.023121390491724014, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.4393063485622406, "rps_doc_frac_unique_words": 0.6890243887901306, "rps_doc_mean_word_length": 8.554878234863281, "rps_doc_num_sentences": 13, "rps_doc_symbol_to_word_ratio": 0.01156068965792656, "rps_doc_unigram_entropy": 4.604163646697998, "rps_doc_word_count": 164, "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.01568068005144596, "rps_doc_frac_chars_top_3gram": 0.06272274255752563, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -195.98538208007812, "rps_doc_books_importance_length_correction": -192.29867553710938, "rps_doc_openwebtext_importance": -117.49813079833984, "rps_doc_openwebtext_importance_length_correction": -117.49813079833984, "rps_doc_wikipedia_importance": -83.50847625732422, "rps_doc_wikipedia_importance_length_correction": -83.41468811035156 }, "fasttext": { "dclm": 0.23972636461257935, "english": 0.5003037452697754, "fineweb_edu_approx": 2.443269968032837, "eai_general_math": 0.8407360315322876, "eai_open_web_math": 0.05644452944397926, "eai_web_code": 0.066539466381073 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "-1", "labels": { "level_1": "", "level_2": "", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "-1", "label": "Abstain" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "0", "label": "No missing content" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "3", "label": "Academic Writing" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }
ece34605c058195ed03b4d393ef1a36c
577,967,644,863,353,000
Инструменты пользователя Инструменты сайта анализ_трафика Это старая версия документа. Анализ трафика SPAN Cisco Switch monitor session 1 source interface f0/1 both monitor session 1 destination interface f0/2 Unix server# ifconfig eth1|le1 up server# tcpdump -ni eth1|le1 -A -s 0 "port 80" tcpdump, trafshow Выделение tcp сессий Анализ трафика для предотвращения атак - пакет Snort Использование пакета Snortsam для блокировки хостов Установка пакета FreeBSD [server:~] # pkg_add -r snortsam [server:~] # more /usr/local/share/doc/snortsam/README.conf [server:~] # cd /usr/local/etc/snortsam/ Ubuntu root@server:~# cd /usr/src root@server:/usr/src# wget http://www.snortsam.net/files/snortsam/snortsam-src-2.69.tar.gz root@server:/usr/src# tar -xvf snortsam-src-2.69.tar.gz root@server:/usr/src# cd snortsam/ root@server:/usr/src/snortsam# sh makesnortsam.sh root@server:/usr/src/snortsam# cp snortsam /usr/sbin/ root@server:/usr/src/snortsam# mkdir /etc/snortsam root@server:/usr/src/snortsam# cd /etc/snortsam Варианты блокировки хостов на cisco router В случае использования aaa new-model требуется пользователь c priv-lvl = 1 1. Использование списков доступа и протокола telnet server# cat snortsam.acl conf terminal no ip access-list extended ACL_FIREWALL ip access-list extended ACL_FIREWALL snortsam-ciscoacl-begin snortsam-ciscoacl-end permit tcp any host 192.168.X.3 eq www permit icmp any any permit udp any any permit tcp any any established deny ip any any log end server# cat snortsam.conf daemon nothreads accept 127.0.0.1 defaultkey secret # ciscoacl 192.168.X.1 student/tacacs cisco /usr/local/etc/snortsam/snortsam.acl # ciscoacl 192.168.X.1 cisco cisco /etc/snortsam/snortsam.acl logfile /var/log/snortsam.log FreeBSD: [server:~] # /usr/local/etc/rc.d/snortsam rcvar [server:~] # /usr/local/etc/rc.d/snortsam start Ubuntu: root@server:~# /usr/sbin/snortsam /etc/snortsam/snortsam.conf 2. Использование списков доступа и протокола tftp server# cat /tftpboot/snortsam.acl no ip access-list extended ACL_FIREWALL ip access-list extended ACL_FIREWALL snortsam-ciscoacl-begin snortsam-ciscoacl-end permit tcp any host 192.168.X.3 eq www permit icmp any any permit udp any any permit tcp any any established deny ip any any log end server# cat snortsam.tftp copy tftp://192.168.X.1/ running-config server# cat snortsam.conf ... # ciscoacl 192.168.X.2 student/tacacs cisco snortsam.acl|/usr/local/etc/snortsam/snortsam.tftp # ciscoacl 192.168.X.2 student/tacacs cisco snortsam.acl|/etc/snortsam/snortsam.tftp ... server# cd /tftpboot/ FreeBSD: [server:/tftpboot] # snortsam /usr/local/etc/snortsam/snortsam.conf Ubuntu: root@server:/tftpboot# snortsam /etc/snortsam/snortsam.conf 3. Использование null маршрутов server# cat snortsam.conf ... cisconullroute 192.168.X.1 student/tacacs cisco ... Подключение Snort к Snortsam FreeBSD [server:~] # cd /usr/ports/security/snort [server:ports/security/snort] # make config [server:ports/security/snort] # cat /var/db/ports/snort/options ... WITH_SNORTSAM=true ... [server:ports/security/snort] # make install clean [server:ports/security/snort] # cd /usr/local/etc/snort/ Ubuntu http://www.snortsam.net/files/snort-plugin/readme.txt root@server:~# apt-get install libpcap-dev libpcre3-dev libtool automake autoconf root@server:~# cd /usr/src root@server:/usr/src# wget http://www.snortsam.net/files/snort-plugin/snortsam-2.8.6.diff.gz root@server:/usr/src# gunzip snortsam-2.8.6.diff.gz root@server:/usr/src# wget http://dl.snort.org/downloads/116 root@server:/usr/src# mv snort-2.8.6.1.tar.gz\?AWSA... snort-2.8.6.1.tar.gz root@server:/usr/src# tar -xvf snort-2.8.6.tar.gz root@server:/usr/src# cd snort-2.8.6 root@server:/usr/src/snort-2.8.6# patch -p1 < ../snortsam-2.8.6.diff root@server:/usr/src/snort-2.8.6# sh autojunk.sh root@server:/usr/src/snort-2.8.6# ./configure --prefix /usr/local/snort root@server:/usr/src/snort-2.8.6# make root@server:/usr/src/snort-2.8.6# make install root@server:/usr/src/snort-2.8.6# cp -r etc/ /usr/local/snort/ root@server:~# ln -s /usr/local/snort/lib/snort_dynamicengine /usr/local/lib/snort_dynamicengine root@server:~# ln -s /usr/local/snort/lib/snort_dynamicpreprocessor /usr/local/lib/snort_dynamicpreprocessor root@server:~# cd /usr/local/snort/ root@server:/usr/local/snort# wget http://www.snort.org/pub-bin/oinkmaster.cgi/xxxxxxxxxxxxxx/snortrules-snapshot-2.8.tar.gz root@server:/usr/local/snort# tar -xvf snortrules-snapshot-2.8.tar.gz rules/ root@server:/usr/local/snort# cd /usr/local/snort/etc Настройка FreeBSD/Ubuntu server# cat snort.conf ... output alert_fwsam: 127.0.0.1:898/secret ... server# cat sid-block.map 1256: src, 2 min !!! Раскомментировать правило !!! server# grep 1256 web-iis.rules alert tcp $EXTERNAL_NET any -> $HTTP_SERVERS $HTTP_PORTS (msg:"WEB-IIS CodeRed v2 root.exe access"; flow:to_server,established; uricontent:"/root.exe"; nocase; classtype:web-application-attack; reference:url,www.cert.org/advisories/CA-2001-19.html; sid:1256; rev:7;) server# grep web-application-attack classification.config config classification: web-application-attack,Web Application Attack,1 Запуск в Ubuntu root@server:~# /usr/local/snort/bin/snort -m 027 -D -d -l /var/log/snort -u snort -g snort -c /usr/local/snort/etc/snort.conf -i eth1 анализ_трафика.1290486298.txt.gz · Последние изменения: 2013/05/22 13:50 (внешнее изменение)
{ "url": "http://backend.wiki.val.bmstu.ru/doku.php?id=%D0%B0%D0%BD%D0%B0%D0%BB%D0%B8%D0%B7_%D1%82%D1%80%D0%B0%D1%84%D0%B8%D0%BA%D0%B0&rev=1290486298", "source_domain": "backend.wiki.val.bmstu.ru", "snapshot_id": "crawl=CC-MAIN-2020-34", "warc_metadata": { "Content-Length": "21753", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:GXFYHZQOIVKCZXRDBAKXSDAWLNPMXMJP", "WARC-Concurrent-To": "<urn:uuid:37fa2509-462c-42d7-a1fe-ee6db5130a2a>", "WARC-Date": "2020-08-08T20:21:44Z", "WARC-IP-Address": "195.19.40.152", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:R6Q7HBBUVMS4VGXSVPFW6XIP5SHV5ZG5", "WARC-Record-ID": "<urn:uuid:b00a18c7-7edc-4f44-92e5-83661c470c58>", "WARC-Target-URI": "http://backend.wiki.val.bmstu.ru/doku.php?id=%D0%B0%D0%BD%D0%B0%D0%BB%D0%B8%D0%B7_%D1%82%D1%80%D0%B0%D1%84%D0%B8%D0%BA%D0%B0&rev=1290486298", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:077fd805-08b7-4776-9e57-6d3d97aa1507>" }, "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-187.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 25, 26, 44, 45, 46, 61, 62, 91, 92, 93, 108, 109, 114, 115, 128, 129, 174, 219, 220, 225, 226, 255, 256, 303, 304, 322, 323, 344, 345, 398, 399, 451, 452, 469, 470, 478, 479, 512, 513, 573, 574, 615, 616, 623, 624, 651, 652, 743, 799, 834, 835, 886, 940, 941, 992, 1040, 1041, 1084, 1085, 1160, 1161, 1213, 1214, 1239, 1253, 1293, 1330, 1355, 1378, 1418, 1439, 1459, 1491, 1514, 1518, 1544, 1551, 1561, 1578, 1596, 1677, 1739, 1769, 1770, 1779, 1780, 1828, 1829, 1877, 1878, 1886, 1887, 1949, 1950, 2000, 2001, 2036, 2076, 2113, 2138, 2161, 2201, 2222, 2242, 2274, 2297, 2301, 2328, 2368, 2369, 2395, 2399, 2494, 2579, 2583, 2605, 2606, 2615, 2616, 2684, 2685, 2693, 2694, 2754, 2755, 2787, 2788, 2814, 2818, 2866, 2870, 2871, 2900, 2901, 2909, 2910, 2952, 2953, 2997, 2998, 3063, 3067, 3086, 3090, 3091, 3142, 3143, 3200, 3201, 3208, 3209, 3263, 3264, 3346, 3347, 3374, 3467, 3519, 3520, 3581, 3658, 3659, 3709, 3746, 3747, 3817, 3867, 3939, 3978, 3979, 4026, 4089, 4090, 4187, 4296, 4297, 4333, 4334, 4459, 4536, 4590, 4591, 4616, 4617, 4640, 4644, 4685, 4689, 4715, 4732, 4766, 4767, 4799, 5067, 5068, 5127, 5198, 5199, 5215, 5216, 5350 ], "line_end_idx": [ 25, 26, 44, 45, 46, 61, 62, 91, 92, 93, 108, 109, 114, 115, 128, 129, 174, 219, 220, 225, 226, 255, 256, 303, 304, 322, 323, 344, 345, 398, 399, 451, 452, 469, 470, 478, 479, 512, 513, 573, 574, 615, 616, 623, 624, 651, 652, 743, 799, 834, 835, 886, 940, 941, 992, 1040, 1041, 1084, 1085, 1160, 1161, 1213, 1214, 1239, 1253, 1293, 1330, 1355, 1378, 1418, 1439, 1459, 1491, 1514, 1518, 1544, 1551, 1561, 1578, 1596, 1677, 1739, 1769, 1770, 1779, 1780, 1828, 1829, 1877, 1878, 1886, 1887, 1949, 1950, 2000, 2001, 2036, 2076, 2113, 2138, 2161, 2201, 2222, 2242, 2274, 2297, 2301, 2328, 2368, 2369, 2395, 2399, 2494, 2579, 2583, 2605, 2606, 2615, 2616, 2684, 2685, 2693, 2694, 2754, 2755, 2787, 2788, 2814, 2818, 2866, 2870, 2871, 2900, 2901, 2909, 2910, 2952, 2953, 2997, 2998, 3063, 3067, 3086, 3090, 3091, 3142, 3143, 3200, 3201, 3208, 3209, 3263, 3264, 3346, 3347, 3374, 3467, 3519, 3520, 3581, 3658, 3659, 3709, 3746, 3747, 3817, 3867, 3939, 3978, 3979, 4026, 4089, 4090, 4187, 4296, 4297, 4333, 4334, 4459, 4536, 4590, 4591, 4616, 4617, 4640, 4644, 4685, 4689, 4715, 4732, 4766, 4767, 4799, 5067, 5068, 5127, 5198, 5199, 5215, 5216, 5350, 5442 ] }
{ "red_pajama_v2": { "ccnet_original_length": 5442, "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.03812709078192711, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.016722410917282104, "rps_doc_frac_lines_end_with_ellipsis": 0.039603959769010544, "rps_doc_frac_no_alph_words": 0.5224080085754395, "rps_doc_frac_unique_words": 0.5468409657478333, "rps_doc_mean_word_length": 9.006535530090332, "rps_doc_num_sentences": 146, "rps_doc_symbol_to_word_ratio": 0.04548494890332222, "rps_doc_unigram_entropy": 5.165042400360107, "rps_doc_word_count": 459, "rps_doc_frac_chars_dupe_10grams": 0.10498306900262833, "rps_doc_frac_chars_dupe_5grams": 0.1412675380706787, "rps_doc_frac_chars_dupe_6grams": 0.10498306900262833, "rps_doc_frac_chars_dupe_7grams": 0.10498306900262833, "rps_doc_frac_chars_dupe_8grams": 0.10498306900262833, "rps_doc_frac_chars_dupe_9grams": 0.10498306900262833, "rps_doc_frac_chars_top_2gram": 0.01741654984652996, "rps_doc_frac_chars_top_3gram": 0.019351720809936523, "rps_doc_frac_chars_top_4gram": 0.029995160177350044, "rps_doc_books_importance": -644.0543212890625, "rps_doc_books_importance_length_correction": -644.0543212890625, "rps_doc_openwebtext_importance": -415.5770568847656, "rps_doc_openwebtext_importance_length_correction": -415.5770568847656, "rps_doc_wikipedia_importance": -250.1269989013672, "rps_doc_wikipedia_importance_length_correction": -250.1269989013672 }, "fasttext": { "dclm": 0.09313852339982986, "english": 0.2568788528442383, "fineweb_edu_approx": 1.1899588108062744, "eai_general_math": 0.00621462007984519, "eai_open_web_math": 0.009939789772033691, "eai_web_code": 0.602963924407959 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.822", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.028", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
-3,033,816,948,749,709,300
Meffapef Level 3 Impossible to escape blank space ? Hello, I am trying to run a command to execute an .exe while specifying a path in which there are several spaces. Based on this example (https://community.flexera.com/t5/InstallShield-Forum/Space-characters-in-Setup-exe-command-line/td-p...), I tried to do something like this (in an installshield script) MySetup.exe " /v" + "\"INSTALLDIR=c:\\PROGRA~1\\Install\\My Setup\""; (I use notations with "\" to escape the sequences as explained here: https://docs.revenera.com/installshield22helplib/Subsystems/installshield22langref/helplibrary/Langr... ) Unfortunately it doesn't work. At execution, I get this message:   errorEscape.PNG For program files, I know I can use the notation "c:\PROGRA~1" I tried and it works. But I still have the space problem with the final folder. Can't escape the spaces in my case? 😞 Labels (1) 0 Kudos 1 Reply Thananjeyan_M Level 6 Hi, Try below installscript code  szProgram = szSupportDir ^ "Setup.exe"; szInstallPath = "\\"+"\""+szInstallPath+"\\"+"\""; szCommandLine = "/s /v"+"\""+"INSTALLDIR="+szInstallPath+" PROPERTY="+szprop+" /qn" +"\"" ; LaunchAppAndWait(szProgram,szCommandLine,LAAW_OPTION_WAIT|LAAW_OPTION_HIDDEN);   Thanks, Thananjeyan 0 Kudos
{ "url": "https://community.flexera.com/t5/InstallShield-Forum/Impossible-to-escape-blank-space/td-p/204353", "source_domain": "community.flexera.com", "snapshot_id": "crawl=CC-MAIN-2022-05", "warc_metadata": { "Content-Length": "190336", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:FS4L3WPFU2KJVP57ADVHEVWH2OVLANIW", "WARC-Concurrent-To": "<urn:uuid:ff95f040-c6d5-412a-825d-7d22a84d52b1>", "WARC-Date": "2022-01-22T21:38:13Z", "WARC-IP-Address": "52.85.151.17", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:Y2UQXHXH7OFVBR63URFRVPKDUVEW5TAT", "WARC-Record-ID": "<urn:uuid:4081a2cf-9ad7-40fb-bb3f-1a013e6c1651>", "WARC-Target-URI": "https://community.flexera.com/t5/InstallShield-Forum/Impossible-to-escape-blank-space/td-p/204353", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:48b0c57f-24bb-454d-99b1-bb706fec1e5a>" }, "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, 9, 17, 18, 53, 54, 61, 62, 169, 170, 362, 363, 433, 434, 609, 610, 675, 676, 678, 679, 695, 696, 839, 840, 878, 879, 890, 898, 906, 920, 928, 929, 933, 963, 964, 1004, 1055, 1147, 1226, 1227, 1229, 1230, 1238, 1250, 1251 ], "line_end_idx": [ 9, 17, 18, 53, 54, 61, 62, 169, 170, 362, 363, 433, 434, 609, 610, 675, 676, 678, 679, 695, 696, 839, 840, 878, 879, 890, 898, 906, 920, 928, 929, 933, 963, 964, 1004, 1055, 1147, 1226, 1227, 1229, 1230, 1238, 1250, 1251, 1258 ] }
{ "red_pajama_v2": { "ccnet_original_length": 1258, "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.22962963581085205, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.05925925821065903, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.37037035822868347, "rps_doc_frac_unique_words": 0.7518247961997986, "rps_doc_mean_word_length": 6.802919864654541, "rps_doc_num_sentences": 17, "rps_doc_symbol_to_word_ratio": 0.007407410070300102, "rps_doc_unigram_entropy": 4.477358818054199, "rps_doc_word_count": 137, "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.017167380079627037, "rps_doc_frac_chars_top_3gram": 0, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -118.47689819335938, "rps_doc_books_importance_length_correction": -118.47689819335938, "rps_doc_openwebtext_importance": -51.43431091308594, "rps_doc_openwebtext_importance_length_correction": -51.43431091308594, "rps_doc_wikipedia_importance": -77.47100830078125, "rps_doc_wikipedia_importance_length_correction": -77.47100830078125 }, "fasttext": { "dclm": 0.04076426848769188, "english": 0.734844446182251, "fineweb_edu_approx": 1.824180006980896, "eai_general_math": 0.9771589636802673, "eai_open_web_math": 0.4080824851989746, "eai_web_code": 0.2819247245788574 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.4", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c
3,166,056,510,157,325,000
¿Requieres de una instalación o configuración de Linux o sus servicios? ¿Un desarrollo WEB empresarial a la medida? ¿Un curso o capacitación a la medida? Revisa el sitio de SERVICIOS de LinuxTotal Crear certificados SSL para Apache  Copyright © 2005-2018 LinuxTotal.com.mx Se concede permiso para copiar, distribuir y/o modificar este documento siempre y cuando se cite al autor y la fuente de linuxtotal.com.mx y según los términos de la GNU Free Documentation License, Versión 1.2 o cualquiera posterior publicada por la Free Software Foundation. Autor: Sergio González D.   Introducción Imaginémonos a la empresa "Pato, S.A." que ofrece a sus empleados y clientes el sitio http://www.pato.com/consulta, donde mediante un nombre de usuario y contraseña es posible para los empleados consultar saldos, órdenes, resurtir, estados de cuenta, etc. y para los clientes observar el estado de sus pedidos, su saldo, pagos, historial de compras, etc. El sitio esta perfectamente diseñado, protegido contra inyecciones sql, ataques mediante el url, el servidor al día con los últimos parches y actualizaciones, toda entrada de usuario, contraseña, y demás debidamente validadas para solo recibir caracteres válidos y excluir caracteres usados en consultas e instrucciones sql, etc. etc. Una belleza en cuanto a la seguridad de la aplicación Web. PERO, todo el sitio funciona bajo un servidor Web apache en el puerto 80, esta bien, pero implica que un empleado rencoroso porque no le aumentaron el sueldo o no lo promovieron de puesto y con intenciones de querer ser un hacker, instala un sniffer en su PC (dentro de la empresa), baja herramientas para envenenar mediante un ataque arp (arp poisoning) el switch al que corresponde a su segmento red de tal modo que puede observar todo el tráfico de red de los equipos conectados a su switch. Fácil, nada del otro mundo, cualquier chico de los scripts (script kiddie) le hubiera enseñado como hacerlo si no lo hubiese el sabido ya. En unas cuantas horas tiene ya varias cuentas de usuario y contraseñas, se introduce como ellas y baja información confidencial de varios de sus compañeros y como algunos son gerente, también obtiene información sensible de clientes. Listo, ahora a chantajear a la empresa por medio de un cómplice en el exterior o simplemente tratar de utilizar la información en su beneficio o peor aun causar algún tipo de destrozo con esta. ¿Ficción? Absolutamente no. Lo anterior es perfectamente posible porque el tráfico de red generado entre el cliente (navegador) y el servidor Web apache en el puerto 80 no esta encriptado, viaja tal cual. Entonces es posible, con la herramienta adecuada interceptar y observar este tráfico y obtener entre otras cosas contraseñas, números de tarjetas de crédito, etc. La solución es simple (la implementación no tanto), obtener un certificado de seguridad y hacer que el tráfico se dirija al puerto 443 (https) en vez del 80 (http). En el puerto 443 el tráfico se encripta a través del los protocolos SSL (Secure Sockets Layer) y TLS (Transport Layer Security). Entonces todo el tráfico será encriptado y aunque es posible interceptarlo y observarlo, no se verá mas que basura o cadenas de caracteres sin ningún significado todo el tiempo, logrando asi un canal seguro encriptado entre el cliente y el servidor. Certificate Authority CA (Autoridad Certificadora) Esta fuera del alcance de este documento toda la teoría detrás de SSL, hay varios documentos, tutoriales y manuales en Internet que lo explican, pero lo que si hay que entender que es un CA. Una autoridad certificadora como lo son Verisign, Thawte, beTRUSTed o ValiCert son empresas dedicadas a vender certificados de seguridad que la empresa que lo adquiere instala en su servidor web. Es decir "Pato, S.A." desea montar su apliación Web bajo un sitio seguro con https, crea su certificado y lo manda firmar con un CA, el CA verifica que "Pato, S.A." es realmente quien dice ser. Después de checar la autenticidad de la empresa en cuestión, el CA firma el certificado de seguridad de su cliente con alguno de sus certificados raíz bajo una fuerte encriptación y se lo regresa a "Pato, S.A.", este lo instala en su servidor Web y cuando los clientes (navegadores) se conectan, estarán tanto el cliente como el servidor bajo un tráfico encriptado y seguro, todo avalado por el CA otorgante del certificado. La enorme ventaja de este esquema es que todos los navegadores actuales (Internet Explorer, Firefox, Opera, Mozilla, etc) tienen incorporados los certificados raíz de todas las empresas CA conocidas del mundo, asi que cuando el cliente se conecta al servidor no hay ninguna molestia para el cliente, todo es transparente para el usuario final. Si eres una empresa dedicada a cualquier tipo de comercio electrónico donde se involucre dinero a través de tarjetas de crédito o servicios como paypal, firmarse con un CA como Verisign es la única alternativa que se tiene, esto para otorgar seguridad a los clientes del sitio. Ahora bien, los CA como los mencionados no son almas de la caridad, cobran por el servicio de firmar los certificados, sus precios comienzan en alrededor de 200 a 300 dólares anuales por certificado y pueden subir mas dependiendo del tipo de encriptación que se solicite, es decir, para un sitio de comercio electrónico con un alto volumen de tráfico requerira de certificados mas seguros debido a que será mas tentador para posibles hackers de tratar de violarlo. Lo interesante viene a continuación. "Pato, S.A." es como muchas empresas que solo ofrecen una aplicación sin transacciones de comercio, solo consulta a sus bases de datos y algunos formularios que involucran solicitudes de reportes o actualización de datos. "Pato, S.A." o quienquiera puede convertirse el mismo en CA, el mismo emitir un certificado raíz de seguridad y a través de este generar certificados para sitios Web. Y de hecho es el tema de este artículo, como crear certificados SSL para montarlo en nuestro propio servidor Web o de correo electrónico. ¿Cual es la deventaja?, solo una, que en el navegador del cliente al no estar importado el certificado (integrado) en su lista de certificados seguros, pedirá al usuario cuando se conecte al sitio que acepte el certificado. Si el usuario es desconfiado y no lo acepta no se podrá conectar a nuestro servidor Web seguro. Lo que se puede hacer es, por ejemplo, lo siguiente: • El usuario se conecta a "http://www.pato.com" puerto 80, trafico http normal sin seguridad. • En la página inicial del sitio desplegamos un botón y una leyenda que dice que al apretar el botón se redirigirá a la aplicación Web de consulta y que deberá aceptar el certificado de seguridad que la empresa "Pato, S.A." ofrece para establecer una conexión segura, que si tiene dudas puede comunicarse al siguiente teléfono o correo, etc. • Al apretar el botón se redirige a "https://www.pato.com/consulta" puerto 443, que es donde estará la apliación de consulta y en este momento se pedirá que se acepte el certificado. El usuario entonces, estuvo mas informado de lo que pasa. Ya quedando mas claro lo anterior, entonces, comencemos a aclarar algunas cosas. Se requiere para lo anterior dos cosas: • Un par de claves, una pública y una privada (claves RSA o DSA, en otras palabras encriptación asimétrica). La clave es pública, como su nombre implica es expuesta a todo el mundo y la privada es solo conocida por el emisor, es decir, nosotros. • Un certificado de seguridad, que es una versión "firmada" o verificada de la clave pública RSA o DSA. Entonces, se trata de que uno va a generar tanto la clave pública como la privada. Una vez teniendo esto volvemos a las dos opciones previamente mencionadas, podemos autofirmar nosotros mismos nuestra clave pública o podemos mandarla a un tercero, a un CA reconocido para que nos la firme cobrando por el servicio. Una vez que hacemos esto tendremos en ambos casos como producto un certificado firmado que será el que el navegador deberá importar en su lista de certificados de confianza para poder establecer la conexión. Vamos a ponerlo mas ilustrado, primero con un certificado autofirmado: - El usuario (cliente) se conecta a https://www.pato.com/consulta y este servidor le envia el certificado autofirmado para que sea aceptado (importado) por el navegador del cliente. Traducido en un diálogo de humanos sería de la siguiente manera: "Hey! hola navegador, soy el servidor www.pato.com tienes que confiar que soy de la empresa Pato, S.A. y nadie mas, y para demóstrartelo te envió mi clave pública que te permitirá autentificarte con mi clave privada en mi servidor, todo esto te lo mando en este certificado que espero aceptes, ya que yo mismo me convertí en mi propio CA. Y en serio yo el firmante Pato, S.A. te juro que soy yo, creeme, acéptame, vamos, si soy yo, por favor aprieta Aceptar para poder establecer la conexión segura." Ahora veamos que pasa con un certificado de terceros: - El usuario (cliente) se conecta a https://www.pato.com/consulta y este servidor le envia el certificado firmado, por ejemplo por el CA Verisign, los certificados de Verisign ya están por default en la lista de CA confiables del navegador, por lo que es aceptado sin mayor problema y sin preguntas. Traducido en un diálogo de humanos sería de la siguiente manera: "Hey!, hola navegador, soy el servidor www.pato.com, te envió mi certificado con mi clave pública que te permitirá autentificarte con mi clave privada en mi servidor, esto te lo mando en un certificado firmado nada mas ni nada menos por Verisign. Verisign ya verificó que si soy la empresa Pato, me cobro un billete por esto, asi que mi certificado debe ser autorizado sin mayor problema por los certificados raíz que se encuentran en tu lista de certificados confiables. Listo, conexión segura establecida". Bueno, espero que con esto quede claro cual es la idea detrás de los certificados y de las conexiones seguras, pero ya estuvo bueno de tanto rollo y pongamos manos a la obra en crear nuestros propios certificados autofirmados. Nota cultural rápida: Hace algunos años fue muy sonado el caso de dos certificados que firmó Verisign para alguien que dijo ser empleado de Microsoft y Verisign ¡¡¡le creyó!!!. Lo mas increible es que todavía pasaron varios meses hasta que se descubrió el fraude de los certificados del supuesto empleado de Microsoft. Desde entonces todos los CA del mundo checan muy escrupulosamente tanto a la persona que representa a la empresa que desea obtener un certificado como a la empresa en si, por eso el proceso de obtener un certificado firmado por un tercero suele tardar de dos a tres semanas. (Si tienes curiosidad puedes checar estos dos certificados falsos están en la lista de "fabricantes que no son de confianza" en el Internet Explorer --> Herramientas - Opciones de Internet - Contenido - Certificados - Fabricantes que no son de confianza). Prerequisitos Para crear nuestros certificados usaremos la excelente aplicación Openssl, que deberás tener instalada, puedes verificarlo con una consulta rpm: #> rpm -q openssl openssl-0.9.7f-7 O directamente con el mismo comando openssl: #> openssl version OpenSSL 0.9.7f 22 Mar 2005 Si muestra que el comando no existe, deberás entonces descargarlo e instalarlo. También, por supuesto, que requieres del servidor Web Apache y todo lo que se hará a continuación se tiene que hacer en el equipo donde se tenga instalado el servidor Web configurado con un dominio FQDN (Fully Qualified Domain Name), es decir, un dominio auténtico de Internet, si es que es el caso, o bastará con la dirección IP privada del equipo si va a quedar dentro de una Intranet. En cualquier caso debe hacerse todo el procedimiento directamente en el equipo en cuestión. Apache además deberá estar instalado con el módulo ModSSL. Si tienes OpenSSL seguramente tienes también este módulo. Instalación inicial Todo el trabajo lo haremos dentro de un directorio de trabajo, puedes ponerle el nombre que desees, para fines prácticos le pondré CA y dentro de este directorio a la vez hay que crear otros dos, llamados certificados y privado. El primero es donde se guardará una copia de cada certificado que firmemos y en el otro directorio se guardará la llave privada. #> mkdir CA #> cd CA #> mkdir certificados privado Es muy importante no perder la llave privada que se generé, ya que con esta podremos firmar o renovar certificados, y mucho menos dársela a nadie, ya que toda nuestra seguridad radica en la confidencialidad de la llave privada que se guardará en el directorio privado. Lo siguiente será crear un par de archivos que en conjunto formarán la base de datos de los certificados autofirmados. #> echo '01' > serial #> > index.txt #> touch index.txt El primer archivo 'serial' simplemente contiene el siguiente número de serie de nuestros certificados, ya que apenas vamos a crear el primero su número de serie será 01, después de crearlo se actualizará a 02 y asi sucesivamente. 'index.txt' será la base de datos propiamente en base al número de serie. Archivo de configuración Openssl tiene docenas de opciones y parámetros, mucha de la información que irá en el certificado es tomado del archivo de configuración, en vez de la línea de comandos. A continuación te muestro un archivo de configuración listo para ser usado, puedes personalizarlo a tu gusto, usa los comentarios que añadí y el sentido común para que te des una idea de lo que hace cada línea. A este archivo lo nombraremos openssl.cnf y lo guardaremos dentro de nuestro directorio CA. Añadí comentarios a cada variable para hacerlo mas claro. El archivo se divide en secciones indicadas entre [ corchetes ], y cada sección tiene sus propias variables. La idea principal del archivo de configuración es de simplificar el uso de los subcomados del comando openssl, que tiene tres subopciones principales: ca, req y x509, entonces, cuando se lee el archivo de configuración 'openssl.cnf' y usamos la opción req por ejemplo, esta opción toma sus argumentos de la sección correspondiente del archivo de configuración. Una explicación detallada de cada opción posible la encuentras aqui. Hay una directiva o variable importante que es distinguished_name (DN) o nombre distinguido en español, esta a su vez hace referencia a una sección que tiene los datos básicos de la autoridad certificadora (CA) y que también servirán estos datos para cuando se generen certificados. Mas simple, el DN son los campos que identifican al propietario del certificado. # ************************************************************************************* # www.linuxtotal.com.mx # [email protected] # # Archivo de configuracion para openssl # # ***** openssl.cnf ****** dir = . # variable que establece el directorio de trabajo # seccion que permite convertirnos en una CA # solo se hace referncia a otra sección CA_default [ ca ] default_ca = CA_default [ CA_default ] serial = $dir/serial # archivo que guarda el siguiente número de serie database = $dir/index.txt # archvio que guarda la bd de certificados new_certs_dir = $dir/certificados # dir que guarda los certificados generados certificate = $dir/cacert.pem # nombre del archivo del certificado raíz private_key = $dir/privado/cakey.pem # llave privada del certificado raíz default_md = md5 # algoritmo de dispersión usado preserve = no # Indica si se preserva o no el orden de los # campos del DN cuando se pasa a los certs. nameopt = default_ca # esta opcion y la siguiente permiten mostrar # detalles del certificado certopt = default_ca policy = policy_match # indica el nombre de la seccion # donde se especifica que campos son # obligatorios, opcionales y cuales deben ser # iguales al certificado raíz # seccion de politicas para la emision de certificados [ policy_match ] countryName = match # match, obligatorio stateOrProvinceName = match organizationName = match organizationalUnitName = optional # optional, campo opcional commonName = supplied # supplied, debe estar en la petición emailAddress = optional # seccion que indica como los certificados deben ser creados [ req ] default_bits = 1024 # tamaño de la llave, si no se indica 512 default_keyfile = key.pem # nombre de la llave privada default_md = md5 # algoritmo de dispersión a utilizar string_mask = nombstr # caracteres permitidos en la mascara de la llave distinguished_name = req_distinguished_name # seccion para el nombre distinguido (DN) req_extensions = v3_req # seccion con mas extensiones que se añaden a la # peticion del certificado # seccion del nombre distinguido, el valor es el prompt que se vera en pantalla. # datos del propietario del certificado. # esta seccion define el contenido de datos de id que el certificado llevara. [ req_distinguished_name ] 0.organizationName = Nombre de la organizacion 0.organizationName_default = Pato, S.A. organizationalUnitName = Departamento o division emailAddress = Correo electronico emailAddress_max = 40 localityName = Ciudad o distrito localityName_default = Leon stateOrProvinceName = Estado o provincia stateOrProvinceName_default = Guanajuato countryName = Codigo del pais (dos letras) countryName_default = MX countryName_min = 2 countryName_max = 2 commonName = Nombre comun (hostname o IP) commonName_max = 64 # si en la linea de comandos se indica la opcion -x509, # las siguientes extensiones tambien aplican [ v3_ca ] # indica que se trata de un certificado CA raíz con autoridad para # firmar o revocar otros certificados basicConstraints = CA:TRUE # especifica bajo que metodo identificar a la llave publica que sera certificada subjectKeyIdentifier = hash # especifica como identifcar la llave publica authorityKeyIdentifier = keyid:always,issuer:always # extensiones de la opcion req [ v3_req ] basicConstraints = CA:FALSE # los certificados firmados no son CA subjectKeyIdentifier = hash # ************************************************************************************* Como ya lo había mencionado guarda este archivo con el nombre de 'openssl.cnf' en tu directorio CA. En este punto esto es lo que debes de tener en el directorio CA. #> ls -l drwxr-xr-x 2 root root 4096 ene 26 13:23 certificados -rw-r--r-- 1 root root 0 ene 26 13:24 index.txt -rwxr--r-- 1 root root 4776 ene 26 2006 openssl.cnf drwxr-xr-x 2 root root 4096 ene 26 13:23 privado -rw-r--r-- 1 root root 3 ene 26 13:23 serial #> Creando el certificado raíz Todo esta casi listo para crear el certificado raíz, recordemos que este certificado es el que nos convertira en una autoridad certificadora CA, asi que cuando emitamos el comando lo primero que nos pedira es el "pass phrase" o mas llanamente, una contraseña pero en forma de una frase. Esta contraseña es de vital importancia ya que es con la que validaremos nuestra autoridad para después poder crear certificados autofirmados que son los que realmente usaremos en nuestro sitio, debe ser preferentemente muy compleja, con mayúsculas, minúsculas, espacios, números y por supuesto símbolos, un buen ejemplo sería: el Der3ch0 al #respE5to( -a+jeño_Ez-la=pAz8%. =) Puede parecer muy complicada para recordar y lo es, pero tengamos en cuenta que los algoritmos de cifrado son muy buenos y sumamente dificiles o al menos muy tardados para romper mediante fuerza bruta (hasta miles de años podría llevarse), asi que la verdadera debilidad es el uso de contraseñas débiles. Te recomiendo como "pass phrase" algo similar a lo anterior y al menos 20 caracteres. Ok. Manos a la obra, tenemos todo listo incluyendo una buena contraseña. #> openssl req -new -x509 -extensions v3_ca -keyout privado/cakey.pem \ -out cacert.pem -days 3650 -config ./openssl.cnf Generating a 1024 bit RSA private key ....++++++ .......++++++ writing new private key to 'privado/cakey.pem' Enter PEM pass phrase: Verifying - Enter PEM pass phrase: ----- You are about to be asked to enter information that will be incorporated into your certificate request. What you are about to enter is what is called a Distinguished Name or a DN. There are quite a few fields but you can leave some blank For some fields there will be a default value, If you enter '.', the field will be left blank. ----- Nombre de la organizacion [Pato, S.A.]: Departamento o division []:Sistemas Correo electronico []:[email protected] Ciudad o distrito [Leon]: Estado o provincia [Guanajuato]: Codigo del pais (dos letras) [MX]: Nombre comun (hostname o IP) []:www.pato.com Antes de analizar la salida, veamos las opciones indicadas: • req -new -x509 ---> • -extensions v3_ca ---> • -keyout ---> • -out ---> • -days 3650 ---> • -config ---> Con respecto al resultado producido, lo primero que se indico fue escribir y verificar la contraseña, después vienen los datos para identificar al propietario del certificado CA, que como se puede apreciar los prompts y los datos por default provienen del archivo de configuración. Si no se especifica la opción -days entonces el certificado será válido por solo 30 días. (En el archivo de configuración es posible inicar la variable default_days = valor, en la sección de CA_default) Lo anterior da por resultado dos archivos: • Un certificado raíz CA (cacert.pem) • Una llave privada (privado/cakey.pem) (La extensión "pem" es de Privacy Enhanced Message) IMPORTANTE: El archivo cacert.pem es el que se podría mandar a nuestros clientes o usuarios del sistema, y que estos lo instalen (importen desde el punto de vista del navegador) en su navegador favorito, de esta manera quedaríamos como un CA más válido para el navegador y cada vez que el cliente se conecte a nuestro servidor, su navegador ya no estaría mostrando el diálogo donde se pide aceptar la conexión segura. Veamos como lucen estos archivos: #> more cacert.pem -----BEGIN CERTIFICATE----- MIIDkzCCAvygAwIBAgIJAKTOKYwDdhLRMA0GCSqGSIb3DQEBBAUAMIGOMRMwEQYD VQQKEwpQYXRvLCBTLkEuMREwDwYDVQQLEwhTaXN0ZW1hczEcMBoGCSqGSIb3DQEJ ARYNaW5mb0BwYXRvLmNvbTENMAsGA1UEBxMETGVvbjETMBEGA1UECBMKR3VhbmFq dWF0bzELMAkGA1UEBhMCTVgxFTATBgNVBAMTDHd3dy5wYXRvLmNvbTAeFw0wNjAx MjcwMTU4NDFaFw0wNjAyMjYwMTU4NDFaMIGOMRMwEQYDVQQKEwpQYXRvLCBTLkEu MREwDwYDVQQLEwhTaXN0ZW1hczEcMBoGCSqGSIb3DQEJARYNaW5mb0BwYXRvLmNv bTENMAsGA1UEBxMETGVvbjETMBEGA1UECBMKR3VhbmFqdWF0bzELMAkGA1UEBhMC TVgxFTATBgNVBAMTDHd3dy5wYXRvLmNvbTCBnzANBgkqhkiG9w0BAQEFAAOBjQAw gYkCgYEA52zeMbFW2lSRfcZl6yrqXDAzbwL4ZoXCGRnbo6Wr8S1yp/KYW9/TMHlX nFrKXzM+RP7St/LzlkW1Zt8L+bCZ3XMBLGaa7qHgOagZxhcq1XTLL3CcvaCuzzKT 8izENDnGr4abtvkAJW4QqRCP7iVvVf8Db624JclbhBYMBUqPEJsCAwEAAaOB9jCB 8zAMBgNVHRMEBTADAQH/MB0GA1UdDgQWBBS6tkzuiG3DR+AO1Oy32QjZvBbpLTCB wwYDVR0jBIG7MIG4gBS6tkzuiG3DR+AO1Oy32QjZvBbpLaGBlKSBkTCBjjETMBEG A1UEChMKUGF0bywgUy5BLjERMA8GA1UECxMIU2lzdGVtYXMxHDAaBgkqhkiG9w0B CQEWDWluZm9AcGF0by5jb20xDTALBgNVBAcTBExlb24xEzARBgNVBAgTCkd1YW5h anVhdG8xCzAJBgNVBAYTAk1YMRUwEwYDVQQDEwx3d3cucGF0by5jb22CCQCkzimM A3YS0TANBgkqhkiG9w0BAQQFAAOBgQAEdK/hgtIqEVw551fs3G3+TKoH9b9t3TJa aelLJtKSQAoKzsnhwl88Hm78LEXK/kYufX6M6rDQHDpmcBV3DhIkEEHrBPJ4KBuV +aC559Xqb828YCkNVWDIIefFuxfaWBfd4HHPNKBBiyE5rp2IXN8AgUy7mVkMbsto RCAZS/IhAg== -----END CERTIFICATE----- #> Y la llave privada tiene el siguiente contenido: #> more privado/cakey.pem -----BEGIN RSA PRIVATE KEY----- Proc-Type: 4,ENCRYPTED DEK-Info: DES-EDE3-CBC,0FC86D0DBD03A241 TQIqQQKIB2ZFaZUqTwk+k658Lj+RStlsdLKkAeWN+B7ibgtLPN8OHNZM2cOts9Se qRSVfWSSXzhFsh2fbDoBNx+JYKgPh7+IeBhQ1PJNrPAbyrC1GEybtn+WPEWzBNdo 2e4kOeIzgm7LxeAoofmKgvqcDLRlY34TCFHgnSAQIuZC3iZ8YZAFcMWo3owoUpP7 TKL8W1PtFTVviMC5I7A0rN9en9EQY4QazXDIIVc60uIcKONyEF4fj3aE87+m2lD5 fqfMWG7Ce8GBBOUPL1YtLSC9LOBNhulFqceMvfysLFxToPUP4rs+n+upxnGsHnmF YjsPR3lqAt41JehsO+sUSqoX6I83Q/706g/87XV0JPMDCXBejRI/vW5KgJ0Ux2gv yQfYvHGs5RZl8NfK9AUEcC053VSkjwmuT/anu7czyJC+IG2XTHqoLu6g6CjLNe3b bm/FhymOKENGnKSvA6Mny+NThhSOImhibB0fvsW5Fygi7SboZpXZFJBfEqHzUGvW guzfVF4G7Rhs29Bue0dJOMT2ptFPrjUn0582O7WVIE7aV7msygmt2QUYIWykEt7s O5hzdhguw2WZu0/gl2y5Mpjo3W5SrrCOoxC2mcPutoNhV+DFCQxcbCLsu5PnLBoF HFBCe6ynh/6bIpakGJorzdsB9QqhGdgvbRQbrpYfAl+QHr6/8kyEu4OG+PmoD2ZR O/gAGlSIlDowesmWXGk6l7vZc5BxU1qQVI5QLVr3X7ilavi6+EVSWDF8dFVetYBP dPYYAEzVJVEiDH8yxQ4NoGk+9gmxKVfmejnmtbSHuR20cXbHOKJGmQ== -----END RSA PRIVATE KEY----- ADVERTENCIA: Esto jamás lo hagas en la vida real, el contenido de una llave privada jamás debe publicarse ni mostrarse, ni mandarse a nadie, esta es de prueba y es totalmente inútil. Una llave privada auténtica es tu mayor secreto. Podemos también consultar información específica del certificado raíz, fechas, a quien pertenece etc. #> openssl x509 -in cacert.pem -noout -dates notBefore=Jan 27 02:22:33 2006 GMT notAfter=Jan 25 02:22:33 2016 GMT En el ejemplo anterior se aprecia que el certificado si fue generado con una validez de 10 años, tal como se indico. Otros ejemplos de consulta pero se omite la salida: #> openssl x509 -in cacert.pem -noout -text #> openssl x509 -in cacert.pem -noout -purpose Creando un Certificate Signing Request(CSR) (Solicitud de firmado de certificado) En este punto, ya tenemos un certificado raíz que nos válida como CA, claro sin mas autoridad que nuestro propio dominio pero podemos crear certificados no solo para https, sino también spop, o simap o crear autentificación para vpn's a través de aplicaciones como stunnel. Los siguientes procedimientos son los que a continuación hay que realizar: • Crear una llave privada y una solicitud de certificado. • Firmar la solicitud para generar un certificado autofirmado. Volveremos entonces a usar el comando openssl para lograr lo anterior. Casi todo será igual a lo anterior. Solo que en la solictud de firmado no es necesario especificar una contraseña, aunque si se generará una clave privada para la solictud. Veamos. #> openssl req -new -nodes -out pato-cert.pem -config ./openssl.cnf Generating a 1024 bit RSA private key ......................................................++++++ .......++++++ writing new private key to 'key.pem' ----- You are about to be asked to enter information that will be incorporated into your certificate request. What you are about to enter is what is called a Distinguished Name or a DN. There are quite a few fields but you can leave some blank For some fields there will be a default value, If you enter '.', the field will be left blank. ----- Nombre de la organizacion [Pato, S.A.]: Departamento o division []:Sistemas Correo electronico []:[email protected] Ciudad o distrito [Leon]: Estado o provincia [Guanajuato]: Codigo del pais (dos letras) [MX]: Nombre comun (hostname o IP) []:www.pato.com Lo último que nos pregunto en la parte DN (distinguished name) es el nombre común (CN common name), aqui es sumamente importante indicarlo igual a como esta el certificado raíz generado previamente, como se trata de un servidor web, lo correcto es poner su FQDN que es www.pato.com, no debe indicarse ni pato.com ni http://www.pato.com Lo anterior genera dos archivos: • pato-cert.pem ---> • key.pem ---> En cuanto a las opciones, se uso req de request solicitando un certificado nuevo, -out que es el nombre del certificado que deseamos firmar, -config de nuevo toma el archivo de configuración que creamos. La opción -nodes se especifica para indicar que no deseamos contraseña en la llave privada. Observemos el contenido de la solictud: #> more pato-cert.pem -----BEGIN CERTIFICATE REQUEST----- MIIBwTCCASoCAQAwRjETMBEGA1UEChMKUGF0bywgUy5BLjENMAsGA1UEBxMETGVv bjETMBEGA1UECBMKR3VhbmFqdWF0bzELMAkGA1UEBhMCTVgwgZ8wDQYJKoZIhvcN AQEBBQADgY0AMIGJAoGBAMMvo7xg3vmdlf/38yA68uzNq2WYTtkyecuBnUgocOqD gc0Yl2hrfXN6lHl65kxeRFVdEBYhGgA7JoISivuDTvWwVOIxmH5HOFzZlIPIZ3xT hHCdWUKipXhcsVCTGV+rbB1F9kkIAMrmtaNH2+Zj261jdB7eX960l1EqQaWt71dJ AgMBAAGgOzA5BgkqhkiG9w0BCQ4xLDAqMAkGA1UdEwQCMAAwHQYDVR0OBBYEFGVf A/CDDXl6LQs1MH/XItqJl/8kMA0GCSqGSIb3DQEBBAUAA4GBAJH0sO7bR+dJL67p xK5oEG9LPA2KcP+W7Vn5edpaLtUs/jYyvhQaCdSBxbMkV42nmt9DGD5p5caTFk3M 5guV9f087K+eYnUGILGQS51tXFcmYramZLETzs7nVfwGnXGsDGyKDkG6VTkx46pz JrRTJfWBpWpo4FWg/Fi2l4E4PLv8 -----END CERTIFICATE REQUEST----- Observa claramente que se trata de una solicitud de certificación (Certificate Request), es decir todavía tiene que ser firmado por una autoridad certificadora CA que somos nosotros mismos. Y antes de hacer este último paso podemos observar el contenido de nuestra solictud en un formato mas legible e incluso verificar que estén los datos correctos. Se omite la salida, chécalo en tu pantalla : ) #> openssl req -in pato-cert.pem -text -verify -noout Firmando el certificado Por último firmaremos la solicitud que hicimos en el paso previo, para firmarlo necesitaremos indicar la contraseña que autentifique que somos la CA y que que por serlo tenemos la autoridad de autorizar (firmar) certificados. (Para nuestro propio uso). #> openssl ca -out certificado-pato.pem -config ./openssl.cnf -days 3650 \ -infiles pato-cert.pem Using configuration from ./openssl.cnf Enter pass phrase for ./privado/cakey.pem: Check that the request matches the signature Signature ok The Subject's Distinguished Name is as follows organizationName :PRINTABLE:'Pato, S.A.' organizationalUnitName:PRINTABLE:'Sistemas' localityName :PRINTABLE:'Leon' stateOrProvinceName :PRINTABLE:'Guanajuato' countryName :PRINTABLE:'MX' commonName :PRINTABLE:'www.pato.com' Certificate is to be certified until Jan 26 00:10:10 2016 GMT (3650 days) Sign the certificate? [y/n]:y 1 out of 1 certificate requests certified, commit? [y/n]y Write out database with 1 new entries Data Base Updated #> Observa que usamos la opción ca que indica que firmaremos un certificado como autoridad certificadora (CA) que somos, la salida -out será el archivo certificado-pato.pem usando las opciones -config del archivo de configuración y la solicitud de firmado se especificó con la opción -infiles que tomó los datos del archivo pato-cert.pem creado en el paso previo. Aqui se nos pidió la contraseña, que es la que se indicó cuando creamos cacert.pem que corresponde a nuestro certificado raíz que nos identifica como CA. El certificado será válido por 10 años -days y después se nos preguntó que si queriamos firmarlo, por supuesto que si, y la última pregunta es por si queremos guardar este certificado ya autofirmado en la base de datos, a lo que también contestamos que si. #> more serial 02 Se comprueba que ya aumento el número de serie a 02, es decir, el siguiente certificado que firmemos será ese número. #> more index.txt V 160126001010Z 01 unknown /C=MX/ST=Guanajuato/O=Pato, S.A./OU=Sistemas/CN=www.pato.com En el archivo index.txt el tercer campo indica 01, que es el número de serie para el certificado recien creado y muestra también los campos del DN. #> ls -l certificados total 4 -rw-r--r-- 1 root root 2597 ene 27 18:10 01.pem En el directorio de certificados se guarda también con el correspondiente número de serie (01.pem) un archivo que complementa la base de datos de certificados que podemos ir creando. Y por último tenemos el certificado en si: #> ls -l certificado-pato.pem -rw-r--r-- 1 root root 2597 ene 27 18:10 certificado-pato.pem Y podemos inspeccionarlo: #> openssl x509 -in certificado-pato.pem -noout -text -purpose Instalando el certificado y la llave para Apache Tenemos entonces dos elementos ya generados que necesitaremos para Apache: • key.pem ---> • certificado-pato.pem ---> Hay algunas aplicaciones (no Apache) que requieren estos dos elementos en un solo archivo, como en el caso de stunnel: # > cat key.pem certificado-pato.pem > key-cert-pato.pem Simplemente se concatenan los dos archivos en uno. Pero esto no es necesario para el caso del servidor Web Apache. Lo que hay que hacer es copiar nuestros dos archivos en un directorio, de hecho podrían quedarse donde están, es lo de menos, pero por cuestión de orden y organización vamos a copiarlos a /etc/httpd/conf que en la mayoría de distribucciones es el directorio de configuración del Apache. NOTA IMPORTANTE: por ningún motivo los copies dentro del directorio raíz del servicio de Apache como /var/www/html ya que podrías dejar expuestos los archivos a todo el mundo y ser vulnerados. #> cp key.pem certificado-pato.pem /etc/httpd/conf/. Una vez copiados los archivos, hay que crear un servidor virtual en Apache, esto dentro del archivo de configuración httpd.conf, en algunas distribucciones como Fedora y otras dentro de /etc/httpd/conf.d hay un archivo llamado ssl.conf que es donde viene un servidor virtual ya creado, se puede tomar como plantilla. <VirtualHost 192.168.100.1:443> ServerName www.pato.com DocumentRoot /var/www/consulta ... (demás directivas del sitio) SSLEngine on SSLCertificateFile /etc/httpd/conf/certificado-pato.pem SSLCertificateKeyFile /etc/httpd/conf/key.pem </VirtualHost< También debe existir una línea que abre el puerto 443 a la escucha de paquetes. Esta fuera de las directivas del servidor virtual, búscala y si no esta agrégala, es la siguiente: Listen 443 Forzosamente debe ser un servidor virtual basado en IP, aqui lo indique con una IP (192.168.100.1) de una red privada pero en tu caso indica la IP homologada o real de tu sitio web o deja tu IP privada si es una Intranet. Observa también que la directiva DocumentRoot apunta a /var/www/consulta y no a /var/www/html, esto yo lo hago para que en /var/www/html dejes un simple index.html con una línea como la siguiente: <meta http-equiv="refresh" content="0;url=https://www.pato.com"> Esto hará que el usuario en su navegador especifique http://www.pato.com, es decir dirigido al puerto 80 y es cachado por la página index.html con el código que redirige al mismo servidor pero a https, es decir, puerto 443 y es donde entra en función el servidor virtual que a la vez redirige a /var/www/consulta donde se inicia la apliación de consulta o lo que se tenga. Pero lo interesante es que no hay necesidad de indicarle al usuario que indique https en el url. Para estás alturas ya sabes que al usuario le aparecerá un diálogo pidiéndole que acepte el certificado de la empresa Pato, S.A. Distribuir el certificado raíz CA Como ya había mencionado antes, si quieres evitar que a tus clientes cada vez que ingresen a tu sitio salga el molesto diálogo que pide aceptar el certificado, la única solución es que distribuyas el archivo cacert.pem, recuerda que este archivo es el que te identifica como una autoridad certificadora. Lo puedes poner a descarga desde tu propio sitio, o mandarlo por correo, como sea. Cuando el cliente lo tenga en su equipo deberá importarlo dentro del browser o navegador. Todos los navegadores en sus preferencias o herramientas tienen una opción de certificados y desde ahí existe un botón importar para realizar esto. Pues eso es todo, si todo funcionó bien, tienes ahora un sitio con encriptación de extremo a extremo y todo el tráfico viaja seguro, haciéndoles la vida mas difcil a los hackers de sombrero negro (black hat) que abundan por ahí. Suerte y por favor contáctame si tienes problemas, en la medida de lo posible te ayudaré. Referencias Buena parte de esta guía la tomé de los siguientes sitios: • http://www.eclectica.ca/howto/ssl-cert-howto.php • http://www.technoids.org/openssl.cnf.html • http://www.squarebox.co.uk/cgi-squarebox/manServer/usr/share/man/man1/ca.1ssl • http://www.openssl.org Y también de las mismas páginas del manual: #> man openssl #> man req #> man ca #> man x509 ¿Requieres de una instalación o configuración de Linux o sus servicios? ¿Un desarrollo WEB empresarial a la medida? ¿Un curso o capacitación a la medida? Revisa el sitio de SERVICIOS de LinuxTotal LinuxTotal en: Si encuentras útil la información que proveé LinuxTotal, considera realizar un donativo que estimule a seguir proporcionando contenido de calidad y utilidad. Gracias. Dona a través de paypal:: O a través de bitcoins: 14TNQv5wM3xkSv65gHGQ6s6f8yTZuFTohE Más artículos de LinuxTotal ¿Has visto esa combinación de r,w,x,- cuando listas un directorio?, tienes cierta idea que son los permisos, pero ¿como se usan.... mysqldump es una utilieria cliente de MySQL que te permite respaldar bases de datos. Aprende por ejemplos como utilizarlo. Puedes.... El comando find de Linux es extremadamente potente. No hay nada mejor para hacer todo tipo de búsquedas de archivos y carpetas qu.... Hay ocasiones que cuando busco un archivo dentro del listado de un directorio con varios archivos, usando ls, deseo ver solamente .... Una tarea administrativa algo común, es eventualmente tener que añadir un nuevo disco duro (IDE) al o a los que ya se tienen, de.... En Linux existen tres formas de controlar y mostrar la marca del tiempo en archvios y directorios. Asi es, cuando creas o editas u.... Hay múltiples maneras de cometer errores (algunos muy graves y desastrosos) cuando se administran servidores GNU/Linux, conócelo.... Aqui, traté de enviar un archivo ejecutable (notepad.exe) a través de gmail, y sus mecanismos de seguridad me lo impidieron. Gma.... SSH (Secure SHell), www.openssh.com, es la herramienta de conexión segura mas usada en el mundo Linux, no hay nada como ssh para .... Cuando tu creas un documento de texto en MSDOS/Windows (como por ejemplo en notepad.exe), Windows añade al final de cada línea u.... Copyright © LinuxTotal.com.mx 2006-2018 [email protected] · [email protected]
{ "url": "https://www.linuxtotal.com.mx/index.php?cont=info_seyre_001", "source_domain": "www.linuxtotal.com.mx", "snapshot_id": "crawl=CC-MAIN-2018-30", "warc_metadata": { "Content-Length": "313378", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:HHIKQU37RCXV5VIEGIG43NPZXE5RETRW", "WARC-Concurrent-To": "<urn:uuid:314fb533-d2e0-4b59-8714-b8f8b9bd6b58>", "WARC-Date": "2018-07-18T17:53:24Z", "WARC-IP-Address": "64.22.104.116", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:BRQG7FI46H3IQ235T5XNSNVBL75GTDJS", "WARC-Record-ID": "<urn:uuid:857d4c25-25c6-488c-87ba-c4767c0b00df>", "WARC-Target-URI": "https://www.linuxtotal.com.mx/index.php?cont=info_seyre_001", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:84309bdd-23af-4245-ad0c-cabcf1d83b31>" }, "warc_info": "robots: classic\r\nhostname: ip-10-171-47-163.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, 1, 73, 117, 155, 198, 199, 200, 236, 237, 277, 553, 554, 582, 583, 596, 597, 2408, 2409, 3321, 3322, 3323, 3374, 3375, 5003, 5468, 6405, 6406, 6502, 6846, 7089, 7090, 7211, 7212, 7460, 7566, 7567, 8090, 8091, 8162, 8910, 8911, 8965, 9330, 9839, 9840, 10067, 10068, 10918, 10919, 10920, 10934, 10935, 11080, 11081, 11099, 11116, 11117, 11162, 11163, 11182, 11209, 11210, 11770, 11771, 11888, 11889, 11890, 11910, 11911, 12269, 12270, 12282, 12291, 12321, 12322, 12591, 12592, 12711, 12712, 12734, 12760, 12779, 12780, 13010, 13084, 13085, 13086, 13111, 13112, 14182, 14183, 14547, 14548, 14636, 14660, 14694, 14697, 14737, 14739, 14766, 14767, 14838, 14841, 14886, 14937, 14944, 14971, 14972, 14987, 15074, 15154, 15235, 15314, 15390, 15459, 15542, 15625, 15709, 15777, 15815, 15886, 15963, 16048, 16117, 16118, 16173, 16190, 16256, 16302, 16338, 16410, 16494, 16533, 16534, 16595, 16603, 16681, 16746, 16819, 16905, 16992, 17077, 17142, 17143, 17224, 17265, 17343, 17370, 17426, 17467, 17521, 17570, 17603, 17651, 17686, 17735, 17776, 17835, 17868, 17900, 17932, 17991, 18024, 18025, 18082, 18128, 18138, 18206, 18244, 18279, 18313, 18394, 18429, 18464, 18524, 18578, 18619, 18650, 18661, 18739, 18775, 18863, 18864, 19029, 19030, 19039, 19094, 19146, 19200, 19250, 19299, 19302, 19303, 19331, 19332, 19947, 19948, 19997, 19998, 20389, 20390, 20463, 20464, 20536, 20585, 20586, 20624, 20635, 20649, 20696, 20719, 20754, 20760, 20833, 20864, 20940, 20998, 21045, 21093, 21099, 21139, 21175, 21211, 21237, 21270, 21305, 21350, 21351, 21411, 21412, 21436, 21463, 21480, 21494, 21514, 21531, 21532, 22017, 22018, 22061, 22062, 22102, 22196, 22197, 22615, 22616, 22650, 22651, 22670, 22698, 22763, 22828, 22893, 22958, 23023, 23088, 23153, 23218, 23283, 23348, 23413, 23478, 23543, 23608, 23673, 23738, 23803, 23868, 23933, 23946, 23972, 23975, 23976, 24025, 24026, 24052, 24084, 24107, 24147, 24148, 24213, 24278, 24343, 24408, 24473, 24538, 24603, 24668, 24733, 24798, 24863, 24928, 24985, 25015, 25016, 25350, 25351, 25396, 25431, 25465, 25466, 25635, 25636, 25680, 25727, 25728, 25772, 25810, 25811, 26085, 26086, 26161, 26162, 26222, 26287, 26288, 26540, 26541, 26609, 26647, 26708, 26722, 26759, 26765, 26838, 26869, 26945, 27003, 27050, 27098, 27104, 27144, 27180, 27216, 27242, 27275, 27310, 27355, 27356, 27692, 27693, 27726, 27727, 27750, 27767, 27768, 28064, 28065, 28105, 28106, 28128, 28164, 28229, 28294, 28359, 28424, 28489, 28554, 28619, 28684, 28749, 28778, 28812, 28813, 29211, 29212, 29266, 29267, 29291, 29292, 29545, 29546, 29621, 29644, 29683, 29726, 29771, 29784, 29831, 29877, 29921, 29961, 30007, 30045, 30093, 30167, 30197, 30198, 30199, 30257, 30295, 30313, 30316, 30317, 30678, 30679, 31090, 31091, 31106, 31109, 31110, 31228, 31229, 31247, 31335, 31336, 31484, 31485, 31507, 31515, 31564, 31565, 31748, 31749, 31792, 31793, 31823, 31886, 31887, 31913, 31914, 31977, 31978, 32027, 32028, 32103, 32104, 32121, 32151, 32152, 32271, 32272, 32329, 32330, 32732, 32733, 32926, 32927, 32980, 32981, 33298, 33299, 33335, 33363, 33398, 33435, 33452, 33512, 33562, 33577, 33578, 33757, 33758, 33769, 33770, 33992, 33993, 34190, 34191, 34256, 34257, 34856, 34857, 34891, 34892, 35517, 35518, 35837, 35838, 35839, 35851, 35852, 35911, 35912, 35965, 36011, 36093, 36120, 36121, 36165, 36166, 36181, 36192, 36202, 36214, 36215, 36216, 36288, 36332, 36370, 36413, 36414, 36429, 36430, 36597, 36598, 36599, 36625, 36626, 36627, 36651, 36652, 36653, 36688, 36716, 36717, 36849, 36850, 36851, 36985, 36986, 36987, 37121, 37122, 37123, 37258, 37259, 37260, 37393, 37394, 37395, 37530, 37531, 37532, 37665, 37666, 37667, 37800, 37801, 37802, 37936, 37937, 37938, 38071, 38072, 38073, 38074, 38114 ], "line_end_idx": [ 1, 73, 117, 155, 198, 199, 200, 236, 237, 277, 553, 554, 582, 583, 596, 597, 2408, 2409, 3321, 3322, 3323, 3374, 3375, 5003, 5468, 6405, 6406, 6502, 6846, 7089, 7090, 7211, 7212, 7460, 7566, 7567, 8090, 8091, 8162, 8910, 8911, 8965, 9330, 9839, 9840, 10067, 10068, 10918, 10919, 10920, 10934, 10935, 11080, 11081, 11099, 11116, 11117, 11162, 11163, 11182, 11209, 11210, 11770, 11771, 11888, 11889, 11890, 11910, 11911, 12269, 12270, 12282, 12291, 12321, 12322, 12591, 12592, 12711, 12712, 12734, 12760, 12779, 12780, 13010, 13084, 13085, 13086, 13111, 13112, 14182, 14183, 14547, 14548, 14636, 14660, 14694, 14697, 14737, 14739, 14766, 14767, 14838, 14841, 14886, 14937, 14944, 14971, 14972, 14987, 15074, 15154, 15235, 15314, 15390, 15459, 15542, 15625, 15709, 15777, 15815, 15886, 15963, 16048, 16117, 16118, 16173, 16190, 16256, 16302, 16338, 16410, 16494, 16533, 16534, 16595, 16603, 16681, 16746, 16819, 16905, 16992, 17077, 17142, 17143, 17224, 17265, 17343, 17370, 17426, 17467, 17521, 17570, 17603, 17651, 17686, 17735, 17776, 17835, 17868, 17900, 17932, 17991, 18024, 18025, 18082, 18128, 18138, 18206, 18244, 18279, 18313, 18394, 18429, 18464, 18524, 18578, 18619, 18650, 18661, 18739, 18775, 18863, 18864, 19029, 19030, 19039, 19094, 19146, 19200, 19250, 19299, 19302, 19303, 19331, 19332, 19947, 19948, 19997, 19998, 20389, 20390, 20463, 20464, 20536, 20585, 20586, 20624, 20635, 20649, 20696, 20719, 20754, 20760, 20833, 20864, 20940, 20998, 21045, 21093, 21099, 21139, 21175, 21211, 21237, 21270, 21305, 21350, 21351, 21411, 21412, 21436, 21463, 21480, 21494, 21514, 21531, 21532, 22017, 22018, 22061, 22062, 22102, 22196, 22197, 22615, 22616, 22650, 22651, 22670, 22698, 22763, 22828, 22893, 22958, 23023, 23088, 23153, 23218, 23283, 23348, 23413, 23478, 23543, 23608, 23673, 23738, 23803, 23868, 23933, 23946, 23972, 23975, 23976, 24025, 24026, 24052, 24084, 24107, 24147, 24148, 24213, 24278, 24343, 24408, 24473, 24538, 24603, 24668, 24733, 24798, 24863, 24928, 24985, 25015, 25016, 25350, 25351, 25396, 25431, 25465, 25466, 25635, 25636, 25680, 25727, 25728, 25772, 25810, 25811, 26085, 26086, 26161, 26162, 26222, 26287, 26288, 26540, 26541, 26609, 26647, 26708, 26722, 26759, 26765, 26838, 26869, 26945, 27003, 27050, 27098, 27104, 27144, 27180, 27216, 27242, 27275, 27310, 27355, 27356, 27692, 27693, 27726, 27727, 27750, 27767, 27768, 28064, 28065, 28105, 28106, 28128, 28164, 28229, 28294, 28359, 28424, 28489, 28554, 28619, 28684, 28749, 28778, 28812, 28813, 29211, 29212, 29266, 29267, 29291, 29292, 29545, 29546, 29621, 29644, 29683, 29726, 29771, 29784, 29831, 29877, 29921, 29961, 30007, 30045, 30093, 30167, 30197, 30198, 30199, 30257, 30295, 30313, 30316, 30317, 30678, 30679, 31090, 31091, 31106, 31109, 31110, 31228, 31229, 31247, 31335, 31336, 31484, 31485, 31507, 31515, 31564, 31565, 31748, 31749, 31792, 31793, 31823, 31886, 31887, 31913, 31914, 31977, 31978, 32027, 32028, 32103, 32104, 32121, 32151, 32152, 32271, 32272, 32329, 32330, 32732, 32733, 32926, 32927, 32980, 32981, 33298, 33299, 33335, 33363, 33398, 33435, 33452, 33512, 33562, 33577, 33578, 33757, 33758, 33769, 33770, 33992, 33993, 34190, 34191, 34256, 34257, 34856, 34857, 34891, 34892, 35517, 35518, 35837, 35838, 35839, 35851, 35852, 35911, 35912, 35965, 36011, 36093, 36120, 36121, 36165, 36166, 36181, 36192, 36202, 36214, 36215, 36216, 36288, 36332, 36370, 36413, 36414, 36429, 36430, 36597, 36598, 36599, 36625, 36626, 36627, 36651, 36652, 36653, 36688, 36716, 36717, 36849, 36850, 36851, 36985, 36986, 36987, 37121, 37122, 37123, 37258, 37259, 37260, 37393, 37394, 37395, 37530, 37531, 37532, 37665, 37666, 37667, 37800, 37801, 37802, 37936, 37937, 37938, 38071, 38072, 38073, 38074, 38114, 38166 ] }
{ "red_pajama_v2": { "ccnet_original_length": 38166, "ccnet_original_nlines": 538, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 1, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.10278096050024033, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.02551605924963951, "rps_doc_frac_lines_end_with_ellipsis": 0.018552880734205246, "rps_doc_frac_no_alph_words": 0.20670871436595917, "rps_doc_frac_unique_words": 0.2769607901573181, "rps_doc_mean_word_length": 5.651960849761963, "rps_doc_num_sentences": 349, "rps_doc_symbol_to_word_ratio": 0.016628440469503403, "rps_doc_unigram_entropy": 6.118772029876709, "rps_doc_word_count": 5304, "rps_doc_frac_chars_dupe_10grams": 0.06204549968242645, "rps_doc_frac_chars_dupe_5grams": 0.09490293264389038, "rps_doc_frac_chars_dupe_6grams": 0.06971778720617294, "rps_doc_frac_chars_dupe_7grams": 0.0677163302898407, "rps_doc_frac_chars_dupe_8grams": 0.06578157097101212, "rps_doc_frac_chars_dupe_9grams": 0.06204549968242645, "rps_doc_frac_chars_top_2gram": 0.0032023501116782427, "rps_doc_frac_chars_top_3gram": 0.008439520373940468, "rps_doc_frac_chars_top_4gram": 0.0052038198336958885, "rps_doc_books_importance": -3072.21044921875, "rps_doc_books_importance_length_correction": -3072.21044921875, "rps_doc_openwebtext_importance": -1513.381591796875, "rps_doc_openwebtext_importance_length_correction": -1513.381591796875, "rps_doc_wikipedia_importance": -1351.2701416015625, "rps_doc_wikipedia_importance_length_correction": -1351.2701416015625 }, "fasttext": { "dclm": 0.870649516582489, "english": 0.00392954982817173, "fineweb_edu_approx": 1.4858452081680298, "eai_general_math": 0.001238579978235066, "eai_open_web_math": 0.40675485134124756, "eai_web_code": 0.3441091775894165 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.822", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.678", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
2,929,580,216,919,548,400
Answers Solutions by everydaycalculation.com Answers.everydaycalculation.com » Multiply fractions Multiply 9/30 with 2/32 This multiplication involving fractions can also be rephrased as "What is 9/30 of 2/32?" 9/30 × 2/32 is 3/160. Steps for multiplying fractions 1. Simply multiply the numerators and denominators separately: 2. 9/30 × 2/32 = 9 × 2/30 × 32 = 18/960 3. After reducing the fraction, the answer is 3/160 MathStep (Works offline) Download our mobile app and learn to work with fractions in your own time: Android and iPhone/ iPad Related: © everydaycalculation.com
{ "url": "https://answers.everydaycalculation.com/multiply-fractions/9-30-times-2-32", "source_domain": "answers.everydaycalculation.com", "snapshot_id": "crawl=CC-MAIN-2021-31", "warc_metadata": { "Content-Length": "7481", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:QTGUT6B4Y3EUZOVUTCGLNGVEYXRAJVQG", "WARC-Concurrent-To": "<urn:uuid:0cf42d37-9909-4011-b2bc-1b1ed24982c1>", "WARC-Date": "2021-08-03T22:04:15Z", "WARC-IP-Address": "96.126.107.130", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:7QSBS4HPGU26QSRN3W5GH4VY72F6EPMX", "WARC-Record-ID": "<urn:uuid:50750794-2bff-436d-ba14-0056bdf322e7>", "WARC-Target-URI": "https://answers.everydaycalculation.com/multiply-fractions/9-30-times-2-32", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:7a899c41-8070-4bdb-baa4-5e97c09bf6f8>" }, "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-180.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }
{ "line_start_idx": [ 0, 8, 9, 46, 47, 100, 101, 125, 126, 215, 216, 238, 239, 271, 272, 337, 379, 433, 434, 459, 460, 535, 560, 561, 570, 571 ], "line_end_idx": [ 8, 9, 46, 47, 100, 101, 125, 126, 215, 216, 238, 239, 271, 272, 337, 379, 433, 434, 459, 460, 535, 560, 561, 570, 571, 596 ] }
{ "red_pajama_v2": { "ccnet_original_length": 596, "ccnet_original_nlines": 25, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.19548872113227844, "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.4962405860424042, "rps_doc_frac_unique_words": 0.7325581312179565, "rps_doc_mean_word_length": 5.348837375640869, "rps_doc_num_sentences": 10, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 3.9947781562805176, "rps_doc_word_count": 86, "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.017391299828886986, "rps_doc_frac_chars_top_3gram": 0.030434779822826385, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -43.34477233886719, "rps_doc_books_importance_length_correction": -57.268245697021484, "rps_doc_openwebtext_importance": -27.51344871520996, "rps_doc_openwebtext_importance_length_correction": -41.43692398071289, "rps_doc_wikipedia_importance": -17.543201446533203, "rps_doc_wikipedia_importance_length_correction": -31.4666748046875 }, "fasttext": { "dclm": 0.5057747960090637, "english": 0.8788782954216003, "fineweb_edu_approx": 2.2447845935821533, "eai_general_math": 0.011019470170140266, "eai_open_web_math": 0.1851380467414856, "eai_web_code": -0.0000066799998421629425 } }
{ "free_decimal_correspondence": { "primary": { "code": "513.24", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Geometry" } }, "secondary": { "code": "510", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "1", "label": "Factual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "5", "label": "Exceptionally Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }
ece34605c058195ed03b4d393ef1a36c
-7,386,159,625,496,905,000
Sway (Español) From ArchWiki Esta traducción de Sway fue revisada el 2024-06-03. Si existen cambios puede actualizarla o avisar al equipo de traducción. Sway (proveniente de S'irCmpwn's Way'land compositor [1]) es un compositor para Wayland (Español) diseñado para ser totalmente compatible con i3. Según el sitio web oficial: Sway es un compositor de Wayland en mosaico y un reemplazo directo del gestor de ventanas i3 para X11. Funciona con su configuración existente de i3 y soporta la mayoría de las características de i3, además de algunas adicionales. Si le interesan los efectos visuales llamativos consulte swayfxAUR, un fork de sway. Instalación Sway puede ser instalado con el paquete sway. La versión de desarrollo se puede instalar con sway-gitAUR. Se aconseja actualizar siempre wlroots cuando se actualice sway, debido a que ambos paquetes dependen uno del otro. Nota: Los drivers gráficos propietarios no están soportados], incluyendo NVIDIA. Después de la versión 495 del controlador de NVIDIA, sway funciona si activa kernel mode setting y ejecuta sway con --unsupported-gpu. También se recomienda instalar swaylock, swayidle y swaybg para bloquear la pantalla, configurar un gestor de inactividad y establecer fondos de pantalla respectivamente. Igualmente puede encontrar las versiones de desarrollo de estos paquetes en el AUR, como swaylock-gitAUR, swayidle-gitAUR y swaybg-gitAUR. Estos ofrecen las últimas funciones y actualizaciones de sus respectivos repositorios Git de los proyectos. El lanzador de aplicaciones por defecto es wmenu (aunque la configuración por defecto aún utiliza dmenu_path con dmenu) y el emulador de terminal por defecto es foot. Antes de iniciar sway se aconseja instalar estos paquetes o establecer un nuevo lanzador y terminal en el archivo de configuración. Para más versiones de programas compatibles con i3 se recomienda consultar la guía de migración en la wiki de sway. Inicio Antes de que Sway pueda iniciarse, este necesita acceder a tus dispositivos de hardware como el teclado, el ratón y la tarjeta gráfica. El conjunto de estos dispositivos de hardware se llama seat, como se menciona en sd-login(3). En Arch Linux, Sway puede obtener acceso a seat utilizando Si polkit ya está instalado en su sistema, Sway debería obtener automáticamente el acceso a seat. Alternativamente, si polkit no está instalado en su sistema y quiere usar seatd en su lugar, deberá agregarse al grupo de usuarios seat y active seatd.service, vuelve a iniciar la sesión y elige uno de los siguientes métodos para iniciar Sway. Manualmente Para iniciar Sway, ejecute sway en la consola. Automáticamente al ingresar a una TTY De forma similar al servidor gráfico X, Sway puede iniciar automáticamente al agregar el siguiente código en su archivo de inicio de la shell (véase Command-line shell (Español)#Intérprete de línea de órdenes de inicio de sesión): if [ -z "${WAYLAND_DISPLAY}" ] && [ "${XDG_VTNR}" -eq 1 ]; then exec sway fi Para más detalles, consulte Xinit (Español)#Inicio automático de X al inicio de sesión Desde un gestor de pantallas Nota: Sway no soporta gestores de pantallas oficilamente. [2] La sesión de sway se encuentra en /usr/share/wayland-sessions/sway.desktop. Esta es reconocida automáticamente por gestores de pantalla modernos como GDM y SDDM. Se puede iniciar sway como servicio de usuario de systemd a través del gestor de pantallas. También puede usar un gestor de sesiones de consola, consulte Display manager (Español)#Consola. Configuración Si usted ya usa i3, es posible copiar el archivo de configuración existente a ~/.config/sway/config y que este funcione de forma inmediata en sway. De otra forma, copie el archivo de configuración muestra ubicado en /etc/sway/config a ~/.config/sway/config. Consulte sway(5) para conocer más de la configuración. Nota: Se espera que la configuración de usuario contenga include /etc/sway/config.d/* para poder aplicar fragmentos de configuración de archivos drop-in. El paquete sway proporciona el archivo drop-in 50-systemd-user.conf, que importa varias variables de entorno en la sesión de usuario de systemd y dbus. Esto es necesario para varias aplicaciones como xdg-desktop-portal-wlr. Mapa de teclado Por defecto, sway inicia con la distribución de teclado US QWERTY. Para configurar por dispositivo de entrada: ~/.config/sway/config input * { xkb_layout "us,de,ru" xkb_variant "colemak,,typewriter" xkb_options "grp:win_space_toggle" } input <identifier> xkb_model "pc101" Para más detalles véase xkeyboard-config(7) y sway-input(5). El mapa de teclado también puede ser configurado usando variables de entorno (XKB_DEFAULT_LAYOUT, XKB_DEFAULT_VARIANT, etc.) al iniciar sway. Las opciones de configuración se priorizan ante las variables de ambiente. Tasa y retardo tipográfico Para modificar la tasa y retardo tipográfico, agregue las siguientes lineas a la sección input de configuración: ~/.config/sway/config input <identifier> repeat_delay 300 input <identifier> repeat_rate 30 Barra de estado Sway incluye una barra de estado, swaybar, que se ejecuta en un ambiente de Wayland (Español) puro. swaybar puede ejecutar un script o algún otro programa para mostrar información en la barra de estado. Consulte sway-bar(5) y swaybar-protocol(7) para más detalles. Tip: waybar es una barra de estado alternativa a la de defecto (swaybar). Instalar i3status es una opción para tener una barra de estado práctica por defecto en Wayland. Agregue el siguiente segmento de código al final de su archivo de configuración de sway: ~/.config/sway/config bar { status_command i3status } Para habilitar los colores en la salida de i3status necesitará modificar el siguiente segmento en la configuración de i3status: ~/.config/i3status/config general { colors = true interval = 5 } Outputs El comando output de sway permite configurar detalladamente diferentes salidas de pantalla (outputs en inglés). Esto incluye ajustes como el fondo de pantalla, factor de escala, posición, entre otros. Usted puede combinar múltiples comandos en una sola linea, de acuerdo a sus necesidades. ~/.config/sway/config output HDMI-A-1 mode 1920x1080 pos 1920 0 bg ~/wallpaper.png stretch Podemos referirnos a una salida de pantalla en específico utilizando sus nombres designados, también podemos referirnos a cualquier salida con "*", o mediante el uso de nombres específicos de las pantallas (usualmente una cadena de caracteres que consiste del nombre de la empresa, modelo y número de serie). Por ejemplo: ~/.config/sway/config output "Alguna Compañía ABC123 0x00000000" pos 1920 0 Se puede obtener una lista de los nombres de las salidas e información adicional con la orden: $ swaymsg -t get_outputs Para conocer más acerca de las opciones de configuración, consulte sway-output(5). Fondo de pantalla La visualización de un fondo de pantalla en sway es gestionada por un programa dedicado. El ejemplo más simple es swaybg, que sway puede gestionar directamente. El paquete swaybg debe ser instalado para poder ejecutar la orden output ... bg. La siguiente linea configura una imagen como fondo en todas las pantallas (output aplicará el comando a todas las pantallas "*"), esta puede ser colocada en cualquier parte del archivo de configuración: ~/.config/sway/config output "*" bg /ruta/a/imagen fill No olvide reemplazar /ruta/a/imagen con la ruta de una imagen existente. Puede usar colores sin transparencias como fondo: output * bg #000000 color Consulte la wiki de Sway para utilidades y herramientas adicionales de administración de fondo de pantalla. HiDPI Configure el factor de escala de pantallas con el comando output en su archivo de configuración. El factor de escala puede ser fraccional, aunque este suele ser un factor de 2 para pantallas HiDPI. ~/.config/sway/config output <nombre> scale <factor> Puede encontrar el nombre de la pantalla con ejecutando el comando: $ swaymsg -t get_outputs Dispositivos de entrada Es posible modificar individualmente la configuracion de los dispositivos de entrada. Por ejemplo, para activar "toque para hacer clic" y desplazamiento natural en todos los touchpads: ~/.config/sway/config input type:touchpad { tap enabled natural_scroll enabled } Para configurar un touchpad específico, use swaymsg -t get_inputs para obtener el identificador del dispositivo deseado y reemplácelo por type:touchpad. Nota: La salida del comando swaymsg -t get_inputs puede contener caracteres "\" para escapar símbolos como "/" (por ejemplo, "2:14:ETPS\/2_Elantech_Touchpad"). Estos caracteres necesitan ser eliminados. Puede encontrar más documentación en sway-input(5) y configuración adicional como perfiles de aceleración o cómo desactivar la entrada de dispositivos. Asignación de pantallas táctiles Los objetivos entradas táctiles de las pantallas táctiles usadas en entornos multipantalla pueden ser asignados a una sola pantalla. ~/.config/sway/config set $display1 "Dell Inc. DELL P2414H VHVTW542165L" set $display2 "Dell Inc. DELL P2418HT MYDM775F152L" set $display2-touch "8146:24835:Melfas_LGD_AIT_Touch_Controller" input $display2-touch map_to_output $display2 Atajos de teclado personalizados Las teclas especiales en su teclado pueden ser utilizadas para ejecutar órdenes, por ejemplo, para controlar el volumen, brillo del monitor o reproductores de música: ~/.config/sway/config bindsym XF86AudioRaiseVolume exec pactl set-sink-volume @DEFAULT_SINK@ +5% bindsym XF86AudioLowerVolume exec pactl set-sink-volume @DEFAULT_SINK@ -5% bindsym XF86AudioMute exec pactl set-sink-mute @DEFAULT_SINK@ toggle bindsym XF86AudioMicMute exec pactl set-source-mute @DEFAULT_SOURCE@ toggle bindsym XF86MonBrightnessDown exec brightnessctl set 5%- bindsym XF86MonBrightnessUp exec brightnessctl set 5%+ bindsym XF86AudioPlay exec playerctl play-pause bindsym XF86AudioNext exec playerctl next bindsym XF86AudioPrev exec playerctl previous bindsym XF86Search exec bemenu-run Para más detalles y programas adicionales véase: Para permitir que un atajo de teclado se pueda ejecutar mientras que la pantalla está bloqueada, agregue el parámetro --locked a bindsym. bindsym --locked XF86AudioPlay exec playerctl play-pause Sugerencia: wev es una herramienta que proveé funciones similares a xorg-xev en Wayland. Nota: Systemd administra algunas teclas especiales como la tecla de encendido, así como eventos, por ejemplo cuando se abre o cierra la tapa del equipo portátil. Existe la posibilidad de que estos interfieran con los configurados en Sway. Vea loginctl(1) y logind.conf(5) para detalles de cómo configurarlos en systemd (Español). Indicadores gráficos de la barra de estado A menudo es deseable que el porcentaje actual de algún valor, como el brillo o el volumen, sea indicado por una barra gráfica cuando se ajusta. Una opción para proporcionar esto en Sway es wob (o wob-gitAUR), que proporciona un subconjunto de funciones de la popular herramienta xobAUR pero como una utilidad nativa de Wayland que implementa el protocolo layer-shell. Consulte el sitio web del proyecto para ver ejemplos de uso. Vista general de los espacios de trabajo Si usa un gran número de espacios de trabajo con varias ventanas y le es difícil recordar la ubicación de estos, entonces sovAUR puede ser de ayuda. Es una ventana superpuesta (overlay) que muestra los esquemas de los espacios de trabajo, para hacer su navegación más sencilla. Muestra los nombres de los programas y ventanas, además soporta configuraciones de múltiples pantallas. Consulte la página del proyecto para más información. Idle Sway tiene un demonio de inactividad (idle) llamado swayidle que administra la inactividad de las sesiones. Existen muchas formas de iniciar y configurar el demonio. La más sencilla es usar el archivo de configuración de sway. swayidle acepta múltiples argumentos para configurar eventos como timeout (es decir, periodo de inactividad), resume (al reanudar de suspensión), before-sleep, etc. Consulte swayidle(1) para más conocer detalles de los eventos. Es posible asignar una acción a un evento. Para asignar múltiples acciones a un evento sólo repita el accionador (trigger). La siguientes lineas indican a swayidle bloquear la pantalla después de 30 minutos de inactividad y apagar la pantalla cinco segundos después del bloqueo: ~/.config/sway/config exec swayidle -w \ timeout 1800 'swaylock -f' \ timeout 1805 'swaymsg "output * dpms off"' \ resume 'swaymsg "output * dpms on"' Para apagar una pantalla bloqueada con más anticipación, como después de 10 segundos, filtre con grep el proceso del bloqueo de pantalla de la lista de procesos y ejecute swaymsg "output * dpms off" de la siguiente forma: timeout 10 'if pgrep -x swaylock; then swaymsg "output * dpms off"; fi' Para suspender y pausar medios de reproducción, anteceda las siguientes instrucciones al comando swayidle: before-sleep 'playerctl pause; swaylock' Nota: Systemd también administra algunos eventos de inactividad, estos pueden entrar en conflicto con los configurados en sway. Véase loginctl(1) y logind.conf(5) para detalles en cómo configuralos. Si no desea que swaylock se active mientras se reproducen vídeos en Firefox, Chrome o VLC puede usar idlehack-gitAUR para escuchar las peticiones de inhibición del dbus e invocar swayidle-inhibit. Programas como Firefox, Chrome y VLC emiten estos eventos para evitar que el sistema quede inactivo. Ventanas flotantes Para habilitar ventanas flotantes o asignaciones de modos, abra la aplicación y use los atributos app_ip, class, instance y title para habilitarla. El siguiente comando listará las propiedades de todas las ventanas abiertas. $ swaymsg -t get_tree Para obtener app_id de todas las ventanas abiertas escriba: $ swaymsg -t get_tree | grep "app_id" Y para el app_id de la ventana enfocada: $ swaymsg -t get_tree | jq -r '..|try select(.focused == true)' Las ventanas de X11 no cuentan con app_id. Sin embargo, puede usar atributos como class, window_type, window_role y/o instance para obtenerlas. Busque en la salida del comando swaymsg -t get_tree y configure reglas específicas para esas ventanas. ~/.config/sway/config for_window [app_id="galculator"] floating enable for_window [window_type="dialog"] floating enable for_window [window_role="dialog"] floating enable assign [class="firefox"] -> 3 assign [class="^Urxvt$" instance="^htop$"] -> 9 Este proceso es similar a usar xorg-xprop para conocer los atributos class o wm_name en X11. Al usar múltiples pantallas algunas ventanas flotantes pueden incrementar su tamaño más allá de una pantalla. Este comando centra y redimensiona la ventana flotantes al 80% del tamaño de la pantalla actual: $ swaymsg move position center; swaymsg resize set 80ppt 80ppt Portapapeles This article or section is a candidate for merging with Clipboard. Notes: No es específico a Sway. (Discuss in Talk:Sway (Español)) Por defecto, el portapapeles es vaciado cuando una ventana se cierra. Este comportamiento puede ser sorpresivo. Un "gestor de portapapeles" debe de ser instalado para que el contenido copiado se comparta entre las ventanas. Un ejemplo de un gestor de portapapeles diseñado para waylando es clipman[enlace roto 2023-10-29], el cual puede ser instalado con el paquete clipmanAUR or clipman-gitAUR. Para iniciar clipman simultáneamente a Sway, agregue la siguiente línea a su archivo de configuración: ~/.config/sway/config exec wl-paste -t text --watch clipman store --no-persist Xresources Copie ~/.Xresources a ~/.Xdefaults para usarlos en Sway. Xwayland Consulte Wayland (Español)#Xwayland para más detalles y un resumen de los paquetes disponibles. Xwayland se encuentra habilitado por defecto. Si desea deshabilitarlo y ejecutar una sesión de Wayland "pura", modifique su archivos de configuración con los siguientes valores: ~/.config/sway/config xwayland disable Para identificar qué ventanas están utilizando Xwayland, agregue la siguiente linea: ~/.config/sway/config for_window [shell="xwayland"] title_format "[Xwayland] %title" Nota: Algunos programas requieren variables de ambiente especiales u opciones de configuración para ejecutarse de forma nativa en Wayland, otros programas (incluyendo la mayoría de aplicaciones propietarias) no son compatibles con Wayland en los absoluto. Por el momento se recomienda mantener Xwayland para usar de aplicaciones no compatibles. Usar otro renderizador de wlroots Es posible usar otro renderizador de wlroots al asignar la variable de ambiente WLR_RENDERER. La lista de renderizadores disponibles está en la documentación de wlroots. Inicio automático Consulte i3#Autostart y modifique el nombre del archivo de configuración acorde al de sway. Consejos y trucos Habilita BloqMayus/BloqNum al inicio Sway desactiva las teclas BloqMayus (CapsLock) y BloqNum (NumLock) al iniciar. Para que sean activadas al inicio, modifique las configuraciones de entrada xkb_capslock y/o xkb_numlock a enable para sus teclados. Por ejemplo, para aplicarlo en todos los teclados, incluya las siguientes lineas en su configuración: ~/.config/sway/config input type:keyboard xkb_capslock enabled input type:keyboard xkb_numlock enabled En cualquier caso, BloqMayus y BloqNum pueden ser alternadas al presionar las teclas correspondientes en el teclado. Nota: Habilitar esta configuración usando el identificador wildcard puede causar errores en Firefox al recargar el archivo de configuración: Bugzilla 1652820. Intente especificar el teclado en su lugar. Distribución de teclado actual La distribución de teclado actual puede ser obtenida de la siguiente forma, donde kbd_identifier debe de ser reemplazado por el identificador del teclado actual: $ swaymsg -t get_inputs | jq -r '.[] | select(.identifier == "kbd_identifier") | .xkb_active_layout_name' Tecla de composición Para configurar PrintScreen (tecla de imprimir pantalla) como tecla de composición: $ swaymsg 'input * xkb_options compose:prsc' Las combinaciones disponibles para asignar a la tecla de composición se muestran en Xorg/Keyboard configuration#Configuring compose key. Estas incluso pueden ser configuradas en el archivo XCompose. Es necesario reiniciar las aplicaciones para que lo cambios se vean reflejados. This article or section needs expansion. Reason: Explique qué significa el siguiente consejo (por qué es útil). (Discuss in Talk:Sway (Español)) Puede buscar nombres de teclas en /usr/include/X11/keysymdef.h, o usar algún depurador como xev(1): xkbcli-interactive-wayland(1) (en /usr/lib/xkbcommon/). Alternar iluminación Para apagar (y encender) su pantalla con una tecla (por ejemplo, Pause), agregue el siguiente scrip a su archivo de configuración de Sway: #!/bin/sh read lcd < /tmp/lcd if [ "$lcd" -eq "0" ]; then swaymsg "output * dpms on" echo 1 > /tmp/lcd else swaymsg "output * dpms off" echo 0 > /tmp/lcd fi O use la opción toggle directamente, puede que deba especificar una pantalla específica si tiene múltiples pantallas: $ swaymsg "output nombre_pantalla dpms toggle" Capturar y compartir pantalla Véase Screen capture#Wayland. Ajuste de temperatura de color Véase Backlight#Wayland. Controlar swaynag con el teclado Swaynag es el programa de avisos incluido por defecto en sway, este sólo permite interacciones con el ratón. Un programa como swaynagmodeAUR puede ser usado para permitir la interacción a través del teclado. Swaynagmode funciona ejecutando swaynag primero, luego escucha por señales que activan aciones, como seleccionar el siguiente botón, ignorar el prompt o aceptar el botón seleccionado. Estas señales son enviadas lanzando otra instancia del script swaynagmode con argumentos de control, como swaynagmode --select right o swaynagmode --confirm. Swaynagmode activa por defecto el modo sway nag al iniciar seguido de default al finalizar. Esto permite definir atajos de teclado fácilmente en su archivo de configuración: ~/.config/sway/config set $nag exec swaynagmode mode "nag" { bindsym { Ctrl+d mode "default" Ctrl+c $nag --exit q $nag --exit Escape $nag --exit Return $nag --confirm Tab $nag --select prev Shift+Tab $nag --select next Left $nag --select next Right $nag --select prev Up $nag --select next Down $nag --select prev } } Tome en cuenta que desde la versión 1.2 de sway, los nombres de los modos diferencian entre mayúsculas y minúsculas (case-sensitive) Puede configurar sway para que use swaynagmode con el comando de configuración swaynag_command swaynagmode. Cambiar el tema y tamaño del cursor Para modificar el tamaño y tema del cursor: ~/.config/sway/config seat seat0 xcursor_theme my_cursor_theme my_cursor_size Donde my_cursor_theme puede asignarse o ser reemplazado por un valor específico como default, Adwaita o Simple-and-Soft, y my_cursor_size con valores como 48. Para ver los valores ejecute echo $XCURSOR_SIZE y echo $XCURSOR_THEME. Puede que necesite reiniciar las aplicaciones para ver reflejado el cambio. Nota: Wayland usa cursores del cliente (client-side en inglés). Por lo que es posible que algunas aplicaciones no evalúen los valores de $XCURSOR_SIZE y $XCURSOR_THEME. Administrar demonios de Sway con systemd Systemd provee graphical-session.target, la cual es una unidad de usuario de systemd que es activada cuando una sesión grafica es ejecutada, ya sea en Xorg o Wayland. Los servicios de usuario que deben de ejecutarse en todos los entornos gráficos pueden vincularse a este target. También permite que el target de un gestor de ventanas en particular sea vinculado a graphical-session.target para iniciar y detener servicio que deberían de iniciar sólo al usar ese gestor de ventanas. Véase systemd.special(7). Algunos usuarios quizá quieran iniciar algunos servicios/demonios (como swayidle o kanshi) sólo cuando el gestor de ventanas es Sway, y finalizar estos servicios cuando Sway se detiene. Además, usuarios que ejecuten systemd-oomd.service(8) puede que necesiten cgroups separados, para que un servicio no consuma toda la memoria y detenga la sesión de Sway (Consulte el reporte del bug de Fedora). Algunas o todas estas funciones las proveen los paquetes de Sway en Arch. Por ejemplo, el paquete sway incluye el archivo sway-session.target, tanto sway como sway-gitAUR proveen el archivo 50-systemd-user.conf (véase #Configuración). Si usted busca usar su propio método o un paquete específico como sway-systemd-gitAUR o sway-services-gitAUR para proveer dichas funciones, considere eliminar los archivos que brindan la misma funcionalidad. Estas funciones pueden brindarse mediante un método propio al crear un sway-session.target dejando los demonios/servicios necesitado por sway-session.target. Este target de systemd debería de ser un target de usuario (véase systemd/User). Por ejemplo: ~/.config/systemd/user/sway-session.target [Unit] Description=Sway compositor session Documentation=man:systemd.special BindsTo=graphical-session.target Wants=graphical-session-pre.target After=graphical-session-pre.target Luego agregue la siguiente linea al archivo de configuración de Sway (por ejemplo, agregue al final de ~/.config/sway/config, o en un nuevo archivo en /etc/sway/config.d/): ~/.config/sway/config ... ... ... exec_always "systemctl --user start sway-session.target" Con la linea anterior en el archivo de configuración, cuando Sway inicie también se activa sway-session.target. Finalmente, enlace los servicios necesitados a sway-session.target. Por ejemplo, agregue kanshi (o el servicio kanshi-gitAUR): ~/.config/systemd/user/kanshi.service [Unit] Description=Dynamic output configuration for Wayland compositors Documentation=https://sr.ht/~emersion/kanshi BindsTo=sway-session.target [Service] Type=simple ExecStart=/usr/bin/kanshi [Install] WantedBy=sway-session.target Cuando esta unidad de usuario sea activada, sólo se iniciará cuando Sway se ejecuta y se detendrá cuando Sway no se ejecute. La creación e importación del archivo sway-session.target al entorno puede ser lograda al instalar sway-systemd-gitAUR. Además de separar los servicios en cgroups, sway-systemd también coloca cada aplicación gráfica (GUI) en su propio cgroup. Esto habilita la limitación de recursos por cgroup en aplicaciones individuales. Consulte README de sway-systemd. Cambiar la resolución de pantalla después del inicio Puede utilizar la aplicaciones gráficas como wdisplaysAUR, swayrandrAUR o el programa de línea de comandos wlr-randr para cambiar la resolución, rotar, asignar un factor de escala y ordenar otras pantallas. Crear salidas de video headless Para crear salidas de video que no estén vinculadas a una interfaz de video física, HEADLESS-1, HEADLESS-2, etc.: $ swaymsg create_output Mostrar una descripción de la salida de video: $ swaymsg -pt get_outputs | grep -A 10 HEADLESS Para configurar la nueva salida de video use el comando output, por ejemplo: ~/.config/sway/config output HEADLESS-1 { pos 1920,0 mode 1280x720@75Hz } Cambiar la tecla modificadora a BloqMayus y mantener Super Para cambiar la tecla modificadora a BloqMayus y mantener la tecla Super funcionando en un teclado con distribución estadounidense, creé el archivo ~/.config/xkb/symbols/custom con los siguientes contenidos: ~/.config/xkb/symbols/custom xkb_symbols "basic" { include "us" name[Group1]= "English (US Custom)"; key <CAPS> { [ Hyper_L ] }; modifier_map Mod4 { Hyper_L }; key <LWIN> { [ Super_L ] }; modifier_map Mod5 { Super_L }; }; Para otros lenguajes edite la segunda y tercera línea. Luego agregue esta disposición de teclado en su archivo de configuración de sway, preferentemente al inicio del archivo. ~/.config/sway/config input * xkb_layout custom set $mod Mod4 set $super Mod5 Troubleshooting Lanzadores de aplicaciones Sugerencia: La wiki de sway también tiene una lista de lanzadores de aplicaciones conocidos. dmenu y rofi funcionan relativamente bien en Sway, sin embargo, estos se ejecutan bajo Xwayland, lo que puede ocasionar que dejen de responder si el cursor se mueve a una ventana nativa de Wayland. Esto se debe a que los clientes/ventanas de Wayland no tienen acceso a los dispositivos de entrada a menos que tengan enfoque de la pantalla. El servidor Xwayland es un cliente del compositor de Wayland, por lo que unos de los clientes de Xwayland debe estar enfocado para que tenga acceso a la entrada del usuario. Sin embargo, cuando un cliente está enfocado puede recolectar la entrada y hacerla disponible a todos los clientes de Xwayland a través del protocolo X11. Por esta razón, mover el cursor a una ventana de Xwayland y presionar la tecla Esc debería corregir el problema, también ejecutar pkill ayuda. bemenu es un reemplazo de dmenu nativo de Wayland. Opcionalmente puede ser usado con j4-dmenu-desktop para proveer una solución nativa de Wayland para lanzar archivos de escritorio (desktop files) (como i3-dmenu-desktop): j4-dmenu-desktop --dmenu='bemenu -i --nb "#3f3f3f" --nf "#dcdccc" --fn "pango:DejaVu Sans Mono 12"' --term='termite' Necesitará configurar la variable de entorno BEMENU_BACKEND a "wayland" si decide no desactivar Xwayland. También puede crear su propio lanzador de aplicaciones usando una terminal flotante ejecutando fzf como se discute en este issue de GitHub. Igualmente el binario krunner del paquete plasma-workspace puede servir como un lanzador, ofreciendo soporte para Xwayland y Wayland nativo. rofi-wayland es un fork de rofi que se ejecuta en Wayland y tiene una bandera -x11 por si es necesario utilizarlo en una sesión de X11. wofi es un lanzador de comandos, que provee algunas características de rofi bajo Wayland. Sin embargo, rofi carece de un modo SSH y modo "alternar ventana". Está basado en la biblioteca wlroots y usa GTK3 para el renderizado. Funciona bastante bien en sway. fuzzel es otro lanzador de aplicaciones para compositores de Wayland basados en wlroots, es muy parecido al modo drun de rofi. Virtualización Sway funciona con VirtualBox (Español) y VMware ESXi. Para que Sway funcione en QEMU (Español), este debe de iniciarse con la bandera -vga qxl. Véase también QEMU#qxl. No es posible iniciar Sway desde una tty Para ESXi necesita habilitar el soporte 3D en el menú Hardware Configuration > Video card settings. Véase VMware#Enable 3D graphics on Intel, Optimus and AMD para más detalles. El cursor no es visible Cuando ciertos controladores gráficos están en uso (como los controladores gráficos VMSVGA o NVIDIA), el cursor se vuelve invisible. Esto puede ser arreglado usando software de cursores, como se menciona en [3]: $ export WLR_NO_HARDWARE_CURSORS=1 El socket de Sway no es detectado Al invocar swaymsg con algún argumento, como swaymsg -t get_outputs, puede devolver un mensaje de error: sway socket not detected. ERROR: Unable to connect to cuando se ejecuta el comando dentro de un multiplexador de terminal (como GNU Screen or tmux). Esto significa que swaymsg no pudo conectarse al socket designado en SWAYSOCK. Para conocer el valor actual de SWAYSOCK escriba: $ env | grep -F "SWAYSOCK" SWAYSOCK=/run/user/1000/sway-ipc.1000.4981.sock Una forma de solucionar este problema es intentar conectarse a un socked del proceso de ejecución de sway: $ export SWAYSOCK=/run/user/$(id -u)/sway-ipc.$(id -u).$(pgrep -x sway).sock Para evitar ese error simplemente ejecute el comando fuera de un multiplexador. Falló la conexión al servidor Wayland Tmux crea variables de entorno locales para cada sesión (para visualizarlas escriba: tmux show-environment). Debido a esto, si intenta volver a conectarse a una sesión previa de tmux usando tmux-resurrect o tmux-continuum, o si su servidor de tmux inicia antes que sway, entonces las variables de entorno estarán desactualizadas. Puede usar update-environment en .tmux.conf para indicarle a tmux que actualice las variables cuando se reconecta a la sesión: set-option -g update-environment "DISPLAY WAYLAND_DISPLAY SWAYSOCK SSH_AUTH_SOCK" No fue posible recuperar la ruta del socket Al solicitar mensajes desde una tty con swaymsg -t puede devolver el siguiente mensaje: Unable to retrieve socket path La variable de entorno SWAYSOCK se asigna después de iniciar Sway, por esta razón la solución es ejecutar swaymsg -t [message] en una terminal dentro de Sway. Atajos de teclado y distribuciones de teclado Por defecto si usa mas de una distribución de teclado, por ejemplo input * xkb_layout "us,ru", los atajos de teclado pueden fallar cuando cambia a una distribución de teclado secundaria. Gracias a https://github.com/swaywm/sway/pull/3058, sólo necesita agregar la bandera --to-code a lineas con el comando bindsym como: bindsym --to-code { $mod+$left focus left $mod+$down focus down $mod+$up focus up $mod+$right focus right } Alternativamente puede crear la variable set $mybind bindsym --to-code y reemplazar todas las ocurrencias de bindsym con $mybind de esta forma: $mybind $mod+w accion Aplicaciones en Java Algunas aplicaciones desarrolladas en Java mostrarán una ventana en blanco cuando inician, por ejemplo cualquier editor de JetBrains como IntelliJ, CLion, or PyCharm. Para evitar esto, la aplicación debe de ser iniciada con la variable de entorno _JAVA_AWT_WM_NONREPARENTING asignada a 1. En caso de iniciar la aplicación usando lanzadores de aplicaciones como rofi o dmenu se recomienda modificar el archivo de aplicación como se muestra en Desktop entries#Modify environment variables. Algunos errores han sido corregidos en OpenJDK 11 y Sway 1.5. Sin embargo, ciertas aplicaciones requieren configuración adicional para funcionar correctamente con versiones más recientes de OpenJDK, por ejemplo, en el caso de Android Studio se debe asignar la variable STUDIO_JDK=/usr/lib/jvm/java-11-openjdk/. [4] El JRE tiene una lista de gestores de ventanas conocidos, en la cual Sway no se encuentra. Si experimenta paneles grises, menús mal ubicados o ventanas con dimensiones incorrectas, consulte Java#Impersonate another window manager (en inglés). Desplazamiento en el borde Si usar la rueda de desplazamiento del ratón (scroll) en el borde de una aplicación provoca un fallo en sway, puede usar border none para el app_id correspondiente (por ejemplo, Firefox). Program cannot open display Si al iniciar un programa se muestra el mensaje de error "cannot open display", es posible que el programa funcione sólo bajo X11. Usted puede usar Xwayland para ejecutar programas de X11 en Wayland, consulte #Xwayland para más detalles. El ratón no funciona en aplicaciones de WINE Cuando ejecuta programas WINE espera que exista una pantalla principal sea asignada, esto puede causar errores (como clics que no son registrados) debido a que no existe el concepto de una pantalla principal en Wayland. Para evitar esto, agregue esta linea a su configuración de Sway para asignar una pantalla principal que sea usada por Xwayland mediante xrandr: ~/.config/sway/config ... exec_always xrandr --output XWAYLAND0 --primary ... El desplazamiento (offset) de la posición de pantalla debe de ser 0,0 para que esto funcione, debido a un bug [5] en sway. Tome en cuenta que XWAYLAND0 (o cualquier nombre de pantalla de XWAYLAND) puede no representar su pantalla y sea susceptible a cambiar en diferentes sesiones. En su lugar, especifique la primer pantalla XWAYLAND usando la siguiente linea: exec_always xrandr --output $(xrandr | grep -m 1 XWAYLAND | awk '{print $1;}') --primary Quizá necesite modificar estas instrucciones a sus necesidades. Para identificar los nombres asignados a las pantallas use el comando xrandr sin argumentos. Nota: Xwayland reconocerá cualquier pantalla conectada recientemente (incluyendo pantallas apagadas y encendidas) como nuevas pantallas. Si esto sucede su "pantalla primaria" ya no será considerada primaria. Flickering en videojuegos con GPUs de NVIDIA Aunque los controladores gráficos propietarios como NVIDIA no cuentan con soporte oficial, es posible usarlos incluyendo para videojuegos. Al hacer uso de ellos usted puede encontrar flickering (parpadeo) en la parte superior de la pantalla, que puede ser arreglado al reemplazar wlroots con wlroots-nvidiaAUR, o compilando manualmente su propia versión con el parche. Véase también
{ "url": "https://wiki.archlinux.org/title/Sway_(Espa%C3%B1ol)", "source_domain": "wiki.archlinux.org", "snapshot_id": "CC-MAIN-2024-30", "warc_metadata": { "Content-Length": "123844", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:SBK2ZQS2VYLZLEESHNDBSV5KOC4L3HBE", "WARC-Concurrent-To": "<urn:uuid:bf91df58-3ee1-44e3-8252-f80212f1f189>", "WARC-Date": "2024-07-21T20:33:25Z", "WARC-IP-Address": "135.181.27.174", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:I7OCQB4FORKFDCLCZADQRXP5U5INK5EA", "WARC-Record-ID": "<urn:uuid:1fb0f58d-aa5d-4a1c-8c9f-d7bc0aa24be1>", "WARC-Target-URI": "https://wiki.archlinux.org/title/Sway_(Espa%C3%B1ol)", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:74ecbd46-4cb2-4f43-937c-444ee5670f15>" }, "warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-173\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, 15, 16, 30, 154, 155, 329, 330, 561, 562, 647, 648, 660, 661, 883, 884, 1100, 1101, 1519, 1520, 1935, 1936, 1943, 1944, 2174, 2175, 2234, 2235, 2333, 2334, 2578, 2579, 2591, 2592, 2639, 2640, 2678, 2679, 2910, 2911, 2975, 2987, 2990, 2991, 3078, 3079, 3108, 3109, 3171, 3172, 3334, 3335, 3427, 3428, 3525, 3526, 3540, 3541, 3854, 3855, 4233, 4234, 4250, 4251, 4362, 4363, 4385, 4395, 4421, 4459, 4498, 4500, 4501, 4538, 4539, 4600, 4601, 4818, 4819, 4846, 4847, 4960, 4961, 4983, 5019, 5053, 5054, 5070, 5071, 5336, 5337, 5411, 5412, 5597, 5598, 5620, 5626, 5654, 5656, 5657, 5785, 5786, 5812, 5822, 5840, 5857, 5859, 5860, 5868, 5869, 6159, 6160, 6182, 6251, 6252, 6574, 6575, 6597, 6651, 6652, 6747, 6748, 6773, 6774, 6857, 6858, 6876, 6877, 7119, 7120, 7323, 7324, 7346, 7380, 7381, 7454, 7455, 7505, 7506, 7532, 7533, 7641, 7642, 7648, 7649, 7847, 7848, 7870, 7901, 7902, 7970, 7971, 7996, 7997, 7998, 8022, 8023, 8208, 8209, 8231, 8253, 8269, 8296, 8298, 8299, 8452, 8453, 8656, 8657, 8809, 8810, 8843, 8844, 8977, 8978, 9000, 9057, 9115, 9180, 9182, 9228, 9229, 9262, 9263, 9430, 9431, 9453, 9528, 9603, 9672, 9748, 9805, 9860, 9908, 9950, 9996, 10031, 10032, 10081, 10082, 10220, 10221, 10278, 10367, 10697, 10698, 10741, 10742, 11171, 11172, 11213, 11214, 11650, 11651, 11656, 11657, 12236, 12237, 12392, 12393, 12415, 12434, 12464, 12510, 12547, 12548, 12770, 12771, 12843, 12844, 12951, 12952, 12993, 13192, 13193, 13491, 13492, 13511, 13512, 13737, 13738, 13760, 13761, 13821, 13822, 13860, 13861, 13902, 13903, 13967, 13968, 14215, 14216, 14238, 14287, 14337, 14387, 14417, 14465, 14466, 14559, 14560, 14767, 14768, 14831, 14832, 14845, 14846, 14913, 14914, 14979, 14980, 15092, 15093, 15205, 15206, 15378, 15379, 15482, 15483, 15505, 15562, 15563, 15574, 15575, 15632, 15633, 15642, 15643, 15739, 15740, 15786, 15787, 15919, 15920, 15942, 15959, 15960, 16045, 16046, 16068, 16131, 16476, 16477, 16511, 16512, 16682, 16683, 16701, 16702, 16794, 16795, 16813, 16814, 16851, 16852, 17166, 17167, 17189, 17230, 17270, 17271, 17388, 17389, 17592, 17593, 17624, 17625, 17787, 17788, 17894, 17895, 17916, 17917, 18001, 18002, 18047, 18048, 18327, 18328, 18369, 18370, 18474, 18475, 18631, 18632, 18653, 18654, 18793, 18794, 18804, 18824, 18856, 18891, 18917, 18926, 18962, 18988, 18995, 18996, 19114, 19115, 19162, 19163, 19193, 19194, 19224, 19225, 19256, 19257, 19282, 19283, 19316, 19317, 19525, 19526, 19868, 19869, 20043, 20044, 20066, 20092, 20105, 20117, 20146, 20147, 20173, 20199, 20225, 20226, 20255, 20256, 20289, 20322, 20323, 20356, 20389, 20390, 20423, 20456, 20460, 20462, 20463, 20596, 20597, 20705, 20706, 20742, 20743, 20787, 20788, 20810, 20866, 20867, 21026, 21027, 21098, 21099, 21175, 21176, 21345, 21346, 21387, 21388, 21897, 21898, 22294, 22295, 22530, 22531, 22739, 22740, 22992, 22993, 23036, 23043, 23079, 23113, 23146, 23181, 23216, 23217, 23390, 23391, 23413, 23417, 23421, 23425, 23482, 23483, 23595, 23596, 23723, 23724, 23762, 23769, 23834, 23879, 23907, 23908, 23918, 23930, 23956, 23957, 23967, 23996, 23997, 24122, 24123, 24480, 24481, 24534, 24535, 24742, 24743, 24775, 24776, 24890, 24891, 24915, 24916, 24963, 24964, 25012, 25013, 25090, 25091, 25113, 25133, 25144, 25163, 25165, 25166, 25225, 25226, 25434, 25435, 25464, 25486, 25503, 25544, 25576, 25611, 25643, 25678, 25681, 25682, 25858, 25859, 25881, 25907, 25921, 25937, 25938, 25954, 25955, 25982, 25983, 26076, 26077, 26889, 26890, 27112, 27113, 27230, 27231, 27337, 27338, 27478, 27479, 27620, 27621, 27757, 27758, 28016, 28017, 28144, 28145, 28160, 28161, 28215, 28216, 28330, 28331, 28372, 28373, 28550, 28551, 28575, 28576, 28788, 28789, 28824, 28825, 28859, 28860, 28965, 28966, 28992, 29020, 29021, 29195, 29196, 29246, 29247, 29274, 29322, 29323, 29430, 29431, 29508, 29509, 29589, 29590, 29628, 29629, 29959, 29960, 30087, 30088, 30170, 30171, 30215, 30216, 30304, 30305, 30336, 30337, 30496, 30497, 30543, 30544, 30731, 30732, 30865, 30866, 30886, 30910, 30934, 30954, 30980, 30982, 30983, 31149, 31150, 31171, 31172, 31461, 31462, 31661, 31662, 31977, 31978, 32221, 32222, 32249, 32250, 32438, 32439, 32467, 32468, 32706, 32707, 32752, 32753, 33117, 33118, 33140, 33144, 33192, 33196, 33197, 33320, 33321, 33560, 33561, 33650, 33651, 33808, 33809, 34017, 34018, 34063, 34064, 34433, 34434 ], "line_end_idx": [ 15, 16, 30, 154, 155, 329, 330, 561, 562, 647, 648, 660, 661, 883, 884, 1100, 1101, 1519, 1520, 1935, 1936, 1943, 1944, 2174, 2175, 2234, 2235, 2333, 2334, 2578, 2579, 2591, 2592, 2639, 2640, 2678, 2679, 2910, 2911, 2975, 2987, 2990, 2991, 3078, 3079, 3108, 3109, 3171, 3172, 3334, 3335, 3427, 3428, 3525, 3526, 3540, 3541, 3854, 3855, 4233, 4234, 4250, 4251, 4362, 4363, 4385, 4395, 4421, 4459, 4498, 4500, 4501, 4538, 4539, 4600, 4601, 4818, 4819, 4846, 4847, 4960, 4961, 4983, 5019, 5053, 5054, 5070, 5071, 5336, 5337, 5411, 5412, 5597, 5598, 5620, 5626, 5654, 5656, 5657, 5785, 5786, 5812, 5822, 5840, 5857, 5859, 5860, 5868, 5869, 6159, 6160, 6182, 6251, 6252, 6574, 6575, 6597, 6651, 6652, 6747, 6748, 6773, 6774, 6857, 6858, 6876, 6877, 7119, 7120, 7323, 7324, 7346, 7380, 7381, 7454, 7455, 7505, 7506, 7532, 7533, 7641, 7642, 7648, 7649, 7847, 7848, 7870, 7901, 7902, 7970, 7971, 7996, 7997, 7998, 8022, 8023, 8208, 8209, 8231, 8253, 8269, 8296, 8298, 8299, 8452, 8453, 8656, 8657, 8809, 8810, 8843, 8844, 8977, 8978, 9000, 9057, 9115, 9180, 9182, 9228, 9229, 9262, 9263, 9430, 9431, 9453, 9528, 9603, 9672, 9748, 9805, 9860, 9908, 9950, 9996, 10031, 10032, 10081, 10082, 10220, 10221, 10278, 10367, 10697, 10698, 10741, 10742, 11171, 11172, 11213, 11214, 11650, 11651, 11656, 11657, 12236, 12237, 12392, 12393, 12415, 12434, 12464, 12510, 12547, 12548, 12770, 12771, 12843, 12844, 12951, 12952, 12993, 13192, 13193, 13491, 13492, 13511, 13512, 13737, 13738, 13760, 13761, 13821, 13822, 13860, 13861, 13902, 13903, 13967, 13968, 14215, 14216, 14238, 14287, 14337, 14387, 14417, 14465, 14466, 14559, 14560, 14767, 14768, 14831, 14832, 14845, 14846, 14913, 14914, 14979, 14980, 15092, 15093, 15205, 15206, 15378, 15379, 15482, 15483, 15505, 15562, 15563, 15574, 15575, 15632, 15633, 15642, 15643, 15739, 15740, 15786, 15787, 15919, 15920, 15942, 15959, 15960, 16045, 16046, 16068, 16131, 16476, 16477, 16511, 16512, 16682, 16683, 16701, 16702, 16794, 16795, 16813, 16814, 16851, 16852, 17166, 17167, 17189, 17230, 17270, 17271, 17388, 17389, 17592, 17593, 17624, 17625, 17787, 17788, 17894, 17895, 17916, 17917, 18001, 18002, 18047, 18048, 18327, 18328, 18369, 18370, 18474, 18475, 18631, 18632, 18653, 18654, 18793, 18794, 18804, 18824, 18856, 18891, 18917, 18926, 18962, 18988, 18995, 18996, 19114, 19115, 19162, 19163, 19193, 19194, 19224, 19225, 19256, 19257, 19282, 19283, 19316, 19317, 19525, 19526, 19868, 19869, 20043, 20044, 20066, 20092, 20105, 20117, 20146, 20147, 20173, 20199, 20225, 20226, 20255, 20256, 20289, 20322, 20323, 20356, 20389, 20390, 20423, 20456, 20460, 20462, 20463, 20596, 20597, 20705, 20706, 20742, 20743, 20787, 20788, 20810, 20866, 20867, 21026, 21027, 21098, 21099, 21175, 21176, 21345, 21346, 21387, 21388, 21897, 21898, 22294, 22295, 22530, 22531, 22739, 22740, 22992, 22993, 23036, 23043, 23079, 23113, 23146, 23181, 23216, 23217, 23390, 23391, 23413, 23417, 23421, 23425, 23482, 23483, 23595, 23596, 23723, 23724, 23762, 23769, 23834, 23879, 23907, 23908, 23918, 23930, 23956, 23957, 23967, 23996, 23997, 24122, 24123, 24480, 24481, 24534, 24535, 24742, 24743, 24775, 24776, 24890, 24891, 24915, 24916, 24963, 24964, 25012, 25013, 25090, 25091, 25113, 25133, 25144, 25163, 25165, 25166, 25225, 25226, 25434, 25435, 25464, 25486, 25503, 25544, 25576, 25611, 25643, 25678, 25681, 25682, 25858, 25859, 25881, 25907, 25921, 25937, 25938, 25954, 25955, 25982, 25983, 26076, 26077, 26889, 26890, 27112, 27113, 27230, 27231, 27337, 27338, 27478, 27479, 27620, 27621, 27757, 27758, 28016, 28017, 28144, 28145, 28160, 28161, 28215, 28216, 28330, 28331, 28372, 28373, 28550, 28551, 28575, 28576, 28788, 28789, 28824, 28825, 28859, 28860, 28965, 28966, 28992, 29020, 29021, 29195, 29196, 29246, 29247, 29274, 29322, 29323, 29430, 29431, 29508, 29509, 29589, 29590, 29628, 29629, 29959, 29960, 30087, 30088, 30170, 30171, 30215, 30216, 30304, 30305, 30336, 30337, 30496, 30497, 30543, 30544, 30731, 30732, 30865, 30866, 30886, 30910, 30934, 30954, 30980, 30982, 30983, 31149, 31150, 31171, 31172, 31461, 31462, 31661, 31662, 31977, 31978, 32221, 32222, 32249, 32250, 32438, 32439, 32467, 32468, 32706, 32707, 32752, 32753, 33117, 33118, 33140, 33144, 33192, 33196, 33197, 33320, 33321, 33560, 33561, 33650, 33651, 33808, 33809, 34017, 34018, 34063, 34064, 34433, 34434, 34447 ] }
{ "red_pajama_v2": { "ccnet_original_length": 34447, "ccnet_original_nlines": 645, "rps_doc_curly_bracket": 0.0009289599838666618, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.06377708911895752, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01439628005027771, "rps_doc_frac_lines_end_with_ellipsis": 0.007739940192550421, "rps_doc_frac_no_alph_words": 0.21222910284996033, "rps_doc_frac_unique_words": 0.28927162289619446, "rps_doc_mean_word_length": 5.750570774078369, "rps_doc_num_sentences": 281, "rps_doc_symbol_to_word_ratio": 0.003715170081704855, "rps_doc_unigram_entropy": 6.093299865722656, "rps_doc_word_count": 4819, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.035219401121139526, "rps_doc_frac_chars_dupe_6grams": 0.01353203970938921, "rps_doc_frac_chars_dupe_7grams": 0.0032476899214088917, "rps_doc_frac_chars_dupe_8grams": 0.0032476899214088917, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.01270208042114973, "rps_doc_frac_chars_top_3gram": 0.012449479661881924, "rps_doc_frac_chars_top_4gram": 0.005412819795310497, "rps_doc_books_importance": -2772.884033203125, "rps_doc_books_importance_length_correction": -2772.884033203125, "rps_doc_openwebtext_importance": -1583.697021484375, "rps_doc_openwebtext_importance_length_correction": -1583.697021484375, "rps_doc_wikipedia_importance": -855.7329711914062, "rps_doc_wikipedia_importance_length_correction": -855.7329711914062 }, "fasttext": { "dclm": 0.8280738592147827, "english": 0.0037338100373744965, "fineweb_edu_approx": 1.2851250171661377, "eai_general_math": 0.0002934900112450123, "eai_open_web_math": 0.35706257820129395, "eai_web_code": 0.6757454872131348 } }
{ "free_decimal_correspondence": { "primary": { "code": "004.0285", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "005.456", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }
ece34605c058195ed03b4d393ef1a36c
8,787,903,798,283,828,000
How To Get On The Dark Web On Laptop Am pretty sure you deep cp links know exactly what hacking is and how bad it can be when you fall into the hands of a hacker. The dark web is an office for almost all types. Find the perfect dark web hacker stock photo, image, vector, illustration or 360 image. Hacker with laptop initiating cyber attack Stock Photo. THE LAPTOP IS GETTING HOT JNE. Langian, I have the same problem Ctrl Alt Right Arrow: Flips the screen to the right Dark Web Browsers Just uncheck. Accessing the dark web on your desktop or laptop. We suggest using either Tor Browser or Brave to browse the dark web. Using. Make sure to bookmark some good dark web links lists for your dark web browsing. It's NOT! Today I was on my laptop surfing the Internet. A small business owner looks at his laptop computer while inside Assets are important because they're used to calculate your net worth. The dark web market was exclusively accessible via the Tor network ( buy > 50 cvv price 12 = 1cvv) ship laptop hp dell = 120 ship. NordVPN on a laptop Dark Web Monitor works automatically, but is turned off by Enabling Dark Web Monitor as well got us to 57. Toggling dark mode with any theme is easy: click on the Messenger icon on the top left of the web page, and set your preference. Cyber criminals now have decentralized darknet market access to the most-secured data files used to facilitate confidential communication between organisations' servers. A laptop surrounded by a spider web Dark web spaces have developed a reputation for the unsavoryshadowy enclaves for. You can't use standard access methods to gain entry into the Dark Web. The most common method is through the Tor network, an anonymous network. The Tor browser is the only browser that lets you visit the dark web. your Computer or laptop with Wi-Fi connection through which you have to access the. Once you download and install Tor, you'll have to go through a very quick setup process. Tor will ask you whether you want to connect directly. The Dark Net How to access into Dark Net? The onion router breaks the direct link between the source and the destination computer. Who uses. 'Unfriended: Dark Web' review: Further laptop adventures turn too grim. By Katie Walsh. Chicago Tribune. Jul 19, 2024 at 12:22 pm. Although I seem to have forgotten where it was, I was reading some blog post that said something like this: While browsing the dark web it is. Laptop Mag. You can get your code in 115 seconds... Prev post Internet of things vacancies in the medical industry were the hardest tech. (CODE Sidebar or side navbar is mostly used dbol steroid pills in web application side in a vertical Dark Web Design Bangla Tutorial Session 14 PSD to Bootstrap Template. 5 Best Laptop for Dark Web (Best for Tail OS)- 2024 Review ASUS VIVOBOOK F512 Apple MacBook pro LENOVO FLEX 11 ASUS X205TA ACER ASPIRE 5. If you want to surf the Darknet, you first need anonymous access to the Tor network. Tor is originally an abbreviation for The Onion Router and it is a. Accessing the dark web on your desktop or laptop. We suggest using either Tor Browser or Brave to browse the dark web. Using. To access the dark web, you'll need a virtual private network (VPN) and an anonymous browser like The Onion Router (Tor). Tor sends your web. The film is a sequel to the 2024 film Unfriended, and follows a group of friends who find a laptop that has access to the dark web, only to realize they are. I've already started it, but it bears repeating: the dark web cannot be accessed by standard search engines, regardless of whether you're using a Windows laptop. TAILS darkweb sites reddit OS, it's a linux distro darkweb форум but you put it in your flash drive. It's got Tor built-in, and when you turn off your computer/laptop all the data. The deep web search engines 2024 are the ones that help you get sites that to download & install Torch Browser on Windows 10 PC/laptop in simple way. Hacker,Code,In,Laptop.,Cyber,Security,,Privacy, or available on the dark web allow cyber criminals to make their way into computers. The Dutch Institute for Vulnerability Disclosure (DIVD) on Sunday revealed it had alerted Kaseya to a number of zero-day vulnerabilities in its VSA software (CVE-2021-30116) that it said were being exploited as a conduit to deploy ransomware. Kennedy also provided control of his financial accounts used to facilitate his criminal activity, including an account [on] the how to get on the dark web on laptop online Bitcoin exchange how to get on the dark web on laptop mtgox. Common information such as book and product listings, software, press releases, and so forth may turn up multiple times on search engine searches. The matter of law enforcement on the Internet has been a source of debate both in academia and in the courts. Micky reported on this possibility in October when the famously libertarian Ver told the audience at London’s CC Forum that a drug cartel could create a generic SLP token and pay out profits as dividends. If you’re feeling confident, though, and would like to give White House a try, you can swap bitcoin for monero using a service like Flyp. Biography: Paris is the co-admin and head of staff of Dread forum. Open Representative Voting (ORV) is the consensus mechanism of the Nano network. Please only modmail us about posts and comments that visibly break the rules. “The seller made a number of gun-related sales via the darknet before being arrested, darkweb markets each time wrapping the products in plastic and then in Mylar bags before finally disguising them in food packaging.” Visiting Paused at Eastern Oregon Correctional Institution - July 30, 2021. Bitcoin solely markets embrace Darkfox, Hydra, Vice City, Aurora, Majestic Garden, Neptune, Mega, Global Dreams, and Flugsvamp 3. Research from across the darkweb marketplace world indicates that easier access to cheaper alcohol tends to cause more problems for individuals and populations. They do not represent the views or opinions of newindianexpress. The mercenaries have access to banking institutions, lawyers, and offshore companies how to get on the dark web on laptop to silently cash out their loot in any currency and in any form, including gold and real estate. This blog post explores how the dark web industry has recovered from the DarkMarket takedown. 314 75 votes Rating Read Previous Darknet Markets Working Links guest 0 Comments Inline Feedbacks View all comments
{ "url": "https://alphabayonionmarkets.com/how-to-get-on-the-dark/", "source_domain": "alphabayonionmarkets.com", "snapshot_id": "CC-MAIN-2024-30", "warc_metadata": { "Content-Length": "119943", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:LOQ6GJU4FDTIVD7WLAMUJAHIEGVHU5EE", "WARC-Concurrent-To": "<urn:uuid:f335e610-3dfb-44cd-bbd1-be12ed43f008>", "WARC-Date": "2024-07-23T20:35:56Z", "WARC-IP-Address": "104.21.82.138", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:WBHIS3HFOJ3Y7JX3NSADJVFFMGGDPYET", "WARC-Record-ID": "<urn:uuid:28531877-e036-490a-b6a8-546cce690907>", "WARC-Target-URI": "https://alphabayonionmarkets.com/how-to-get-on-the-dark/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:4886935f-9c78-4dbd-b2da-15863c9a3ff4>" }, "warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-120\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, 37, 38, 1035, 1036, 2022, 2023, 3038, 3039, 4091, 4092, 5394, 5395, 5614, 5615, 6360, 6361, 6374, 6381, 6382, 6396, 6397, 6427, 6428, 6434, 6445, 6462 ], "line_end_idx": [ 37, 38, 1035, 1036, 2022, 2023, 3038, 3039, 4091, 4092, 5394, 5395, 5614, 5615, 6360, 6361, 6374, 6381, 6382, 6396, 6397, 6427, 6428, 6434, 6445, 6462, 6479 ] }
{ "red_pajama_v2": { "ccnet_original_length": 6479, "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.35257890820503235, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.027713630348443985, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.14780600368976593, "rps_doc_frac_unique_words": 0.4990958273410797, "rps_doc_mean_word_length": 4.691681861877441, "rps_doc_num_sentences": 68, "rps_doc_symbol_to_word_ratio": 0.0007698200060985982, "rps_doc_unigram_entropy": 5.621577739715576, "rps_doc_word_count": 1106, "rps_doc_frac_chars_dupe_10grams": 0.03854307159781456, "rps_doc_frac_chars_dupe_5grams": 0.06012719124555588, "rps_doc_frac_chars_dupe_6grams": 0.06012719124555588, "rps_doc_frac_chars_dupe_7grams": 0.06012719124555588, "rps_doc_frac_chars_dupe_8grams": 0.06012719124555588, "rps_doc_frac_chars_dupe_9grams": 0.06012719124555588, "rps_doc_frac_chars_top_2gram": 0.03777220845222473, "rps_doc_frac_chars_top_3gram": 0.034688759595155716, "rps_doc_frac_chars_top_4gram": 0.013875509612262249, "rps_doc_books_importance": -566.1494140625, "rps_doc_books_importance_length_correction": -566.1494140625, "rps_doc_openwebtext_importance": -334.4525451660156, "rps_doc_openwebtext_importance_length_correction": -334.4525451660156, "rps_doc_wikipedia_importance": -284.1875915527344, "rps_doc_wikipedia_importance_length_correction": -284.1875915527344 }, "fasttext": { "dclm": 0.018540920689702034, "english": 0.9047645330429077, "fineweb_edu_approx": 1.7257366180419922, "eai_general_math": 0.023425700142979622, "eai_open_web_math": 0.05439602956175804, "eai_web_code": 0.015130340121686459 } }
{ "free_decimal_correspondence": { "primary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "005.82", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "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": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "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" } } }
ece34605c058195ed03b4d393ef1a36c