id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
7,837,038,297,505,528,000 |
fbpx
Botnets are a string of private computers linked together by one server. While some types are legal and serve to run websites, others are malicious. These illegal botnets connect computers through infection by malware, namely Trojan malware. Other less common infections occur through drive-by downloads and spiders. While the owner often doesn’t know that they are infected, the cybercriminals controlling the botnet have full access to their computer and information. Additionally, these criminals can make your computer a zombie to perform tasks for them. Any device that can connect to the internet including PCs, Macs, smartphones, smartwatches, laptops, security cameras, and other smart appliances can be incorporated into a botnet.
How Botnets Work
After downloading infectious software, the botnet contacts its creator, and your computer is now is under his/her control. The creator’s ultimate goal is to incorporate millions of computers into their botnet web or zombie network. This occurs because the more computers there are in a web, the stronger the cyber attacks. Once in control of your computer, these cybercriminals can perform malicious tasks including:
• Sending spam
• Influencing elections
• Using their web to create DDoS attacks where they overload the website with all of their botnets until there is a denial in service
• Creating fake internet traffic for financial gain
• Creating ads for financial gain
• Mining cryptocurrencies
In other cases, cybercriminals create zombie networks to sell to other criminals. This allows more people to have access to your data. Furthermore, these infections are very skilled at hiding themselves. They use minimal power, so they do not disrupt normal computer function. Some botnets even adapt to avoid security software detection.
Different types of Botnets
Client-server model
This type of botnet uses a single master server to transmit information to each member of the web. They do this through command and control servers to effectively relay information.
However, while client-server models are great for conveying information to the zombie network, they are also easily detected and stopped by law enforcement because they use command and control servers. In order to destroy the botnet, one must simply destroy the server.
Peer-to-peer
This structure is similar to the client-server model. However, instead of having one main server to distribute information, each computer in the web acts as both a receptor and a server. Similar to how people communicate peer-to-peer, these computers talk to each other to relay information. This makes it harder for law enforcement to detect because there are many servers and destroying one will not destroy the botnet.
How to protect yourself
Protecting your personal information is pretty straight-forward. Some of the common recommendations to protect yourself from infection and to rid your devices from current botnets are:
• Download and run malware software often
• Update your computer system, applications, and security software often
• Do not click on or download suspicious links and attachments. This includes all links sent from unknown email addresses, websites, and pop-ups.
• Utilize a firewall to ensure security while you browse the internet.
• Avoid suspicious websites
For more information about cybersecurity, visit our website https://dynagrace.com/.
Image Resource: Featured Image https://pixabay.com/en/network-computer-laptop-connection-698598/https://pixabay.com/en/businessman-internet-continents-2682712/https://pixabay.com/en/internet-cyber-network-finger-3563638/
Resources: https://us.norton.com/internetsecurity-malware-what-is-a-botnet.html, https://usa.kaspersky.com/resource-center/threats/botnet-attacks, https://www.pandasecurity.com/mediacenter/security/what-is-a-botnet/
Pin It on Pinterest
Share This
|
{
"url": "https://dynagrace.com/botnets-and-how-to-avoid-them/",
"source_domain": "dynagrace.com",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "71491",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UYSLJ3GLZTLLMS4R66CNKW2AQWBPB2SN",
"WARC-Concurrent-To": "<urn:uuid:bb24d765-461b-4b34-ad26-d10f46ac879b>",
"WARC-Date": "2021-06-18T12:14:15Z",
"WARC-IP-Address": "68.66.216.57",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:M3LGKX2RHRCTDTKDRVKZIXXRMEQ3ZU7W",
"WARC-Record-ID": "<urn:uuid:18101e52-2146-4a96-be8d-264f323bd7c4>",
"WARC-Target-URI": "https://dynagrace.com/botnets-and-how-to-avoid-them/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:03eab5c6-2f5d-4b7f-94ad-e4f5227f424a>"
},
"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-177.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,
5,
6,
746,
747,
764,
765,
1182,
1183,
1200,
1226,
1362,
1416,
1452,
1480,
1481,
1820,
1821,
1848,
1849,
1869,
1870,
2052,
2053,
2323,
2324,
2337,
2338,
2760,
2761,
2785,
2786,
2971,
2972,
3016,
3091,
3239,
3312,
3342,
3343,
3345,
3346,
3430,
3431,
3652,
3653,
3869,
3870,
3890,
3891
],
"line_end_idx": [
5,
6,
746,
747,
764,
765,
1182,
1183,
1200,
1226,
1362,
1416,
1452,
1480,
1481,
1820,
1821,
1848,
1849,
1869,
1870,
2052,
2053,
2323,
2324,
2337,
2338,
2760,
2761,
2785,
2786,
2971,
2972,
3016,
3091,
3239,
3312,
3342,
3343,
3345,
3346,
3430,
3431,
3652,
3653,
3869,
3870,
3890,
3891,
3901
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3901,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32469305396080017,
"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.19781719148159027,
"rps_doc_frac_unique_words": 0.4841121435165405,
"rps_doc_mean_word_length": 5.942056179046631,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.140796184539795,
"rps_doc_word_count": 535,
"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.011324319988489151,
"rps_doc_frac_chars_top_3gram": 0.010066060349345207,
"rps_doc_frac_chars_top_4gram": 0.010695190168917179,
"rps_doc_books_importance": -258.2515563964844,
"rps_doc_books_importance_length_correction": -258.2515563964844,
"rps_doc_openwebtext_importance": -185.65322875976562,
"rps_doc_openwebtext_importance_length_correction": -185.65322875976562,
"rps_doc_wikipedia_importance": -187.77467346191406,
"rps_doc_wikipedia_importance_length_correction": -187.77467346191406
},
"fasttext": {
"dclm": 0.43356043100357056,
"english": 0.9143689870834351,
"fineweb_edu_approx": 3.250523328781128,
"eai_general_math": 0.051317691802978516,
"eai_open_web_math": 0.23772144317626953,
"eai_web_code": 0.073577880859375
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,192,217,401,890,510,300 |
What is Asynchronous programming?
Asynchronous programming has been attaining much attention for a while and a good reason. Although it can be complicated than the outdated linear style, it is also much more efficient.
Asynchronous programming aims to solve the point that a shoe needs to tie up, but the person does not want to wait until they are done with their jog. The same is goes for a web page. Let us say resources are loading from various locations, and one of the pictures present on some servers is not responding. With synchronous loading, it may hang the entire page. With asynchronous loading, other functions of the page load while the requestor waits for the different server’s response.
As a System system, the system may not wait for an execution step to complete before moving on to the next process. It will move on to future executions even though a forgoing step has not yet finished and is still running in the background. It means that the system recognizes what to do when an initial step does finish execution.
Asynchronous Programming in Python
Asynchronous Practices in Real Life
Asynchronous programs require thinking differently about coding. While this new way of philosophy can be hard to cope with the User’s head around, it is also an exciting practice. That is for the reason that the real world is almost utterly asynchronous.
Imagine this: A parent is trying to do numerous things at once. They have to balance the checklist, and keep an eye on the kids, do laundry. One way or another, they can do all the tasks in parallel without even thinking about it! Let’s break it down:
• Balancing the checklist is an asynchronous task. One-step follows another until the task completes.
• However, it can halt away from the checklist to do laundry. Unloaded dryer, move clothes from the washer to the dryer, and start another washer again.
• Operating the washer and dryer is an asynchronous task, but the bulk job happens after the washers and dryers are started. Once they are operational, let them go, Operator can walk away and get back to the checklist tasks. At this very point, the dryer and washer tasks have become asynchronous. They will run unconventionally until the timer goes off (notifying the User that the task needs attention).
These examples can help to demonstrate the perceptions of blocking and non-blocking code. Let’s think about this in programming terms. In this example, the User is like a CPU. While the User is moving the laundry around, the User (the CPU) is busy and blocked from performing other work, like harmonizing the checklist, which is okay because the task is comparatively swift.
On the other hand, starting the dryer and washer does not stop Users from executing the different tasks. It is an asynchronous function because Users do not have to postpone for it to finish. Once it is underway, Users can perform other tasks, which refers to a context switch.
The context of what the User is doing has transformed, and the machine’s beeper notifies the User when the laundry task is complete.
This is how a human works all the time. They unsurprisingly juggle numerous things at once, often without even knowing about it. However, a developer’s trick is to interpret these behaviors into code that performs the same tasks.
Asynchronous Practices in Python
Asyncio
Asyncio() is a concurrency function that was provided in Python 3.4. This is designed to utilize coroutines and futures to streamline asynchronous programs. It makes it almost as readable as synchronous code as callbacks do not exist in it.
Asyncio() structures the code, so subtasks are distinct as coroutines permit Users to plan them as they please, including concurrently. Coroutines contain return points where the User describes possible points where a context shift can happen if other tasks are undecided. However, It will not if there is no task pending.
Coroutines
A coroutine() is a function with an async() explanation. It can also be an object that gets returned from a coroutine() function.
By marking a function as async(), it can be called await statement like await say_after(1, ‘hello’). Await means that the package will run up until the await statement, call the function, and suspend implementation until the function completes and other coroutines may run.
That interruption of execution means that the package returns to the event loop. When the User uses asyncio(), an event loop executes all the asynchronous tasks, completes network IO and runs sub-processes. For the most part, when a programmer writes coroutines, they will use tasks to run them.
Tasks
Tasks enable the coder to run a coroutine in an event loop; that streamlines managing the implementation of several coroutines.
Event Loop
An event loop manages and allocates the accomplishment of different tasks. It records them and handles assigning the flow of control between them.
Multiprocessing
The most recognizable way is to use multiple processes. From the terminal, the User can start the script two, three, four…ten times (numerous times), and then all the scripts will run individually or simultaneously. The operating structure underneath will take responsibility for sharing the processing of CPU resources amongst all those instances. Alternatively, the User can use the Multi-Processing library, which supports spawning processes, as shown in the example below.
def print_func(continent='Asia'):
print('The name of continent is : ', continent)
if __name__ == "__main__": # confirms that the code is under main function
names = ['America', 'Europe', 'Africa']
procs = []
proc = Process(target=print_func) # instantiating without any argument
procs.append(proc)
proc.start()
# instantiating process with arguments
for name in names:
# print(name)
proc = Process(target=print_func, args=(name,))
procs.append(proc)
proc.start()
# complete the processes
for proc in procs:
proc.join()
Output
The name of the continent is Asia
The name of the continent is America
The name of the continent is Europe
The name of the continent is Africa
Tasks and coroutines have their usages. Suppose there is a combination of I/O and computation or different computations. In that case, the implementer can favorably run them together and decrease processing time by running concurrently rather than consecutively.
However, this does not let the User run numerous similar tasks at the same time. For that User need multiprocessing—the focus of a future article.
Async() is a style of concurrency programming technique in which multiple tasks release the processing of CPU during waiting periods in order to accommodate other tasks. In Python, there are numerous ways to achieve concurrency. Based on the code flow, requirement, architecture design, data manipulation, and use cases, the User can select these methods.
Benefits of using Asynchronous Programming
Practicing Asynchronous programming in Python is beneficial for solving multiple problems given the complexity and needed timely execution. The concept of synchronous programming is to take one step of execution and perform that particular task alone. Even if the program consists of loops, conditional branching, or function calls, synchronous programming deals with one-step execution at a time. On the other hand, asynchronous programming exhibits different behavior. The asynchronous programming style difference is that the system may not stop and wait to complete the current execution step before moving on with the next step. Asynchronous programming proves helpful in handling critical types of problems. Following are some of the advantages of using asynchronous programming in Python:
Parallel Programming
Asynchronous programming is a kind of parallel programming. This programming manner allows the separate execution of the work unit without depending on the primary application thread. Once the program has separately executed the step, it notifies about its successful execution or failure to the main thread.
Efficient Performance
Asynchronous style of programming helps to improve the performance of an application in development. It also helps in increasing the responsiveness of applications and sites by loading various parts independently. It allows quick responses to users’ requests and performs efficiently compared to synchronous programming in critical circumstances.
Smart Programming Practice
Even though asynchronous programming is more complex than the traditional programming style, it is way more efficient than it. Since most server-side programming, especially the code in Heavy IO applications, depends on external resources. Therefore, when a user requests some data, the program waits for a response and does nothing in the conventional method. However, with an asynchronous style, there is no need to waste time, and the program can go on with the other tasks to handle in the queue. So, this programming practice proves resource and time-efficient in complex problems.
Conclusion
Many programming practices include using synchronous programming. The drawback of using synchronous programming is that if the user requests the server, he has to wait until the response is displayed. The user experience in such cases is not good with the application. Therefore, utilizing asynchronous programming can enrich the user experience by making the website or the application user-friendly. Moreover, if the program involves slower input-output operations, there is a definite chance of optimizing the code by introducing asynchronous programming techniques.
This rule of thumb will help increase the efficiency of the overall program. The asyncio( ) makes the tasks in the code run concurrently. It solves the problems which are related to IO bounds. It makes the execution faster than conventional methods. A simple example of making things faster is of chess master paradox. For example, the chess master has to play chess with different people. He can play with them one by one or make a move with the first player and leave him thinking about his move while the chess master moves to the next player to make his move. The latter will save more time and makes things go smoother and faster. Asynchronous programming helps to deal with multiple operations without being hung up on any of them in a nutshell.
|
{
"url": "https://pdf.co/blog/asynchronous-programming-in-python",
"source_domain": "pdf.co",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "743964",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NQ2B2TWNS6ZVJALWWEGALYBAO3AHVDQP",
"WARC-Concurrent-To": "<urn:uuid:98da4000-c663-44c9-8275-f311234228ff>",
"WARC-Date": "2021-10-22T13:12:29Z",
"WARC-IP-Address": "35.168.216.102",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DUI55HMWGFP4ESHZGCXIKQNM6S7XSBJO",
"WARC-Record-ID": "<urn:uuid:c786a2ce-6a61-4e17-a83e-e921c014808d>",
"WARC-Target-URI": "https://pdf.co/blog/asynchronous-programming-in-python",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ec2f64d6-3709-475b-9a6f-66be93a4bae3>"
},
"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-74\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
34,
35,
220,
221,
707,
708,
1041,
1042,
1077,
1078,
1114,
1115,
1370,
1371,
1623,
1624,
1728,
1883,
2291,
2292,
2667,
2668,
2946,
3079,
3080,
3310,
3311,
3344,
3345,
3353,
3354,
3595,
3918,
3919,
3930,
3931,
4061,
4062,
4336,
4337,
4633,
4634,
4640,
4641,
4769,
4770,
4781,
4782,
4929,
4930,
4946,
4947,
5424,
5425,
5459,
5511,
5587,
5631,
5646,
5722,
5745,
5762,
5763,
5806,
5829,
5851,
5907,
5934,
5955,
5956,
5985,
6008,
6028,
6029,
6036,
6037,
6071,
6108,
6144,
6180,
6181,
6444,
6445,
6592,
6593,
6949,
6950,
6993,
6994,
7790,
7791,
7812,
7813,
8122,
8123,
8145,
8146,
8493,
8494,
8521,
8522,
9109,
9110,
9121,
9122,
9692,
9693
],
"line_end_idx": [
34,
35,
220,
221,
707,
708,
1041,
1042,
1077,
1078,
1114,
1115,
1370,
1371,
1623,
1624,
1728,
1883,
2291,
2292,
2667,
2668,
2946,
3079,
3080,
3310,
3311,
3344,
3345,
3353,
3354,
3595,
3918,
3919,
3930,
3931,
4061,
4062,
4336,
4337,
4633,
4634,
4640,
4641,
4769,
4770,
4781,
4782,
4929,
4930,
4946,
4947,
5424,
5425,
5459,
5511,
5587,
5631,
5646,
5722,
5745,
5762,
5763,
5806,
5829,
5851,
5907,
5934,
5955,
5956,
5985,
6008,
6028,
6029,
6036,
6037,
6071,
6108,
6144,
6180,
6181,
6444,
6445,
6592,
6593,
6949,
6950,
6993,
6994,
7790,
7791,
7812,
7813,
8122,
8123,
8145,
8146,
8493,
8494,
8521,
8522,
9109,
9110,
9121,
9122,
9692,
9693,
10444
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10444,
"ccnet_original_nlines": 107,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4134312570095062,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006295910105109215,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1369359940290451,
"rps_doc_frac_unique_words": 0.34365326166152954,
"rps_doc_mean_word_length": 5.199380874633789,
"rps_doc_num_sentences": 101,
"rps_doc_symbol_to_word_ratio": 0.003147949930280447,
"rps_doc_unigram_entropy": 5.45548152923584,
"rps_doc_word_count": 1615,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.010956290178000927,
"rps_doc_frac_chars_dupe_6grams": 0.010956290178000927,
"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.0410861000418663,
"rps_doc_frac_chars_top_3gram": 0.0042872498743236065,
"rps_doc_frac_chars_top_4gram": 0.0057163299061357975,
"rps_doc_books_importance": -867.5093383789062,
"rps_doc_books_importance_length_correction": -867.5093383789062,
"rps_doc_openwebtext_importance": -587.3487548828125,
"rps_doc_openwebtext_importance_length_correction": -587.3487548828125,
"rps_doc_wikipedia_importance": -417.505859375,
"rps_doc_wikipedia_importance_length_correction": -417.505859375
},
"fasttext": {
"dclm": 0.941828727722168,
"english": 0.9240494966506958,
"fineweb_edu_approx": 2.9034011363983154,
"eai_general_math": 0.7231557965278625,
"eai_open_web_math": 0.1744566559791565,
"eai_web_code": 0.8533786535263062
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,702,914,889,332,436,000 |
aaaah
Additional
Language
Kotlin
Version
0.9.0 (Jan 31, 2021)
Created
Oct 10, 2018
Updated
Feb 28, 2021
Owner
Christopher (chRyNaN)
Contributor
Christopher (chRyNaN)
1
Activity
Badge
Generate
Download
Source code
Show card
aaaah
Another Android Adapter Abstraction Here
A lightweight and easy to use abstraction for Android RecyclerViews.
@Adapter
class EmojiListItemAdapter @Inject constructor() : AnotherAdapter<EmojiListItemViewModel>() {
override val viewType: ViewType = AdapterViewType.from(EmojiListItemAdapter::class.java)
override fun onHandlesItem(item: Any): Boolean = item is EmojiListItemViewModel
override fun onCreateView(parent: ViewGroup, inflater: LayoutInflater, viewType: ViewType): View =
inflater.inflate(R.layout.adapter_emoji_list_item, parent, false)
override fun View.onBindItem(item: EmojiListItemViewModel, position: Int) {
adapterEmojiWidget?.emojiViewModel = item.viewModel
}
}
Building
The library is provided through Bintray. Refer to the releases for the latest version.
Repository
repositories {
maven {
url = uri("https://dl.bintray.com/chrynan/chrynan")
}
}
Dependencies
Android Library:
implementation 'com.chrynan.aaaah:aaaah-libraryx:VERSION'
Core Common (Kotlin Multi-platform Classes):
implementation 'com.chrynan.aaaah:aaaah-core:VERSION'
Annotations (Optional):
implementation 'com.chrynan.aaaah:aaaah-annotation:VERSION'
Annotation Processor (Optional):
kapt 'com.chrynan.aaaah:aaaah-compiler:VERSION'
DSL (Optional):
implementation 'com.chrynan.aaaah:aaaah-dsl:VERSION'
Using the Library
• Create an AnotherAdapter implementation:
class MyAdapter : AnotherAdapter<MyItem>() {
override val viewType = AdapterViewType.from(this::class.java)
override fun onHandlesItem(item: Any) = item is MyItem
override fun onCreateView(parent: ViewGroup, inflater: LayoutInflater, viewType: ViewType): View =
inflater.inflate(R.layout.my_adapter_layout_file, parent, false)
override fun View.onBindItem(item: MyItem, position: Int) {
// Bind the Item to the View
}
}
• Create the ManagerRecyclerViewAdapter which handles the coordination between multiple AnotherAdapters:
val managerAdapter = anotherAdapterManager(MyAdapter()) // vararg parameters
• Add the ManagerRecyclerViewAdapter to the RecyclerView:
recyclerView?.apply {
adapter = managerAdapter
layoutManager = LinearLayoutManager(context) // Or whatever LayoutManager needed
}
Quick Adapter Creation
There is a convenience function which is a shortened syntax to create an Adapter. This could be useful for quick basic adapters.
val myAdapter =
anotherAdapter<ItemType>(viewType = myViewType, viewResId = R.layout.my_adapter_layout) { item, position ->
// this refers to the containing Android View
this.findViewById<TextView>(R.id.myTextView)?.text = item.title
}
Then to assign the Adapter to a RecyclerView, wrap it in a ManagerRecyclerViewAdapter:
recyclerView?.apply {
adapter = anotherManagerAdapter(myAdapter)
layoutManager = LinearLayoutManager(context) // Or whatever LayoutManager needed
}
If only one Adapter is needed, there's no need to explicitly wrap the Adapter, just call the RecyclerView.adapter() extension function:
recyclerView?.apply {
adapter(myAdapter)
layoutManager = LinearLayoutManager(context) // Or whatever LayoutManager needed
}
Annotation Processor
By default, the AdapterViewType.from() function returns the Hash Code of the Class. For most use cases this should be sufficient. However, if guaranteed unique View Types are needed for each Adapter, the Annotation Processor could be used.
• Annotate the Adapter with the Adapter annotation (available in the Annotations library):
@Adapter
class MyAdapter : AnotherAdapter<MyItem>() {
override val viewType = AdapterViewType.from(this::class.java)
override fun onHandlesItem(item: Any) = item is MyItem
override fun onCreateView(parent: ViewGroup, inflater: LayoutInflater, viewType: ViewType): View =
inflater.inflate(R.layout.my_adapter_layout_file, parent, false)
override fun View.onBindItem(item: MyItem, position: Int) {
// Bind the Item to the View
}
}
• Build the project (make sure to have both the compiler and annotations libraries in the dependencies)
A class, AdapterViewTypes, will be generated with View Type constants for each class annotated with the Adapter annotation. Also, a more specific AdapterViewType.from() extension function will be generated. Either approach could be used to access the View Type for each adapter:
AdapterViewTypes.MY_ADAPTER
// or
AdapterViewType.from(MyAdapter::class.java)
Naming the generated constants
The generated constant names can be overridden by providing a value to the name parameter in the Adapter annotation:
@Adapter(name = "MyConstantName")
// Results in:
AdapterViewTypes.MyConstantName
Processing Item Changes
The library comes with a DiffUtilCalculator class which is a basic implementation of RecyclerView's DiffUtil.Callback for a UniqueAdapterItem. This class can be used for most cases but if additional functionality is needed, the class is extensible. The DiffUtilCalculator.calculateDiff() function takes in a parameter of list items and calculates the diff and returns an AndroidDiffResult which is a wrapper around the RecyclerView's DiffUtil.DiffResult.
val diffCalculator = DiffUtilCalculator<UniqueAdapterItem>()
val result = diffCalculator.calculateDiff(sortedItems = myNewListItems)
// myListUpdater is an implementation of the ItemListUpdater interface
myListUpdater.items = result.items
result.diffUtilResult.dispatchItemsTo(myListUpdater)
The library contains a DiffProcessor interface in the Kotlin common core module and an AndroidDiffProcessor implementation which encapsulates the processing logic.
val processor = AndroidDiffProcessor(DiffUtilCalculator())
val result = processor.processDiff(myNewListItems)
The library also contains a DiffDispatcher interface in the Kotlin common core module and an AndroidDiffDispatcher implementation which encapsulates the dispatching logic.
val dispatcher = AndroidDiffDispatcher(myItemListUpdater)
dispatcher.dispatchDiff(result)
Both the DiffProcessor.processDiff and the DiffDispatcher.dispatchDiff functions are suspending functions. This is because these tasks should be performed off the UI Thread.
Using the provided AdapterItemHandler interface, processing items is much easier on a Kotlin Coroutine Flow of items:
val adapterItemHandler = BaseAdapterItemHandler(myDiffProcessor, myDiffDispatcher)
flowOf(myItems)
.calculateAndDispatcherDiff(adapterItemHandler)
.launchIn(this)
Adapter Factories
Sometimes dynamic Adapter creation is necessary, such as when using nested adapters. For this scenario, there is the AdapterFactory interface along with the BaseAdapterFactory abstract class implementation. Creating a custom AdapterFactory implementation is fairly straightforward:
class MyItemAdapterFactory @Inject constructor(
myItemAdapter: MyItemAdapter,
context: Context
) : BaseAdapterFactory<ListItemViewModel>() {
override val adapters: Set<AnotherAdapter<*>> = setOf(myItemAdapter)
override val positionManager: AdapterPositionManager = VerticalPositionManager(context)
}
Then the AdapterFactory has to be bound to the RecyclerView, and finally it can be used instead of the AdapterItemHandler to calculate and dispatch the diffs:
recyclerView?.bindAdapterFactory(myAdapterFactory)
flowOf(myItems)
.calculateAndDispatcherDiff(myAdapterFactory)
.launchIn(this)
|
{
"url": "https://android-arsenal.com/details/1/7535",
"source_domain": "android-arsenal.com",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "25695",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PS53Z47GDMUJZN3PJG77GTVQOEKSFURD",
"WARC-Concurrent-To": "<urn:uuid:29542c04-cfe3-4aff-a3ad-9daf12df18be>",
"WARC-Date": "2021-06-12T14:10:20Z",
"WARC-IP-Address": "172.67.181.105",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6NLX6U4HMLJJF6BUGSH2ROWBB7NZKGDK",
"WARC-Record-ID": "<urn:uuid:d0628bc2-f15e-4f50-ab5f-6f23e39f8444>",
"WARC-Target-URI": "https://android-arsenal.com/details/1/7535",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8f7447e8-3e1c-40ba-ac48-170b54ae65c8>"
},
"warc_info": "isPartOf: CC-MAIN-2021-25\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-234.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
6,
7,
18,
19,
28,
35,
43,
64,
72,
85,
93,
106,
112,
134,
146,
168,
170,
179,
185,
194,
203,
215,
216,
226,
227,
233,
234,
275,
276,
345,
346,
355,
449,
450,
543,
544,
628,
629,
732,
806,
807,
887,
947,
953,
955,
956,
965,
966,
1053,
1054,
1065,
1066,
1081,
1093,
1153,
1159,
1161,
1162,
1175,
1176,
1193,
1194,
1252,
1253,
1298,
1299,
1353,
1354,
1378,
1379,
1439,
1440,
1473,
1474,
1522,
1523,
1539,
1540,
1593,
1594,
1612,
1613,
1658,
1703,
1704,
1771,
1772,
1831,
1832,
1935,
2008,
2009,
2073,
2110,
2116,
2118,
2225,
2302,
2362,
2384,
2413,
2498,
2500,
2501,
2524,
2525,
2654,
2655,
2671,
2783,
2837,
2909,
2915,
2916,
3003,
3004,
3026,
3073,
3158,
3160,
3161,
3297,
3298,
3320,
3343,
3428,
3430,
3431,
3452,
3453,
3693,
3694,
3787,
3796,
3841,
3842,
3909,
3910,
3969,
3970,
4073,
4146,
4147,
4211,
4248,
4254,
4256,
4362,
4363,
4642,
4643,
4671,
4677,
4721,
4722,
4753,
4754,
4871,
4872,
4906,
4921,
4953,
4954,
4978,
4979,
5434,
5435,
5496,
5497,
5569,
5570,
5641,
5676,
5729,
5730,
5894,
5895,
5954,
5955,
6006,
6007,
6179,
6180,
6238,
6239,
6271,
6272,
6446,
6447,
6565,
6566,
6649,
6650,
6666,
6718,
6738,
6739,
6757,
6758,
7040,
7041,
7089,
7123,
7144,
7190,
7191,
7264,
7265,
7357,
7359,
7360,
7519,
7520,
7571,
7572,
7588,
7638
],
"line_end_idx": [
6,
7,
18,
19,
28,
35,
43,
64,
72,
85,
93,
106,
112,
134,
146,
168,
170,
179,
185,
194,
203,
215,
216,
226,
227,
233,
234,
275,
276,
345,
346,
355,
449,
450,
543,
544,
628,
629,
732,
806,
807,
887,
947,
953,
955,
956,
965,
966,
1053,
1054,
1065,
1066,
1081,
1093,
1153,
1159,
1161,
1162,
1175,
1176,
1193,
1194,
1252,
1253,
1298,
1299,
1353,
1354,
1378,
1379,
1439,
1440,
1473,
1474,
1522,
1523,
1539,
1540,
1593,
1594,
1612,
1613,
1658,
1703,
1704,
1771,
1772,
1831,
1832,
1935,
2008,
2009,
2073,
2110,
2116,
2118,
2225,
2302,
2362,
2384,
2413,
2498,
2500,
2501,
2524,
2525,
2654,
2655,
2671,
2783,
2837,
2909,
2915,
2916,
3003,
3004,
3026,
3073,
3158,
3160,
3161,
3297,
3298,
3320,
3343,
3428,
3430,
3431,
3452,
3453,
3693,
3694,
3787,
3796,
3841,
3842,
3909,
3910,
3969,
3970,
4073,
4146,
4147,
4211,
4248,
4254,
4256,
4362,
4363,
4642,
4643,
4671,
4677,
4721,
4722,
4753,
4754,
4871,
4872,
4906,
4921,
4953,
4954,
4978,
4979,
5434,
5435,
5496,
5497,
5569,
5570,
5641,
5676,
5729,
5730,
5894,
5895,
5954,
5955,
6006,
6007,
6179,
6180,
6238,
6239,
6271,
6272,
6446,
6447,
6565,
6566,
6649,
6650,
6666,
6718,
6738,
6739,
6757,
6758,
7040,
7041,
7089,
7123,
7144,
7190,
7191,
7264,
7265,
7357,
7359,
7360,
7519,
7520,
7571,
7572,
7588,
7638,
7657
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7657,
"ccnet_original_nlines": 217,
"rps_doc_curly_bracket": 0.0033955899998545647,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.19299611449241638,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011673149652779102,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3190661370754242,
"rps_doc_frac_unique_words": 0.4359999895095825,
"rps_doc_mean_word_length": 8.10533332824707,
"rps_doc_num_sentences": 88,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.238890647888184,
"rps_doc_word_count": 750,
"rps_doc_frac_chars_dupe_10grams": 0.10758347809314728,
"rps_doc_frac_chars_dupe_5grams": 0.17437078058719635,
"rps_doc_frac_chars_dupe_6grams": 0.1677907556295395,
"rps_doc_frac_chars_dupe_7grams": 0.13423259556293488,
"rps_doc_frac_chars_dupe_8grams": 0.13423259556293488,
"rps_doc_frac_chars_dupe_9grams": 0.13423259556293488,
"rps_doc_frac_chars_top_2gram": 0.016285570338368416,
"rps_doc_frac_chars_top_3gram": 0.00937653984874487,
"rps_doc_frac_chars_top_4gram": 0.015298569574952126,
"rps_doc_books_importance": -520.5568237304688,
"rps_doc_books_importance_length_correction": -520.5568237304688,
"rps_doc_openwebtext_importance": -286.9138488769531,
"rps_doc_openwebtext_importance_length_correction": -286.9138488769531,
"rps_doc_wikipedia_importance": -148.01246643066406,
"rps_doc_wikipedia_importance_length_correction": -148.01246643066406
},
"fasttext": {
"dclm": 0.24819928407669067,
"english": 0.6094214916229248,
"fineweb_edu_approx": 2.80287766456604,
"eai_general_math": 0.25379133224487305,
"eai_open_web_math": 0.06574773788452148,
"eai_web_code": 0.5964459776878357
}
}
|
{
"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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,623,448,818,204,344,000 |
Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
PerlMonks
Re: eq vs. ==
by Abigail-II (Bishop)
on Jul 21, 2003 at 11:01 UTC ( #276215=note: print w/ replies, xml ) Need Help??
in reply to Re: Re: Re: eq vs. ==
in thread eq vs. ==
In Pascal (at least in the version as intended by Go^H^HWirth), you are not very likely to make that mistake. Pascal uses = to compare two values, and := for assignment. So, you'd have to type an extra character (instead of leaving one off) to make this mistake, but even if you do:
if a := b then begin ... end
is a compile time error. Not really a problem. In Perl using assignment instead of comparison in a condition leads to a compile time warning. However, in C, the use of assignment instead of comparison is just find, and only some compilers will warn, if you turn on the appriate warnings. But when compiling C, it's much more common (and troublesome) to turn warnings on than in Perl.
Conclusing, when coding in Perl, and certainly in C, is more likely to make this mistake than when coding in Pascal.
Abigail
Comment on Re: eq vs. ==
Download Code
Re: Re: eq vs. ==
by Jenda (Abbot) on Jul 21, 2003 at 11:05 UTC
I did not say (or at least did not mean to say) that it's more likely to make such mistake in Pascal than in Perl. What I meant was that if you use both Perl and Pascal, it's more likely you'll make this mistake in Perl.
Jenda
Always code as if the guy who ends up maintaining your code will be a violent psychopath who knows where you live.
-- Rick Osborne
Edit by castaway: Closed small tag in signature
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://276215]
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (5)
As of 2014-07-12 22:34 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
When choosing user names for websites, I prefer to use:
Results (241 votes), past polls
|
{
"url": "http://www.perlmonks.org/?node_id=276215",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2014-23",
"warc_metadata": {
"Content-Length": "18734",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TRVWA746GFMYTQNJ7VONNSVLZJJXJ3MW",
"WARC-Concurrent-To": "<urn:uuid:657392ac-fc2e-4298-97f4-f8e3b06b2e2a>",
"WARC-Date": "2014-07-12T22:34:51Z",
"WARC-IP-Address": "66.39.54.27",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:S7DZR4FDCIWDJ6IRUNZ3NDW35OZNQHFD",
"WARC-Record-ID": "<urn:uuid:342c2988-4e90-4be4-944e-d7e081dd2e49>",
"WARC-Target-URI": "http://www.perlmonks.org/?node_id=276215",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cfb93aa6-40c5-43b1-86f6-f963c3ba1a9b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-212-248.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-23\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for July 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
63,
83,
85,
97,
98,
112,
113,
136,
217,
218,
219,
253,
273,
274,
557,
558,
587,
971,
972,
1089,
1090,
1098,
1099,
1100,
1125,
1139,
1157,
1203,
1204,
1429,
1430,
1440,
1559,
1582,
1583,
1635,
1636,
1644,
1654,
1664,
1665,
1685,
1703,
1716,
1729,
1759,
1764,
1776,
1813,
1814,
1852,
1865,
1903,
1930,
1940,
1953,
1965,
1976,
1994,
1995,
2055,
2056,
2057,
2058,
2059,
2060,
2061,
2062,
2063
],
"line_end_idx": [
63,
83,
85,
97,
98,
112,
113,
136,
217,
218,
219,
253,
273,
274,
557,
558,
587,
971,
972,
1089,
1090,
1098,
1099,
1100,
1125,
1139,
1157,
1203,
1204,
1429,
1430,
1440,
1559,
1582,
1583,
1635,
1636,
1644,
1654,
1664,
1665,
1685,
1703,
1716,
1729,
1759,
1764,
1776,
1813,
1814,
1852,
1865,
1903,
1930,
1940,
1953,
1965,
1976,
1994,
1995,
2055,
2056,
2057,
2058,
2059,
2060,
2061,
2062,
2063,
2098
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2098,
"ccnet_original_nlines": 69,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35523614287376404,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028747430071234703,
"rps_doc_frac_lines_end_with_ellipsis": 0.014285709708929062,
"rps_doc_frac_no_alph_words": 0.25872689485549927,
"rps_doc_frac_unique_words": 0.5469613075256348,
"rps_doc_mean_word_length": 4.2375688552856445,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.006160160060971975,
"rps_doc_unigram_entropy": 4.974910259246826,
"rps_doc_word_count": 362,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01694915071129799,
"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.01303781010210514,
"rps_doc_frac_chars_top_3gram": 0.01564536988735199,
"rps_doc_frac_chars_top_4gram": 0.010430250316858292,
"rps_doc_books_importance": -200.01821899414062,
"rps_doc_books_importance_length_correction": -200.01821899414062,
"rps_doc_openwebtext_importance": -126.90324401855469,
"rps_doc_openwebtext_importance_length_correction": -126.90324401855469,
"rps_doc_wikipedia_importance": -94.80040740966797,
"rps_doc_wikipedia_importance_length_correction": -94.80040740966797
},
"fasttext": {
"dclm": 0.018699049949645996,
"english": 0.9265525341033936,
"fineweb_edu_approx": 2.2304420471191406,
"eai_general_math": 0.25011855363845825,
"eai_open_web_math": 0.4600009322166443,
"eai_web_code": 0.002516929991543293
}
}
|
{
"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.132",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,046,050,801,921,643,300 |
Ask Ubuntu is a question and answer site for Ubuntu users and developers. It's 100% free.
Sign up
Here's how it works:
1. Anybody can ask a question
2. Anybody can answer
3. The best answers are voted up and rise to the top
I've got an SSD drive for root and /home, and a larger HDD for storage. The storage disk is almost full, and there's a low disk space warning on startup. The warning doesn't have any "don't show again" option, only "ignore" and "examine". It also doesn't go away but sticks on the screen until the ignore button is clicked, so it's very annoying in addition to being competely unnecessary.
I tried unselecting the storage HDD in baobab's settings, but that didn't have any effect. I also tried gconf-editor, and looked for apps -> gnome_settings_daemon -> plugins -> housekeeping, but there is no "plugins" under "gnome_settings_daemon". Only "gtk-modules" and "keybindings".
share|improve this question
Found via https://bugs.launchpad.net/ubuntu/+source/gnome-settings-daemon/+bug/881376
gsettings set org.gnome.settings-daemon.plugins.housekeeping active false
share|improve this answer
This is not to stop but to for the auto clean
You can know the free space by df -h
Then type sudo apt-get autoclean
clean using sudo apt-get clean
share|improve this answer
2
Thanks, but I'm not trying to free space, and I doubt apt-get would free space on the storage drive anyway – grimripper Sep 4 '12 at 5:19
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://askubuntu.com/questions/183510/how-to-disable-low-disk-space-notification/183532",
"source_domain": "askubuntu.com",
"snapshot_id": "crawl=CC-MAIN-2016-07",
"warc_metadata": {
"Content-Length": "73639",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4JVX7HXDZ27K336FMLX6M2KTD2AD4FFZ",
"WARC-Concurrent-To": "<urn:uuid:81c512c1-7a1d-426d-8f21-c47e64ce9e34>",
"WARC-Date": "2016-02-13T17:41:23Z",
"WARC-IP-Address": "104.16.109.188",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:UGDKLBDGHMFNBAIWOHCVS3DMEKBH6V72",
"WARC-Record-ID": "<urn:uuid:000e9259-29a6-487c-b5eb-628ea6c765c5>",
"WARC-Target-URI": "http://askubuntu.com/questions/183510/how-to-disable-low-disk-space-notification/183532",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:93de7207-377e-416f-a183-5dbbff83fba3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-182-209.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-07\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
90,
91,
99,
120,
152,
176,
231,
232,
622,
623,
909,
910,
938,
939,
1025,
1026,
1100,
1101,
1127,
1128,
1174,
1175,
1212,
1245,
1276,
1277,
1303,
1307,
1445,
1446,
1458,
1459,
1461,
1469,
1470,
1548,
1549
],
"line_end_idx": [
90,
91,
99,
120,
152,
176,
231,
232,
622,
623,
909,
910,
938,
939,
1025,
1026,
1100,
1101,
1127,
1128,
1174,
1175,
1212,
1245,
1276,
1277,
1303,
1307,
1445,
1446,
1458,
1459,
1461,
1469,
1470,
1548,
1549,
1639
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1639,
"ccnet_original_nlines": 37,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33243969082832336,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021447720006108284,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24396783113479614,
"rps_doc_frac_unique_words": 0.5953307151794434,
"rps_doc_mean_word_length": 4.910505771636963,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.762185096740723,
"rps_doc_word_count": 257,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02377179078757763,
"rps_doc_frac_chars_top_3gram": 0.03486528992652893,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -176.4729461669922,
"rps_doc_books_importance_length_correction": -162.7357940673828,
"rps_doc_openwebtext_importance": -112.85369873046875,
"rps_doc_openwebtext_importance_length_correction": -112.85369873046875,
"rps_doc_wikipedia_importance": -89.63517761230469,
"rps_doc_wikipedia_importance_length_correction": -76.98075103759766
},
"fasttext": {
"dclm": 0.43857187032699585,
"english": 0.924066424369812,
"fineweb_edu_approx": 1.1351447105407715,
"eai_general_math": 0.000023130000045057386,
"eai_open_web_math": 0.04312080144882202,
"eai_web_code": -0.000005960000180493807
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,050,885,333,892,782,100 |
1
\$\begingroup\$
I want to make a game which would require a 3D map editor. Of course, I would like to avoid creating such an editor. My idea is now to use modeling tools (3DS Max, Maya, Blender) to create the map, and to give game specific objects specified names. This way I'd just need to write an COLLADA -> native map format converter. But I'm not sure if this is possible the way I imagine it, that's why I'd like to hear your thoughts on the matter.
• Are modeling tools suitable to create big open world maps?
• Can this "naming convention"-idea for game specific objects work?
• Are the modeling tools able to export a scene in chunks / in a way that occlusion culling and collision detection can be properly done? If not: Is there a way to build a suitable data structure from the exported data?
\$\endgroup\$
1
• \$\begingroup\$ It might be worth looking at Maya Layout Tools. \$\endgroup\$
– user14497
Commented Jun 10, 2012 at 15:52
1 Answer 1
1
\$\begingroup\$
In principle I see no reason you can't do this. You might have to wirte script utilities for max(maya, blender), and possibly your own exporter though.
Max has mechanisms for referencing other scenes, and I assume blender and maya have something similar, too. I don't know if these are exactly suited to working on the world in chunks.
For a simple grid-like chunk system though it shouldn't be too hard to write a script that allows you to save and load chunks from different scene files on the fly to edit them.
As for the naming system, that should certainly work as well, you can do pretty much whatever you want when you write your collada or custom file format parser. You could for example prefix occlusion portals with [portal], other things you might need could be [collider] or [physics proxy] etc...
BSP trees are relatively popular for collision detection (mostly for static geometry since compiling them can be expensive), you could compile one from the collision meshes referenced in your map file at any point you like. I don't know of any built in functionality to export one in max, though.
Extending max, blender or maya to a map editor could be a huge or small task, depending on the functionality you need.
\$\endgroup\$
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged .
|
{
"url": "https://gamedev.stackexchange.com/questions/30382/using-model-tools-as-map-editor",
"source_domain": "gamedev.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "143430",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7PHU34M65K5AAK3Q5OEF455EC3ITZ4WM",
"WARC-Concurrent-To": "<urn:uuid:9a05c053-6f71-4ebf-82a3-42437811a824>",
"WARC-Date": "2024-07-20T13:12:23Z",
"WARC-IP-Address": "172.64.144.30",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KYBAVYRBBCGSIKWD5K3BN5Q23ILMOYUG",
"WARC-Record-ID": "<urn:uuid:08704337-c5dd-45c6-9af6-586f816c1870>",
"WARC-Target-URI": "https://gamedev.stackexchange.com/questions/30382/using-model-tools-as-map-editor",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a8027dfe-3a41-4650-8014-2b1549448afd>"
},
"warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-110\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
18,
19,
459,
460,
523,
593,
815,
829,
831,
913,
929,
965,
966,
977,
978,
980,
996,
997,
1149,
1150,
1334,
1335,
1513,
1514,
1811,
1812,
2109,
2110,
2229,
2230,
2244,
2245,
2286,
2287
],
"line_end_idx": [
2,
18,
19,
459,
460,
523,
593,
815,
829,
831,
913,
929,
965,
966,
977,
978,
980,
996,
997,
1149,
1150,
1334,
1335,
1513,
1514,
1811,
1812,
2109,
2110,
2229,
2230,
2244,
2245,
2286,
2287,
2353
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2353,
"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.41683366894721985,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028056109324097633,
"rps_doc_frac_lines_end_with_ellipsis": 0.0277777798473835,
"rps_doc_frac_no_alph_words": 0.18236473202705383,
"rps_doc_frac_unique_words": 0.5085574388504028,
"rps_doc_mean_word_length": 4.427872657775879,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0.0020040099043399096,
"rps_doc_unigram_entropy": 5.015120506286621,
"rps_doc_word_count": 409,
"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.01104362029582262,
"rps_doc_frac_chars_top_3gram": 0.020982880145311356,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -208.47340393066406,
"rps_doc_books_importance_length_correction": -208.47340393066406,
"rps_doc_openwebtext_importance": -112.5239028930664,
"rps_doc_openwebtext_importance_length_correction": -112.5239028930664,
"rps_doc_wikipedia_importance": -69.31536865234375,
"rps_doc_wikipedia_importance_length_correction": -69.31536865234375
},
"fasttext": {
"dclm": 0.17388832569122314,
"english": 0.9183145761489868,
"fineweb_edu_approx": 2.0333375930786133,
"eai_general_math": 0.36190396547317505,
"eai_open_web_math": 0.0799940824508667,
"eai_web_code": 0.09423708915710449
}
}
|
{
"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.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,714,238,560,127,187,000 |
1
\$\begingroup\$
This API's aim is to return color-names for a bunch of hex colors.
Its the first time I am writing an API. And while I write lots of frontend code I rarely touched node.
I am interested in a general code review and also a API design review. I want to keep it as simple as possible: Someone with limited tech (frontend or backend) knowhow should be able to use this.
I also wanted to avoid using Express or any other framework, because I wanted to learn.
My next step would be to make it possible to look for names as well. Basically "black" would contain all the color names that contain black. (Maybe I would even register a few aliases black => night => dark)
I am looking forward to your review.
const http = require('http');
const url = require('url');
const fs = require('fs');
const nearestColor = require('../node_modules/nearest-color/nearestColor.js');
const colors = JSON.parse(
fs.readFileSync(__dirname + '/../dist/colornames.json', 'utf8')
);
const port = process.env.PORT || 8080;
const currentVersion = 'v1';
const APIurl = ''; // subfolder for the API
const baseUrl = `${APIurl}${currentVersion}/`;
/**
* disassembles a HEX color to its RGB components
* @param {string} hex hex color representatin
* @return {object} {r,g,b}
*/
const hexToRgb = (hex) => {
const int = parseInt(hex.replace('#', ''), 16);
return {
r: (int >> 16) & 255,
g: (int >> 8) & 255,
b: int & 255
};
};
// object containing the name:hex pairs for nearestColor()
const colorsObj = {};
colors.forEach((c) => {
// populates object needed for nearestColor()
colorsObj[c.name] = c.hex;
// transform hex to RGB
c.rgb = hexToRgb(c.hex);
});
const nc = nearestColor.from(colorsObj);
/**
* validates a hex color
* @param {string} color hex representation of color
* @return {boolen}
*/
const validateColor = (color) => (
/(^[0-9A-F]{6}$)|(^[0-9A-F]{3}$)/i.test(color)
);
/**
* names an array of colors
* @param {array} colorArr array containing hex values without the hash
* @return {object} object containing all nearest colors
*/
const nameColors = (colorArr) => {
let colors = {};
colorArr.forEach((hex) => {
const closestColor = nc(`#${hex}`);
const rgb = hexToRgb(hex);
colors[`#${hex}`] = {
name: closestColor.name,
hex: closestColor.value,
rgb: closestColor.rgb,
isExactMatch: closestColor.rgb.r === rgb.r &&
closestColor.rgb.g === rgb.g &&
closestColor.rgb.b === rgb.b
};
});
return colors;
};
const httpRespond = (response, responseObj = {}, statusCode = 200) => {
response.writeHead(statusCode, {
'Access-Control-Allow-Origin': '*',
'Access-Control-Allow-Methods': 'POST, GET, PUT, DELETE, OPTIONS',
'Access-Control-Allow-Credentials': false,
'Access-Control-Max-Age': '86400',
'Access-Control-Allow-Headers': 'X-Requested-With, X-HTTP-Method-Override, Content-Type, Accept',
'Content-Type': 'application/json; charset=utf-8',
});
// ends the response with the API answer
response.end(JSON.stringify(responseObj));
};
const requestHandler = (request, response) => {
const requestUrl = url.parse(request.url);
const isAPI = requestUrl.pathname.indexOf(baseUrl) !== -1;
let statusCode = 404;
let colorQuery = request.url.toLowerCase();
colorQuery = colorQuery.split(baseUrl)[1] || '';
const urlColorList = colorQuery.split(',');
const responseObj = {status: 'Someting went wrong', colors: {}};
const invalidColors = urlColorList.filter((hex) => (
!validateColor(hex) && hex
));
if (!isAPI) {
responseObj.status = 'invalid URL: make sure to provide the API version';
statusCode = 404;
} else if (!urlColorList[0]) {
responseObj.status = `no color(s) provided, returning all the ${colors.length} colors`;
responseObj.colors = colors;
statusCode = 200;
} else if (invalidColors.length) {
responseObj.status = `'${invalidColors.join(', ')}' is not a valid HEX color`;
statusCode = 404;
} else if (!invalidColors.length && isAPI) {
responseObj.status = `names for '${urlColorList.join(', ')}' returned`;
responseObj.colors = nameColors(urlColorList);
statusCode = 200;
}
httpRespond(response, responseObj, statusCode);
};
const server = http.createServer(requestHandler);
server.listen(port, '0.0.0.0', (error) => {
if (error) {
return console.log(`something terrible happened: ${error}`);
}
console.log(`Server running and listening on port ${port}`);
console.log(`http://localhost:${port}/${baseUrl}`);
});
This state of the code can also be viewed here: https://github.com/meodai/color-names/blob/b7f7da7db5ce42b400bb08f6f00ab43d42bb67f1/scripts/server.js
Bonus question: Would if be worth it to work with streams? If yes how would you implement that
\$\endgroup\$
1 Answer 1
1
\$\begingroup\$
requestHandler
I find the implementation requestHandler hard to read and understand. The first half of the function populates various objects, and the second half acts on the various combinations of those values. It would be easier to read if you use some early returns, and that way is more likely to avoid some unnecessary processing too.
I believe this is equivalent, but a bit easier to read, and with some impossible execution paths eliminated:
const notFound = (response, msg) => httpRespond(response, {status: msg}, 404);
const requestHandler = (request, response) => {
const path = url.parse(request.url).pathname;
if (path.indexOf(baseUrl) !== -1) {
notFound(response, 'invalid URL: make sure to provide the API version');
return;
}
let colorQuery = (path.split(baseUrl)[1] || '').toLowerCase();
if (!colorQuery) {
var responseObj = {
status: `no color(s) provided, returning all the ${colors.length} colors`,
colors: colors
};
httpRespond(response, responseObj);
return;
}
const urlColorList = colorQuery.split(',');
const invalidColors = urlColorList.filter(hex => !validateColor(hex) && hex);
if (invalidColors.length) {
notFound(`'${invalidColors.join(', ')}' is not a valid HEX color`);
return;
}
var responseObj = {
status: `names for '${urlColorList.join(', ')}' returned`,
colors: nameColors(urlColorList)
}
httpRespond(response, responseObj);
};
API design
As mentioned earlier, I found it difficult to understand the supported URL request schemes. Some comments would have been helpful, explaining the supported patterns with examples.
The responseObj in 404 responses include empty colors property. That's unnecessary, and inappropriate, as users should not try to access this property in case of failures.
The httpRespond function returns too permissive headers. Most notably, your service does not really allow all the POST, GET, PUT, DELETE, OPTIONS methods. It seems to me that just GET would be enough. I think it's a good policy to try to be as minimalistic as possible.
Validation logic of invalid colors
The implementation filters the input colors to get a list of invalid colors. If the list is not empty, it returns with failure. It would be better to stop iterating over the colors on the first invalid found.
Also, somewhat inconsistently, the algorithm tolerates empty color strings. I think it would make more sense to fail on such input.
Technique
In this code:
const requestUrl = url.parse(request.url);
const isAPI = requestUrl.pathname.indexOf(baseUrl) !== -1;
let colorQuery = request.url.toLowerCase();
colorQuery = colorQuery.split(baseUrl)[1] || '';
It's suspicious coding that in the assignment of isAPI, there is a search for baseUrl in the request url, but then in the assignment of colorQuery, there is a search for baseUrl in the lowercased request url. This could result in odd corner cases.
Note that some minor improvements in terms of performance are also possible:
• There's no need to lowercase the entire url. It's really just the list of colors you need to lowercase, so you could do just that.
• There's no need to split the entire url, when you already have just the path part in requestUrl.pathname, so you could just split on that.
Of course these "performance issues" are negligible, and most probably not measurable. But I think it's good to keep these things in mind as a principle.
Regex
This regex /(^[0-9A-F]{6}$)|(^[0-9A-F]{3}$)/ can be written with slightly less duplication:
/^[0-9A-F]{3}([0-9A-F]{3})?$/
Also, the color validation method uses the i flag on the regex to make it case insensitive, but the caller always lowercases the string first. The performance would be better if you drop the i flag and change the A-F ranges to a-f.
\$\endgroup\$
3
• \$\begingroup\$ Thanks a lot for this precious feedback. I figured some of the things you mentioned myself by using the API a bit. But it really helps me to improve my code. I am very thankful for your time and effort. Thank you so much \$\endgroup\$
– meo
Sep 27, 2017 at 22:57
• 1
\$\begingroup\$ Arguably less readable, but /^([0-9A-F]{3}){1,2}$/ also works. \$\endgroup\$
– Gerrit0
Sep 28, 2017 at 1:57
• \$\begingroup\$ @janos thanks again, I've implemented most of your feedback: github.com/meodai/color-names/blob/master/scripts/server.js \$\endgroup\$
– meo
Sep 29, 2017 at 19:18
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://codereview.stackexchange.com/questions/176550/simple-static-json-get-only-api",
"source_domain": "codereview.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "235843",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BHNYSVFYPH3ON6CGCSUY3ZFRKXVWZX4B",
"WARC-Concurrent-To": "<urn:uuid:2580741f-6e22-43bb-b178-d0967b408587>",
"WARC-Date": "2022-07-03T21:01:56Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:COF3SW27WWRH6P6MS42V3XDRLGBO3JVK",
"WARC-Record-ID": "<urn:uuid:33c264b4-cd07-4ff4-8c4e-24494769bdbd>",
"WARC-Target-URI": "https://codereview.stackexchange.com/questions/176550/simple-static-json-get-only-api",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9c058a41-cec5-406d-828c-66a2112610b5>"
},
"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-171\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
18,
19,
86,
87,
190,
191,
387,
388,
476,
477,
685,
686,
723,
724,
754,
782,
808,
887,
914,
980,
983,
1022,
1051,
1095,
1142,
1143,
1147,
1197,
1246,
1279,
1283,
1311,
1361,
1372,
1398,
1423,
1440,
1445,
1448,
1449,
1508,
1530,
1531,
1555,
1603,
1632,
1658,
1685,
1689,
1690,
1731,
1735,
1760,
1815,
1835,
1839,
1874,
1923,
1926,
1927,
1931,
1959,
2033,
2099,
2103,
2138,
2157,
2187,
2227,
2258,
2284,
2315,
2346,
2375,
2427,
2479,
2528,
2535,
2541,
2558,
2561,
2562,
2634,
2669,
2709,
2780,
2827,
2866,
2968,
3023,
3029,
3072,
3117,
3120,
3121,
3169,
3214,
3275,
3299,
3345,
3400,
3401,
3447,
3514,
3569,
3600,
3606,
3607,
3623,
3701,
3723,
3756,
3848,
3881,
3903,
3940,
4023,
4045,
4092,
4168,
4219,
4241,
4245,
4246,
4296,
4299,
4300,
4350,
4394,
4409,
4474,
4478,
4541,
4595,
4599,
4600,
4750,
4751,
4846,
4847,
4861,
4862,
4873,
4874,
4876,
4892,
4893,
4908,
4909,
5235,
5236,
5345,
5346,
5425,
5426,
5474,
5522,
5560,
5637,
5649,
5653,
5654,
5719,
5740,
5764,
5845,
5866,
5873,
5913,
5925,
5929,
5930,
5976,
6056,
6057,
6087,
6159,
6171,
6175,
6176,
6198,
6261,
6298,
6302,
6340,
6343,
6344,
6355,
6356,
6536,
6537,
6709,
6710,
6980,
6981,
7016,
7017,
7226,
7227,
7359,
7360,
7370,
7371,
7385,
7386,
7431,
7492,
7538,
7593,
7594,
7842,
7843,
7920,
7921,
8056,
8199,
8200,
8354,
8355,
8361,
8362,
8454,
8455,
8485,
8486,
8718,
8719,
8733,
8735,
8990,
9000,
9026,
9032,
9129,
9143,
9168,
9323,
9333,
9359,
9360,
9372,
9373,
9473,
9474
],
"line_end_idx": [
2,
18,
19,
86,
87,
190,
191,
387,
388,
476,
477,
685,
686,
723,
724,
754,
782,
808,
887,
914,
980,
983,
1022,
1051,
1095,
1142,
1143,
1147,
1197,
1246,
1279,
1283,
1311,
1361,
1372,
1398,
1423,
1440,
1445,
1448,
1449,
1508,
1530,
1531,
1555,
1603,
1632,
1658,
1685,
1689,
1690,
1731,
1735,
1760,
1815,
1835,
1839,
1874,
1923,
1926,
1927,
1931,
1959,
2033,
2099,
2103,
2138,
2157,
2187,
2227,
2258,
2284,
2315,
2346,
2375,
2427,
2479,
2528,
2535,
2541,
2558,
2561,
2562,
2634,
2669,
2709,
2780,
2827,
2866,
2968,
3023,
3029,
3072,
3117,
3120,
3121,
3169,
3214,
3275,
3299,
3345,
3400,
3401,
3447,
3514,
3569,
3600,
3606,
3607,
3623,
3701,
3723,
3756,
3848,
3881,
3903,
3940,
4023,
4045,
4092,
4168,
4219,
4241,
4245,
4246,
4296,
4299,
4300,
4350,
4394,
4409,
4474,
4478,
4541,
4595,
4599,
4600,
4750,
4751,
4846,
4847,
4861,
4862,
4873,
4874,
4876,
4892,
4893,
4908,
4909,
5235,
5236,
5345,
5346,
5425,
5426,
5474,
5522,
5560,
5637,
5649,
5653,
5654,
5719,
5740,
5764,
5845,
5866,
5873,
5913,
5925,
5929,
5930,
5976,
6056,
6057,
6087,
6159,
6171,
6175,
6176,
6198,
6261,
6298,
6302,
6340,
6343,
6344,
6355,
6356,
6536,
6537,
6709,
6710,
6980,
6981,
7016,
7017,
7226,
7227,
7359,
7360,
7370,
7371,
7385,
7386,
7431,
7492,
7538,
7593,
7594,
7842,
7843,
7920,
7921,
8056,
8199,
8200,
8354,
8355,
8361,
8362,
8454,
8455,
8485,
8486,
8718,
8719,
8733,
8735,
8990,
9000,
9026,
9032,
9129,
9143,
9168,
9323,
9333,
9359,
9360,
9372,
9373,
9473,
9474,
9564
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9564,
"ccnet_original_nlines": 245,
"rps_doc_curly_bracket": 0.011710580438375473,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21472683548927307,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03230404108762741,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3890736401081085,
"rps_doc_frac_unique_words": 0.4173297882080078,
"rps_doc_mean_word_length": 5.938992023468018,
"rps_doc_num_sentences": 136,
"rps_doc_symbol_to_word_ratio": 0.0014251800021156669,
"rps_doc_unigram_entropy": 5.6039838790893555,
"rps_doc_word_count": 1131,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.12386482208967209,
"rps_doc_frac_chars_dupe_6grams": 0.08217953890562057,
"rps_doc_frac_chars_dupe_7grams": 0.05865713953971863,
"rps_doc_frac_chars_dupe_8grams": 0.05865713953971863,
"rps_doc_frac_chars_dupe_9grams": 0.01191007997840643,
"rps_doc_frac_chars_top_2gram": 0.005210659932345152,
"rps_doc_frac_chars_top_3gram": 0.0023820200003683567,
"rps_doc_frac_chars_top_4gram": 0.00476403022184968,
"rps_doc_books_importance": -981.693603515625,
"rps_doc_books_importance_length_correction": -981.693603515625,
"rps_doc_openwebtext_importance": -546.5263671875,
"rps_doc_openwebtext_importance_length_correction": -546.5263671875,
"rps_doc_wikipedia_importance": -276.8766174316406,
"rps_doc_wikipedia_importance_length_correction": -276.8766174316406
},
"fasttext": {
"dclm": 0.9234375953674316,
"english": 0.7223753929138184,
"fineweb_edu_approx": 2.262030601501465,
"eai_general_math": 0.42964768409729004,
"eai_open_web_math": 0.10025501251220703,
"eai_web_code": 0.3393470048904419
}
}
|
{
"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": "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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,023,052,628,974,882,000 |
Sign in with
Sign up | Sign in
Your question
Good PC?
Last response: in Systems
Share
December 6, 2012 3:11:31 PM
Ok, i am building a budget gaming pc, so tell me is this ok?
-AMD A8 5600k
-8GB Corsair Vengence RAM
-EVGA GTX 560 TI CLASSIFIED (water-cooled)
-Alpine 700W PSU
-Aerocool Strike-X One Case
Will it run most games on medium settings?
More about : good
December 6, 2012 3:28:05 PM
No. If you have a dedicated graphics card, don't buy an apu. Would be a big waste.
December 6, 2012 3:38:38 PM
1) As flexxar said, if you are getting a dedicated card, there is no reason for an APU. The CPU portion of the APU really isn't that powerful, but with a really good integrated graphics chip it makes it a nice all in one package. Swap it out and get an AMD FX-6300 and supporting motherboard.
2) Drop the alpine power supply and get a more reputable brand. You also don't need 700Ws, you can get away with 500-550W easily for something like you are doing.
3) Why would you get a last generation GPU? Skip the 560TI and get a GTX660 or higher. Also, don't mess with water cooling a lower end GPU. The blocks are expensive, factory installed or not. You are better off getting a higher model GPU for the money.
4) Budget? Site you are purchasing from? Where are the rest of your parts, motherboard, etc?
Related resources
December 6, 2012 6:11:55 PM
Amazon and motherboard is a asrock fm2a55m-dgs
December 6, 2012 6:16:20 PM
Also i was on a budget of around £200-£250 (and i'm using some parts from my current pc)
!
|
{
"url": "http://www.tomshardware.com/forum/374108-31-good",
"source_domain": "www.tomshardware.com",
"snapshot_id": "crawl=CC-MAIN-2014-35",
"warc_metadata": {
"Content-Length": "109723",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KXJF3J5TYBH5Y2DF3AZFHC3Z2L2FVRXJ",
"WARC-Concurrent-To": "<urn:uuid:c15a220b-292e-4820-900e-b2f687062f86>",
"WARC-Date": "2014-08-28T10:41:03Z",
"WARC-IP-Address": "23.0.160.65",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:MYGVO5LQBQ5K6KUSCKM77ZY77M4MPA3X",
"WARC-Record-ID": "<urn:uuid:e1bb6e7d-4d7c-4f88-8388-1d6f7834fc8a>",
"WARC-Target-URI": "http://www.tomshardware.com/forum/374108-31-good",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5cb230a0-461f-45e7-ad54-04bd23a485ea>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-136-8.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for August 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
13,
31,
45,
46,
55,
56,
82,
88,
116,
117,
178,
179,
193,
194,
220,
221,
264,
265,
282,
283,
311,
312,
355,
356,
374,
375,
403,
404,
487,
515,
516,
809,
810,
973,
974,
1227,
1228,
1321,
1339,
1367,
1368,
1415,
1443,
1444,
1533
],
"line_end_idx": [
13,
31,
45,
46,
55,
56,
82,
88,
116,
117,
178,
179,
193,
194,
220,
221,
264,
265,
282,
283,
311,
312,
355,
356,
374,
375,
403,
404,
487,
515,
516,
809,
810,
973,
974,
1227,
1228,
1321,
1339,
1367,
1368,
1415,
1443,
1444,
1533,
1534
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1534,
"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.328000009059906,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07466667145490646,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2879999876022339,
"rps_doc_frac_unique_words": 0.6035714149475098,
"rps_doc_mean_word_length": 4.14642858505249,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.870747089385986,
"rps_doc_word_count": 280,
"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.03875968977808952,
"rps_doc_frac_chars_top_3gram": 0.05598621815443039,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -91.8138427734375,
"rps_doc_books_importance_length_correction": -80.55461883544922,
"rps_doc_openwebtext_importance": -70.6932601928711,
"rps_doc_openwebtext_importance_length_correction": -70.6932601928711,
"rps_doc_wikipedia_importance": -67.71817779541016,
"rps_doc_wikipedia_importance_length_correction": -54.516456604003906
},
"fasttext": {
"dclm": 0.03578352928161621,
"english": 0.9412473440170288,
"fineweb_edu_approx": 0.9329189658164978,
"eai_general_math": 0.01948446035385132,
"eai_open_web_math": 0.21653085947036743,
"eai_web_code": 0.00009262999810744077
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"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": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,392,294,532,574,187,000 |
Roku Developer Program
Developers and content creators—a complete solution for growing an audience directly.
cancel
Showing results for
Show only | Search instead for
Did you mean:
MadmanDavid
Level 7
ParseJSON inside a Task cannot parse long numbers
I'm trying to parse some timestamps from our server inside a Task and having trouble with long numbers.
The numbers output from ParseJSON() are "invalid"
If I use ParseJSON() within the main thread, the Roku has no issue with outputting the correct value.
// Example JSON string
{
"pin": "8RY2",
"pinKey": "2589b22c-240d-4a02-8a7f-8ddf2b273b73",
"expiry": 1484795032530, // This long value (13 numbers) is output as invalid when converting to an AA
"expired": false
}
// ParseJSON()
{
expired: false
expiry: invalid 'This should be the above value.
pin: "8RY2"
pinKey: "2589b22c-240d-4a02-8a7f-8ddf2b273b73"
}
I'm pretty sure this is not working as intended...
If I shorten the number by 4 digits, it quite happily parses.
0 Kudos
4 Replies
Highlighted
MadmanDavid
Level 7
Re: ParseJSON inside a Task cannot parse long numbers
On further investigation its not the Task specifically that cannot parse a long value. The passing of the AA back into the scene thread is what causes the issue.
0 Kudos
Highlighted
EnTerr
Level 9
Re: ParseJSON inside a Task cannot parse long numbers
"MadmanDavid" wrote:
On further investigation its not the Task specifically that cannot parse a long value. The passing of the AA back into the scene thread is what causes the issue.
Aha! Exactly what i guessed reading your first message.
Yes, because `long` is unsupported by RSG data type. See the list of supported field types, strategically hidden here <interface>-Attributes ? Everything that is not one of them gets stripped during data cloning. `Long` is not one of them, so...
0 Kudos
Highlighted
MadmanDavid
Level 7
Re: ParseJSON inside a Task cannot parse long numbers
Okay. Good to know there's a layer that can posibly mangle attributes. I'll have to keep that in mind.
0 Kudos
Highlighted
EnTerr
Level 9
Re: ParseJSON inside a Task cannot parse long numbers
"MadmanDavid" wrote:
Okay. Good to know there's a layer that can posibly mangle attributes. I'll have to keep that in mind.
That will happen every time data has to cross boundaries between threads, be it main and render or task and render - a deep copy is made of it and "unsupported" types are silently(!) lopped off. There are somewhat complicated rules which thread owns what objects, so beware it may not be obvious when
0 Kudos
|
{
"url": "https://community.roku.com/t5/Roku-Developer-Program/ParseJSON-inside-a-Task-cannot-parse-long-numbers/m-p/403175",
"source_domain": "community.roku.com",
"snapshot_id": "crawl=CC-MAIN-2020-10",
"warc_metadata": {
"Content-Length": "188042",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F6K5IOXMKA4PLEWHVXCZEDTOPTJZGSHT",
"WARC-Concurrent-To": "<urn:uuid:3b7374c6-db64-474d-b9c7-b783b9951ab9>",
"WARC-Date": "2020-02-24T03:12:35Z",
"WARC-IP-Address": "208.74.205.104",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UV64G4CONHOX6QRLDSZPVWSJYTRRGTIB",
"WARC-Record-ID": "<urn:uuid:ad51b328-c324-4029-93ac-7ccb55cc86da>",
"WARC-Target-URI": "https://community.roku.com/t5/Roku-Developer-Program/ParseJSON-inside-a-Task-cannot-parse-long-numbers/m-p/403175",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e5f2e181-a6c5-40d5-829c-d3ed05cebb03>"
},
"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-123.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
23,
24,
110,
117,
138,
172,
187,
199,
207,
208,
258,
259,
364,
365,
416,
417,
519,
520,
521,
544,
546,
565,
619,
726,
747,
749,
750,
765,
767,
782,
831,
843,
890,
892,
893,
944,
945,
1007,
1015,
1025,
1037,
1049,
1057,
1058,
1112,
1113,
1275,
1283,
1295,
1302,
1310,
1311,
1365,
1366,
1387,
1549,
1550,
1606,
1852,
1860,
1872,
1884,
1892,
1893,
1947,
1948,
2051,
2059,
2071,
2078,
2086,
2087,
2141,
2142,
2163,
2266,
2267,
2568
],
"line_end_idx": [
23,
24,
110,
117,
138,
172,
187,
199,
207,
208,
258,
259,
364,
365,
416,
417,
519,
520,
521,
544,
546,
565,
619,
726,
747,
749,
750,
765,
767,
782,
831,
843,
890,
892,
893,
944,
945,
1007,
1015,
1025,
1037,
1049,
1057,
1058,
1112,
1113,
1275,
1283,
1295,
1302,
1310,
1311,
1365,
1366,
1387,
1549,
1550,
1606,
1852,
1860,
1872,
1884,
1892,
1893,
1947,
1948,
2051,
2059,
2071,
2078,
2086,
2087,
2141,
2142,
2163,
2266,
2267,
2568,
2575
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2575,
"ccnet_original_nlines": 78,
"rps_doc_curly_bracket": 0.0015533999539911747,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3219047486782074,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024761900305747986,
"rps_doc_frac_lines_end_with_ellipsis": 0.02531646005809307,
"rps_doc_frac_no_alph_words": 0.22285713255405426,
"rps_doc_frac_unique_words": 0.46305418014526367,
"rps_doc_mean_word_length": 4.916255950927734,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0.0038095200434327126,
"rps_doc_unigram_entropy": 4.908308029174805,
"rps_doc_word_count": 406,
"rps_doc_frac_chars_dupe_10grams": 0.37174350023269653,
"rps_doc_frac_chars_dupe_5grams": 0.4068136215209961,
"rps_doc_frac_chars_dupe_6grams": 0.39278557896614075,
"rps_doc_frac_chars_dupe_7grams": 0.39278557896614075,
"rps_doc_frac_chars_dupe_8grams": 0.39278557896614075,
"rps_doc_frac_chars_dupe_9grams": 0.37174350023269653,
"rps_doc_frac_chars_top_2gram": 0.03857715055346489,
"rps_doc_frac_chars_top_3gram": 0.03306613117456436,
"rps_doc_frac_chars_top_4gram": 0.05010019987821579,
"rps_doc_books_importance": -199.44573974609375,
"rps_doc_books_importance_length_correction": -199.44573974609375,
"rps_doc_openwebtext_importance": -136.1521759033203,
"rps_doc_openwebtext_importance_length_correction": -136.1521759033203,
"rps_doc_wikipedia_importance": -93.88435363769531,
"rps_doc_wikipedia_importance_length_correction": -93.88435363769531
},
"fasttext": {
"dclm": 0.17595398426055908,
"english": 0.84046870470047,
"fineweb_edu_approx": 2.166411876678467,
"eai_general_math": 0.17769837379455566,
"eai_open_web_math": 0.27527785301208496,
"eai_web_code": 0.02386528067290783
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,496,362,260,937,943,000 |
Google Script - Making a Form Question from Spreadsheet Data
This is totally a revisit of the post I did on made on October 31, 2016 about "Google Script - Create a Drop-Down List from Spreadsheet Column"
I had another use for this today. I wanted educators completing a form to fill in their district. Yet the thought of all the different spelling/acronyms I might give was going to make the data analysis crazy. For people from my organization alone in the first 5 minutes I got Calhoun ISD, Calhoun, Calhoun Intermediate School District, CISD. Seriously.
I remembered this script I used before to create a drop-down from a spreadsheet, and figured I could revamp it for use with a Multiple Choice item - one where people could input their district if it was not there yet using the 'other' option.
Viola! Here it is modified for a multiple choice - much is the same as before, but there are some differences.
To do this yourself -
1. Create your form.
Really important step. Make sure to create your multiple choice item and give it a title, but you do not need to add any options to it (because later you will populate it from the spreadsheet). Make sure to add the option of "other" so people can input items onto the list.
2. Create the spreadsheet where your list will reside.
I created the spreadsheet for my form responses and add a second sheet to it, calling the additional sheet Districts:
3. An additional step on this spreadsheet - since I want to constantly update this from the form entries (column E on my responses sheet), in Column C I ran a query
=query('Form Responses 1'!E1:E)
This pulled all the entries for the District question from the responses sheet. I the ran another formula in Column A to sort them and only get the unique entries
=unique(sort(C2:C))
3. Open up the Script editor
Go to the Tools Menu and select Script editor
4. Replace the code
Replace the default code -
with this - (all the text highlighted in gray include the final bracket)
function updateForm(){
// call your form and connect to the drop-down item
var form = FormApp.openById("Your Form ID");
var namesList = form.getItemById("The Multiple Choice ID").asMultipleChoiceItem();
// identify the sheet where the data resides needed to populate the drop-down
var ss = SpreadsheetApp.getActive();
var names = ss.getSheetByName("Name of Sheet in Spreadsheet with list");
// grab the values in the first column of the sheet - use 2 to skip header row
var namesValues = names.getRange(2, 1, names.getMaxRows() - 1).getValues();
var districtNames = [];
// convert the array ignoring empty cells
for(var i = 0; i < namesValues.length; i++)
if(namesValues[i][0] != "")
districtNames[i] = namesValues[i][0];
// populate the drop-down with the array data
namesList.setChoiceValues(districtNames);
}
5. Enter Your Form ID
Replace the text Your Form ID with your actual form id. You can get this from the URL of your form when you are editing it - it is the part between the backslashes as marked here
6. Enter Your Drop-Down ID
Probably the hardest task in this - it took me a couple hours to find the item ID. I selected to View Source, then utilized the search for to look for data-item-ID ...then did a comparison until I found the right question. This ID will be a random alpha-numeric - mine was a 9 digit number. It appears multiple places in the source. (One hint from another person was to do a 1-question form at first for this, then add the others later.)
Replace the text The Multiple Choice ID with the ID you just found.
6. Enter Your Sheet Name
Replace the text Name of Sheet in Spreadsheet with the name you put on your new sheet that will have the data. (In my example the sheet is Districts.)
7. Set Your Script Trigger
Go to the Edit Menu and select Current project's triggers. Set at least one trigger to make your script run automatically (unless you really like opening it up all the time...). Mine runs every time someone submits a form entry.
8. Debug (test your accuracy)
If you click on the bug icon, it will debug your script. If something needs fixing, it will give information at the bottom of the window. If all is right with the world, it will run and nothing will happen.
That's it! Go and test it - add names to the first column of your spreadsheet and see what happens on your form. You can either wait for the trigger to run it, or you can manually run it with the play icon while looking at the script.
Finally - if you want the data from a column OTHER than the first one, just update this bit of code:
names.getRange(2, 1
change the 1 to the column you want (2 for column B, 3 for column C, etc).
Popular posts from this blog
Google Script - Create a Drop-Down List from Spreadsheet Column
Google Sheets - Flipping Your Rows & Columns
Google Forms - Copy Summary Graph/Diagram to Use Elsewhere
Google Script - Create Calendar Events from Spreadsheet Data
Google - Reset a Form for Reuse with the new School Year
|
{
"url": "http://wafflebytes.blogspot.com/2018/12/google-script-revisiting-making-form.html",
"source_domain": "wafflebytes.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2020-10",
"warc_metadata": {
"Content-Length": "270712",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ALAQRV6HHB4PMKETNB3QCCG6GX7LYY3S",
"WARC-Concurrent-To": "<urn:uuid:a3e1df24-0b3a-4c28-9b1f-e133ccbe0b76>",
"WARC-Date": "2020-02-27T02:10:36Z",
"WARC-IP-Address": "172.217.12.225",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ULICF26RA36G2S2TPH5WWV4QBSFRKNHU",
"WARC-Record-ID": "<urn:uuid:222d9370-353c-41b2-925d-c2d0f94263b3>",
"WARC-Target-URI": "http://wafflebytes.blogspot.com/2018/12/google-script-revisiting-making-form.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b0276016-35ca-4a84-a136-965c5c55b8f2>"
},
"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-233.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,
61,
62,
206,
207,
564,
565,
808,
809,
921,
922,
944,
967,
1242,
1243,
1298,
1416,
1417,
1418,
1584,
1617,
1618,
1782,
1802,
1803,
1832,
1878,
1879,
1900,
1928,
1929,
1930,
2003,
2006,
2029,
2083,
2130,
2134,
2219,
2220,
2298,
2337,
2412,
2413,
2495,
2573,
2574,
2600,
2601,
2645,
2695,
2727,
2771,
2772,
2820,
2864,
2867,
2869,
2870,
2871,
2893,
3073,
3074,
3102,
3543,
3544,
3612,
3613,
3638,
3790,
3791,
3818,
4049,
4050,
4051,
4081,
4291,
4292,
4529,
4530,
4631,
4651,
4726,
4727,
4756,
4757,
4821,
4822,
4867,
4868,
4927,
4928,
4989,
4990
],
"line_end_idx": [
61,
62,
206,
207,
564,
565,
808,
809,
921,
922,
944,
967,
1242,
1243,
1298,
1416,
1417,
1418,
1584,
1617,
1618,
1782,
1802,
1803,
1832,
1878,
1879,
1900,
1928,
1929,
1930,
2003,
2006,
2029,
2083,
2130,
2134,
2219,
2220,
2298,
2337,
2412,
2413,
2495,
2573,
2574,
2600,
2601,
2645,
2695,
2727,
2771,
2772,
2820,
2864,
2867,
2869,
2870,
2871,
2893,
3073,
3074,
3102,
3543,
3544,
3612,
3613,
3638,
3790,
3791,
3818,
4049,
4050,
4051,
4081,
4291,
4292,
4529,
4530,
4631,
4651,
4726,
4727,
4756,
4757,
4821,
4822,
4867,
4868,
4927,
4928,
4989,
4990,
5046
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5046,
"ccnet_original_nlines": 93,
"rps_doc_curly_bracket": 0.0003963499912060797,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3730084300041199,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03467665985226631,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19962511956691742,
"rps_doc_frac_unique_words": 0.38948625326156616,
"rps_doc_mean_word_length": 4.573476791381836,
"rps_doc_num_sentences": 58,
"rps_doc_symbol_to_word_ratio": 0.0018744099652394652,
"rps_doc_unigram_entropy": 5.113000869750977,
"rps_doc_word_count": 837,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03970741853117943,
"rps_doc_frac_chars_dupe_6grams": 0.02716822922229767,
"rps_doc_frac_chars_dupe_7grams": 0.02716822922229767,
"rps_doc_frac_chars_dupe_8grams": 0.02716822922229767,
"rps_doc_frac_chars_dupe_9grams": 0.02716822922229767,
"rps_doc_frac_chars_top_2gram": 0.012539179995656013,
"rps_doc_frac_chars_top_3gram": 0.014106580056250095,
"rps_doc_frac_chars_top_4gram": 0.009926849976181984,
"rps_doc_books_importance": -406.9022521972656,
"rps_doc_books_importance_length_correction": -406.9022521972656,
"rps_doc_openwebtext_importance": -231.2095489501953,
"rps_doc_openwebtext_importance_length_correction": -231.2095489501953,
"rps_doc_wikipedia_importance": -160.08609008789062,
"rps_doc_wikipedia_importance_length_correction": -160.08609008789062
},
"fasttext": {
"dclm": 0.02497733011841774,
"english": 0.8066074252128601,
"fineweb_edu_approx": 2.0335183143615723,
"eai_general_math": 0.06161915883421898,
"eai_open_web_math": 0.293401837348938,
"eai_web_code": 0.08338434249162674
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "371.392",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Teachers, Teaching, and School management and organization"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
783,323,471,144,865,000 |
Name
blendColor()
Examples
orange = color(204, 102, 0)
blue = color(0, 102, 153)
orangeblueadd = blendColor(orange, blue, ADD)
background(51)
noStroke()
fill(orange)
rect(14, 20, 20, 60)
fill(orangeblueadd)
rect(40, 20, 20, 60)
fill(blue)
rect(66, 20, 20, 60)
Description Blends two color values together based on the blending mode given as the MODE parameter. The possible modes are described in the reference for the blend() function.
Syntax
blendColor(c1,c2,MODE)
Parameters
c1color: the first color to blend
c2color: the second color to blend
MODEEither BLEND, ADD, SUBTRACT, DARKEST, LIGHTEST, DIFFERENCE, EXCLUSION, MULTIPLY, SCREEN, OVERLAY, HARD_LIGHT, SOFT_LIGHT, DODGE, or BURN
Related blend()
color()
Updated on Sat Dec 1 21:31:10 2018.
Creative Commons License
|
{
"url": "https://py.processing.org/reference/blendColor.html",
"source_domain": "py.processing.org",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "5573",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:32TAJRVSWGZCLZEIZI5KMQSEBK2QDQ57",
"WARC-Concurrent-To": "<urn:uuid:cc185636-4b76-48b7-887a-622017dbdd76>",
"WARC-Date": "2019-01-20T05:56:11Z",
"WARC-IP-Address": "23.239.19.146",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2RTUUBBEMFRYLAJIWH4HQMALDUOBXCU7",
"WARC-Record-ID": "<urn:uuid:37e3fc51-678b-4a90-a5ff-4f4bef3032b3>",
"WARC-Target-URI": "https://py.processing.org/reference/blendColor.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e592f498-d846-4ead-9ed7-3f9c0017b9cb>"
},
"warc_info": "isPartOf: CC-MAIN-2019-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-182-67-179.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,
5,
6,
19,
20,
29,
57,
83,
129,
144,
155,
168,
189,
209,
230,
241,
262,
439,
446,
469,
480,
514,
549,
690,
706,
714,
750
],
"line_end_idx": [
5,
6,
19,
20,
29,
57,
83,
129,
144,
155,
168,
189,
209,
230,
241,
262,
439,
446,
469,
480,
514,
549,
690,
706,
714,
750,
774
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 774,
"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.11827956885099411,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.09139785170555115,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.48924732208251953,
"rps_doc_frac_unique_words": 0.75,
"rps_doc_mean_word_length": 5.692307472229004,
"rps_doc_num_sentences": 4,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.167680263519287,
"rps_doc_word_count": 104,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.020270269364118576,
"rps_doc_frac_chars_top_3gram": 0.030405409634113312,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -83.251708984375,
"rps_doc_books_importance_length_correction": -83.251708984375,
"rps_doc_openwebtext_importance": -40.63475799560547,
"rps_doc_openwebtext_importance_length_correction": -40.63475799560547,
"rps_doc_wikipedia_importance": -29.910003662109375,
"rps_doc_wikipedia_importance_length_correction": -29.910003662109375
},
"fasttext": {
"dclm": 0.036798179149627686,
"english": 0.5557234287261963,
"fineweb_edu_approx": 2.5512688159942627,
"eai_general_math": 0.2739788293838501,
"eai_open_web_math": 0.33837324380874634,
"eai_web_code": 0.3657609820365906
}
}
|
{
"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": "778.9",
"labels": {
"level_1": "Arts",
"level_2": "Photography",
"level_3": "Cinematography"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "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": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,873,080,209,607,807,500 |
How to cancel App Store subscription on Apple iPhone running iOS 15
Apple’s App Store is among the most popular in the market, hosting millions of applications for the users of iPhone and iPad to download, install, and use. It hosts a combination of free and paid apps but gone are the days when you could make a one-time purchase and use the application until the developer supports it.
Nowadays, most applications have moved to the subscription model, where the user needs to purchase a monthly or yearly plan for using the application. While this is good for the business, it gives them recurring revenue, but not so much for the user.
The boom in the subscription business model has led to subscription fatigue. Subscription fatigue refers to a potential decrease in consumer interest around subscription services over time as the number of available subscription offerings increases.
If you are among those users, then thankfully, for the app and services purchased thorugh the App Store, Apple offers a relatively easy way to cancel the subscription.
In this step-by-step guide, we will show you how to unsubscribe from a subscription on your Apple iPhone running the iOS 15 or newer version of the operating system.
How to cancel App Store subscription on Apple iPhone running iOS 15
Step 1: Open the Settings application on your Apple iPhone.
Step 2: When the Settings app opens, tap on the Apple ID icon at the top of the screen.
Step 3: After that, click on the “Subscriptions” option.
Step 4: Under the Subscription settings, tap on the subscription you want to cancel.
Step 5: On the Edit Subscription page that opens, tap on the “Cancel Subscription” option and tap the “Confirm” button when asked.
Apple-App-Store-Subscription-Cancellation-1
That’s it. After you have followed the above-mentioned steps, the subscription for that particular product or service will be canceled, and you will no longer be automatically billed for that. It’s noteworthy that many applications also allows changing the subscription plan within the subscriptions page. Note that this method for unsubscribing for services only works when you have a subscription to an application or service through the App Store.
Leave a Comment
|
{
"url": "https://banpeegroup.com/how-to-cancel-app-store-subscription-on-apple-iphone-running-ios-15/",
"source_domain": "banpeegroup.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "74675",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EBXQZZF23TOOHBXPXWNHMLMJTVW74KVQ",
"WARC-Concurrent-To": "<urn:uuid:eb141905-eaa0-4cb7-9e38-f05bb4f666ee>",
"WARC-Date": "2022-05-24T10:06:15Z",
"WARC-IP-Address": "162.0.232.38",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IFF7RGDIOW6ZJPN3GU23BGXWSXCKAAIL",
"WARC-Record-ID": "<urn:uuid:308562b1-de9d-4a2a-9568-20f6f85ea4ff>",
"WARC-Target-URI": "https://banpeegroup.com/how-to-cancel-app-store-subscription-on-apple-iphone-running-ios-15/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7acc4c41-343f-4fb8-988f-caf6ea13b087>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-190\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
68,
69,
389,
390,
641,
642,
892,
893,
1061,
1062,
1228,
1229,
1297,
1298,
1358,
1359,
1447,
1448,
1505,
1506,
1591,
1592,
1723,
1724,
1768,
1769,
2220,
2221
],
"line_end_idx": [
68,
69,
389,
390,
641,
642,
892,
893,
1061,
1062,
1228,
1229,
1297,
1298,
1358,
1359,
1447,
1448,
1505,
1506,
1591,
1592,
1723,
1724,
1768,
1769,
2220,
2221,
2236
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2236,
"ccnet_original_nlines": 28,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40509259700775146,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0023148099426180124,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1527777761220932,
"rps_doc_frac_unique_words": 0.4820936620235443,
"rps_doc_mean_word_length": 4.991735458374023,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.659915447235107,
"rps_doc_word_count": 363,
"rps_doc_frac_chars_dupe_10grams": 0.06181015074253082,
"rps_doc_frac_chars_dupe_5grams": 0.06181015074253082,
"rps_doc_frac_chars_dupe_6grams": 0.06181015074253082,
"rps_doc_frac_chars_dupe_7grams": 0.06181015074253082,
"rps_doc_frac_chars_dupe_8grams": 0.06181015074253082,
"rps_doc_frac_chars_dupe_9grams": 0.06181015074253082,
"rps_doc_frac_chars_top_2gram": 0.05794702097773552,
"rps_doc_frac_chars_top_3gram": 0.029801320284605026,
"rps_doc_frac_chars_top_4gram": 0.015452539548277855,
"rps_doc_books_importance": -200.00721740722656,
"rps_doc_books_importance_length_correction": -200.00721740722656,
"rps_doc_openwebtext_importance": -110.673828125,
"rps_doc_openwebtext_importance_length_correction": -110.673828125,
"rps_doc_wikipedia_importance": -73.54342651367188,
"rps_doc_wikipedia_importance_length_correction": -73.54342651367188
},
"fasttext": {
"dclm": 0.04394632950425148,
"english": 0.8998674154281616,
"fineweb_edu_approx": 1.3265825510025024,
"eai_general_math": 0.03329623118042946,
"eai_open_web_math": 0.08332443237304688,
"eai_web_code": 0.17539191246032715
}
}
|
{
"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": "-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": "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": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
371,326,329,794,300,000 |
How you can Hookup a Wii With AV Cords
Are you looking for a method to hookup the Nintendo wii console to your TV? If so , you’ve come towards the right place. Right here, we’ll walk you through the process step-by-step so https://besthookupsites.org/snapsext-review/ that you can receive playing your chosen games very fast.
The first step is to check what types of fittings your TELEVISION supports. Most will support RCA (three-pronged) cables, which are typically colored Red, Bright white, and Yellow-colored.
Newer TVs may also accept component (five-pronged) wires. These will certainly currently have two jacks for music, each with a color (typically crimson or white) and three ports with respect to online video, each using a color (typically blue or green).
Connecting a Wii to your TV is certainly pretty simple if you know what you’re doing. It’s a good idea to consult a user manual for your specific TV SET model to make certain that you’re using the right connections and settings.
https://elite-brides.com/images/59-1582905666135.jpg
How to Get together a Wii with AUDIO-VIDEO Cables
The most common and easy approach to connect the Wii is by using AV cables, that include Composite RCA cabling (three connectors colored yellow hue, red, and white), S-video, and component video cabling (RGB video connectors with twin white and red audio connectors).
If you are trying to use an older TELEVISION SET that doesn’t have right AV connections, you are going to neet to purchase an adapter or ripping tools. A great adapter is known as a cable that has different ends to convert a person data https://books.google.fr/books?id=Ni1pDwAAQBAJ&pg=PA168&lpg=PA168&dq=about+women&source=bl&ots=uNXp5SeMCb&sig=ACfU3U3u8lbtxvAUee-JXFru0aCs–NQTQ&hl=en type to a different, such as standard-definition to hi def.
About the Author
Lasă un răspuns
Adresa ta de email nu va fi publicată. Câmpurile obligatorii sunt marcate cu *
You may also like these
|
{
"url": "https://www.petroneladobrica.ro/2023/01/27/how-you-can-hookup-a-wii-with-av-cords/",
"source_domain": "www.petroneladobrica.ro",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "203804",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:47CAW76YJLVF6TCA6NZKQYCWDDL5EM2W",
"WARC-Concurrent-To": "<urn:uuid:9ba49790-b7ee-4ba8-985e-d1a8823f792f>",
"WARC-Date": "2024-08-06T07:46:00Z",
"WARC-IP-Address": "185.199.175.131",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4F7QWFC2QLKYTYGMBKJGZVCHIQKOBFZF",
"WARC-Record-ID": "<urn:uuid:79de9f6b-0e35-4d25-ae40-0eb075ade9b9>",
"WARC-Target-URI": "https://www.petroneladobrica.ro/2023/01/27/how-you-can-hookup-a-wii-with-av-cords/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a24672db-68cc-4cf1-bbd0-9b3d1914b29c>"
},
"warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-107\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,
39,
40,
327,
328,
517,
518,
772,
773,
1002,
1003,
1056,
1057,
1107,
1108,
1376,
1377,
1823,
1824,
1841,
1842,
1858,
1859,
1938,
1939
],
"line_end_idx": [
39,
40,
327,
328,
517,
518,
772,
773,
1002,
1003,
1056,
1057,
1107,
1108,
1376,
1377,
1823,
1824,
1841,
1842,
1858,
1859,
1938,
1939,
1962
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1962,
"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.3387471139431,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.046403709799051285,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20417633652687073,
"rps_doc_frac_unique_words": 0.5892255902290344,
"rps_doc_mean_word_length": 5.27946138381958,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.867517471313477,
"rps_doc_word_count": 297,
"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.007653059903532267,
"rps_doc_frac_chars_top_3gram": 0.010204079560935497,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -209.83444213867188,
"rps_doc_books_importance_length_correction": -209.83444213867188,
"rps_doc_openwebtext_importance": -120.56236267089844,
"rps_doc_openwebtext_importance_length_correction": -120.56236267089844,
"rps_doc_wikipedia_importance": -94.5007095336914,
"rps_doc_wikipedia_importance_length_correction": -94.5007095336914
},
"fasttext": {
"dclm": 0.025113459676504135,
"english": 0.913905680179596,
"fineweb_edu_approx": 1.8013725280761719,
"eai_general_math": 0.013802110217511654,
"eai_open_web_math": 0.29797619581222534,
"eai_web_code": 0.0029301000759005547
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,495,849,915,975,720,400 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
I followed the instructions in this link but I face a strange problem which is when the lookup is populated with the new filtered view the add button is getting disabled when I select a record from the new view !! I debugged the code in the lookupinfo.aspx page and I found this line of code that controls whether the add button is enabled or disabled btnAdd.disabled = (crmGrid.InnerGrid.SelectedRecords.length == 0); and this line of code always return true despite there is a selected record !!
Can anyone help me ? Thank you.
share|improve this question
1 Answer 1
I followed the instructions in this link
Which link? I can't see one referenced in your question. I'll make some assumptions about what you are trying to do. I will assume that you are trying to hide an "Add Existing" button linked to a form's sub-grid. I'll also assuem you're trying to edit XML files by hand (which is the hard way!).
The easiest way to apply rules to buttons in CRM 2011 is to use Erik Pool's brilliant tool "Visual Ribbon Editor" (available here)).
To hide an "Add Existing" button based on selected records, you would:
1. Connect the tool to your CRM environment
2. Open the "parent" entity (i.e. the record type that shows the "Add Existing xxxx" button
3. Select the Ribbon Type to be "Sub-Grid"
4. Select the button you wish to manipulate
5. Add or edit the Enable Rules for that button
If I'm not describing a solution to your problem, maybe enhance your question - it's hard to understand what you are trying to acheive.
share|improve this answer
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/10470549/add-filter-to-add-existing-button-crm-2011",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-41",
"warc_metadata": {
"Content-Length": "66302",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CSDIWG6NVMTB4CKONKDZRN66WMRIQM6R",
"WARC-Concurrent-To": "<urn:uuid:2083b93d-54dd-453e-a80c-44eecab95035>",
"WARC-Date": "2014-09-23T02:51:26Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:7SDMKCLBMLGPU65JB5ECYEA3R4LH7KP7",
"WARC-Record-ID": "<urn:uuid:c712a9f6-cff1-4928-8c1b-7aef09aaa104>",
"WARC-Target-URI": "http://stackoverflow.com/questions/10470549/add-filter-to-add-existing-button-crm-2011",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9bcb9ba4-0dbf-4058-820e-a0d8d88b6892>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-234-18-248.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-41\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for September 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
157,
158,
656,
657,
689,
690,
718,
719,
730,
731,
772,
773,
1069,
1070,
1203,
1204,
1275,
1276,
1322,
1416,
1461,
1507,
1557,
1558,
1694,
1695,
1721,
1722,
1734,
1735,
1737,
1745,
1746,
1824,
1825
],
"line_end_idx": [
25,
157,
158,
656,
657,
689,
690,
718,
719,
730,
731,
772,
773,
1069,
1070,
1203,
1204,
1275,
1276,
1322,
1416,
1461,
1507,
1557,
1558,
1694,
1695,
1721,
1722,
1734,
1735,
1737,
1745,
1746,
1824,
1825,
1915
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1915,
"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.38498789072036743,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.033898308873176575,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19612590968608856,
"rps_doc_frac_unique_words": 0.5263158082962036,
"rps_doc_mean_word_length": 4.591331481933594,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.75409460067749,
"rps_doc_word_count": 323,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1038435623049736,
"rps_doc_frac_chars_dupe_6grams": 0.07956843823194504,
"rps_doc_frac_chars_dupe_7grams": 0.04585300013422966,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.021577879786491394,
"rps_doc_frac_chars_top_3gram": 0.024275120347738266,
"rps_doc_frac_chars_top_4gram": 0.02832097001373768,
"rps_doc_books_importance": -215.9541473388672,
"rps_doc_books_importance_length_correction": -215.95413208007812,
"rps_doc_openwebtext_importance": -125.9416732788086,
"rps_doc_openwebtext_importance_length_correction": -125.9416732788086,
"rps_doc_wikipedia_importance": -86.5246353149414,
"rps_doc_wikipedia_importance_length_correction": -86.5246353149414
},
"fasttext": {
"dclm": 0.15813684463500977,
"english": 0.9222368597984314,
"fineweb_edu_approx": 1.0281586647033691,
"eai_general_math": 0.0003617999900598079,
"eai_open_web_math": 0.04678630828857422,
"eai_web_code": 0.0000443499993707519
}
}
|
{
"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.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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,914,458,007,640,113,700 |
Forum Thread: Need help with Cyber Cafe system
Hello everyone, I need help with something.
About a week ago a cyber/gaming cafe opened near my school, there is WiFi ofcourse so i decided to snoop around the network with zANTI for Android. I found out there is a cash register or something like that connected, there are multiple remote hosts connected to it, after using password complexity audit with the http-get protocol i got a password and username Root/sa123456. When i press it Connectbot comes up and says "connecting to 192.168.56.1" something like that, after some time nothing happends. I still need to look around the network. The router that is being used is Cisco with 2 ports on it one is 80 and other one is 81.
When I open the 80 port it redirects me to the router login screen after trying multiple admin passwords it wouldn't connect to it. I also found out that the main pc is vulnerable to SQL attacks.
I would like to know is it possible to access the SQL database.
Our Best Hacking & Security Guides
New Null Byte posts — delivered straight to your inbox.
9 Responses
This is probably black hat. So it's illegal. Don't do that.
We do not promote or aid any black hat related activity. At the front page, you should see:
Null Byte
The aspiring white-hat hacker/security awareness playground
TRT
yes possible to access the sql database,check out Master OTW articles on db hacking.............
Dont do anything illegal
Its not illegal actually I know the owner of the place, his son is my friend and I have told him that I found some possible vulnrabilities, I have full permision from the owner himself.
You should check out the articles about database hacking.
Apply only if you have full permission. Don't do illegal stuff mr. Pantelija.
Then get a written contract by him stating that you can do this.
Get Kali Linux Live CD and boot into a computer that's on the LAN.Since it's a Cyber Cafe that won't be a problem right?Then just use Owasp zap on the 192.168.XXX.XXX or whatever is the Local Address of the main PC.Don't do anything illegal :)
What do i do after that?
Any tips
Share Your Thoughts
• Hot
• Active
|
{
"url": "https://null-byte.wonderhowto.com/forum/need-help-with-cyber-cafe-system-0168247/",
"source_domain": "null-byte.wonderhowto.com",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "156071",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NPGTO3YR5SCCID3ATGPCBPMN6PENE7MB",
"WARC-Concurrent-To": "<urn:uuid:da046348-9905-4fbe-b30d-a7718a91fdf4>",
"WARC-Date": "2020-07-16T14:46:39Z",
"WARC-IP-Address": "104.193.19.59",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NY76ALNQYX7TEATBFGWVP3WS5MDW7AGU",
"WARC-Record-ID": "<urn:uuid:be21b008-13e6-4fd2-aadb-6a572b5cc619>",
"WARC-Target-URI": "https://null-byte.wonderhowto.com/forum/need-help-with-cyber-cafe-system-0168247/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c5fe8860-f2cf-4be8-9eee-8a470399a084>"
},
"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-95.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,
47,
48,
92,
93,
730,
731,
927,
928,
992,
993,
1028,
1029,
1085,
1086,
1098,
1099,
1159,
1160,
1252,
1262,
1322,
1323,
1327,
1328,
1425,
1450,
1451,
1637,
1638,
1696,
1774,
1775,
1840,
1841,
2085,
2086,
2111,
2120,
2121,
2141,
2142,
2150
],
"line_end_idx": [
47,
48,
92,
93,
730,
731,
927,
928,
992,
993,
1028,
1029,
1085,
1086,
1098,
1099,
1159,
1160,
1252,
1262,
1322,
1323,
1327,
1328,
1425,
1450,
1451,
1637,
1638,
1696,
1774,
1775,
1840,
1841,
2085,
2086,
2111,
2120,
2121,
2141,
2142,
2150,
2160
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2160,
"ccnet_original_nlines": 42,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42424240708351135,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04112553969025612,
"rps_doc_frac_lines_end_with_ellipsis": 0.023255810141563416,
"rps_doc_frac_no_alph_words": 0.1580086648464203,
"rps_doc_frac_unique_words": 0.5657894611358643,
"rps_doc_mean_word_length": 4.434210300445557,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0.008658009581267834,
"rps_doc_unigram_entropy": 5.015468597412109,
"rps_doc_word_count": 380,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.026112759485840797,
"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.010682489722967148,
"rps_doc_frac_chars_top_3gram": 0.014243319630622864,
"rps_doc_frac_chars_top_4gram": 0.02255192957818508,
"rps_doc_books_importance": -196.62799072265625,
"rps_doc_books_importance_length_correction": -196.62799072265625,
"rps_doc_openwebtext_importance": -125.35829162597656,
"rps_doc_openwebtext_importance_length_correction": -125.35829162597656,
"rps_doc_wikipedia_importance": -111.38573455810547,
"rps_doc_wikipedia_importance_length_correction": -111.38573455810547
},
"fasttext": {
"dclm": 0.019790830090641975,
"english": 0.9482631087303162,
"fineweb_edu_approx": 1.151030421257019,
"eai_general_math": 0.026771429926156998,
"eai_open_web_math": 0.13415199518203735,
"eai_web_code": 0.021892309188842773
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.8",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.076",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,597,687,918,174,169,000 |
Free Trial
Safari Books Online is a digital library providing on-demand subscription access to thousands of learning resources.
• Create BookmarkCreate Bookmark
• Create Note or TagCreate Note or Tag
• PrintPrint
Share this Page URL
Help
Section #11. Kernel Hacking Config Options
Section #11. Kernel Hacking Config Options
Several options exist under Kernel hacking in the kernel configuration menu that can emit valuable debug information. If you enable an option, corresponding debug code compile when you build the kernel.[10] Here are a few examples:
[10] Some kernel hacking options are architecture-dependent.
1. Show Timing information on printks (CONFIG_PRINTK_TIME) adds timing instrumentation to printk() output, so you can use printks as checkpoints for measuring execution times and identifying slow code regions.
2. Using freed memory results in memory poisoning. Debug slab memory allocations (CONFIG_DEBUG_SLAB) helps you detect such problems.
3. Spinlock and rw-lock debugging: basic checks (CONFIG_DEBUG_SPINLOCK) finds lock-related problems such as uninitialized spinlock usage and helps catch code that is not SMP-safe.
4. You have already worked with Magic SysRq key (CONFIG_MAGIC_SYSRQ) when you learned to use kdump. If you turn this on, you have some avenues left even if the kernel crashes during debugging. For example, pressing Alt-Sysrq-t produces a dump of current tasks, whereas Alt-Sysrq-p prints the contents of processor registers.
5. Detect Soft Lockups (CONFIG_DETECT_SOFTLOCKUP) utilizes the services of a watchdog to detect tight loops in kernel code that last for more than 10 seconds. We looked at this when we analyzed a kernel hang using kdump. Note that hardware lockups cannot be found this way. For that, use the services of a Non-Maskable Interrupt (NMI)-watchdog if your platform supports it.
6. If you enable CONFIG_DEBUG_SLAB, CONFIG_DEBUG_HIMEM, or CONFIG_DEBUG_PAGE_ALLOC while configuring your kernel, additional error-checking code is compiled that help debug problems related to memory management.
7. Check for stack overflows (CONFIG_DEBUG_STACKOVERFLOW) adds code to emit warnings if the available stack space falls below a threshold. Stack utilization instrumentation (CONFIG_DEBUG_STACK_USAGE) adds stack space instrumentation to the magic Sysrq key output. Another related option, CONFIG_4KSTACKS, lets you set the kernel stack size to 4 KB rather than 8 KB.
8. Verbose BUG() reporting (CONFIG_DEBUG_BUGVERBOSE) produces extra debug information when any kernel code invokes BUG(), assuming that you have -CONFIG_BUG turned on during kernel configuration.
You are currently reading a PREVIEW of this book.
Get instant access to over $1 million worth of books and videos.
Start a Free 10-Day Trial
• Safari Books Online
• Create BookmarkCreate Bookmark
• Create Note or TagCreate Note or Tag
• PrintPrint
|
{
"url": "http://my.safaribooksonline.com/book/operating-systems-and-server-administration/linux/9780137072446/kernel-hacking-config-options/ch11?bookview=contents",
"source_domain": "my.safaribooksonline.com",
"snapshot_id": "crawl=CC-MAIN-2014-23",
"warc_metadata": {
"Content-Length": "46954",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZDSQTXANIBX7R3NWHWIDV2KIQRNSC5SR",
"WARC-Concurrent-To": "<urn:uuid:64ef5256-1de1-4ef0-b801-276a41105518>",
"WARC-Date": "2014-07-29T00:45:32Z",
"WARC-IP-Address": "23.235.46.185",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:B3Q3EPB3CQKLXTUWC6EN5L53PIOPNCAE",
"WARC-Record-ID": "<urn:uuid:c194b7cf-1d57-435f-8d1c-ed68f7da8e41>",
"WARC-Target-URI": "http://my.safaribooksonline.com/book/operating-systems-and-server-administration/linux/9780137072446/kernel-hacking-config-options/ch11?bookview=contents",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:31212c84-b771-43dd-a5a9-68b32aaa18cf>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-146-231-18.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-23\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for July 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
11,
12,
129,
130,
165,
206,
221,
241,
246,
247,
290,
291,
334,
335,
567,
568,
629,
630,
842,
843,
978,
979,
1161,
1162,
1489,
1490,
1866,
1867,
2081,
2082,
2450,
2451,
2649,
2650,
2651,
2654,
2655,
2705,
2706,
2823,
2824,
2889,
2890,
2893,
2894,
2920,
2921,
2922,
2925,
2949,
2984,
3025
],
"line_end_idx": [
11,
12,
129,
130,
165,
206,
221,
241,
246,
247,
290,
291,
334,
335,
567,
568,
629,
630,
842,
843,
978,
979,
1161,
1162,
1489,
1490,
1866,
1867,
2081,
2082,
2450,
2451,
2649,
2650,
2651,
2654,
2655,
2705,
2706,
2823,
2824,
2889,
2890,
2893,
2894,
2920,
2921,
2922,
2925,
2949,
2984,
3025,
3039
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3039,
"ccnet_original_nlines": 52,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26346153020858765,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04038462042808533,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20961537957191467,
"rps_doc_frac_unique_words": 0.5486935973167419,
"rps_doc_mean_word_length": 5.517814636230469,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.003846149891614914,
"rps_doc_unigram_entropy": 5.156096935272217,
"rps_doc_word_count": 421,
"rps_doc_frac_chars_dupe_10grams": 0.06112784892320633,
"rps_doc_frac_chars_dupe_5grams": 0.09126129746437073,
"rps_doc_frac_chars_dupe_6grams": 0.09126129746437073,
"rps_doc_frac_chars_dupe_7grams": 0.06112784892320633,
"rps_doc_frac_chars_dupe_8grams": 0.06112784892320633,
"rps_doc_frac_chars_dupe_9grams": 0.06112784892320633,
"rps_doc_frac_chars_top_2gram": 0.012053379788994789,
"rps_doc_frac_chars_top_3gram": 0.014636250212788582,
"rps_doc_frac_chars_top_4gram": 0.024967709556221962,
"rps_doc_books_importance": -238.18028259277344,
"rps_doc_books_importance_length_correction": -238.18028259277344,
"rps_doc_openwebtext_importance": -135.1317138671875,
"rps_doc_openwebtext_importance_length_correction": -135.1317138671875,
"rps_doc_wikipedia_importance": -101.46391296386719,
"rps_doc_wikipedia_importance_length_correction": -101.46391296386719
},
"fasttext": {
"dclm": 0.17487651109695435,
"english": 0.7155348062515259,
"fineweb_edu_approx": 2.423024892807007,
"eai_general_math": 0.23823827505111694,
"eai_open_web_math": 0.15503960847854614,
"eai_web_code": 0.29446935653686523
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.22",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "6",
"label": "Indeterminate"
}
},
"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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,909,979,995,573,925,000 |
answersLogoWhite
0
Best Answer
9,800
User Avatar
Wiki User
11y ago
This answer is:
User Avatar
Add your answer:
Earn +20 pts
Q: What is 10 percent of 98 thousand dollars?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions
What is 10 percent of 98 dollars?
9.8 dollars
What is 40 percent of 98 dollars?
$39.20
What is 40 percent off of 98.00 dollars?
40% of 98 dollars is 39.20 dollars
What is 30 percent off 140 dollars?
$98
What is 8 percent of 98 dollars after 3.5 years?
27.44
What is 10 percent of 98?
9.8
What is 35 percent off 280 dollars?
35% of 280 dollars = 280*35/100 = 98 So 35% off of 280 dollars = 280-98 = 182 dollars
What is 92 dollars plus 7 percent tax?
92 x 1.07 = 98.44 Answer: 98 dollars 44 cents
How do i find out what is 15 percent off of 98 dollars?
100% minus 15% is 85% which is 0.85 then 98 x 0.85 = 83.30 so $83.30 Similarly $98 = 100% $9.80 = 10% $4.90 = 5% so 98.00 - 9.80 - 4.90 = 83.30
How do you get 98 to a percent?
.98 is 98 percent
What covers nearly 98 percent of Antarctica?
Fresh-water ice covers nearly 98 percent of the Antarctic continent, equal to 10 percent of the earth's surface.
How many pennies do you need to make 98 dollars?
nine thousand eight hundred 100 x 98 = 9,800 assuming pennies means cents
|
{
"url": "https://math.answers.com/Q/What_is_10_percent_of_98_thousand_dollars",
"source_domain": "math.answers.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "163625",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CQWJULM4G3WWOVK2OTJL3FUDS7BTRFMM",
"WARC-Concurrent-To": "<urn:uuid:e016e743-1115-4b67-8864-5043fd4b4e54>",
"WARC-Date": "2023-10-04T23:38:55Z",
"WARC-IP-Address": "146.75.32.203",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GZQXMQITINRBD7VPQLQDARJDXKNERIA4",
"WARC-Record-ID": "<urn:uuid:80e4b897-9d2f-4b34-9937-41675f4b9c43>",
"WARC-Target-URI": "https://math.answers.com/Q/What_is_10_percent_of_98_thousand_dollars",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:18d583a0-a46c-4be3-9501-10db50425fe3>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-221\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,
17,
18,
20,
21,
22,
34,
35,
41,
42,
54,
55,
65,
66,
74,
90,
102,
103,
120,
121,
134,
180,
201,
208,
230,
244,
248,
266,
267,
301,
302,
314,
315,
316,
350,
351,
358,
359,
360,
401,
402,
437,
438,
439,
475,
476,
480,
481,
482,
531,
532,
538,
539,
540,
566,
567,
571,
572,
573,
609,
610,
696,
697,
698,
737,
738,
784,
785,
786,
842,
843,
987,
988,
989,
1021,
1022,
1040,
1041,
1042,
1087,
1088,
1201,
1202,
1203,
1252,
1253
],
"line_end_idx": [
17,
18,
20,
21,
22,
34,
35,
41,
42,
54,
55,
65,
66,
74,
90,
102,
103,
120,
121,
134,
180,
201,
208,
230,
244,
248,
266,
267,
301,
302,
314,
315,
316,
350,
351,
358,
359,
360,
401,
402,
437,
438,
439,
475,
476,
480,
481,
482,
531,
532,
538,
539,
540,
566,
567,
571,
572,
573,
609,
610,
696,
697,
698,
737,
738,
784,
785,
786,
842,
843,
987,
988,
989,
1021,
1022,
1040,
1041,
1042,
1087,
1088,
1201,
1202,
1203,
1252,
1253,
1326
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1326,
"ccnet_original_nlines": 85,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.19590643048286438,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.002923979889601469,
"rps_doc_frac_lines_end_with_ellipsis": 0.01162790972739458,
"rps_doc_frac_no_alph_words": 0.5087719559669495,
"rps_doc_frac_unique_words": 0.4142259359359741,
"rps_doc_mean_word_length": 3.9832634925842285,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0.002923979889601469,
"rps_doc_unigram_entropy": 4.039504051208496,
"rps_doc_word_count": 239,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1081932783126831,
"rps_doc_frac_chars_dupe_6grams": 0.059873949736356735,
"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.06302520632743835,
"rps_doc_frac_chars_top_3gram": 0.05777310952544212,
"rps_doc_frac_chars_top_4gram": 0.047268908470869064,
"rps_doc_books_importance": -104.59717559814453,
"rps_doc_books_importance_length_correction": -104.59717559814453,
"rps_doc_openwebtext_importance": -49.93175506591797,
"rps_doc_openwebtext_importance_length_correction": -49.93175506591797,
"rps_doc_wikipedia_importance": -38.50053787231445,
"rps_doc_wikipedia_importance_length_correction": -38.499961853027344
},
"fasttext": {
"dclm": 0.9959052801132202,
"english": 0.9124560356140137,
"fineweb_edu_approx": 3.4055025577545166,
"eai_general_math": 0.056040700525045395,
"eai_open_web_math": 0.38869428634643555,
"eai_web_code": -0.000009299999874201603
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "513",
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,087,717,040,796,079,000 |
Click here to Skip to main content
Click here to Skip to main content
GraphDisplay: a Bezier based control for graphing functions and curves
By , 26 Mar 2010
Sign Up to vote
Add a reason or comment to your vote: x
Votes of 3 or less require a comment
Introduction
This article presents a control for the graphing of functions and parametric curves. The control will take a mathematically defined function and make a smooth representation of its graph using Bezier segments. Originally, this was part of some work on creating geometrical representations of curves using Bezier segments. As it evolved, I felt the need to verify that the geometries represented were the geometries I believed them to be. Grids, rules, ticks, and labels were all added for this purpose. In the end, a graphing control was produced that should prove useful in its own right.
Background
This article uses calculus and some simple linear algebra and a bit of trigonometry. The curves are graphed directly from the information on the function or curve and its derivatives. As I was unable to find derivations or formulas of that nature, I was required to recreate them from scratch. If any kind reader knows of somewhere where this derivation is done, please let me know and I will joyfully update this article.
How to Use
Functions
As this control graphs functions and curves, it would be best to start by defining exactly what definition of function or curve is being used. Put loosely, a function is a pair of methods, one that represents a value and one that represents a slope or derivative. The base class from which all functions derive is:
public abstract class FunctionBase
{
public abstract double Value(double x);
public abstract double Derivative(double x);
//... Other stuff
}
Graphing Functions
To graph a function, we call the AddFunction method of GraphDisplay.
public void AddFunction(FunctionBase f, double start,
double end, int segments, GraphStyle style)
For example:
GraphStyle curveStyle = new GraphStyle()
{Stroke = new SolidColorBrush(Colors.Red ) ,Thickness = 2};
Exp ex = new Exp() ;
gDisplay.AddFunction(exp, 1, 2, 5, curveStyle);
would use GraphDisplay gDisplay to graph the exponential function y= ex from x= 1 to x= 2 in the color red with a stroke of width 2 using five Bezier segments. However, we are not quite done. The control needs to know how to relate the values in the abstract mathematical space where the function resides.
gDisplay.YTop = 8 ;
gDisplay.YBottom 2;
gDisplay.XLeft =0;
gDisplay.XRight =3;
This gives a small bit of whitespace around the graphed exponential. We are not restricted in the number of functions that we can add to a GraphDisplay, but all of the functions use the same bounds.
Creating Functions through Inheritance
Functions can be created by directly inheriting from FunctionBase. For example, let's say we want the function corresponding to f(x) = sin(x).
public class Sin : Mathematics.BaseClasses.FunctionBase
{
public override double Value(double x)
{
return Math.Sin( x );
}
public override double Derivative(double x)
{
return Math.Cos(x);
}
}
Please note that this is a minimalist version of the Mathemaics.Functions.Sin class which corresponds to the family of functions of the form f(x) = ASin(nx + d).
Creating Functions Directly
We can also create functions through the Function class. The function class is as follows:
public sealed class Function:FunctionBase
{
private Func<double,> mF;
private Func<double,> mDF;
public Function( Func<double,double> f, Func<double,double> df)
{
mF = f;
mDF = df;
}
public override double Value(double x)
{
return mF(x);
}
public override double Derivative(double x)
{
return mDF(x);
}
}
We just pass in delegates for the function and its derivative. For example, we could again create f(x) = sin(x) via:
Function f = new Function(x=> Math.Sin(x), x=> Math.Cos(x));
Overriding is probably preferable for creating functions while the Function class works dynamically at runtime.
Combining Functions
Functions can also be combined in various ways. It is important to remember that instances of classes that derive from FunctionBase are Calculus like functions, so the chain rule needs to be obeyed. Fortunately, there are several static methods in FunctionBase for combining functions. To compose y= 2x and y= sin(x) and get y=sin(2x), we could use the following code:
Function twoX = new Function (x=>2*x,x=>2);
Sin sin = new Sin();
Function composition = Function.Compose(sin ,twoX);
All of the complexity is hidden behind the scenes.
public static Function Compose(FunctionBase outerFunction, FunctionBase innerFunction)
{
//Change of variables for more readable code
FunctionBase f = outerFunction;
FunctionBase g = innerFunction;
return new Function(
x => f.Value(g.Value(x)), //Composition f(g(x))
x => f.Derivative(g.Value(x)) * g.Derivative(x)
//Chain Rule f'(g(x))*g'(x)
);
}
There are also static methods for the sum, difference, product, and quotient of functions. These functions can both be called directly or used via operators. With the same sin and twoX, f(x) = sin(x) + 2x can be done via:
Function plus = Function.Sum(sin, twoX);
Function plus = sin + twoX ;
which calls:
public static Function Sum(FunctionBase f, FunctionBase g)
{
return new Function(x => f.Value(x) + g.Value(x),
x => f.Derivative(x) + g.Derivative(x)
);
}
f(x) = sin(x) - 2x can be made via:
Function minus = Function.Difference(sin, twoX);
Function minus = sin - twoX ;
which calls:
public static Function Difference(FunctionBase f, FunctionBase g)
{
return new Function(x => f.Value(x) - g.Value(x),
x => f.Derivative(x) - g.Derivative(x)
);
}
f(x) = 2xsin(x) can be made via:
Function times = Function.Product( twoX ,sin);
Function times = twoX * sin;
which calls:
public static Function Product(FunctionBase f, FunctionBase g)
{
return new Function(x => f.Value(x) * g.Value(x),
x => f.Derivative(x) * g.Value(x) +
g.Derivative(x) * f.Value(x) //Chain Rule f'(x)g(x) + f(x)g'(x)
);
}
f(x) = sin(x)/2x can be made via:
Function divides = Function.Product( sin , twoX);
Function divides = sin /twoX;
which calls:
public static Function Quotient(FunctionBase numerator, FunctionBase denominator)
{
//Change of variables for more readable code
FunctionBase f = numerator;
FunctionBase g = denominator;
return new Function(x => f.Value(x) / g.Value(x),
//Chain rule (f'(x)g(x) - f(x)g'(x))/g(x)^2
x => (f.Derivative(x) * g.Value(x) - f.Value(x) *
g.Derivative(x)) / Math.Pow(g.Value(x), 2)
);
}
I have belabored these transformations because they are important. The main reason for creating FunctionBase is to have an entity that will naturally obey the chain rule.
Function Sample
As a sample for the graphing of functions, we have the DampedSinusoid.
public class DampedSinusoid : FunctionBase
{
public double A { get; private set; }
public double Gamma { get; private set; }
public double Omega { get; private set; }
public double Phi { get; private set; }
public DampedSinusoid(double a, double gamma, double omega, double phi)
{
A = a; Gamma = gamma; Omega = omega; Phi = phi;
}
public override double Value(double x)
{
return A * Math.Pow(Math.E, -Gamma * x) * Math.Cos(Omega * x + Phi);
}
public override double Derivative(double x)
{
return A * Math.Pow(Math.E, -Gamma * x) * Math.Cos(Omega * x + Phi) * (-Gamma)
- A * Math.Pow(Math.E, -Gamma * x) * Math.Sin(Omega * x + Phi) * Omega;
}
}
The sample shows two damped sinusoids and their sum. I might note that all of the values used in this class are set in the constructor and thereafter unalterable. I would strongly recommend following this policy.
Curves
A curve is very similar to a function except that there are four methods instead of two.
public abstract class CurveBase
{
public abstract Double X(double t);
public abstract Double Y(double t);
public abstract Double Dx(double t);
public abstract Double Dy(double t);
... other stuff
}
The is also a CyclicCurveBase. This should be used in cases where we have a closed curve. In general, we should not expect an end user to know the period of a function.
public abstract class CyclicCurveBase:CurveBase
{
public abstract double CycleStart {get;}
public abstract double CycleEnd{ get;}
}
Curves can be added via the AddCurve and AddCyclicCurve methods.
public void AddCurve(CurveBase c, double start, double end,
int segments, GraphStyle style){...}
public void AddCyclicCurve(CyclicCurveBase c, int segments, GraphStyle style){...}
Curve Class Hierarchy
At this point, looking at the class hierarchy for the descendents of CurveBase should be helpful.
In order to create a new curve to graph, we should either inherit from one of the abstract base classes (blue) or compose using the compositional classes (purple). This is one of those times when being able to employ multiple inheritance would be nice. For example, I would like to be able to inherit the cyclic properties from some cyclic base class and the polar properties from a polar base. The way things are implemented involves some regrettable duplication. The classes were designed for expansion without significant changes to the graphing control. For example, if bipolar coordinates were added to the mix, no changes would need to be made to the graphing control. We could reasonably add other types of curves such as bipolar, elliptic, or hyperbolic in the future. In that case, we should create four classes for each coordinate system, just as we have PolarCurveBase, PolarCurve, CyclicPolarCurveBase, and CyclicPolarCurve.
Polar Curves and their Constructor Order
The PolarCurve class can be used to construct a curve if we have a function r= f(Θ)
public sealed class PolarCurve:PolarCurveBase
{
private Func<double, double> mR;
private Func<double, double> mDr;
public PolarCurve(Function r)
{
mR = r.Value;
mDr = r.Derivative;
}
public override double R(double theta)
{
return mR(theta);
}
public override double Dr(double theta)
{
return mDr(theta);
}
}
The thing to note is that the graphing control does not use r or Θ coordinates. This is handled by the base class.
public abstract class PolarCurveBase:CurveBase
{
public abstract double R(double theta);
public abstract double Dr(double theta);
private Curve mC;
static Cos sCos = new Cos();
static Sin sSin = new Sin();
protected PolarCurveBase() {
Function r = new Function(R,Dr);
mC = new Curve( r * sCos , r * sSin );
}
public override double X(double t)
{
return mC.X(t);
}
public override double Y(double t)
{
return mC.Y(t);
}
public override double Dx(double t)
{
return mC.Dx(t);
}
public override double Dy(double t)
{
return mC.Dy(t);
}
}
The interesting thing is the order in which the two constructors are called. PolarCurveBase's constructor is called before PolarCurve's.
This means that the curve transforming the function is created from overridden methods encapsulating the function before the function itself is introduced. The sample for polar curves is the Rose curve.
The Mathematics
Bezier Curves
Bezier curves are extremely useful for the drawing of smooth curves, so a little motivation might be of value. Let's assume we have a curve that we are interested in creating a representation of. It starts at Point a = (ax, ay) and goes to point b = (bx, by). We could represent the curve between them by a pair of functions. Bx(t) where Bx(0)=ax and Bx(1)=bx along with By(t) where By(0)=ay and By(1)=by.
Linear Bezier Curves
The simplest functions we could use for Bx and By (B is for Bezier) would be straight lines of the form f(x) = Ax + B, subject to the initial constraints. (A different equivalent formulation is usually used, but that adds complexity we don't need yet.) The important thing to notice is that we need 4 numbers to uniquely determine this line, two for Bx(t) and two for By(t). Fortunately, these are available in the x and y coordinates of the endpoints. With a little reorganization and notational change, this could be transformed to the customary definition of a Linear Bezier Curve.
B(t) = P0 + t(P1 - P0) where P0 is the starting point and P1 is the end point.
A line is not that good of an approximation to a curve, but it's worth keeping in mind that using it, we can use a lot of Bezier segments next to one another and that in the process of being displayed on the screen, our Bezier curves are converted back into line segments. The Geometry base class even has a GetFlattenedPathGeometry method to do just that. WPF supports this in spirit with the LineSegment class, if not in name.
Quadratic Bezier Curves
We can make a better approximation to our curve using a Quadratic (of the form f(x) = Ax2 + Bx + C) instead of a linear function. The thing to notice is that now we will need 6 numbers to define our segment. The obvious candidate for these numbers is the slope at the initial and final points. Put in vector form, we have:
B(t) = P0 (1-t)<sup>2</sup> + P1 2(1-t)t + P2t<sup>2</sup>
which corresponds to:
B<sub>x</sub>(t) = P0<sub>x</sub>(1-t)<sup>2</sup> + P1<sub>x</sub> 2(1-t)t + P2<sub>x</sub>t<sup>2</sup>
B<sub>y</sub>(t) = P0<sub>y</sub>(1-t)<sup>2</sup> + P1<sub>y</sub> 2(1-t)t + P2<sub>y</sub>t<sup>2</sup>
You might ask why we need to use this format instead of the simpler Ax2 + Bx + C. First, it is obvious that we can do this. Just multiply everything out and collect the terms to get A, B, and C. The benefit of this comes when we evaluate the conditions at the endpoints. If we start at Point a = (ax, ay) and go to point b = (bx, by), then we can immediately get P0x = ax and P0y = ay by evaluating at t=0. We get P2x = bx and P2y = by by evaluating at t=0. We then have the simpler problem of finding P1x and P1y. In WPF, Quadratic Bezier segments are supported by QuadraticBezierSegment. The constructor for QuadraticBezierSegment has a space for a P1 and a P2 but not a P0. At first, this might make it seem as if it only takes 4 rather than 6 numbers to define a Quadratic Bezier segment. This has much more to do with memory management than mathematics. If you have two consecutive segments in a path, P2 for the first acts as P0 for the second. Microsoft both saves memory and removes the chance for us to enter a wrong value by doing this. It does not change the dynamics of finding the values of P1. If we want to think in the Microsoft way, we must lose the two conditions at the initial point along with the requirement to find P0.
Cubic Bezier Curves
These are the type of segments that we are most likely to use. Notably, it is represented by a class named BezierSegment rather than CubicBezierSegment. These are also the segments you use in Adobe Illustrator with the pen tool. In vector form, it looks like:
B(t) = P0 (1-t)<sup>3</sup> + P1 3(1-t)<sup>2</sup> t + P2 3(1-t)t<sup>2</sup> + P3 t<sup>3</sup>
which corresponds to:
B<sub>x</sub>(t) = P0<sub>x</sub> (1-t)<sup>3</sup> + P1<sub>x</sub> 3(1-t)<sup>2</sup> t + P2<sub>x</sub> 3(1-t)t<sup>2</sup> + P3<sub>x</sub> t<sup>3</sup>
B<sub>y</sub>(t) = P0<sub>y</sub> (1-t)<sup>3</sup> + P1<sub>y</sub> 3(1-t)<sup>2</sup> t + P2<sub>y</sub> 3(1-t)t<sup>2</sup> + P3<sub>y</sub> t<sup>3</sup>
One of the nice things about the vector form is that it makes certain common transformations of Bezier segments easy. For instance, if we want to move the Bezier curve by 5 in the positive x direction, all we would need to do is add 5 to the x components of P0, P1, P2, and P3. In fact, any translation, reflection, or other transformation that can be accomplished by matrix multiplication has this property. Also, it means that when drawing pictures of Bezier segments, we lose no generality by rotating them, so they are easier to draw.
There is a very important relationship between the Ps and the derivatives at t =0 and t=1. It is just straightforward algebra, but unpleasant enough that I would advise using Mathematica or something similar rather than pencil and paper.
B'<sub>y</sub>(0) /B'<sub>x</sub>(0) = (P0<sub>y</sub> - P1<sub>y</sub>) /(P0<sub>x</sub> - P1<sub>x</sub>)
B'<sub>y</sub>(1) /B'<sub>x</sub>(1) = (P2<sub>y</sub> - P3<sub>y</sub>) /(P2<sub>x</sub> - P3<sub>x</sub>)
This means that the tangent line to the Bezier curve at Point P0 intersects P1, and that the tangent line at P3 intersects P2. So, if the only conditions that we have are the endpoints and the slopes at the ends, there is a large collection of possible P1s. Similar reasoning applies for P2.
Furthermore, let's say we wanted to choose a P1 such that it has a specified slope at P0. We could pick any point that is both on the tangent line and in the direction of P3, and it would have the correct slope at P0. For example, we could have the following possibilities:
In the one called leaning, the curve extends further to the right than P3, P1 would have needed to be significantly further out for it to be more noticeable. As we can see, we can get significantly different Bezier segments that have the same endpoints and slopes at their endpoints.
By the same reasoning as with Quadratic curves, we need 8 numbers to define the segment, four of which are provided by the initial and final points.
Functions
Now that the preliminaries are out of the way, it's time to graph functions. I am assuming that f(x) and its derivative f'(x) also exist for the range that is being graphed. This type of function was chosen as the graphing sweet spot. Giving up the first derivative makes things significantly harder, and derivatives higher than the first add a lot less than we would like.
B<sub>x</sub>(t) = P0<sub>x</sub> (1-t)<sup>3</sup> + P1<sub>x</sub> 3(1-t)<sup>2</sup> t + P2<sub>x</sub> 3(1-t)t<sup>2</sup> + P3<sub>x</sub> t<sup>3</sup>
B<sub>y</sub>(t) = P0<sub>y</sub> (1-t)<sup>3</sup> + P1<sub>y</sub> 3(1-t)<sup>2</sup> t + P2<sub>y</sub> 3(1-t)t<sup>2</sup> + P3<sub>y</sub> t<sup>3</sup>
a = P0<sub>x</sub>
f(a) = P0<sub>y</sub>
b = P3<sub>x</sub>
f(b) = P3<sub>y</sub>
f'(a) = (P0<sub>y</sub> - P1<sub>y</sub>) /(P0<sub>x</sub> - P1<sub>x</sub>)
f'(b) = (P2<sub>y</sub> - P3<sub>y</sub>) /(P2<sub>x</sub> - P3<sub>x</sub>)
After a bit of simplification, we get:
P1<sub>y</sub> -f'(a) P1<sub>x</sub> = f(a) - af'(a)
<sub>y</sub> -f'(b) P2<sub>x</sub> = f(b) - bf'(b)
It looks a bit better, but we still have two equations and four unknowns, and as we have already seen, this leaves a lot of possible segments. So we need more constraints. We have two, although they are not expressed in the form of equalities. First, we are graphing a function. By definition, that means that for every x, there must be exactly one f(x). That makes Bezier segments that loop and lean unacceptable representations of the function. Also, we expect that as a and b get closer together, the Bezier segment will match its portion of the curve more closely, just as it would if we were approximating the curve with line segments.
To go further, we need more conditions that are in the form of equations. Let's consider the following two:
P1<sub>x</sub> =( 2 a + b)/3
P2<sub>x</sub> =( a + 2 b)/3
We will later see that these are excellent choices for conditions, but it is worth noting that they are not the only choices we could have made, and this choice puts the curve in the normal category. It also matches with the illustrator pen tool rule of thumb, that control handles should be about 1/3 of the way between nodes. With these conditions, we get:
P1<sub>y</sub> =( 3 f(a) - a f'(a) + b f'(a))/3
P2<sub>y</sub> =( 3 f(b) - a f'(b) + b f'(b))/3
This is exactly the sort of result we would hope for. P1y and P2y are expressed as linear combinations of the conditions at the endpoints. There is no denominator that could possibly go to zero. One of the major reasons that Quadratic Bezier segments are not used is that there is a denominator that can go to zero, which causes artifacts in the graph. So, in summary, we have the following result:
B<sub>x</sub>(t) = P0<sub>x</sub> (1-t)<sup>3</sup> + P1<sub>x</sub> 3(1-t)<sup>2</sup> t + P2<sub>x</sub> 3(1-t)t<sup>2</sup> + P3<sub>x</sub> t<sup>3</sup>
B<sub>y</sub>(t) = P0<sub>y</sub> (1-t)<sup>3</sup> + P1<sub>y</sub> 3(1-t)<sup>2</sup> t + P2<sub>y</sub> 3(1-t)t<sup>2</sup> + P3<sub>y</sub> t<sup>3</sup>
P0<sub>x</sub> = a , P0<sub>y</sub> = f(a)
P1<sub>x</sub> = ( 2 a + b)/3 , P1<sub>y</sub> =( 3 f(a) - a f'(a) + b f'(a))/3
P2<sub>x</sub> =( a + 2 b)/3 , P2<sub>y</sub> =( 3 f(b) - a f'(b) + b f'(b))/3
P3<sub>x</sub> = b , P3<sub>y</sub> = f(b)
Parametric Curves
For a parametric curve, we have a curve defined by two functions: x = x(t) and y=y(t). By long standing tradition, t is used for the parameter (t is a good letter for time), It should be remembered that this t is not the same t as in Bx(t) and By(t). For a curve going from t = a to t= b, and functions x(t) and y(t), we have:
B<sub>x</sub>(t) = P0<sub>x</sub> (1-t)<sup>3</sup> + P1<sub>x</sub> 3(1-t)<sup>2</sup> t + P2<sub>x</sub> 3(1-t)t<sup>2</sup> + P3<sub>x</sub> t<sup>3</sup>
B<sub>y</sub>(t) = P0<sub>y</sub> (1-t)<sup>3</sup> + P1<sub>y</sub> 3(1-t)<sup>2</sup> t + P2<sub>y</sub> 3(1-t)t<sup>2</sup> + P3<sub>y</sub> t<sup>3</sup>
x(a) = P0<sub>x</sub>
y(a) = P0<sub>y</sub>
x(b) = P3<sub>x</sub>
y(b) = P3<sub>y</sub>
y'(a)/x'(a) = (P0<sub>y</sub> - P1<sub>y</sub>) /(P0<sub>x</sub> - P1<sub>x</sub>)
y'(b)/x'(b) = (P0<sub>y</sub> - P1<sub>y</sub>) /(P0<sub>x</sub> - P1<sub>x</sub>)
Again, we need more conditions. Loops and points can occur in parametric curves such as the Lissajous curve, but should not be added as artifacts of our algorithm. One of the implications of this is that P1 cannot be entirely determined from the behavior at P0. To see this, consider bringing b closer and closer to a. Eventually, we would get a pointed looped or leaning curve for the Bezier segment.
We could consider the same idea we used while graphing functions. Since the argument for P1 is completely analogous to the one for P2, the discussion will focus solely on P1. The difference is that instead of moving horizontally 1/3 of the x distance, we could put P1 on the line that intersects the segment connecting P0 and P3. In doing this, we define a triangle and so are able to find P1.
First, we know the angle α. The slopes of the lines between P0 and P3 is known since P0 and P3 are known. The slope of the line between P0 and P1 is just y'(a)/x'(a), which again is known. Via a well known formula tan(α) = (mb - ms)/ (1+ mb ms), where mb is the bigger slope and ms is the smaller slope. Due to the law of Sines, we know that the length of the segment from P0 to P1 is 1/3 the distance between P0 and P3 divided by the sine of pi/2 - α.
Once we have the length between P0 and P1, call it h, we can get P1.
P1<sub>x</sub> =P0<sub>x</sub> + h cos(μ) where μ is the angle made by the tangent line at P0 with the X axis
P1<sub>y</sub> =P0<sub>y</sub> + h sin(μ)
Since we have dx and dy separately, we can simplify this a bit as cos(μ) = dx/(dx2 + dyx2)1/2 and sin(μ) = dy/(dx2 + dyx2)1/2. This gives us a way to find P1. It is not nearly as good a solution as was found for the functional case, but it provides a procedure that can be used to plot curves.
How it Works
Coordinates
Up until now, coordinates have been taken for granted. Functions and curves have been defined in an abstract space of numbers, but they must be displayed on the screen in terms of screen coordinates. This involves changes in translation, scale, and orientation. On the screen, we need to graph a TransformedFunction rather than the original FunctionBase.
public class TransformedFunction
{
private FunctionBase mF;
private FunctionBase mXTrans;
private FunctionBase mYTrans;
public TransformedFunction(FunctionBase f,
FunctionBase xTrans, FunctionBase yTrans)
{
mF = f; mXTrans = xTrans; mYTrans = yTrans;
}
public double Input(double x)
{
return mXTrans.Value(x);
}
public double Value(double x)
{
return mYTrans.Value(mF.Value(x));
}
public double Derivative(double x)
{
return (mYTrans.Derivative(mYTrans.Value(x)) /
mXTrans.Derivative(x)) * mF.Derivative(x);//Chain Rule
}
}
The only things to note are that all three items must be transformed, the input (x), the output (y), and the derivative (dy/dx). Also, we should remember that the chain rule is not optional. The interesting bits are the two FunctionBases that transform the x and y coordinates.
mXTransform = new Function(x => (DisplayCanvas.ActualWidth /
(XRight - XLeft)) * (x - XLeft), x => DisplayCanvas.ActualWidth / (XRight - XLeft));
mYTransform = new Function(y => (DisplayCanvas.ActualHeight / (YBottom - YTop)) *
(y - YTop), y => DisplayCanvas.ActualHeight / (YBottom - YTop));
This takes care of all three aspects including the fact that in our functional space, increasing y goes up, while on the canvas, it goes down. This is not the only function we could use. A slightly different expression would give a logarithmic scaling. There is very little difference in this respect between curves and functions, so I will omit the discussion.
Functions
When graphing a function, we just add it to the GraphDisplay:
public void AddFunction(FunctionBase f, double start, double end,
int segments, GraphStyle style)
{
Path p = new Path();
TransformedFunction tf =
new TransformedFunction(f, mXTransform, mYTransform);
p.Data = BezierGeometry(tf, start, end, segments);
p.Fill = style.Fill;
p.Stroke = style.Stroke;
p.StrokeThickness = style.Thickness;
DisplayCanvas.Children.Add(p);
}
This utilizes the BezierGeometry method to produce the geometry.
private PathGeometry BezierGeometry(TransformedFunction tf,
double start, double end, int segments)
{
PathFigure pF = new PathFigure();
pF.StartPoint = new Point(tf.Input(start),tf.Value(start));
pF.IsClosed = false;
Func<double, double> f = tf.Value; //for readability
Func<double, double> df = tf.Derivative; //for readability
for (int i = 0; i < segments; i++)
{
double aOrig = i * (end - start) / segments + start;
double a = tf.Input(aOrig);
double bOrig = (i + 1) * (end - start) / segments + start;
double b = tf.Input(bOrig);
Point P1 = new Point((2 * a + b) / 3,
(3 * f(aOrig) - a * df(aOrig) + b * df(aOrig)) / 3);
Point P2 = new Point((2 * b + a) / 3,
(3 * f(bOrig) + a * df(bOrig) - b * df(bOrig)) / 3);
Point P3 = new Point(b, f(bOrig));
BezierSegment bs = new BezierSegment(P1, P2, P3, true);
pF.Segments.Add(bs);
}
PathGeometry pGeo = new PathGeometry();
pGeo.Figures.Add(pF);
return pGeo;
}
Curves
The code for adding a curve or cyclic curve is virtually identical.
public void AddCurve(CurveBase c, double start,
double end, int segments, GraphStyle style)
{
Path p = new Path();
TransformedCurve tf = new TransformedCurve(c, mXTransform, mYTransform);
p.Data = BezierGeometry(tf, start, end, segments);
p.Fill = style.Fill;
p.Stroke = style.Stroke;
p.StrokeThickness = style.Thickness;
DisplayCanvas.Children.Add(p);
}
The only difference lies in the BezierGeometry method. The algorithm described above is used for generating the Bezier segments. However, the algorithm for generating the curve's geometry is not as stable as in the functional case. Rapid changes of direction are not handled well. For example, Lissajous figures can have spikes in them. These are handled less than optimally.
For this reason, there are two distinct algorithms being used in calculating the Bezier segments: BezierBuilder and AjustingBezierBuilder.
private PathGeometry BezierGeometry(TransformedCurve tc,
double start, double end, int segments)
{
PathFigure pF = new PathFigure();
pF.StartPoint = new Point(tc.X(start), tc.Y(start));
pF.IsClosed = false;
Stack<double> boundaries = new Stack<double>();
for (int i = segments; i >= 0; i--)
{
boundaries.Push(i * (end - start) / segments + start);
}
for (int i = 0; i < segments; i++)
{
double a = boundaries.Pop();
double b = boundaries.Peek();
AjustingBezierBuilder abb = new AjustingBezierBuilder(tc, a, b);
abb.AddTo( pF);
}
PathGeometry pGeo = new PathGeometry();
pGeo.Figures.Add(pF);
return pGeo;
}
The BezierGeometry method first creates a Stack of boundaries to define the start and end points for calculating the Bezier segments. This replaces the loop used in the functional case. This step of creating the stack may appear odd, but it was chosen to be able to harmonize with several different optimization strategies that in the end did not make it to this edition of the graphing control. Under normal circumstances, the results of AjustingBezierBuilder will be the same as for when BezierBuilder will be used for the segment. Normal circumstances means that the distance between the starting and ending points is less than the distance from the points to their nearby control points. This is just following the procedure described in the mathematical area.
• The distance between the endpoints is calculated.
• Check if endpoints are close enough to approximate with a straight line.
• The slope of the lines to the control points is determined from the derivatives of the curve at the endpoints.
• The slope of the line connecting the endpoints of the segment is determined.
• The angles between the slope at the endpoints and the endpoint connecting lines is determined from the slopes.
• The length of the segments connecting the endpoints to the control points is determined via the law of Sines.
• The control points are determined by moving along the line connecting the endpoints to the control points, the distance to the control points.
• BezierSegment is created from the control points and the endpoints.
public BezierBuilder(CurveBase c, double a, double b)
{
A = a;
B = b;
Point InitialPoint = new Point(c.X(a), c.Y(a));
FinalPoint = new Point(c.X(b), c.Y(b));
//The distance between the endpoints is calculated.
double distance = Geometry.Distance(InitialPoint, FinalPoint) ;
//Check if endpoints are close enough to approximate with a straight line.
if (distance < tolerance) //optimization
{
mBs = new LineSegment(FinalPoint, true);
IsStable = true;
}
else
{
//The slope of the lines to the control points is determined
//from the derivatives of the curve at the enpoints.
double curveSlopeA = c.Slope(a); ///dy(a) / dx(a);
double curveSlopeB = c.Slope(b); ///dy(b) / dx(b);
//The slope of the line connecting
// the endpoints of the segment is detemined.
double slope = Geometry.Slope(InitialPoint, FinalPoint);
//The Angles between the slope at the endpoints
//and the endpoint connecting lines is determined from the slopes.
double angleA = Geometry.AngleBetweenLines(slope, curveSlopeA);
double angleB = Geometry.AngleBetweenLines(slope, curveSlopeB);
//The length of the segments connecting the Endpoints
//to the control points is determined via the law of sines
Double distanceIn = distance / 3; //our extra condition
Double lengthAlongLineA = distanceIn /
(Math.Sin(Math.PI / 2 - angleA)); //Law of Sines
Double lengthAlongLineB = distanceIn /
(Math.Sin(Math.PI / 2 - angleB)); //Law of Sines
//The Control points are determined by moving along the line
//conecting the enpoints to the control points
//the distance to the control points.
Point controlPointA = Geometry.AtDistanceFromPointOnLine(InitialPoint,
c.Dx(a), c.Dy(a), lengthAlongLineA);
Point controlPointB = Geometry.AtDistanceFromPointOnLine(FinalPoint,
-c.Dx(b), -c.Dy(b), lengthAlongLineB);
//The BezierSegment is created from the control points and the endpoints.
mBs = new BezierSegment(controlPointA, controlPointB, FinalPoint, true);
//Mark if Bezier segment is Stable
IsStable = distance > lengthAlongLineA &&
distance > lengthAlongLineB;
PointDistance = Geometry.Distance(InitialPoint, FinalPoint);
}
}
This works reasonably well. However, it handled spikes less well than could be hoped for. To handle this situation, AdjustingBezierBuilder is used.
public AjustingBezierBuilder(CurveBase c, double a, double b)
{
BezierBuilder bb = new BezierBuilder(c,a,b);
if ( bb.IsStable) // No Need to Adjust
{
mSegments = new List<pathsegment>();
mSegments.Add(bb.Segment);
}else{
LinkedList<bezierbuilder> builders = new LinkedList<bezierbuilder>();
LinkedListNode<bezierbuilder> current=
builders.AddFirst(new BezierBuilder(c, a, (a + b) / 2));
builders.AddAfter(current, new BezierBuilder(c, (a + b) / 2,b ));
while (current != null )
{
if (current.Value.IsStable) //No Problems
{
current = current.Next;
}
else // There is a problem with the current Bezier builder
{
//Slices BezierBuilder into two samller Bezier builders
builders.AddAfter(current, new BezierBuilder(c,
(current.Value.A + current.Value.B) / 2, current.Value.B));
LinkedListNode<bezierbuilder> newcurrent =
builders.AddAfter(current,
new BezierBuilder(c, current.Value.A,
(current.Value.A + current.Value.B) / 2));
builders.Remove(current );
current = newcurrent;
}
}
mSegments = (from bld in builders select bld.Segment).ToList();
}
}
When BezierBuilder is normal, AdjustingBezierBuilder defaults to the BezierBuilder's segment. Otherwise, AdjustingBezierBuilder splits the segment that the Bezier segment is made from into two. Each of those segments defines a new BezierBuilder which is checked. If that too is unstable, then it is split again. This process continues until all of the BezierBuilder objects are marked as stable. We know that this process will stop since, once the distance between the endpoints goes below the static value of the Tolerance in the BezierBuilder, the process will stop. It should be noted that each distinct BezierBuilder is only created and tested once. If a BezierBuilder is not found to be stable, it is replaced by two new ones, or equivalently, two new ones are added after the original and then the original is removed. A linked-list was employed to make this more efficient.
Conclusion
I hope that this graphing control serves you well. This is something that would have been significantly harder to do just a few years ago. It is also just a preliminary to a new set of functional geometries that I hope to have ready soon.
License
This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)
About the Author
KenJohnson
Software Developer (Senior)
United States United States
Written software for what seems like forever. I'm currenly infatuated with WPF. Hopefully my affections are returned.
MCPD 2.0 Framework
Enterprise Applications
Windows Applications
Web Applications
MCTS
Windows Presentation Foundation
Comments and Discussions
QuestionSecond derivativememberBaccalore4-Oct-13 3:46
GeneralMy vote of 5memberabat8-Jul-12 3:44
QuestionNovel curve generation project 1memberMember 873609322-Mar-12 11:20
QuestionSmall ProblemmemberDoug Wyrembek20-Aug-11 6:17
GeneralMy vote of 5membertoantvo15-Aug-11 6:04
GeneralMy vote of 5memberFilip D'haene23-Jun-11 6:47
QuestionGreat piece of work beautifully presentedmemberDeclan Brennan21-Jun-11 22:26
GeneralMy Vote of 5memberAli BaderEddin6-Apr-10 14:46
GeneralExcellent.mvpLuc Pattyn27-Mar-10 5:07
GeneralRe: Excellent.memberKenJohnson27-Mar-10 15:47
General General News News Suggestion Suggestion Question Question Bug Bug Answer Answer Joke Joke Rant Rant Admin Admin
| Advertise | Privacy | Mobile
Web02 | 2.7.131206.1 | Last Updated 27 Mar 2010
Article Copyright 2010 by KenJohnson
Everything else Copyright © CodeProject, 1999-2013
Terms of Use
Layout: fixed | fluid
|
{
"url": "http://www.codeproject.com/Articles/58280/GraphDisplay-a-Bezier-based-control-for-graphing-f",
"source_domain": "www.codeproject.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "125606",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FVT5VWBUX5SJTRDNACVSAC7NHPV52JJC",
"WARC-Concurrent-To": "<urn:uuid:956302eb-416a-4121-ab58-571de9ac4632>",
"WARC-Date": "2013-12-07T21:01:11Z",
"WARC-IP-Address": "65.39.148.34",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:A24XBJYFMEYH6CIDBI6V3UEVIKYHF5U7",
"WARC-Record-ID": "<urn:uuid:89d7f9c2-b3df-42a5-becb-3843acf4829c>",
"WARC-Target-URI": "http://www.codeproject.com/Articles/58280/GraphDisplay-a-Bezier-based-control-for-graphing-f",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:edbb8100-f2b5-4aea-9633-9a4fc8deb27e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
35,
70,
71,
142,
143,
160,
176,
216,
253,
254,
267,
268,
858,
859,
870,
871,
1294,
1295,
1306,
1307,
1317,
1318,
1633,
1634,
1669,
1671,
1715,
1764,
1769,
1791,
1793,
1794,
1813,
1814,
1883,
1884,
1939,
1997,
1998,
2011,
2012,
2053,
2125,
2141,
2162,
2210,
2211,
2517,
2518,
2538,
2558,
2577,
2597,
2598,
2797,
2798,
2837,
2838,
2981,
2982,
3038,
3040,
3083,
3089,
3120,
3126,
3127,
3175,
3181,
3209,
3215,
3217,
3218,
3380,
3381,
3409,
3410,
3501,
3502,
3545,
3547,
3577,
3608,
3609,
3677,
3681,
3695,
3711,
3715,
3716,
3759,
3765,
3787,
3793,
3794,
3842,
3848,
3871,
3877,
3879,
3880,
3997,
3998,
4059,
4060,
4172,
4173,
4193,
4194,
4563,
4564,
4608,
4629,
4681,
4682,
4733,
4734,
4821,
4823,
4872,
4908,
4944,
4969,
5026,
5083,
5120,
5131,
5133,
5134,
5356,
5357,
5399,
5429,
5430,
5443,
5444,
5503,
5505,
5559,
5606,
5617,
5619,
5620,
5656,
5657,
5707,
5738,
5739,
5752,
5753,
5819,
5821,
5875,
5922,
5933,
5935,
5936,
5969,
5970,
6018,
6049,
6050,
6063,
6064,
6127,
6129,
6183,
6227,
6302,
6312,
6314,
6315,
6349,
6350,
6401,
6432,
6433,
6446,
6447,
6529,
6531,
6580,
6612,
6646,
6700,
6752,
6810,
6867,
6877,
6879,
6880,
7051,
7052,
7068,
7069,
7140,
7141,
7184,
7186,
7228,
7274,
7320,
7364,
7440,
7446,
7502,
7508,
7509,
7552,
7558,
7635,
7641,
7642,
7690,
7696,
7783,
7870,
7876,
7877,
7879,
7880,
8093,
8094,
8101,
8102,
8191,
8192,
8225,
8227,
8266,
8305,
8345,
8385,
8389,
8408,
8410,
8411,
8580,
8581,
8630,
8632,
8675,
8716,
8718,
8719,
8784,
8785,
8846,
8904,
8987,
8988,
9010,
9011,
9109,
9110,
10047,
10048,
10089,
10090,
10174,
10175,
10224,
10226,
10263,
10301,
10302,
10336,
10342,
10364,
10392,
10398,
10399,
10442,
10448,
10474,
10480,
10481,
10525,
10531,
10558,
10564,
10566,
10567,
10682,
10683,
10731,
10733,
10779,
10826,
10850,
10853,
10887,
10921,
10922,
10956,
10998,
11047,
11054,
11055,
11095,
11102,
11127,
11134,
11135,
11175,
11182,
11207,
11214,
11215,
11256,
11263,
11289,
11296,
11297,
11338,
11345,
11371,
11378,
11380,
11381,
11518,
11519,
11722,
11723,
11739,
11740,
11754,
11755,
12161,
12162,
12183,
12184,
12769,
12770,
12849,
12850,
13279,
13280,
13304,
13305,
13628,
13629,
13688,
13689,
13711,
13712,
13818,
13924,
13925,
15167,
15168,
15188,
15189,
15449,
15450,
15548,
15549,
15571,
15572,
15730,
15888,
15889,
16428,
16429,
16667,
16668,
16776,
16884,
16885,
17177,
17178,
17452,
17453,
17737,
17738,
17887,
17888,
17898,
17899,
18273,
18274,
18432,
18590,
18609,
18631,
18650,
18672,
18749,
18826,
18827,
18866,
18867,
18920,
18971,
18972,
19613,
19614,
19722,
19723,
19752,
19782,
19783,
20142,
20143,
20191,
20240,
20241,
20640,
20641,
20799,
20957,
21000,
21080,
21159,
21202,
21203,
21221,
21222,
21549,
21550,
21708,
21866,
21888,
21910,
21932,
21954,
22037,
22120,
22121,
22523,
22524,
22918,
22919,
23372,
23373,
23442,
23443,
23553,
23595,
23596,
23890,
23891,
23904,
23905,
23917,
23918,
24273,
24274,
24308,
24310,
24338,
24371,
24404,
24405,
24453,
24506,
24511,
24562,
24567,
24568,
24601,
24606,
24638,
24643,
24644,
24677,
24682,
24724,
24729,
24730,
24768,
24773,
24828,
24898,
24903,
24905,
24906,
25184,
25185,
25247,
25335,
25418,
25487,
25488,
25850,
25851,
25861,
25862,
25924,
25925,
25992,
26048,
26050,
26075,
26105,
26166,
26221,
26246,
26275,
26316,
26351,
26353,
26354,
26419,
26420,
26481,
26529,
26531,
26569,
26633,
26658,
26721,
26784,
26823,
26829,
26890,
26926,
26993,
27029,
27076,
27140,
27187,
27251,
27294,
27358,
27387,
27393,
27394,
27438,
27464,
27465,
27482,
27484,
27485,
27492,
27493,
27561,
27562,
27611,
27667,
27669,
27694,
27771,
27826,
27851,
27880,
27921,
27956,
27958,
27959,
28335,
28336,
28475,
28476,
28534,
28595,
28597,
28635,
28692,
28717,
28720,
28772,
28812,
28818,
28881,
28887,
28888,
28927,
28933,
28970,
29009,
29082,
29106,
29112,
29113,
29157,
29183,
29184,
29201,
29203,
29204,
29969,
29970,
30024,
30101,
30216,
30297,
30412,
30526,
30673,
30745,
30800,
30802,
30811,
30820,
30870,
30912,
30966,
31034,
31035,
31112,
31156,
31160,
31207,
31230,
31234,
31241,
31245,
31312,
31371,
31434,
31497,
31498,
31539,
31591,
31654,
31655,
31710,
31783,
31853,
31923,
31924,
31985,
32050,
32112,
32158,
32220,
32266,
32328,
32329,
32397,
32451,
32495,
32573,
32638,
32714,
32781,
32782,
32863,
32942,
32947,
32988,
33037,
33083,
33150,
33154,
33156,
33157,
33305,
33306,
33368,
33370,
33418,
33460,
33465,
33509,
33544,
33554,
33629,
33676,
33740,
33812,
33813,
33844,
33851,
33902,
33913,
33950,
33961,
34030,
34041,
34110,
34172,
34247,
34304,
34348,
34403,
34463,
34503,
34538,
34549,
34556,
34625,
34630,
34632,
34633,
35514,
35515,
35526,
35527,
35766,
35767,
35775,
35776,
35894,
35895,
35912,
35913,
35924,
35952,
35980,
36098,
36100,
36119,
36143,
36164,
36181,
36183,
36188,
36220,
36221,
36246,
36247,
36249,
36304,
36348,
36425,
36481,
36529,
36583,
36669,
36724,
36770,
36824,
36825,
36972,
36973,
37004,
37052,
37089,
37140,
37153
],
"line_end_idx": [
35,
70,
71,
142,
143,
160,
176,
216,
253,
254,
267,
268,
858,
859,
870,
871,
1294,
1295,
1306,
1307,
1317,
1318,
1633,
1634,
1669,
1671,
1715,
1764,
1769,
1791,
1793,
1794,
1813,
1814,
1883,
1884,
1939,
1997,
1998,
2011,
2012,
2053,
2125,
2141,
2162,
2210,
2211,
2517,
2518,
2538,
2558,
2577,
2597,
2598,
2797,
2798,
2837,
2838,
2981,
2982,
3038,
3040,
3083,
3089,
3120,
3126,
3127,
3175,
3181,
3209,
3215,
3217,
3218,
3380,
3381,
3409,
3410,
3501,
3502,
3545,
3547,
3577,
3608,
3609,
3677,
3681,
3695,
3711,
3715,
3716,
3759,
3765,
3787,
3793,
3794,
3842,
3848,
3871,
3877,
3879,
3880,
3997,
3998,
4059,
4060,
4172,
4173,
4193,
4194,
4563,
4564,
4608,
4629,
4681,
4682,
4733,
4734,
4821,
4823,
4872,
4908,
4944,
4969,
5026,
5083,
5120,
5131,
5133,
5134,
5356,
5357,
5399,
5429,
5430,
5443,
5444,
5503,
5505,
5559,
5606,
5617,
5619,
5620,
5656,
5657,
5707,
5738,
5739,
5752,
5753,
5819,
5821,
5875,
5922,
5933,
5935,
5936,
5969,
5970,
6018,
6049,
6050,
6063,
6064,
6127,
6129,
6183,
6227,
6302,
6312,
6314,
6315,
6349,
6350,
6401,
6432,
6433,
6446,
6447,
6529,
6531,
6580,
6612,
6646,
6700,
6752,
6810,
6867,
6877,
6879,
6880,
7051,
7052,
7068,
7069,
7140,
7141,
7184,
7186,
7228,
7274,
7320,
7364,
7440,
7446,
7502,
7508,
7509,
7552,
7558,
7635,
7641,
7642,
7690,
7696,
7783,
7870,
7876,
7877,
7879,
7880,
8093,
8094,
8101,
8102,
8191,
8192,
8225,
8227,
8266,
8305,
8345,
8385,
8389,
8408,
8410,
8411,
8580,
8581,
8630,
8632,
8675,
8716,
8718,
8719,
8784,
8785,
8846,
8904,
8987,
8988,
9010,
9011,
9109,
9110,
10047,
10048,
10089,
10090,
10174,
10175,
10224,
10226,
10263,
10301,
10302,
10336,
10342,
10364,
10392,
10398,
10399,
10442,
10448,
10474,
10480,
10481,
10525,
10531,
10558,
10564,
10566,
10567,
10682,
10683,
10731,
10733,
10779,
10826,
10850,
10853,
10887,
10921,
10922,
10956,
10998,
11047,
11054,
11055,
11095,
11102,
11127,
11134,
11135,
11175,
11182,
11207,
11214,
11215,
11256,
11263,
11289,
11296,
11297,
11338,
11345,
11371,
11378,
11380,
11381,
11518,
11519,
11722,
11723,
11739,
11740,
11754,
11755,
12161,
12162,
12183,
12184,
12769,
12770,
12849,
12850,
13279,
13280,
13304,
13305,
13628,
13629,
13688,
13689,
13711,
13712,
13818,
13924,
13925,
15167,
15168,
15188,
15189,
15449,
15450,
15548,
15549,
15571,
15572,
15730,
15888,
15889,
16428,
16429,
16667,
16668,
16776,
16884,
16885,
17177,
17178,
17452,
17453,
17737,
17738,
17887,
17888,
17898,
17899,
18273,
18274,
18432,
18590,
18609,
18631,
18650,
18672,
18749,
18826,
18827,
18866,
18867,
18920,
18971,
18972,
19613,
19614,
19722,
19723,
19752,
19782,
19783,
20142,
20143,
20191,
20240,
20241,
20640,
20641,
20799,
20957,
21000,
21080,
21159,
21202,
21203,
21221,
21222,
21549,
21550,
21708,
21866,
21888,
21910,
21932,
21954,
22037,
22120,
22121,
22523,
22524,
22918,
22919,
23372,
23373,
23442,
23443,
23553,
23595,
23596,
23890,
23891,
23904,
23905,
23917,
23918,
24273,
24274,
24308,
24310,
24338,
24371,
24404,
24405,
24453,
24506,
24511,
24562,
24567,
24568,
24601,
24606,
24638,
24643,
24644,
24677,
24682,
24724,
24729,
24730,
24768,
24773,
24828,
24898,
24903,
24905,
24906,
25184,
25185,
25247,
25335,
25418,
25487,
25488,
25850,
25851,
25861,
25862,
25924,
25925,
25992,
26048,
26050,
26075,
26105,
26166,
26221,
26246,
26275,
26316,
26351,
26353,
26354,
26419,
26420,
26481,
26529,
26531,
26569,
26633,
26658,
26721,
26784,
26823,
26829,
26890,
26926,
26993,
27029,
27076,
27140,
27187,
27251,
27294,
27358,
27387,
27393,
27394,
27438,
27464,
27465,
27482,
27484,
27485,
27492,
27493,
27561,
27562,
27611,
27667,
27669,
27694,
27771,
27826,
27851,
27880,
27921,
27956,
27958,
27959,
28335,
28336,
28475,
28476,
28534,
28595,
28597,
28635,
28692,
28717,
28720,
28772,
28812,
28818,
28881,
28887,
28888,
28927,
28933,
28970,
29009,
29082,
29106,
29112,
29113,
29157,
29183,
29184,
29201,
29203,
29204,
29969,
29970,
30024,
30101,
30216,
30297,
30412,
30526,
30673,
30745,
30800,
30802,
30811,
30820,
30870,
30912,
30966,
31034,
31035,
31112,
31156,
31160,
31207,
31230,
31234,
31241,
31245,
31312,
31371,
31434,
31497,
31498,
31539,
31591,
31654,
31655,
31710,
31783,
31853,
31923,
31924,
31985,
32050,
32112,
32158,
32220,
32266,
32328,
32329,
32397,
32451,
32495,
32573,
32638,
32714,
32781,
32782,
32863,
32942,
32947,
32988,
33037,
33083,
33150,
33154,
33156,
33157,
33305,
33306,
33368,
33370,
33418,
33460,
33465,
33509,
33544,
33554,
33629,
33676,
33740,
33812,
33813,
33844,
33851,
33902,
33913,
33950,
33961,
34030,
34041,
34110,
34172,
34247,
34304,
34348,
34403,
34463,
34503,
34538,
34549,
34556,
34625,
34630,
34632,
34633,
35514,
35515,
35526,
35527,
35766,
35767,
35775,
35776,
35894,
35895,
35912,
35913,
35924,
35952,
35980,
36098,
36100,
36119,
36143,
36164,
36181,
36183,
36188,
36220,
36221,
36246,
36247,
36249,
36304,
36348,
36425,
36481,
36529,
36583,
36669,
36724,
36770,
36824,
36825,
36972,
36973,
37004,
37052,
37089,
37140,
37153,
37174
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 37174,
"ccnet_original_nlines": 732,
"rps_doc_curly_bracket": 0.003174260025843978,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33584561944007874,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02729245088994503,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.333790123462677,
"rps_doc_frac_unique_words": 0.2463073879480362,
"rps_doc_mean_word_length": 5.2662672996521,
"rps_doc_num_sentences": 372,
"rps_doc_symbol_to_word_ratio": 0.00045677999150939286,
"rps_doc_unigram_entropy": 5.994073867797852,
"rps_doc_word_count": 5010,
"rps_doc_frac_chars_dupe_10grams": 0.10328228771686554,
"rps_doc_frac_chars_dupe_5grams": 0.16350819170475006,
"rps_doc_frac_chars_dupe_6grams": 0.13936476409435272,
"rps_doc_frac_chars_dupe_7grams": 0.12954820692539215,
"rps_doc_frac_chars_dupe_8grams": 0.11199969798326492,
"rps_doc_frac_chars_dupe_9grams": 0.11018040776252747,
"rps_doc_frac_chars_top_2gram": 0.006632809992879629,
"rps_doc_frac_chars_top_3gram": 0.009096420370042324,
"rps_doc_frac_chars_top_4gram": 0.00545785017311573,
"rps_doc_books_importance": -4253.91650390625,
"rps_doc_books_importance_length_correction": -4253.91650390625,
"rps_doc_openwebtext_importance": -2135.04296875,
"rps_doc_openwebtext_importance_length_correction": -2135.04296875,
"rps_doc_wikipedia_importance": -1626.104736328125,
"rps_doc_wikipedia_importance_length_correction": -1626.104736328125
},
"fasttext": {
"dclm": 0.6750024557113647,
"english": 0.8363065719604492,
"fineweb_edu_approx": 2.588390350341797,
"eai_general_math": 0.9867280721664429,
"eai_open_web_math": 0.5047095417976379,
"eai_web_code": 0.8295648097991943
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "516.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "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": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,285,901,322,548,929,000 |
Ask Ubuntu is a question and answer site for Ubuntu users and developers. Join them; it only takes a minute:
Sign up
Here's how it works:
1. Anybody can ask a question
2. Anybody can answer
3. The best answers are voted up and rise to the top
I'm running Ubuntu 12.04.
If I try to auto-complete to delete a directory with spaces in the name, it doesn't work.
Say my directory is called "some spacey directory". If I type rm -r some and hit tab, nothing more autocompletes. So then I type a bit more, say rm -r some\ s. Now if I hit tab, it autocompletes but removes the \ characters giving rm -r some spacey directory. This, however, won't delete some spacey directory. So that's inconvenient.
But when this is a real nightmare: If you have two directories, say "basic" and "basic with an added feature" and execute rm -r basic with an added feature you end up deleting basic.
My question: Is there any reason autocomplete has that behaviour? Is there anyway I can get rid of it? This seems like dangerous behaviour in the context of a permanent delete command.
share|improve this question
You don't delete until you press the enter key so I can't see what your issue is. – Meer Borg May 15 '13 at 1:22
Which is fine for the type of person who A) knows enough to know the behaviour of executing that command and B) Never makes mistakes. I only recently hit the criteria for A) and I don't know many people who meet B). – BenB May 15 '13 at 1:33
I find the behavior odd too when I first hit it, but after realizing what it was about it clicked. I rarely have spaces in directories as that is not a good idea. Even in Windows I avoid the issue. I agree with you that leaving the \ in might be a better aproach, but its something we are all used to now... – Meer Borg May 15 '13 at 1:37
Is there a way to autocomplete directory names with spaces? And what is the motivation behind this behaviour? – BenB May 15 '13 at 1:56
Tab completion is working here for directories and files with spaces in their names.
As you can see, Linux does not like spaces in file names. You have to escape them with a \ or use quotes.
rm -rf "directory with spaces"
rm on the command line is harsh and typos can give you problems. I suggest you use the -i option for confirmation.
rm -i file to remove
will give you confirmation, do you want to remove file? and you can abort. I alisis in ~/.bashrc
alias rm="rm -i"
good luck
share|improve this answer
1
-i should be default when running recursive commands as root. :) – Takkat May 15 '13 at 7:26
By "Tab completion is working here" does that mean you're not getting the behaviour I describe? – BenB May 15 '13 at 17:36
no, if I have a file (or directory) called "file with space", bash tab completes. If I type rm -i file<tab> I get rm -i file\ with\ space. – bodhi.zazen May 15 '13 at 17:41
Definitely does not work like that for me. Though I can do rm -r "some <tab> and get rm -r "some spacey" – BenB May 15 '13 at 18:08
do you have a custom .bashrc or other config ? – bodhi.zazen May 15 '13 at 19:15
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://askubuntu.com/questions/295523/changing-rm-r-autocomplete-behaviour-for-directories-with-whitespace-in-their-n",
"source_domain": "askubuntu.com",
"snapshot_id": "crawl=CC-MAIN-2016-30",
"warc_metadata": {
"Content-Length": "83066",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6B5GURKGKW7ES7ANUWYBOP5OCW5EUUIU",
"WARC-Concurrent-To": "<urn:uuid:bb2fbec4-925b-42cb-8e3f-0b3338a59d19>",
"WARC-Date": "2016-07-28T03:00:12Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:QPC4L4GBL2HLL4KQJTZ4CLBBBEWAGXZK",
"WARC-Record-ID": "<urn:uuid:3544d898-9aed-4682-97c4-cd70fd256017>",
"WARC-Target-URI": "http://askubuntu.com/questions/295523/changing-rm-r-autocomplete-behaviour-for-directories-with-whitespace-in-their-n",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e63c0833-cb98-4ea3-b3a2-f0c1847dd0bc>"
},
"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,
109,
110,
118,
139,
171,
195,
250,
251,
277,
278,
368,
369,
704,
705,
888,
889,
1074,
1075,
1103,
1108,
1221,
1226,
1468,
1473,
1812,
1817,
1953,
1954,
2039,
2040,
2146,
2147,
2178,
2179,
2294,
2295,
2316,
2317,
2414,
2415,
2432,
2433,
2443,
2444,
2470,
2474,
2567,
2572,
2695,
2700,
2873,
2878,
3010,
3015,
3096,
3097,
3109,
3110,
3112,
3120,
3121,
3199,
3200
],
"line_end_idx": [
109,
110,
118,
139,
171,
195,
250,
251,
277,
278,
368,
369,
704,
705,
888,
889,
1074,
1075,
1103,
1108,
1221,
1226,
1468,
1473,
1812,
1817,
1953,
1954,
2039,
2040,
2146,
2147,
2178,
2179,
2294,
2295,
2316,
2317,
2414,
2415,
2432,
2433,
2443,
2444,
2470,
2474,
2567,
2572,
2695,
2700,
2873,
2878,
3010,
3015,
3096,
3097,
3109,
3110,
3112,
3120,
3121,
3199,
3200,
3290
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3290,
"ccnet_original_nlines": 63,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37435898184776306,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03205128014087677,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24487179517745972,
"rps_doc_frac_unique_words": 0.40946164727211,
"rps_doc_mean_word_length": 4.003262519836426,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0.0012820500414818525,
"rps_doc_unigram_entropy": 5.057356357574463,
"rps_doc_word_count": 613,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09372452646493912,
"rps_doc_frac_chars_dupe_6grams": 0.05378973111510277,
"rps_doc_frac_chars_dupe_7grams": 0.014669929631054401,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01833740994334221,
"rps_doc_frac_chars_top_3gram": 0.025672370567917824,
"rps_doc_frac_chars_top_4gram": 0.03300733119249344,
"rps_doc_books_importance": -388.7247619628906,
"rps_doc_books_importance_length_correction": -388.7247619628906,
"rps_doc_openwebtext_importance": -186.8710479736328,
"rps_doc_openwebtext_importance_length_correction": -186.8710479736328,
"rps_doc_wikipedia_importance": -163.81312561035156,
"rps_doc_wikipedia_importance_length_correction": -163.81312561035156
},
"fasttext": {
"dclm": 0.3442803621292114,
"english": 0.9373338222503662,
"fineweb_edu_approx": 1.5173038244247437,
"eai_general_math": 0.06657301634550095,
"eai_open_web_math": 0.2935274839401245,
"eai_web_code": 0.001000339980237186
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.436",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
191,920,261,705,141,700 |
O'Reilly logo
Stay ahead with the world's most comprehensive technology and business learning platform.
With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.
Start Free Trial
No credit card required
Mastering MEAN Web Development: Expert Full Stack JavaScript
Video Description
Become a master of the MEAN stack by creating a fully featured web app in one go
About This Video
• Develop sophisticated models for MongodB with MongooseJS
• Leverage Babel and Webpack to expedite your development process
• Learn how to integrate Socket.io into Angular and Node.js
• In Detail
Web development is moving fast and to keep up to mark, you need a technology stack that is . The MEAN stack includes MongoDb, Express, Angular, and Node.js. These tools provide a rich environment to build advanced web applications in a short space of time. All the pieces of the MEAN stack are practically tried and tested in large and small-scale organizations.
Mastering MEAN Web Development will guide you through all the necessary pieces to build a web app from start to finish. We will discuss the concepts and methods in depth, and shine light on how and why we use each piece of the MEAN stack.
We’ll begin by learning how to use Webpack and Babel to assemble our frontend. We’ll see how to leverage many of the new features in Angular2. We’ll create a RESTful API built with Node.js and MongoDB.
Along the way, we’ll touch up on best practices used to create, manage, and deploy web applications to production. Your skills and understanding of JavaScript will increase as you add web sockets, models, and other essential elements to your web application.
Mastering MEAN Web Development will cover all the topics you need to create your own web apps for organizations, small or big.
Table of Contents
1. Chapter 1 : Getting Started
1. The Course Overview 00:03:29
2. Installing the Basics 00:04:57
3. Starting Your Site with Webpack 00:07:07
4. Creating a Good Documentation with README.md 00:04:38
2. Chapter 2 : Making Your Site Shine
1. Adding Bootstrap 00:04:50
2. Using Custom SASS Styles 00:04:22
3. Including Font Awesome Icons 00:03:58
4. Responsive Design with Bootstrap Grid 00:07:32
3. Chapter 3 : Expanding Your Angular App
1. Creating Routes in Angular 00:09:52
2. Adding Navigation Links 00:07:15
3. Developing Reusable Elements 00:06:34
4. Chapter 4 : Creating Express Routes
1. Creating Nested Express Routes 00:10:59
2. Building a Usable API 00:05:32
3. Connecting to MongoDB 00:06:01
4. Adding Mongoose Models 00:09:04
5. Writing Mocha Tests for Your Routes 00:08:31
5. Chapter 5 : Developing Angular Forms
1. Adding an Angular Service 00:08:33
2. Using Rich Models in Angular 00:04:11
3. Validating Form Data 00:10:17
4. Installing and Testing with Protractor 00:05:46
6. Chapter 6 : Securing Your API
1. Adding User Profiles 00:11:31
2. Validating JWT in Express 00:04:57
3. Updating Integration Tests 00:04:12
4. Storing the JSON Web Token 00:10:14
5. Using HTTP Interception 00:06:18
7. Chapter 7 : Sending Transactional E-mails
1. Creating a Work Process 00:06:34
2. Configuring a Job Queue 00:07:33
3. Designing an E-mail Template 00:05:42
4. Connecting to an E-mail Provider 00:07:24
8. Chapter 8 : Including Real-time Updates
1. Installing Socket.io 00:04:13
2. Configuring Real-time Event Messaging 00:05:47
3. Updating Angular with New Content 00:07:08
9. Chapter 9 : Deploying to Production
1. Buying a MongoDB Server 00:05:45
2. Buying a Node.js Server 00:07:17
3. Building Your Site with Webpack 00:09:05
10. Chapter 10 : Conclusion
1. Where We Started? 00:04:32
2. Summary of Our Components 00:06:00
3. Ideas for Extending Your App 00:05:08
4. Resources for Further Learning 00:03:06
|
{
"url": "https://www.oreilly.com/library/view/mastering-mean-web/9781785882159/",
"source_domain": "www.oreilly.com",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "35188",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YF25ZONUJE72PFE43FW5IFHKHAWQHFDS",
"WARC-Concurrent-To": "<urn:uuid:9f2ec233-2638-4301-8a9e-3d0808609136>",
"WARC-Date": "2019-08-20T08:56:43Z",
"WARC-IP-Address": "23.50.125.166",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UMVGNXS6VGWUT22JC7IJK472J6L2M7T4",
"WARC-Record-ID": "<urn:uuid:0f9236c7-7c75-43b9-a1fd-a87055d37f14>",
"WARC-Target-URI": "https://www.oreilly.com/library/view/mastering-mean-web/9781785882159/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:98faf8a6-cc11-49d6-b0c3-2d0e08da1003>"
},
"warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-207.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
14,
15,
105,
106,
251,
252,
269,
270,
294,
295,
356,
357,
375,
376,
457,
458,
475,
476,
537,
538,
606,
607,
669,
670,
684,
685,
1052,
1053,
1296,
1297,
1503,
1504,
1767,
1768,
1899,
1900,
1922,
1923,
1958,
1996,
2036,
2086,
2149,
2191,
2226,
2269,
2316,
2372,
2418,
2463,
2505,
2552,
2595,
2644,
2684,
2724,
2765,
2819,
2863,
2907,
2954,
2993,
3050,
3087,
3126,
3170,
3215,
3260,
3302,
3351,
3393,
3435,
3482,
3533,
3580,
3619,
3675,
3727,
3770,
3812,
3854,
3904,
3936,
3972,
4016,
4063
],
"line_end_idx": [
14,
15,
105,
106,
251,
252,
269,
270,
294,
295,
356,
357,
375,
376,
457,
458,
475,
476,
537,
538,
606,
607,
669,
670,
684,
685,
1052,
1053,
1296,
1297,
1503,
1504,
1767,
1768,
1899,
1900,
1922,
1923,
1958,
1996,
2036,
2086,
2149,
2191,
2226,
2269,
2316,
2372,
2418,
2463,
2505,
2552,
2595,
2644,
2684,
2724,
2765,
2819,
2863,
2907,
2954,
2993,
3050,
3087,
3126,
3170,
3215,
3260,
3302,
3351,
3393,
3435,
3482,
3533,
3580,
3619,
3675,
3727,
3770,
3812,
3854,
3904,
3936,
3972,
4016,
4063,
4111
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4111,
"ccnet_original_nlines": 86,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1739618331193924,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02132434956729412,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.41526374220848083,
"rps_doc_frac_unique_words": 0.501655638217926,
"rps_doc_mean_word_length": 4.943708419799805,
"rps_doc_num_sentences": 73,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.275428771972656,
"rps_doc_word_count": 604,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.020763559266924858,
"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.01875418983399868,
"rps_doc_frac_chars_top_3gram": 0.016075020655989647,
"rps_doc_frac_chars_top_4gram": 0.02712658978998661,
"rps_doc_books_importance": -445.2016906738281,
"rps_doc_books_importance_length_correction": -445.2016906738281,
"rps_doc_openwebtext_importance": -351.7160949707031,
"rps_doc_openwebtext_importance_length_correction": -351.7160949707031,
"rps_doc_wikipedia_importance": -315.5922546386719,
"rps_doc_wikipedia_importance_length_correction": -315.5922546386719
},
"fasttext": {
"dclm": 0.22835153341293335,
"english": 0.7982929944992065,
"fineweb_edu_approx": 1.6438449621200562,
"eai_general_math": 0.011774900369346142,
"eai_open_web_math": 0.04518038034439087,
"eai_web_code": 0.005729559808969498
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.7",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,460,612,670,118,348,000 |
BitmapSource.SetSourceAsync(IRandomAccessStream) Method
Definition
Sets the source image for a BitmapSource by accessing a stream and processing the result asynchronously.
Equivalent WinUI method: Microsoft.UI.Xaml.Media.Imaging.BitmapSource.SetSourceAsync.
public:
virtual IAsyncAction ^ SetSourceAsync(IRandomAccessStream ^ streamSource) = SetSourceAsync;
/// [Windows.Foundation.Metadata.RemoteAsync]
IAsyncAction SetSourceAsync(IRandomAccessStream const & streamSource);
[Windows.Foundation.Metadata.RemoteAsync]
public IAsyncAction SetSourceAsync(IRandomAccessStream streamSource);
function setSourceAsync(streamSource)
Public Function SetSourceAsync (streamSource As IRandomAccessStream) As IAsyncAction
Parameters
streamSource
IRandomAccessStream
The stream source that sets the image source value.
Returns
IAsyncAction
An asynchronous handler called when the operation is complete.
Attributes
Examples
This example shown here uses a file stream (obtained using a file picker, not shown) to load an image source by calling SetSourceAsync. The file picker, stream and call to SetSourceAsync are all asynchronous. The code shown here comes from a larger code sample, the SDK XAML images sample.
// Ensure the stream is disposed once the image is loaded
using (IRandomAccessStream fileStream = await file.OpenAsync(Windows.Storage.FileAccessMode.Read))
{
// Set the image source to the selected bitmap
BitmapImage bitmapImage = new BitmapImage();
bitmapImage.DecodePixelHeight = decodePixelHeight;
bitmapImage.DecodePixelWidth = decodePixelWidth;
await bitmapImage.SetSourceAsync(fileStream);
Scenario2Image.Source = bitmapImage;
}
Remarks
Setting an image source by calling the asynchronous SetSourceAsync method rather than the similar SetSource method avoids blocking the UI thread. The SetSourceAsync behavior is similar to what the system does internally when you set an image source as a URI in markup: the system doesn't wait to retrieve and decode, but it does run layout again once the image source is available. The markup parsing equivalent doesn't expose the async infrastructure, but the SetSourceAsync method does. For more info on how to use async, await, or how to work with an IAsyncAction value, see Call asynchronous APIs in C# or Visual Basic.
If the app changes the image source again via SetSourceAsync, SetSource or UriSource while a SetSourceAsync call is already in progress, the pending SetSourceAsync action will throw a TaskCanceledException and set the Status to Canceled.
If you have a Microsoft .NET stream that you want to use as a source, you can use the AsRandomAccessStream extension method to convert it to the IRandomAccessStream type that's needed as input for SetSourceAsync.
In low memory situations (most likely on lower-memory phones), it is possible for an exception to be raised with the message "The image is unrecognized" and an HRESULT of 0x88982F60. While this exception ordinarily indicates bad data, if your app is close to its memory limit then the cause of the exception is likely to be low memory. In that case, we recommend that you free memory and try again.
Applies to
See also
|
{
"url": "https://docs.microsoft.com/en-us/uwp/api/windows.ui.xaml.media.imaging.bitmapsource.setsourceasync?view=winrt-19041",
"source_domain": "docs.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "46849",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D5WB6N574LJE5J6Y4Z7YTRHPI3CBMK35",
"WARC-Concurrent-To": "<urn:uuid:240f2409-3a50-47e2-9f7c-e0bed2bd46d6>",
"WARC-Date": "2021-03-05T05:40:48Z",
"WARC-IP-Address": "104.82.34.240",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:X5GZ7QCJSMDBSFEC2PTSHIS673YSE2S3",
"WARC-Record-ID": "<urn:uuid:56ef6816-d85e-4106-85fb-e367b9a1a3d2>",
"WARC-Target-URI": "https://docs.microsoft.com/en-us/uwp/api/windows.ui.xaml.media.imaging.bitmapsource.setsourceasync?view=winrt-19041",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e3d233cc-4b5a-4601-8d41-ee57b5036218>"
},
"warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-59.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
56,
57,
68,
69,
174,
175,
261,
262,
270,
363,
409,
480,
522,
592,
630,
715,
716,
727,
728,
741,
761,
762,
814,
815,
823,
824,
837,
838,
901,
902,
913,
914,
923,
924,
1214,
1215,
1273,
1372,
1374,
1426,
1476,
1532,
1586,
1587,
1638,
1680,
1682,
1683,
1691,
1692,
2316,
2317,
2555,
2556,
2769,
2770,
3169,
3170,
3181,
3182
],
"line_end_idx": [
56,
57,
68,
69,
174,
175,
261,
262,
270,
363,
409,
480,
522,
592,
630,
715,
716,
727,
728,
741,
761,
762,
814,
815,
823,
824,
837,
838,
901,
902,
913,
914,
923,
924,
1214,
1215,
1273,
1372,
1374,
1426,
1476,
1532,
1586,
1587,
1638,
1680,
1682,
1683,
1691,
1692,
2316,
2317,
2555,
2556,
2769,
2770,
3169,
3170,
3181,
3182,
3190
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3190,
"ccnet_original_nlines": 60,
"rps_doc_curly_bracket": 0.0006269600125961006,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31491711735725403,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014732969924807549,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19337016344070435,
"rps_doc_frac_unique_words": 0.47783249616622925,
"rps_doc_mean_word_length": 6.408866882324219,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0.0018416199600324035,
"rps_doc_unigram_entropy": 4.81300163269043,
"rps_doc_word_count": 406,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.016910070553421974,
"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.029592620208859444,
"rps_doc_frac_chars_top_3gram": 0.021521909162402153,
"rps_doc_frac_chars_top_4gram": 0.011529590003192425,
"rps_doc_books_importance": -174.30023193359375,
"rps_doc_books_importance_length_correction": -174.30023193359375,
"rps_doc_openwebtext_importance": -139.35549926757812,
"rps_doc_openwebtext_importance_length_correction": -139.35549926757812,
"rps_doc_wikipedia_importance": -127.71966552734375,
"rps_doc_wikipedia_importance_length_correction": -127.71966552734375
},
"fasttext": {
"dclm": 0.30267655849456787,
"english": 0.7762110233306885,
"fineweb_edu_approx": 3.201829195022583,
"eai_general_math": 0.7025474309921265,
"eai_open_web_math": 0.15903747081756592,
"eai_web_code": 0.9392112493515015
}
}
|
{
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,009,345,452,866,071,400 |
What Is Digital Devices?
Digital connection is the transfer info, either for the reason that digitised égal signal or maybe a bitstream, above point-to-point and/or point-to-multipoint communication stations. These include storage channels, fiber optics, computer system buses, and wireless interaction channels. Everybody relies on this technology to communicate each day, including businesses, governments and individuals.
Those who a solid comprehension of digital speaking are highly sought after. This industry takes a strong feeling of sympathy as well as the capacity to create a powerful narrative and connect with people. A dedication to ongoing learning is usually essential as the technology constantly adjustments and evolves.
For example , digital communication tools such as portable and cultural intranets offer more productivity than classic methods like email. https://onedatablog.com/remote-performance-with-virtual-data-room-provider/ Email inboxes are often overloaded, and messages may get buried so quickly that they are either ignored or skimmed above. Instead, modern digital communication tools including task administration systems and videoconferencing allow users to organize and prioritize all their workflows.
An additional of using digital connection is that it will help maintain efficiency in the face of global and everyday disruptions. As an example, many companies use calendars to inform employees of conferences, deadlines and also other important happenings. This makes it much easier for employees to work on all their tasks even if they are not in the office. Furthermore, using multiple digital conversation tools makes for a more flexible workplace where right application can be used with the right time. For instance , a text message may be the most suitable channel to send out a great urgent organization update, even though a video meeting might be better for discussing new assignments or collaborating on thinking visits.
ใส่ความเห็น
อีเมลของคุณจะไม่แสดงให้คนอื่นเห็น ช่องข้อมูลจำเป็นถูกทำเครื่องหมาย *
|
{
"url": "https://www.findingcanada.com/what-is-digital-devices/",
"source_domain": "www.findingcanada.com",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "80614",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3OS2FQ6LU72CH2SZDDL3W22BPAPJFJG2",
"WARC-Concurrent-To": "<urn:uuid:b4dfd236-6b2a-45d7-91dc-e5916c1dc154>",
"WARC-Date": "2023-12-06T18:02:02Z",
"WARC-IP-Address": "172.67.199.57",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TSXDF3OXYZYU7WEKFS6CIOFU7CLANVYE",
"WARC-Record-ID": "<urn:uuid:7da185d1-adf4-4846-9a03-60972b42f9f1>",
"WARC-Target-URI": "https://www.findingcanada.com/what-is-digital-devices/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:03937aac-33b4-40b3-8525-d80ba3665652>"
},
"warc_info": "isPartOf: CC-MAIN-2023-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-11\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
25,
26,
426,
427,
741,
742,
1243,
1244,
1976,
1977,
1989,
1990
],
"line_end_idx": [
25,
26,
426,
427,
741,
742,
1243,
1244,
1976,
1977,
1989,
1990,
2058
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2058,
"ccnet_original_nlines": 12,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3565683662891388,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0026809698902070522,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20643432438373566,
"rps_doc_frac_unique_words": 0.680701732635498,
"rps_doc_mean_word_length": 6.028069972991943,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.027283191680908,
"rps_doc_word_count": 285,
"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.019790450111031532,
"rps_doc_frac_chars_top_3gram": 0.022118739783763885,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -143.5420684814453,
"rps_doc_books_importance_length_correction": -143.5420684814453,
"rps_doc_openwebtext_importance": -85.75481414794922,
"rps_doc_openwebtext_importance_length_correction": -85.75481414794922,
"rps_doc_wikipedia_importance": -66.77576446533203,
"rps_doc_wikipedia_importance_length_correction": -66.77576446533203
},
"fasttext": {
"dclm": 0.6772870421409607,
"english": 0.8799940943717957,
"fineweb_edu_approx": 2.2510933876037598,
"eai_general_math": 0.15332865715026855,
"eai_open_web_math": 0.11940228939056396,
"eai_web_code": 0.09338598698377609
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.01",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.402",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "1",
"label": "About (Org.)"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,486,586,142,839,876,000 |
Archive for encompassing model
ABC model choice not to be trusted [2]
Posted in R, Statistics with tags , , , on January 28, 2011 by xi'an
As we were completing our arXiv summary about ABC model choice, we were helpfully pointed to a recent CRiSM tech. report by X. Didelot, R. Everitt, A. Johansen and D. Lawson on Likelihood-free estimation of model evidence. This paper is quite related to our study of the performances of the ABC approximation to the Bayes factor, deriving in particular the limiting behaviour for the ratio,
B_{12}(x) = \dfrac{g_1(x)}{g_2(x)}\,B^S_{12}(x).
However, Didelot et al. reach the opposite conclusion from ours, namely that the problem can be solved by a sufficiency argument. Their point is that, when comparing models within exponential families (which is the natural realm for sufficient statistics), it is always possible to build an encompassing model with a sufficient statistic that remains sufficient across models. This construction of Didelot et al. is correct from a mathematical perspective, as seen for instance in the Poisson versus geometric example we first mentioned in Grelaud et al. (2009): adding
\prod_{i=1}^n x_i!
to the sum of the observables into a large sufficient statistic produces a ratio g1/g2 that is equal to 1.
Nonetheless, we do not think this encompassing property has a direct impact on the performances of ABC model choice. In practice, complex models do not enjoy sufficient statistics (if only because the overwhelming majority of them are not exponential families, with the notable exception of Gibbs random fields where the above agreement graph is derived). There is therefore a strict loss of information in using ABC model choice, due to the call both to insufficient statistics and to non-zero tolerances. Looking at what happens in the limiting case when one is relying on a common sufficient statistic is a formal study that brings light on the potentially huge discrepancy between the ABC-based Bayes factor and the true Bayes factor. This is why we consider that finding a solution in this formal case—while a valuable extension of the Gibbs random fields case—does not directly help towards the understanding of the discrepancy found in non-exponential complex models.
Follow
Get every new post delivered to your Inbox.
Join 910 other followers
|
{
"url": "https://xianblog.wordpress.com/tag/encompassing-model/",
"source_domain": "xianblog.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2015-35",
"warc_metadata": {
"Content-Length": "54287",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:M3F2FZXG6DMQV6PVXA7P7CUU6IPZPYWL",
"WARC-Concurrent-To": "<urn:uuid:2cefcede-c846-4240-9bfe-57b44159248e>",
"WARC-Date": "2015-09-05T10:15:39Z",
"WARC-IP-Address": "192.0.78.13",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:7OUSOJ6JPYE64G6OEGL4VGGPC4G25WYD",
"WARC-Record-ID": "<urn:uuid:0247d347-d0a0-4aae-9e87-d8379de1a648>",
"WARC-Target-URI": "https://xianblog.wordpress.com/tag/encompassing-model/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c58fee3c-1b19-4154-ab09-608facf543ab>"
},
"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,
31,
32,
71,
72,
141,
142,
534,
535,
584,
585,
1155,
1156,
1175,
1176,
1283,
1284,
2259,
2260,
2267,
2268,
2312,
2313
],
"line_end_idx": [
31,
32,
71,
72,
141,
142,
534,
535,
584,
585,
1155,
1156,
1175,
1176,
1283,
1284,
2259,
2260,
2267,
2268,
2312,
2313,
2337
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2337,
"ccnet_original_nlines": 22,
"rps_doc_curly_bracket": 0.004278989974409342,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.395652174949646,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030434779822826385,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1717391312122345,
"rps_doc_frac_unique_words": 0.56639564037323,
"rps_doc_mean_word_length": 5.059620380401611,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.928168773651123,
"rps_doc_word_count": 369,
"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.013390470296144485,
"rps_doc_frac_chars_top_3gram": 0.02999464049935341,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -225.98727416992188,
"rps_doc_books_importance_length_correction": -225.98727416992188,
"rps_doc_openwebtext_importance": -126.6275863647461,
"rps_doc_openwebtext_importance_length_correction": -126.6275863647461,
"rps_doc_wikipedia_importance": -82.89812469482422,
"rps_doc_wikipedia_importance_length_correction": -82.89812469482422
},
"fasttext": {
"dclm": 0.05675185099244118,
"english": 0.919617235660553,
"fineweb_edu_approx": 1.8913074731826782,
"eai_general_math": 0.9947600960731506,
"eai_open_web_math": 0.6651051640510559,
"eai_web_code": 0.6036465764045715
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "001.422",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Intellectual life"
}
}
},
"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": "2",
"label": "Academic/Research"
},
"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": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-500,522,240,064,095,040 |
What is meta? ×
Meta Stack Exchange is where users like you discuss bugs, features, and support issues that affect the software powering all 133 Stack Exchange communities.
Has the electorate badge increased the number of votes on questions since it was implemented?
share|improve this question
3
It's working for me ;) – ChrisF Jan 27 '10 at 21:40
11
I contend that it would be working as designed if it increased downvotes as well. – dmckee Jan 27 '10 at 23:56
@dmckee Good point, I should have just said votes. – C. Ross Jan 28 '10 at 13:00
Good question... I would say it hasn't base don the number of these acquired on SU. – nicorellius May 6 '10 at 0:13
7 Answers 7
I think it encourages randomly voting on questions. I once asked a question about a non-existing technology I made up, trying to keep the title as obscure and scary looking as possible, to get the Tumbleweed badge. Yes, this is not good behavior, I know :)
Well, what's interesting is that my question about something that doesn't exist was upvoted. It's impossible that whoever voted it understood the question and thought it was "useful" as it was designed to drive people away.
(I would link to it but then someone left a comment so I deleted it, and I don't have enough rep to see deleted questions)
share|improve this answer
+1 You're a great badge hunter... – Fabio Sep 5 '11 at 21:32
I don't think so.
As bmargulies mentioned, some truly worthless questions are being voted on.
I refuse to expend 2 rep to downvote when it'll back up soon after
Edit:
A prime example of vote up idiocy... How many bytes in a 32bit integer? ...5 down and now 4 up
share|improve this answer
A good argument for regular periodic recalcs? That question is now deleted and presumably all the rep from it doesn't count for anyone after a recalc. – Gnome Mar 21 '10 at 1:22
I'm going to assert, 'no.' My reason is as follows. I continually observe sympathy voting. Some truly awful question will get a downvote or two. Moments later, it's back to 0. The user is net positive for rep, reinforcing mediocre questions. The question is back to 0 or even above, giving it a rating it does not deserve.
I offer an example.
share|improve this answer
2
I was going to suggest that the fabled re-weighting of down-votes will help here. But 2 down-votes + 2 up-votes at -5 and +10 still gives a +10 rep gain. – ChrisF Jan 28 '10 at 16:04
One thing I do a bit more is downvote bad questions; I now downvote bad questions that are marked CW a lot more, so much so that I will go to a CW question just so I can downvote the question (and vote to close, if it isn't already closed). It hasn't really changed how I upvote good questions though, as I was doing that already.
I don't think the way I vote on answers has changed much either, except I will no longer go through all answers in a CW poll-type question up- and down-voting each one (this was the main way I exhausted my vote quota; I no longer ever run out).
share|improve this answer
The badge was not announced on the blog, and I don't recall it being mentioned on the podcast. The only people who know about it are those that got it, those that monitor the tags page aggressively, and those that spend enough time on meta to see an electorate related message float by.
Still, when the January data dump is made available you should be able to use stackql or another query service to find out what, if any, impact the new badge made on question votes.
share|improve this answer
So, basically noone knows about it. – Daniel Daranas Jan 28 '10 at 13:16
This is anecdotal, obviously:
I now go to Stack Overflow daily and expend my entire vote amount on questions. I don't vote on answers any more.
I guess this is to pay reparations for the fact that I used to vote on answers about 90% of the time.
share|improve this answer
It has increased them coming from me, so yes. Although my part is small relative to the whole.... Not that I particularly care about the badge, but the discussion around the badge got my attention.
share|improve this answer
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged .
|
{
"url": "http://meta.stackexchange.com/questions/37203/is-the-electorate-badge-working?answertab=active",
"source_domain": "meta.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "92059",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LKDIX6Q3MZCGKQNWJU7AJG3QSUUJZIIJ",
"WARC-Concurrent-To": "<urn:uuid:3a0db4f6-93eb-4429-8789-c844471c8d93>",
"WARC-Date": "2014-12-22T04:26:21Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:O4FWFD2W3Z5BOXFWTS5HVRTFF2QKPEKB",
"WARC-Record-ID": "<urn:uuid:bde9d9a2-acdf-4356-bcdc-1e9c7380606b>",
"WARC-Target-URI": "http://meta.stackexchange.com/questions/37203/is-the-electorate-badge-working?answertab=active",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2753ed88-d2a5-44ca-a143-be70a3c57a49>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-231-17-201.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-52\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for December 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
16,
173,
174,
268,
269,
297,
301,
354,
359,
471,
476,
558,
563,
680,
681,
693,
694,
951,
952,
1176,
1177,
1300,
1301,
1327,
1332,
1394,
1395,
1413,
1414,
1490,
1491,
1558,
1559,
1565,
1566,
1661,
1662,
1688,
1693,
1872,
1873,
2196,
2197,
2217,
2218,
2244,
2248,
2432,
2433,
2764,
2765,
3010,
3011,
3037,
3038,
3325,
3326,
3508,
3509,
3535,
3540,
3614,
3615,
3645,
3646,
3760,
3761,
3863,
3864,
3890,
3891,
4089,
4090,
4116,
4117,
4158,
4159
],
"line_end_idx": [
16,
173,
174,
268,
269,
297,
301,
354,
359,
471,
476,
558,
563,
680,
681,
693,
694,
951,
952,
1176,
1177,
1300,
1301,
1327,
1332,
1394,
1395,
1413,
1414,
1490,
1491,
1558,
1559,
1565,
1566,
1661,
1662,
1688,
1693,
1872,
1873,
2196,
2197,
2217,
2218,
2244,
2248,
2432,
2433,
2764,
2765,
3010,
3011,
3037,
3038,
3325,
3326,
3508,
3509,
3535,
3540,
3614,
3615,
3645,
3646,
3760,
3761,
3863,
3864,
3890,
3891,
4089,
4090,
4116,
4117,
4158,
4159,
4225
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4225,
"ccnet_original_nlines": 77,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4076029658317566,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04223864898085594,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21436114609241486,
"rps_doc_frac_unique_words": 0.43832021951675415,
"rps_doc_mean_word_length": 4.240157604217529,
"rps_doc_num_sentences": 45,
"rps_doc_symbol_to_word_ratio": 0.005279830191284418,
"rps_doc_unigram_entropy": 5.270345687866211,
"rps_doc_word_count": 762,
"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.03961621969938278,
"rps_doc_frac_chars_top_3gram": 0.047663260251283646,
"rps_doc_frac_chars_top_4gram": 0.00835654977709055,
"rps_doc_books_importance": -383.49505615234375,
"rps_doc_books_importance_length_correction": -383.49505615234375,
"rps_doc_openwebtext_importance": -223.55152893066406,
"rps_doc_openwebtext_importance_length_correction": -223.55152893066406,
"rps_doc_wikipedia_importance": -177.07125854492188,
"rps_doc_wikipedia_importance_length_correction": -177.07125854492188
},
"fasttext": {
"dclm": 0.15179967880249023,
"english": 0.969810426235199,
"fineweb_edu_approx": 1.030493974685669,
"eai_general_math": 0.13176566362380981,
"eai_open_web_math": 0.2703917622566223,
"eai_web_code": 0.0008484100108034909
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "302.22",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-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": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,450,192,057,265,743,000 |
Using Type-safe Generic Lists In Templates
From RAD Studio
Jump to: navigation, search
Go Up to Class Templates Overview Index
In general, when you need to write lots of nearly identical things, consider using templates. The problems with the following class definition, a generic list class,
class GList
{
public:
void insert( void * );
void *peek();
.
.
.
};
are that it isn't type-safe and common solutions need repeated class definitions. Since there's no type checking on what gets inserted, you have no way of knowing what results you'll get. You can solve the type-safe problem by writing a wrapper class:
class FooList : public GList {
public:
void insert( Foo *f ) { GList::insert( f ); }
Foo *peek() { return (Foo *)GList::peek(); }
.
.
.
};
This is type-safe. insert will only take arguments of type pointer-to-Foo or object-derived-from-Foo, so the underlying container will only hold pointers that in fact point to something of type Foo. This means that the cast in FooList::peek() is always safe, and you've created a true FooList. Now, to do the same thing for a BarList, a BazList, and so on, you need repeated separate class definitions. To solve the problem of repeated class definitions and type-safety, you can once again use templates. See the example for type-safe generic list class. The C++ Standard Template Library (STL) has a rich set of type-safe collection classes.
By using templates, you can create whatever type-safe lists you want, as needed, with a simple declaration. And there's no code generated by the type conversions from each wrapper class so there's no runtime overhead imposed by this type safety.
|
{
"url": "https://docwiki.embarcadero.com/RADStudio/Alexandria/en/Using_Type-safe_Generic_Lists_In_Templates",
"source_domain": "docwiki.embarcadero.com",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "22719",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YKCJEHNW44PIHIX5X32EAXXSIDBKPHX2",
"WARC-Concurrent-To": "<urn:uuid:fe8c7b6f-ec5e-4948-9607-3a653a3cdbc5>",
"WARC-Date": "2021-09-21T12:09:02Z",
"WARC-IP-Address": "204.61.221.122",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SJXGQPVQWGANADDN6DNFZ3OANZDGXDMB",
"WARC-Record-ID": "<urn:uuid:ebe060f5-2398-4498-96f3-a5149f4caac4>",
"WARC-Target-URI": "https://docwiki.embarcadero.com/RADStudio/Alexandria/en/Using_Type-safe_Generic_Lists_In_Templates",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:16afbbfe-a308-431d-8c9f-cbeef8e54350>"
},
"warc_info": "isPartOf: CC-MAIN-2021-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-22\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
43,
44,
60,
88,
89,
129,
130,
296,
297,
309,
311,
320,
346,
363,
369,
375,
381,
384,
385,
637,
638,
669,
678,
727,
775,
783,
791,
799,
802,
803,
1446,
1447
],
"line_end_idx": [
43,
44,
60,
88,
89,
129,
130,
296,
297,
309,
311,
320,
346,
363,
369,
375,
381,
384,
385,
637,
638,
669,
678,
727,
775,
783,
791,
799,
802,
803,
1446,
1447,
1692
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1692,
"ccnet_original_nlines": 32,
"rps_doc_curly_bracket": 0.00472813006490469,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3087431788444519,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00819671992212534,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24043716490268707,
"rps_doc_frac_unique_words": 0.55078125,
"rps_doc_mean_word_length": 4.93359375,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.659425735473633,
"rps_doc_word_count": 256,
"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.03800474852323532,
"rps_doc_frac_chars_top_3gram": 0.025336500257253647,
"rps_doc_frac_chars_top_4gram": 0.03325416147708893,
"rps_doc_books_importance": -154.5666961669922,
"rps_doc_books_importance_length_correction": -142.16094970703125,
"rps_doc_openwebtext_importance": -111.82371520996094,
"rps_doc_openwebtext_importance_length_correction": -111.82371520996094,
"rps_doc_wikipedia_importance": -76.32543182373047,
"rps_doc_wikipedia_importance_length_correction": -66.5293960571289
},
"fasttext": {
"dclm": 0.23112040758132935,
"english": 0.8319449424743652,
"fineweb_edu_approx": 2.468892812728882,
"eai_general_math": 0.9721082448959351,
"eai_open_web_math": 0.3483656644821167,
"eai_web_code": 0.8551390171051025
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,521,100,083,287,988,700 |
This week's book giveaways are in the Refactoring and Agile forums.
We're giving away four copies each of Re-engineering Legacy Software and Docker in Action and have the authors on-line!
See this thread and this one for details.
Win a copy of Re-engineering Legacy Software this week in the Refactoring forum
or Docker in Action in the Cloud/Virtualization forum!
Bookmark Topic Watch Topic
• New Topic
Standard Deviation
Stephen Barrow
Greenhorn
Posts: 13
• Mark post as helpful
• send pies
• Report post to moderator
Can somebody tell me how I can change this code to allow me to hard code the values into it? such as double [] values = {10,20,30,4,2};
import java.util.*;
public class Deviator
{
public static void main(String [] args)
{
Deviator deviator = new Deviator();
List values = deviator.getValues(args);
double mean = deviator.calculateMean(values);
double stddev = deviator.calculateStandardDeviation(values);
System.out.println("values: " + values);
System.out.println("mean : " + mean);
System.out.println("stddev: " + stddev);
System.out.println("No arguments");
}
public List getValues(final String [] args)
{
List values = new ArrayList();
for (int i = 0; i < args.length; ++i)
{
try
{
Double value = Double.valueOf(args[i]);
values.add(value);
}
catch (NumberFormatException e)
{
System.err.println("Not a number: " + args[i]);
}
}
return values;
}
public double calculateMean(final List values)
{
double mean = 0.0;
int numValues = values.size();
for (int i = 0; i < numValues; ++i)
mean += ((Double)values.get(i)).doubleValue();
return mean/numValues;
}
public double calculateStandardDeviation(final List values)
{
double mean = this.calculateMean(values);
double sum = 0.0;
int numValues = values.size();
for (int i = 0; i < numValues; ++i)
{
double value = ((Double)values.get(i)).doubleValue();
double diff = value - mean;
sum += diff*diff;
}
return Math.sqrt(sum/(numValues - 1));
}
}
fred rosenberger
lowercase baba
Bartender
Posts: 12087
29
Chrome Java Linux
• Mark post as helpful
• send pies
• Report post to moderator
There's no need to post this to multiple forums. most people just find it annoying, and it makes it harder to figure out where to post an answer.
Bookmark Topic Watch Topic
• New Topic
|
{
"url": "http://www.coderanch.com/t/373066/java/java/Standard-Deviation",
"source_domain": "www.coderanch.com",
"snapshot_id": "crawl=CC-MAIN-2016-18",
"warc_metadata": {
"Content-Length": "36990",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XURSBWLRE2QXNGBOIPNRMMA3IKB55WEH",
"WARC-Concurrent-To": "<urn:uuid:37f58578-33fa-4883-b0cb-eb2366e68032>",
"WARC-Date": "2016-05-05T22:16:05Z",
"WARC-IP-Address": "204.144.184.130",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:MHUQGZKUYDGMIHLQ2OW4HF5ZQIOAHU4Z",
"WARC-Record-ID": "<urn:uuid:d1918b71-0702-402a-ba5c-0d419a160b7e>",
"WARC-Target-URI": "http://www.coderanch.com/t/373066/java/java/Standard-Deviation",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4eb1717b-4829-4146-ab72-cbba2c1968a3>"
},
"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,
68,
188,
230,
310,
365,
396,
410,
411,
430,
431,
433,
448,
458,
468,
493,
507,
536,
672,
692,
714,
716,
756,
758,
759,
795,
835,
881,
942,
983,
1021,
1062,
1063,
1099,
1100,
1102,
1146,
1148,
1179,
1217,
1219,
1223,
1225,
1265,
1284,
1286,
1318,
1320,
1368,
1370,
1372,
1387,
1389,
1390,
1437,
1439,
1458,
1489,
1525,
1572,
1595,
1597,
1657,
1659,
1701,
1719,
1750,
1786,
1788,
1842,
1870,
1888,
1890,
1929,
1931,
1933,
1935,
1952,
1967,
1977,
1990,
1993,
2011,
2036,
2050,
2079,
2225,
2227,
2258
],
"line_end_idx": [
68,
188,
230,
310,
365,
396,
410,
411,
430,
431,
433,
448,
458,
468,
493,
507,
536,
672,
692,
714,
716,
756,
758,
759,
795,
835,
881,
942,
983,
1021,
1062,
1063,
1099,
1100,
1102,
1146,
1148,
1179,
1217,
1219,
1223,
1225,
1265,
1284,
1286,
1318,
1320,
1368,
1370,
1372,
1387,
1389,
1390,
1437,
1439,
1458,
1489,
1525,
1572,
1595,
1597,
1657,
1659,
1701,
1719,
1750,
1786,
1788,
1842,
1870,
1888,
1890,
1929,
1931,
1933,
1935,
1952,
1967,
1977,
1990,
1993,
2011,
2036,
2050,
2079,
2225,
2227,
2258,
2271
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2271,
"ccnet_original_nlines": 88,
"rps_doc_curly_bracket": 0.008806689642369747,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20037807524204254,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0018903600284829736,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.385633260011673,
"rps_doc_frac_unique_words": 0.5279720425605774,
"rps_doc_mean_word_length": 5.821678161621094,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.710816383361816,
"rps_doc_word_count": 286,
"rps_doc_frac_chars_dupe_10grams": 0.11051051318645477,
"rps_doc_frac_chars_dupe_5grams": 0.15435434877872467,
"rps_doc_frac_chars_dupe_6grams": 0.14894895255565643,
"rps_doc_frac_chars_dupe_7grams": 0.14894895255565643,
"rps_doc_frac_chars_dupe_8grams": 0.11051051318645477,
"rps_doc_frac_chars_dupe_9grams": 0.11051051318645477,
"rps_doc_frac_chars_top_2gram": 0.02402402088046074,
"rps_doc_frac_chars_top_3gram": 0.012612610124051571,
"rps_doc_frac_chars_top_4gram": 0.01441441010683775,
"rps_doc_books_importance": -188.6148223876953,
"rps_doc_books_importance_length_correction": -188.6148223876953,
"rps_doc_openwebtext_importance": -99.09860229492188,
"rps_doc_openwebtext_importance_length_correction": -99.09860229492188,
"rps_doc_wikipedia_importance": -87.8145523071289,
"rps_doc_wikipedia_importance_length_correction": -87.8145523071289
},
"fasttext": {
"dclm": 0.2371198534965515,
"english": 0.5897030830383301,
"fineweb_edu_approx": 1.6040881872177124,
"eai_general_math": 0.3850298523902893,
"eai_open_web_math": 0.3485940098762512,
"eai_web_code": 0.039059579372406006
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,322,281,311,190,563,000 |
[Samba] Samba 4 on AIX with XLC
Benjamin Huntsman BHuntsman at mail2.cu-portland.edu
Mon Jan 7 15:58:08 MST 2013
As a further follow-up, here's an example, from source3/utils/net_cache.c:
d_printf(_("Key: %s\t Timeout: %s\t Value: %s %s\n"), keystr,
timeout_str, datastr, timeout > now_t ? "": _("(expired)"));
My C skills aren't good enough to understand what's being done here, but the offending bit is the last argument to d_printf:
timeout > now_t ? "": _("(expired)")
Is there a way we can re-write this in more compatible way?
Apparently, this construction is supposed to look like:
(condition) ? (t_result) : (f_result)
and t_result and f_result must be of the same type. So do I read that "" is a char, and _("(expired)") is an int? Something like:
timeout > now_t ? atoi(""):_("(expired)") maybe?
Again, just grasping here...
... or maybe there's a flag to XLC to let us get by this?
Many thanks!
-Ben
More information about the samba mailing list
|
{
"url": "https://lists.samba.org/archive/samba/2013-January/170842.html",
"source_domain": "lists.samba.org",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "4104",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AVJC7IQW2LEQBP3ONHXXKXD5KHGPPCHB",
"WARC-Concurrent-To": "<urn:uuid:9a615898-82f4-4843-ada3-9f4f73513d42>",
"WARC-Date": "2021-03-06T15:31:20Z",
"WARC-IP-Address": "144.76.82.148",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QX23X3LPGE7JPJV5V3UT6PPNPCGDKNHY",
"WARC-Record-ID": "<urn:uuid:79f45d19-f751-48c9-af42-4bc92f1244ec>",
"WARC-Target-URI": "https://lists.samba.org/archive/samba/2013-January/170842.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:11f80fd0-e698-47d6-a2df-bdc412c1fa29>"
},
"warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-59.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
32,
33,
86,
114,
115,
116,
191,
192,
255,
333,
334,
459,
460,
497,
498,
558,
559,
615,
616,
654,
655,
787,
788,
837,
838,
867,
925,
926,
939,
940,
945,
946,
947,
948
],
"line_end_idx": [
32,
33,
86,
114,
115,
116,
191,
192,
255,
333,
334,
459,
460,
497,
498,
558,
559,
615,
616,
654,
655,
787,
788,
837,
838,
867,
925,
926,
939,
940,
945,
946,
947,
948,
993
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 993,
"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.33469387888908386,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02448979951441288,
"rps_doc_frac_lines_end_with_ellipsis": 0.02857143059372902,
"rps_doc_frac_no_alph_words": 0.359183669090271,
"rps_doc_frac_unique_words": 0.7430555820465088,
"rps_doc_mean_word_length": 4.68055534362793,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0.008163269609212875,
"rps_doc_unigram_entropy": 4.531813144683838,
"rps_doc_word_count": 144,
"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.048961419612169266,
"rps_doc_frac_chars_top_3gram": 0.053412459790706635,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -111.0226821899414,
"rps_doc_books_importance_length_correction": -111.0226821899414,
"rps_doc_openwebtext_importance": -65.06841278076172,
"rps_doc_openwebtext_importance_length_correction": -51.02412796020508,
"rps_doc_wikipedia_importance": -44.45402526855469,
"rps_doc_wikipedia_importance_length_correction": -44.45402526855469
},
"fasttext": {
"dclm": 0.05343794822692871,
"english": 0.8358635902404785,
"fineweb_edu_approx": 1.6913022994995117,
"eai_general_math": 0.043170031160116196,
"eai_open_web_math": 0.5942555069923401,
"eai_web_code": 0.03171074017882347
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,946,106,679,235,232,300 |
Titik D mempunyai vektor posisi r = t^2 i + 2 t j. Tentukan :
a. vektor posisi awal saat t = 0 sekon.
b. vektor posisi saat t = 2 sekon.
c. vektor posisi saat t = 4 sekon.
d. vektor perpindahan dari t = 2 sekon hingga t = 4 sekon.
1
Jawabanmu
2014-08-08T12:31:57+07:00
Karena ini yang ditanya vektor posisi tinggal dimasukkan aja nilai t masing2.
a. r= 0
b. r= t^2 i + 2t J
= 2^2 i + 2 (2) j
= 4i + 4j
c. r= 4^2 i + 2(4) j
= 16 i + 8 j
d. r saat 4 s- r saat 2 s
= (16 i + 8j) - (4i + 4j)
= 12 i + 4 j
|
{
"url": "https://brainly.co.id/tugas/302901",
"source_domain": "brainly.co.id",
"snapshot_id": "crawl=CC-MAIN-2016-50",
"warc_metadata": {
"Content-Length": "91516",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6NN3MVLFZF5SOYODKXBRAIR2FJM3BRGX",
"WARC-Concurrent-To": "<urn:uuid:796e69c3-2a37-46b0-bf0e-f425d0f7d818>",
"WARC-Date": "2016-12-10T07:40:31Z",
"WARC-IP-Address": "104.16.104.159",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:EIVCXUQSBIHCNMOBARBFUQNNHGJEZF42",
"WARC-Record-ID": "<urn:uuid:34c00e5d-ae4d-489f-8ca6-753733b64c8f>",
"WARC-Target-URI": "https://brainly.co.id/tugas/302901",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a7daf442-8dfb-42f5-b05c-603fb43bb56a>"
},
"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,
62,
102,
137,
172,
231,
232,
234,
235,
245,
246,
272,
350,
351,
359,
378,
402,
419,
440,
458,
484,
510
],
"line_end_idx": [
62,
102,
137,
172,
231,
232,
234,
235,
245,
246,
272,
350,
351,
359,
378,
402,
419,
440,
458,
484,
510,
522
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 522,
"ccnet_original_nlines": 21,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21387283504009247,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017341040074825287,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5144508481025696,
"rps_doc_frac_unique_words": 0.4423076808452606,
"rps_doc_mean_word_length": 3.048076868057251,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.531850576400757,
"rps_doc_word_count": 104,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.18927444517612457,
"rps_doc_frac_chars_top_3gram": 0.025236589834094048,
"rps_doc_frac_chars_top_4gram": 0.10725551843643188,
"rps_doc_books_importance": -79.13319396972656,
"rps_doc_books_importance_length_correction": -90.99497985839844,
"rps_doc_openwebtext_importance": -35.909969329833984,
"rps_doc_openwebtext_importance_length_correction": -47.77175521850586,
"rps_doc_wikipedia_importance": -23.2285099029541,
"rps_doc_wikipedia_importance_length_correction": -35.090293884277344
},
"fasttext": {
"dclm": 0.9329532980918884,
"english": 0.012513119727373123,
"fineweb_edu_approx": 0.8549249172210693,
"eai_general_math": 0.5375994443893433,
"eai_open_web_math": 0.9743679761886597,
"eai_web_code": 0.0036210999824106693
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.15",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "512.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,244,523,141,921,672,000 |
A_OldRingExplode
From SRB2 Wiki
Jump to: navigation, search
Test.png This article or section is incomplete. It doesn't have all of the necessary core information on this topic. Please help the SRB2 Wiki by finishing this article.
A_OldRingExplode is an action that makes the actor explode like the old Explosion Ring from version 1.09.4. Var1 sets the Object type used for the debris. The debris is thrown at a fixed speed of 20 fracunits/tic. 34 debris Objects are spawned in total, all fired in different directions – 16 directly sideways in different angles, 8 diagonally upwards, 8 diagonally downwards, one directly upwards, and one directly downwards. All debris objects additionally have their targets set to match the actor's, are colored to match their target if it is a player, are given MF2_DEBRIS and last only 5 tics each before disappearing.
Actions – Rings [view]
A_AttractChaseA_OldRingExplodeA_RingDrainA_RingExplodeA_ThrownRing
|
{
"url": "http://wiki.srb2.org/wiki/A_OldRingExplode",
"source_domain": "wiki.srb2.org",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "31317",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UDQYYIFZKSS77FZS37SY4D3ZSU3I7KAT",
"WARC-Concurrent-To": "<urn:uuid:335e03d7-c19c-4aff-b648-69db34af65ec>",
"WARC-Date": "2019-06-25T21:57:41Z",
"WARC-IP-Address": "104.31.91.75",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NQKCK5G3A3ORR6ZPYFEE63VZFEGMY7LF",
"WARC-Record-ID": "<urn:uuid:4b58873a-064e-4b6c-9f26-d85432e2d1ea>",
"WARC-Target-URI": "http://wiki.srb2.org/wiki/A_OldRingExplode",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:19e9add5-0792-4bb4-bfa3-1fc5ff47a795>"
},
"warc_info": "isPartOf: CC-MAIN-2019-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-137-110-251.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,
17,
18,
33,
61,
231,
232,
858,
859,
884
],
"line_end_idx": [
17,
18,
33,
61,
231,
232,
858,
859,
884,
950
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 950,
"ccnet_original_nlines": 9,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35428571701049805,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01714286021888256,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20571428537368774,
"rps_doc_frac_unique_words": 0.6875,
"rps_doc_mean_word_length": 5.340277671813965,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.447404861450195,
"rps_doc_word_count": 144,
"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.020806239917874336,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -76.63896942138672,
"rps_doc_books_importance_length_correction": -76.63896942138672,
"rps_doc_openwebtext_importance": -32.1448974609375,
"rps_doc_openwebtext_importance_length_correction": -19.18467903137207,
"rps_doc_wikipedia_importance": -33.53156661987305,
"rps_doc_wikipedia_importance_length_correction": -33.53156661987305
},
"fasttext": {
"dclm": 0.10985887050628662,
"english": 0.9015054702758789,
"fineweb_edu_approx": 1.8379441499710083,
"eai_general_math": 0.11153125762939453,
"eai_open_web_math": 0.32367414236068726,
"eai_web_code": 0.00006938000296941027
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "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": "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": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,115,475,332,930,877,000 |
Wikia
WoWWiki
Talk:Sharlin/Multiboxing New
99,182pages on
this wiki
Back to page | < User talk:Sharlin
Revision as of 19:05, June 27, 2008 by JIM the Bot (Talk | contribs)
(diff) ←Older revision | Latest revision (diff) | Newer revision → (diff)
What is MultiboxingEdit
Mutliboxing is a term used to denote one user playing mutliple accounts simulataneously. This can be done using one or more machines. Solutions exist for both the PC and Mac. There are also solutions for using both PC and Mac at the same time.
Why MultiboxEdit
For some players there is not enough challenge in playing only one character at a time. Others look to recreate the feel of old time Computer Role Playing Games where a well designed team was used to adventure together. There are also some who don't want to rely on others to play the game when one character is not enough.
Is it LegalEdit
The multiboxing solutions documented here do not violate Blizzard's EULA for the World of Warcraft game. None of the solutions modified game files, programs, or interferes with the data stream between the World of Warcraft Client or Server. See the Additional Resources section of this page for links to discussions with World of Warcraft Game Masters on this subject.
Is it ExpensiveEdit
Depends on how far you take it. Many computers today are quite capable of running multiple copies of the game simulataneously. Given the low system requirements it is very possible to run five copies at one time on some machines. Some of the solutions provided involve multiple machines and additional support hardware. Depending on how reliable you want your setup to be and how many accounts you wish to run simultaneously will determine your final costs. A single box solution is the cheapest route, a multibox solution the most expensive yet offers better protection from the standpoint that if the machine your playing on crashes you can quickly switch to another and continue playing.
Is it hard to doEdit
How complex of a solution do you want? A software only solution using one machine and multiple copies of the game is pretty straight forward. For many the real complexity is in writing macros that allow each character to function properly in the group. Since characters are sharing the same hot keys a lot of care must be put into what effects each hotkey activates. This end result is that you can become very knowledgeable in using the games Macro language and available Addons
Tell me HowEdit
This section will cover the basics of multiboxing. While hardware and software requirements will be mentioned, more extensive detail will be found on either of the following two pages Multiboxing Hardware Requirements and Multiboxing Software Requirements
Game SoftwareEdit
You will need to purchase the game, and depending on needs the expansion as well, for each account you wish to run simultaneously.
Each account must be installed either on a separate machine or into its own directory. Users of Mac computers can symbolic link the Data directory to save space when running multiple copies on one machine.
System HardwareEdit
To run two or more copies on the same machine it is recommended that it contain a dual core processor, discreet 3d graphics accelerator, and at least one gigabyte of memory. Additional copies on the same machine will require faster processors and more memory. When using multiple machines try to keep all of them identical.
Key Broadcasting softwareEdit
There are multiple methods of broadcasting keystrokes from one client to another, either on the same machine or across multiple machines.
Additional HardwareEdit
Keyboard, Video, and Mouse, switches (KVMs for short) are an option when using multiple machines. A Vetra Keyboard Multiplexer is one example for controlling multiple machines. Additional monitors may also be needed, note that the the secondary characters do not need to be on large monitors and there benefits with using smaller monitors to view their actions.
Game ConcernsEdit
Some of the choices you make are strictly within the game. From server type, character types, to the races of the characters.
PvE or PvPEdit
Player versus EnvironmentEdit
Player versus Environment is the easy solution. Even if the eventual goal is to play on an Player versus Player server getting practice with multiboxing will be much easier on the PvE server. PvE is very forgiving. Events are scripted, generally start when you start them, and allow for as many tries as you want.
Player versus PlayerEdit
Player verus Player is dynamic, as such you do not always control what happens or when it happens. PvP is intolerant of latency and many software options will not work well enough so it is suggested to use a hardware solution. It will also require more advance macros and more thought put into contingency plans that would never be needed for PvE. You can always move from a PvP server to a PvE server but not the other way.
Server SelectionEdit
Scout out the server and see what kind of ratio it has. Is it an old server or a new one? Old servers tend to have established PvP and knowledgeable players. It can be harder to find groups, not an issue if you are five boxing, and they tend to have a more vibrant auction system and economy. All told, go with an established server over a new one.
Class SelectionEdit
Class selection. This depends on both your playstyle and the type of server you play on. For the ability to heal and dish out burst damage choose a Priest and four Mages. Other options are to replace the Mages with Warlocks, replace the Priest with another healer class like a Druid, Shaman, or even a Paladin.
Due to game mechanics picking two classes is far easier to deal with than using three or more classes. Even if five different classes is more appropriate being able to direct it is another issue. It comes down to how consistent the actions between the classes are and how the hotkeys can best be shared between them. A special concern exists for Hunters who are the only class with a deadzone, an area where neither their ranged or melee attack can occur. When you are beginning multiboxing it is recommended to limit the number of classes.
Race SelectionEdit
Some consideration of racial abilities is warranted. Undead have Will of the Forsaken which breaks Fear which is very bad when grouped up. Dwarves have a Fear Ward as well but it must be cast ahead of time. Other good racials are the Tauren Warstomp and Blood Elf who have the ability chain two second stuns. Race selection also limits class selection so some choices will not be available regardless.
NamingEdit
Believe it or not, the names you pick for your characters make a difference. By picking logical names you will be quicker to react and it will be easier to tell your characters apart.
An example, where you have four Mages and one Priest. Choose a unique multi-letter name and then prefix it to identify which character is which. Naming the first four characters Amyname, Bmyname, Cmyname, and Dmyname, makes it easy to remember they are the the mages, whereas naming the priest Xmyname provides enough distinction to separate him out. You could also name them for their role in the party. Recognition of which character is which will come over time, using a naming strategy speeds up the process.
Other ConcernsEdit
Play Area LayoutEdit
Once again, this small detail makes a difference. If you run 5 or 6 monitors, I strongly suggest some logical order to how your characters are arranged and which computer runs which character. Your "main" is generally in the middle and the secondaries flank your main to either side. My personal choice is A in the lower left, B upper left, C upper right and D lower right. Clockwise with X in the lower middle. The upper middle is for browsing the internet, looking up quests, vent, etc. My key arrangement mirrors this and the X-Keys Desktop and Pro are perfect for this kind of setup as they have 8 keys wide and 5 vertical. Making your physical interface as intuitive as possible will speed the learning process and make far more logical sense when playing.
Getting StartedEdit
If you choose the hardware method the hard part is paying for it all. You will need four identical machines. Literally, identical machines, down to the revision numbers on the components. I build my own machines but buying them is certainly an option. This project, done at its most basic hardware level, will cost $4280, not counting tax and shipping. Done right, it will push $5k, plus monthly fees. Depending on your perspective, this may be a lot of money. Nobody ever said multiboxing at this level was cheap but I can certainly think of far more expensive hobbies.
LevelingEdit
Powerleveling does not really work in WoW, so leveling up is tricky if you already have a level 60 or 70 and want to add more characters. Short of paying a farmer to level up new characters for you, the best way to level is to level them all at the same time. You can do so with questing alone, questing and instances or just instances. Questing is a good bet as the experience is great, the mobs are easy and you get faction. However, you will want to avoid every single collection quest as you will need to do them five times. Not fun. I personally suggest instance grinding. Elites give great experience and about the time you get tired of an instance, you level out of it. The only downside is the time wasted learning the instance and at the lower levels, learning just how to multibox.
UI ModsEdit
Usually constrained to arranging the bars as you need them and letting you view the state of each of your characters. Pitbull and Bartender are two very good mods.
Button ModsEdit
There are button mods out there that allow you to physically represent the buttons you have on your X-keys on your UI. There are even some out there that will change the buttons when you hold down your alt modifier key.
Anchor ModsEdit
You will likely want to set it so that you cannot move the windows on your "secondary" machines. If you move one, they get desynched and clicking on them with your wireless mouse will not activate all of them.
MacrosEdit
Quest AcceptingEdit
There are quest accepting macros out there. They work pretty well for accepting quests on the "secondary" characters. Right click, hit the quest accept macro and you are done. Sharing quests is another way to do this but not every quest can be shared.
Pet MacrosEdit
This macro will make your pet attack your current target if you have a target. Otherwise, it will attack the focus target. For example, if you have multiple warlocks and assign each one a target, their corresponding pets will attack those targets or assist your main and attack your main's target instead.
/petattack
/stopmacro [target=target, exists]
/petattack [target=focustarget]
What Do I DO When My Main Dies?Edit
You need to setup your macros to allow for transitioning to another "main". This will mean physically moving to another mouse and changing your /assists or /focus to another character. This is doable with custom LUA scripts or simply a dedicated keyboard (or X-Key). I will leave that up to you - usually when my priest dies, I am out of mana and going down anyway. Often times it is faster to do this in battlegrounds as you rez with nearly full mana and health - but there are times when you will need to continue fighting and not just stand there. It took me quite a while to figure this one out - and I will leave this to you.
Example ImplementationsEdit
Xzin of Magtheridon (Xzin, Azin, Bzin, Czin, Dzin)Edit
My name is Xzin and I am (to the best of my knowledge) the only serious 5 boxer who was highly successful in PvP before the first WoW expansion came out. The reason for this is simple. I designed my setup from the beginning to support ultra low latency, maximum spell synergy and high burst damage dealing. Everything I did was carefully chosen to maximize my DPS and reaction times - even if there were other, slower or less reliable methods available. I took great pains to design a system that would work for me from the ground up and I had the resources to make it happen. Building bits and pieces will work but nothing is as good as doing it all at the same time with the exact same hardware.
While I am not the first person ever to box (people were doing it in Dark Age of Camelot http://www.teamwizzy.com and other prior MMORPGs such as EverQuest and the like), I achieved rank 13 on all five characters at the same time and am well known on my server and battlegroup as a player who knows how to play and was nothing to sneeze at in PvP. At times, I have singlehandedly changed the course of AVs and was able to "solo" every 5 man dungeon - with only cloth characters and a single healer.
Below, I present my views on multiboxing and lay out a guide to what I did and where I obtained my hardware. My focus was PvP from the beginning and I never started with two or three characters and expanded to five. I started with one, decided the game was too boring that way and moved straight to five. Not to sound egotistical but if there was a better way to do this, I certainly would love to know. Seriously. I would like to add it to my setup. Lastly, my setup is expensive. There are somewhat cheaper ways to do what I have done but not too many corners can be cut. Be prepared to lay out at least $5,000 or more to do this seriously. The setup I have listed below should be considered the bare minimum needed to do this. If you have decided that this is what you want to do - great. Read on. If not then well.... go back to playing normally or dual boxing. There is to the best of my knowledge no way to do this (well) for under two or three thousand US dollars.
So you want to four box (or more?) WoW? This is a serious decision and needs to be thought about BEFORE purchasing hardware or setting things up. To be done successfully, first identify your target goals. Do you want to PvE, requiring a more balanced group and a less time critical interface, or PvP, which requires maximum flexibility with somewhat more limited class selections, minimal latency and the full gamut of specialized hardware?
Hopefully you are coming across this guide as a Wiki. If so, please feel free to modify it and improve upon it. I am sure there is more that I could add here but I eventually tired of spelling this all out. I spent literally months figuring all of this out and quite a bit of money deciding on what works and what does not. I hope that the community will add on to this and potentially come up with something better. If nothing else, I hope this guide helps you out and makes your five boxing that much easier to do. Make sure you understand why you are doing things the way you are doing though - I set this up for myself and I know how it all fits together. Your success will depend greatly upon your ability to thoroughly understand your setup and improve upon it.
Before you begin, please be aware that increasing capabilities of graphics cards, processors, software drivers and software utilities are making it possible to multibox two (or potentially more) copies of WoW on a single machine with the same feature sets as my hardware method, described below. I am still a bit new to those options so I will not speak to them just yet, but I have tested a "low" high end processor (around $180) dual core system with a 8600 GT graphics card and 2 gigs of ram - running around the bank gives 55+ fps on both screens (minimum settings, except terrain distance, which is set to max) at a resolution of 1600 x 1280 per account. So, the hardware is able to make it happen without making huge FPS sacrifices (yes, I know you can play at 20 fps with huge graphics lag spikes but that is not acceptable for PvP). The hard part is how to send two mice to two copies of WoW on the same computer as well as broadcasting keyboard entry. If I am able to figure out how to do this, I would be able to theoretically use 6 computers to control 10 accounts.... meaning I can shave off $2000 of computer costs as well as remove the need for as many (possibly any) Vetras or KVMs. The only downside is this DOES require the use of "third party" programs. I cannot make any statement as to if Blizzard would consider banning somebody for using these programs but the fact that it has to hook into mouse and keyboard functions does put it in the "somewhat gray area' category. That said though, many other drivers, common network admin utilities and other simple things like the G15 keyboard do the exact same thing..... and none of the programs are bots or in anyway automate gameplay in a way to allow unattended gaming. I suppose Autohotkey could be scripted but then again I am not sure exactly how that would help you.... it is not like you could walk away and smash face in the BGs or have your character leveled for you. You still need to send input to the keyboard and move the mouse around.
If you are going to four box, you might as well five box. You get the ability to run your own group, can enter 5v5 Arenas, fill out an entire group yourself and the hardware costs are not too much greater to buy five over four. I personally suggest going for all five instead of four but you can work with four. However, if you are going to do four (about $850 more), you might consider only doing three. You get the benefits of being able to do a 3v3 arena team and three is much less complex than four.
Other ResourcesEdit
ForumsEdit
Dual Boxing Forums: http://www.dual-boxing.com/forums2/
Interview with a MultiboxerEdit
WoW Insider Interview: http://www.wowinsider.com/2006/12/15/interview-with-xzin-the-man-with-ten-arms/
Some Game Design TheoryEdit
Sirlin Game Design Theory: http://www.sirlin.net/archive/the-man-who-would-solo-a-40-man-raid/
GM ConversationsEdit
GM Conversations: http://www.imagedump.com/index.cgi?pick=setandget&tp=454222&poll_id=0&category_id=19&warned=y
Videos of gameplayEdit
[Video #1] [Video #2]
4+ Multiboxing BlogsEdit
• Æbox - 5 Shamans - [1]
• Captns Log - WoW [2]
• Q Cyber Shop - WoW [3]
• Micah - [4]
• Team Wizzy - DAoC [5]
Toxicmoon also known as Bradster. Has his own website http://www.bradster.net A five box gamer that has released many boxing videos. Two of his PVP videos was placed in the feature moved section of the popular site www.warcraftmovies.com
Dual-Boxing.com Forum http://www.bradster.net
Related PagesEdit
Multiboxing Hardware Requirements Multiboxing Software Requirements
Around Wikia's network
Random Wiki
|
{
"url": "http://www.wowwiki.com/User_talk:Sharlin/Multiboxing_New?oldid=1434075",
"source_domain": "www.wowwiki.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "84334",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6O5NFXN7ZYHRRN5VBNS45K4JEHGCIP4Y",
"WARC-Concurrent-To": "<urn:uuid:993caf7f-5272-456b-9bd2-ec8de5b9fdd2>",
"WARC-Date": "2013-12-10T18:27:10Z",
"WARC-IP-Address": "199.27.76.194",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:P7TL4WFPZFMYMU3EQFJZIA3N6Y6VKRPO",
"WARC-Record-ID": "<urn:uuid:04b25b33-3d81-480f-9cbf-fb41e2473a0b>",
"WARC-Target-URI": "http://www.wowwiki.com/User_talk:Sharlin/Multiboxing_New?oldid=1434075",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3fe159ce-c9d0-40c8-b851-45f54284d956>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
6,
7,
15,
16,
49,
50,
69,
83,
84,
123,
124,
197,
198,
276,
277,
278,
306,
307,
555,
556,
577,
578,
906,
907,
927,
928,
1301,
1302,
1326,
1327,
2022,
2023,
2048,
2049,
2533,
2534,
2554,
2555,
2815,
2816,
2838,
2839,
2974,
2975,
3185,
3186,
3210,
3211,
3539,
3540,
3574,
3575,
3717,
3718,
3746,
3747,
4113,
4114,
4136,
4137,
4267,
4268,
4287,
4288,
4322,
4323,
4641,
4642,
4671,
4672,
5101,
5102,
5127,
5128,
5481,
5482,
5506,
5507,
5822,
5823,
6368,
6369,
6370,
6393,
6394,
6800,
6801,
6816,
6817,
7005,
7006,
7523,
7524,
7525,
7548,
7549,
7574,
7575,
8341,
8342,
8343,
8367,
8368,
8943,
8944,
8945,
8962,
8963,
9759,
9760,
9761,
9777,
9778,
9946,
9947,
9948,
9968,
9969,
10193,
10194,
10195,
10215,
10216,
10430,
10431,
10432,
10447,
10448,
10472,
10473,
10729,
10730,
10731,
10750,
10751,
11061,
11062,
11077,
11116,
11152,
11157,
11158,
11159,
11199,
11200,
11835,
11836,
11837,
11869,
11870,
11929,
11930,
12632,
12633,
13136,
13137,
14113,
14114,
14559,
14560,
15332,
15333,
17352,
17353,
17862,
17863,
17887,
17888,
17903,
17904,
17964,
17965,
18001,
18002,
18109,
18110,
18142,
18143,
18242,
18243,
18268,
18269,
18385,
18386,
18387,
18414,
18415,
18441,
18442,
18471,
18472,
18501,
18528,
18557,
18575,
18603,
18604,
18605,
18847,
18848,
18898,
18899,
18921,
18922,
18994,
18995,
19024,
19025
],
"line_end_idx": [
6,
7,
15,
16,
49,
50,
69,
83,
84,
123,
124,
197,
198,
276,
277,
278,
306,
307,
555,
556,
577,
578,
906,
907,
927,
928,
1301,
1302,
1326,
1327,
2022,
2023,
2048,
2049,
2533,
2534,
2554,
2555,
2815,
2816,
2838,
2839,
2974,
2975,
3185,
3186,
3210,
3211,
3539,
3540,
3574,
3575,
3717,
3718,
3746,
3747,
4113,
4114,
4136,
4137,
4267,
4268,
4287,
4288,
4322,
4323,
4641,
4642,
4671,
4672,
5101,
5102,
5127,
5128,
5481,
5482,
5506,
5507,
5822,
5823,
6368,
6369,
6370,
6393,
6394,
6800,
6801,
6816,
6817,
7005,
7006,
7523,
7524,
7525,
7548,
7549,
7574,
7575,
8341,
8342,
8343,
8367,
8368,
8943,
8944,
8945,
8962,
8963,
9759,
9760,
9761,
9777,
9778,
9946,
9947,
9948,
9968,
9969,
10193,
10194,
10195,
10215,
10216,
10430,
10431,
10432,
10447,
10448,
10472,
10473,
10729,
10730,
10731,
10750,
10751,
11061,
11062,
11077,
11116,
11152,
11157,
11158,
11159,
11199,
11200,
11835,
11836,
11837,
11869,
11870,
11929,
11930,
12632,
12633,
13136,
13137,
14113,
14114,
14559,
14560,
15332,
15333,
17352,
17353,
17862,
17863,
17887,
17888,
17903,
17904,
17964,
17965,
18001,
18002,
18109,
18110,
18142,
18143,
18242,
18243,
18268,
18269,
18385,
18386,
18387,
18414,
18415,
18441,
18442,
18471,
18472,
18501,
18528,
18557,
18575,
18603,
18604,
18605,
18847,
18848,
18898,
18899,
18921,
18922,
18994,
18995,
19024,
19025,
19042
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 19042,
"ccnet_original_nlines": 208,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4629580080509186,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020326290279626846,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13319069147109985,
"rps_doc_frac_unique_words": 0.30843448638916016,
"rps_doc_mean_word_length": 4.611577987670898,
"rps_doc_num_sentences": 188,
"rps_doc_symbol_to_word_ratio": 0.0016047100070863962,
"rps_doc_unigram_entropy": 5.943958282470703,
"rps_doc_word_count": 3213,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.016737530007958412,
"rps_doc_frac_chars_dupe_6grams": 0.002969559980556369,
"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.0035094800405204296,
"rps_doc_frac_chars_top_3gram": 0.003779439954087138,
"rps_doc_frac_chars_top_4gram": 0.0035094800405204296,
"rps_doc_books_importance": -1554.8609619140625,
"rps_doc_books_importance_length_correction": -1554.8609619140625,
"rps_doc_openwebtext_importance": -758.1946411132812,
"rps_doc_openwebtext_importance_length_correction": -758.1946411132812,
"rps_doc_wikipedia_importance": -542.1954345703125,
"rps_doc_wikipedia_importance_length_correction": -542.1954345703125
},
"fasttext": {
"dclm": 0.09710556268692017,
"english": 0.9502931237220764,
"fineweb_edu_approx": 1.593814730644226,
"eai_general_math": 0.34982579946517944,
"eai_open_web_math": 0.2196691632270813,
"eai_web_code": 0.17739015817642212
}
}
|
{
"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.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,827,345,505,672,878,000 |
Source code for idem_aws.states.aws.config.config_recorder
"""State module for managing Amazon Config Recorder."""
import copy
from dataclasses import field
from dataclasses import make_dataclass
from typing import Any
from typing import Dict
from typing import List
__contracts__ = ["resource"]
TREQ = {
"absent": {
"require": [
"aws.config.delivery_channel.present",
],
},
}
[docs]async def present( hub, ctx, name: str, role_arn: str, recording_group: make_dataclass( "ConfigurationRecorder", [ ("allSupported", bool, field(default=None)), ("includeGlobalResourceTypes", bool, field(default=None)), ("resourceTypes", List[str], field(default=None)), ], ), resource_id: str = None, ) -> Dict[str, Any]: """Creates a new configuration recorder to record the selected resource configurations. Args: name(str): The name of the recorder. role_arn (str): Amazon Resource Name (ARN) of the IAM role used to describe the Amazon Web Services resources associated with the account. recording_group (dict[str, Any], Optional): Specifies the types of Amazon Web Services resources for which Config records configuration changes. * allSupported (bool, Optional): Specifies whether Config records configuration changes for every supported type of regional resource. If you set this option to true, when Config adds support for a new type of regional resource, it starts recording resources of that type automatically. If you set this option to true, you cannot enumerate a list of resourceTypes. * includeGlobalResourceTypes (bool, Optional): Specifies whether Config includes all supported types of global resources (for example, IAM resources) with the resources that it records. Before you can set this option to true, you must set the allSupported option to true. If you set this option to true, when Config adds support for a new type of global resource, it starts recording resources of that type automatically. The configuration details for any global resource are the same in all regions. To prevent duplicate configuration items, you should consider customizing Config in only one region to record global resources. * resourceTypes (list[str], Optional): A comma-separated list that specifies the types of Amazon Web Services resources for which Config records configuration changes (for example, AWS::EC2::Instance or AWS::CloudTrail::Trail). To record all configuration changes, you must set the allSupported option to true. If you set this option to false, when Config adds support for a new type of resource, it will not record resources of that type unless you manually add that type to your recording group. For a list of valid resourceTypes values, see the resourceType Value column in Supported Amazon Web Services resource Types. resource_id (str, Optional): The name of the recorder. Request syntax: .. code-block:: sls [aws-config-recorder]: aws.config.config_recorder.present: - name: 'string' - resource_id: 'string' - role_arn: 'string' - recording_group: 'dict' Returns: Dict[str, Any] Examples: .. code-block:: sls aws-config-recorder: aws.config.config_recorder.present: - name: 'config_recorder' - resource_id: 'config_recorder' - role_arn: 'arn:aws:iam::012345678912:role/aws-service-role/config.amazonaws.com/AWSServiceRoleForConfig' - recording_group: allSupported: false includeGlobalResourceTypes: false resourceTypes: - "AWS::ApiGateway::Stage" """ result = dict(comment=[], old_state=None, new_state=None, name=name, result=True) before = None resource_updated: bool = True if resource_id: resource = await hub.exec.boto3.client.config.describe_configuration_recorders( ctx, ConfigurationRecorderNames=[name], ) if not resource["result"]: result["comment"] = resource["comment"] result["result"] = False return result else: before = resource["ret"]["ConfigurationRecorders"][0] if before: resource_translated = ( hub.tool.aws.config.conversion_utils.convert_raw_config_recorder_to_present( ctx, raw_resource=before ) ) result["old_state"] = resource_translated resource_updated = await hub.tool.aws.config.config_utils.is_resource_updated( before=resource_translated, role_arn=role_arn, recording_group=recording_group, ) if ctx.get("test", False): result["new_state"] = hub.tool.aws.test_state_utils.generate_test_state( enforced_state={}, desired_state={ "name": name, "role_arn": role_arn, "resource_id": resource_id, "recording_group": recording_group, }, ) operation = "update" if before else "create" if before: if resource_updated: result["comment"] += [ f"Would {operation} aws.config.config_recorder '{name}'" ] else: result["comment"] += [ f"aws.config.config_recorder '{name}' already exists" ] else: result["comment"] += [ f"Would {operation} aws.config.config_recorder '{name}'" ] return result if resource_updated: update_ret = await hub.exec.boto3.client.config.put_configuration_recorder( ctx=ctx, ConfigurationRecorder={ "name": name, "roleARN": role_arn, "recordingGroup": recording_group, }, ) if not update_ret["result"]: result["comment"] = update_ret["comment"] result["result"] = False return result after_ret = await hub.exec.boto3.client.config.describe_configuration_recorders( ctx, ConfigurationRecorderNames=[name], ) if not after_ret["result"]: result["comment"] = after_ret["comment"] result["result"] = False return result result[ "new_state" ] = hub.tool.aws.config.conversion_utils.convert_raw_config_recorder_to_present( ctx, raw_resource=after_ret["ret"]["ConfigurationRecorders"][0] ) operation = "Created" if not before else "Updated" result["comment"] += [f"{operation} aws.config.config_recorder '{name}'"] else: result["comment"] += [f"aws.config.config_recorder '{name}' already exists"] result["new_state"] = copy.deepcopy(result["old_state"]) return result
[docs]async def absent(hub, ctx, name: str, resource_id: str = None) -> Dict[str, Any]: """Deletes the configuration recorder. After the configuration recorder is deleted, Config will not record resource configuration changes until you create a new configuration recorder. Args: name(str): The name of the recorder. resource_id(str, Optional): AWS Config configuration recorder Name. Idem automatically considers this resource being absent if this field is not specified. Returns: Dict[str, Any] Examples: .. code-block:: sls aws-config-recorder: aws.config.config_recorder.absent: - name: 'config_recorder' - resource_id: 'config_recorder' """ result = dict(comment=[], old_state=None, new_state=None, name=name, result=True) before = None if not resource_id: result["comment"] = hub.tool.aws.comment_utils.already_absent_comment( resource_type="aws.config.config_recorder", name=name ) return result resource = await hub.exec.boto3.client.config.describe_configuration_recorders( ctx, ConfigurationRecorderNames=[name], ) if not resource["result"]: if "NoSuchConfigurationRecorderException" in str(resource["comment"]): result["comment"] = hub.tool.aws.comment_utils.already_absent_comment( resource_type="aws.config.config_recorder", name=name ) return result result["comment"] = resource["comment"] result["result"] = False return result before = resource["ret"]["ConfigurationRecorders"][0] if before: translated_resource = ( hub.tool.aws.config.conversion_utils.convert_raw_config_recorder_to_present( ctx, raw_resource=before ) ) result["old_state"] = translated_resource else: result["comment"] = hub.tool.aws.comment_utils.already_absent_comment( resource_type="aws.config.config_recorder", name=name ) return result if ctx.get("test", False): result["comment"] = hub.tool.aws.comment_utils.would_delete_comment( resource_type="aws.config.config_recorder", name=name ) return result else: delete_ret = await hub.exec.boto3.client.config.delete_configuration_recorder( ctx, ConfigurationRecorderName=name ) result["result"] = delete_ret["result"] if not result["result"]: result["comment"] = delete_ret["comment"] return result result["comment"] = hub.tool.aws.comment_utils.delete_comment( resource_type="aws.config.config_recorder", name=name ) return result
[docs]async def describe(hub, ctx) -> Dict[str, Dict[str, Any]]: """Describe the resource in a way that can be recreated/managed with the corresponding "present" function. Return details about your config recorder. Returns: Dict[str, Any] Examples: .. code-block:: bash $ idem describe aws.config.config_recorder """ result = {} ret = await hub.exec.boto3.client.config.describe_configuration_recorders(ctx) if not ret["result"]: hub.log.warning(f"Could not describe configuration recorder {ret['comment']}") return {} for resource in ret["ret"]["ConfigurationRecorders"]: name = resource["name"] recorder_name = f"{name}-config-recorder" translated_resource = ( hub.tool.aws.config.conversion_utils.convert_raw_config_recorder_to_present( ctx, raw_resource=resource ) ) result[recorder_name] = { "aws.config.config_recorder.present": [ {parameter_key: parameter_value} for parameter_key, parameter_value in translated_resource.items() ] } return result
|
{
"url": "https://docs.idemproject.io/idem-aws/en/latest/_modules/idem_aws/states/aws/config/config_recorder.html",
"source_domain": "docs.idemproject.io",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "130592",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O4OG7OSMYW3B7QF6MRYTLQPAF5TFRFY6",
"WARC-Concurrent-To": "<urn:uuid:afd0ebc4-2f26-41a4-b924-7fadde1e154b>",
"WARC-Date": "2024-07-25T12:43:06Z",
"WARC-IP-Address": "18.160.46.32",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4TEQ3FNP6HMGN27EYAJDGUSNNFM7ECCG",
"WARC-Record-ID": "<urn:uuid:d6e7212f-b652-45ed-b6fe-de4b293ebda3>",
"WARC-Target-URI": "https://docs.idemproject.io/idem-aws/en/latest/_modules/idem_aws/states/aws/config/config_recorder.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:408af123-4add-4588-b4d3-4d8b643584c1>"
},
"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-103\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,
59,
60,
116,
128,
158,
197,
220,
244,
268,
269,
298,
299,
308,
324,
345,
396,
407,
414,
416,
417,
418,
5764,
8033
],
"line_end_idx": [
59,
60,
116,
128,
158,
197,
220,
244,
268,
269,
298,
299,
308,
324,
345,
396,
407,
414,
416,
417,
418,
5764,
8033,
8986
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8986,
"ccnet_original_nlines": 23,
"rps_doc_curly_bracket": 0.004228800069540739,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1450381726026535,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005452559795230627,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.41603052616119385,
"rps_doc_frac_unique_words": 0.30740275979042053,
"rps_doc_mean_word_length": 8.587202072143555,
"rps_doc_num_sentences": 158,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.023226261138916,
"rps_doc_word_count": 797,
"rps_doc_frac_chars_dupe_10grams": 0.055815309286117554,
"rps_doc_frac_chars_dupe_5grams": 0.3246639370918274,
"rps_doc_frac_chars_dupe_6grams": 0.2678258419036865,
"rps_doc_frac_chars_dupe_7grams": 0.18556399643421173,
"rps_doc_frac_chars_dupe_8grams": 0.15721799433231354,
"rps_doc_frac_chars_dupe_9grams": 0.07744009047746658,
"rps_doc_frac_chars_top_2gram": 0.022793689742684364,
"rps_doc_frac_chars_top_3gram": 0.01052016019821167,
"rps_doc_frac_chars_top_4gram": 0.01095850020647049,
"rps_doc_books_importance": -816.0377807617188,
"rps_doc_books_importance_length_correction": -816.0377807617188,
"rps_doc_openwebtext_importance": -413.7620849609375,
"rps_doc_openwebtext_importance_length_correction": -413.7620849609375,
"rps_doc_wikipedia_importance": -382.29345703125,
"rps_doc_wikipedia_importance_length_correction": -382.29345703125
},
"fasttext": {
"dclm": 0.46971678733825684,
"english": 0.4710014760494232,
"fineweb_edu_approx": 2.6537063121795654,
"eai_general_math": 0.608954131603241,
"eai_open_web_math": 0.07395123690366745,
"eai_web_code": 0.9613624811172485
}
}
|
{
"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": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,679,623,679,679,158,800 |
1
$\begingroup$
A version of my question was asked in 2019 (What is the difference between Mathematica and WolframAlpha Notebook Edition?) with no clear answer then. Is there anything new that that addresses this? Specifically, is there anything that Wolfram Alpha Notebook can do that Mathematica cannot do or anything Mathematica can do that Wolfram Alpha Notebook cannot do? I opened a few of my notebooks in both programs. Except for minor cosmetic differences, I didn't encounter any problems with either program executing the notebook functions. The old 2019 answer focused on free-form questions in Wolfram Alpha Notebook. But as far as I can tell, that same functionality is in Mathematica now. Is there anything in a notebook that one of the two cannot execute?
$\endgroup$
0
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.
Browse other questions tagged or ask your own question.
|
{
"url": "https://mathematica.stackexchange.com/questions/296308/whats-the-difference-between-mathematica-14-and-wolfram-alpha-notebook-14",
"source_domain": "mathematica.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "142051",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VUZFVVAOSHTNW5PCO6XQWF3D47OYBX4D",
"WARC-Concurrent-To": "<urn:uuid:329069cc-abdb-416f-8e24-f9fa9787d95e>",
"WARC-Date": "2024-05-27T13:04:18Z",
"WARC-IP-Address": "104.18.43.226",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GI267BNY6E3MT6AT5AXJTYTRPTNZWITI",
"WARC-Record-ID": "<urn:uuid:4f720859-d9e9-43d6-bed0-93ab08858679>",
"WARC-Target-URI": "https://mathematica.stackexchange.com/questions/296308/whats-the-difference-between-mathematica-14-and-wolfram-alpha-notebook-14",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b00d36ce-d75f-4c9c-a4a0-83d3ef6f7374>"
},
"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,
2,
16,
17,
772,
773,
785,
786,
788,
789,
801,
802,
918,
919
],
"line_end_idx": [
2,
16,
17,
772,
773,
785,
786,
788,
789,
801,
802,
918,
919,
974
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 974,
"ccnet_original_nlines": 13,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44262295961380005,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021857919171452522,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14754098653793335,
"rps_doc_frac_unique_words": 0.6075949668884277,
"rps_doc_mean_word_length": 4.97468376159668,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.355521202087402,
"rps_doc_word_count": 158,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02671756036579609,
"rps_doc_frac_chars_top_3gram": 0.057251911610364914,
"rps_doc_frac_chars_top_4gram": 0.06106869876384735,
"rps_doc_books_importance": -88.394775390625,
"rps_doc_books_importance_length_correction": -88.394775390625,
"rps_doc_openwebtext_importance": -42.0944709777832,
"rps_doc_openwebtext_importance_length_correction": -28.2948055267334,
"rps_doc_wikipedia_importance": -22.443281173706055,
"rps_doc_wikipedia_importance_length_correction": -22.443281173706055
},
"fasttext": {
"dclm": 0.5523556470870972,
"english": 0.9554851055145264,
"fineweb_edu_approx": 1.2259886264801025,
"eai_general_math": 0.000304340006550774,
"eai_open_web_math": 0.019733790308237076,
"eai_web_code": -0.000003220000053261174
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,186,803,471,670,294,000 |
Significance Test
Significance tests play a key role in experiments: they allow researchers to determine whether their data supports or rejects the null hypothesis, and consequently whether they can accept their alternative hypothesis.
This article is a part of the guide:
Discover 24 more articles on this topic
Browse Full Outline
In everyday language, "significance" means that something is meaningful or important, but in statistical language, the definition is more precise. Furthermore, significance here does not imply theoretical, practical or research importance. A result can be statistically significant but a rather unimportant finding considering the bigger picture! A result is statistically significant if it satisfies certain statistical criteria.
Quiz 1 Quiz 2 Quiz 3 All Quizzes
The P-Value and the Significance Level
Significance comes down to the relationship between two crucial quantities, the p-value and the significance level (alpha). We can call a result statistically significant when P < alpha. Let’s consider what each of these quantities represents.
• p-value: This is calculated after you obtain your results. It is the probability of observing an extreme effect even with the null hypothesis still being true. Importantly, it does not measure the size of an effect.
• alpha: This is decided on before gathering data. It is the probability of the study rejecting the null hypothesis despite it being true (i.e. the chance of committing a Type 1 error). It is essential an error rate and usually set at or below 5%.
A Comfortable Confidence Level
It’s important to remember that there is nothing inherent about a 5% confidence level; it is merely a common convention. Where exactly the threshold is set is largely determined by the data in question and what the researchers are trying to achieve.
• Sciences where random error and natural variation are likely to play a part (for example investigative biology) will likely be content with alpha set to 5%.
• If you can expect a high level of precision and accuracy with the measurements and instruments employed, alpha can be set lower.
P-values are between 0 and 1. If P is less than the cut-off you’ve pre-chosen, you should reject the null hypothesis in favor of the alternative. Alternatively, if P is greater than the cut-off, say 0.05, you should not reject the null.
A note about falsifiability: though you could be forgiven for thinking otherwise, any piece of research is technically setting out to prove or disprove the null hypothesis, and nothing more. The alternative hypothesis is correctly named – it is only a position that is (provisionally) accepted as an alternative after the null hypothesis has been ruled out. All a significant result tells us is that there is “something going on” as opposed to nothing.
A Word of Caution
If you are studying statistics for a university course, the above may well be sufficient when it comes to writing up a term paper or understanding the general concepts behind statistical testing. However, the fact is that statistics is a complex and evolving science, and nowhere near the panacea that many students believe it to be.
Interestingly, the ASA (American Statistical Association) has published some guidelines about the proper use of the p-value, which will be of interest to those publishing more serious research. Some of these recommendations are:
• p-values do not measure the probability that the studied hypothesis is true, or the probability that the data were produced by random chance alone.
• Scientific conclusions and business or policy decisions should not be based only on whether a p-value passes a specific threshold.
• A p-value, or statistical significance, does not measure the size of an effect or the importance of a result.
• By itself, a p-value does not provide a good measure of evidence regarding a model or hypothesis.
In other words, good research goes well beyond the simple yes/no mechanisms many students of statistics are first taught. A depth understanding of the limits of significance testing is beyond the scope of most students’ curricula, however it does confirm the fact that research is seldom black and white!
Full reference:
, (Nov 26, 2008). Significance Test. Retrieved Apr 25, 2024 from Explorable.com: https://explorable.com/significance-test
You Are Allowed To Copy The Text
The text in this article is licensed under the Creative Commons-License Attribution 4.0 International (CC BY 4.0).
This means you're free to copy, share and adapt any parts (or all) of the text in the article, as long as you give appropriate credit and provide a link/reference to this page.
That is it. You don't need our permission to copy the article; just include a link/reference back to this page. You can use it freely (with some kind of link), and we're also okay with people reprinting in publications like books, blogs, newsletters, course-material, papers, wikipedia and presentations (with clear attribution).
Want to stay up to date? Follow us!
|
{
"url": "https://explorable.com/significance-test?gid=1590",
"source_domain": "explorable.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "62711",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3W3HTC6VSG76KJSZ3CF2Q2LJMMGTWW4R",
"WARC-Concurrent-To": "<urn:uuid:8ad124a3-2dfb-4c62-a6e4-1718b491152d>",
"WARC-Date": "2024-04-25T15:23:00Z",
"WARC-IP-Address": "62.97.210.200",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:X4AD2T2LVKFH42SU5KZYTFH2SH3ETN7U",
"WARC-Record-ID": "<urn:uuid:f9eadb2f-f29e-4716-9117-ce3a378d30fe>",
"WARC-Target-URI": "https://explorable.com/significance-test?gid=1590",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:51362371-079f-4f30-b7b7-5081461f7b3e>"
},
"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-116\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
18,
19,
237,
238,
275,
276,
316,
317,
337,
338,
769,
770,
803,
804,
843,
844,
1088,
1089,
1309,
1310,
1560,
1561,
1562,
1563,
1564,
1565,
1596,
1597,
1847,
1848,
2009,
2142,
2143,
2380,
2381,
2834,
2835,
2853,
2854,
3188,
3189,
3418,
3419,
3571,
3706,
3820,
3922,
3923,
4228,
4229,
4246,
4247,
4369,
4370,
4403,
4404,
4519,
4520,
4697,
4698,
5028,
5029,
5030,
5031,
5032,
5033
],
"line_end_idx": [
18,
19,
237,
238,
275,
276,
316,
317,
337,
338,
769,
770,
803,
804,
843,
844,
1088,
1089,
1309,
1310,
1560,
1561,
1562,
1563,
1564,
1565,
1596,
1597,
1847,
1848,
2009,
2142,
2143,
2380,
2381,
2834,
2835,
2853,
2854,
3188,
3189,
3418,
3419,
3571,
3706,
3820,
3922,
3923,
4228,
4229,
4246,
4247,
4369,
4370,
4403,
4404,
4519,
4520,
4697,
4698,
5028,
5029,
5030,
5031,
5032,
5033,
5068
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5068,
"ccnet_original_nlines": 66,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42624619603157043,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015259410254657269,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17497457563877106,
"rps_doc_frac_unique_words": 0.45915842056274414,
"rps_doc_mean_word_length": 5.024752616882324,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.304507732391357,
"rps_doc_word_count": 808,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04088670015335083,
"rps_doc_frac_chars_dupe_6grams": 0.031034480780363083,
"rps_doc_frac_chars_dupe_7grams": 0.015270940028131008,
"rps_doc_frac_chars_dupe_8grams": 0.015270940028131008,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.012068970128893852,
"rps_doc_frac_chars_top_3gram": 0.025123149156570435,
"rps_doc_frac_chars_top_4gram": 0.009852220304310322,
"rps_doc_books_importance": -403.3456726074219,
"rps_doc_books_importance_length_correction": -403.3456726074219,
"rps_doc_openwebtext_importance": -282.7874450683594,
"rps_doc_openwebtext_importance_length_correction": -282.7874450683594,
"rps_doc_wikipedia_importance": -187.00123596191406,
"rps_doc_wikipedia_importance_length_correction": -187.00123596191406
},
"fasttext": {
"dclm": 0.28309154510498047,
"english": 0.9256879091262817,
"fineweb_edu_approx": 2.9025654792785645,
"eai_general_math": 0.8584093451499939,
"eai_open_web_math": 0.5529250502586365,
"eai_web_code": 0.18313151597976685
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,120,815,865,532,135,000 |
Provided by: libgetdata-doc_0.10.0-5build2_all bug
NAME
gd_delete — remove an entry from a Dirfile
SYNOPSIS
#include <getdata.h>
int gd_delete(DIRFILE *dirfile, const char *field_code, unsigned int flags);
DESCRIPTION
The gd_delete() function attempts to delete the field or alias specified by field_code
from the dirfile specified by dirfile. The field_code should not contain a representation
suffix.
The flags argument influences how the deletion attempt occurs. It may be zero, for the
default behaviour, or else one or more of the following flags, bitwise or'd together:
GD_DEL_DATA
If the field to be deleted is a RAW field, also delete the binary data file
associated with it. If field_code specified a RAW field and this flag is not
specified, the field will still be deleted but the binary file will be left
untouched.
GD_DEL_DEREF
If the field to be deleted is a CONST or CARRAY field which is used as a parameter
in the specification of other fields, resolve these other fields' dependence on
the deleted field by replacing instances of field_code in their field
specifications with the value of the scalar field.
GD_DEL_FORCE
Delete the indicated entry, even if it is used in the specification of other
fields, either as a input for a derived vector field or as a scalar parameter in a
field specification, or if it has aliases pointing to it.
GD_DEL_META
If the field to be deleted has metafields attached to it, attempt to delete those,
too. If the field has metafields and this flag is not specified, the call will
fail with the GD_E_DELETE error.
RETURN VALUE
On successful deletion, zero is returned. On error, a negative-valued error code is
returned. Possible error codes are:
GD_E_ACCMODE
The specified dirfile was opened read-only.
GD_E_ALLOC
The library was unable to allocate memory.
GD_E_BAD_CODE
The field specified by field_code was not found in the database.
GD_E_BAD_DIRFILE
The supplied dirfile was invalid.
GD_E_DELETE
The attempt to delete the field failed. Either it is used in the specification of
other fields and GD_DEL_FORCE or GD_DEL_DEREF was not specified, or it has
metafields and GD_DEL_META was not specified.
GD_E_INTERNAL_ERROR
An internal error occurred in the library while trying to perform the task. This
indicates a bug in the library. Please report the incident to the GetData
developers.
GD_E_IO An error occurred while trying to close or delete the binary file associated with
a RAW field.
GD_E_PROTECTED
The metadata of the fragment containing the field was protected from change. Or,
the deletion of the binary data file associated with a RAW field was attempted and
the data of the fragment was protected.
GD_E_UNKNOWN_ENCODING
The GD_DEL_DATA flag was given but the encoding scheme of the indicated format
specification fragment is not known to the library. As a result, the library was
unable to delete the binary file associated with a RAW field.
GD_E_UNSUPPORTED
The GD_DEL_DATA flag was given but the encoding scheme of the indicated format
specification fragment does not support deleting the binary file associated with a
RAW field.
The error code is also stored in the DIRFILE object and may be retrieved after this
function returns by calling gd_error(3). A descriptive error string for the error may be
obtained by calling gd_error_string(3).
HISTORY
The function dirfile_delete() appeared in GetData-0.5.0.
In GetData-0.7.0, this function was renamed to gd_delete().
In all GetData-0.8.x releases, passing an alias name to this function would delete the
target of the alias. To delete an alias itself, a separate function, gd_delete_alias()
was available.
In GetData-0.9.0, gd_delete_alias() was removed.
In GetData-0.10.0, the error return from this function changed from -1 to a negative-
valued error code.
SEE ALSO
gd_close(3), gd_error(3), gd_error_string(3), gd_metaflush(3), gd_open(3)
|
{
"url": "http://manpages.ubuntu.com/manpages/disco/man3/gd_delete.3.html",
"source_domain": "manpages.ubuntu.com",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "10121",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HROZVVO5IJYSXFDF455FJ4VQWPIAWZEF",
"WARC-Concurrent-To": "<urn:uuid:2d2de91f-7c7e-425b-bbdf-409a18b7f86e>",
"WARC-Date": "2019-11-16T21:26:15Z",
"WARC-IP-Address": "91.189.95.15",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2FDMY36AYNND27KRO7VJOZLZFCB75VTI",
"WARC-Record-ID": "<urn:uuid:9d32cbe3-304a-470b-bcfa-0a3d10ab36ca>",
"WARC-Target-URI": "http://manpages.ubuntu.com/manpages/disco/man3/gd_delete.3.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4a97637a-2cf8-431f-aed7-cf94f2772f53>"
},
"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-188.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,
51,
52,
57,
58,
108,
109,
118,
119,
147,
148,
232,
233,
245,
246,
344,
442,
457,
458,
556,
649,
650,
669,
767,
865,
963,
989,
990,
1010,
1108,
1206,
1304,
1370,
1371,
1391,
1489,
1587,
1660,
1661,
1680,
1778,
1876,
1924,
1925,
1938,
1939,
2037,
2081,
2082,
2102,
2161,
2162,
2180,
2238,
2239,
2260,
2340,
2341,
2365,
2414,
2415,
2434,
2532,
2630,
2691,
2692,
2719,
2817,
2915,
2942,
2943,
3041,
3069,
3070,
3092,
3190,
3288,
3343,
3344,
3373,
3471,
3569,
3646,
3647,
3671,
3769,
3867,
3893,
3894,
3992,
4090,
4137,
4138,
4146,
4147,
4211,
4212,
4279,
4280,
4378,
4476,
4498,
4499,
4555,
4556,
4654,
4680,
4681,
4690,
4691
],
"line_end_idx": [
51,
52,
57,
58,
108,
109,
118,
119,
147,
148,
232,
233,
245,
246,
344,
442,
457,
458,
556,
649,
650,
669,
767,
865,
963,
989,
990,
1010,
1108,
1206,
1304,
1370,
1371,
1391,
1489,
1587,
1660,
1661,
1680,
1778,
1876,
1924,
1925,
1938,
1939,
2037,
2081,
2082,
2102,
2161,
2162,
2180,
2238,
2239,
2260,
2340,
2341,
2365,
2414,
2415,
2434,
2532,
2630,
2691,
2692,
2719,
2817,
2915,
2942,
2943,
3041,
3069,
3070,
3092,
3190,
3288,
3343,
3344,
3373,
3471,
3569,
3646,
3647,
3671,
3769,
3867,
3893,
3894,
3992,
4090,
4137,
4138,
4146,
4147,
4211,
4212,
4279,
4280,
4378,
4476,
4498,
4499,
4555,
4556,
4654,
4680,
4681,
4690,
4691,
4771
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4771,
"ccnet_original_nlines": 109,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38679245114326477,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05256064981222153,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18328841030597687,
"rps_doc_frac_unique_words": 0.35333332419395447,
"rps_doc_mean_word_length": 5.108333110809326,
"rps_doc_num_sentences": 48,
"rps_doc_symbol_to_word_ratio": 0.0013477100292220712,
"rps_doc_unigram_entropy": 4.701126575469971,
"rps_doc_word_count": 600,
"rps_doc_frac_chars_dupe_10grams": 0.05546493083238602,
"rps_doc_frac_chars_dupe_5grams": 0.20783033967018127,
"rps_doc_frac_chars_dupe_6grams": 0.19412724673748016,
"rps_doc_frac_chars_dupe_7grams": 0.15399673581123352,
"rps_doc_frac_chars_dupe_8grams": 0.1357259452342987,
"rps_doc_frac_chars_dupe_9grams": 0.1083197370171547,
"rps_doc_frac_chars_top_2gram": 0.02349103055894375,
"rps_doc_frac_chars_top_3gram": 0.017618270590901375,
"rps_doc_frac_chars_top_4gram": 0.024796079844236374,
"rps_doc_books_importance": -342.85736083984375,
"rps_doc_books_importance_length_correction": -342.85736083984375,
"rps_doc_openwebtext_importance": -232.221435546875,
"rps_doc_openwebtext_importance_length_correction": -232.221435546875,
"rps_doc_wikipedia_importance": -183.44383239746094,
"rps_doc_wikipedia_importance_length_correction": -183.44383239746094
},
"fasttext": {
"dclm": 0.130440354347229,
"english": 0.8991076350212097,
"fineweb_edu_approx": 2.633857250213623,
"eai_general_math": 0.897675633430481,
"eai_open_web_math": 0.43684422969818115,
"eai_web_code": 0.8129608631134033
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-426,618,150,279,184,900 |
Robbie,
Just an initial pass over the patch.
* Robbie Harwood ([email protected]) wrote:
> Here's v12, both here and on my github:
> https://github.com/frozencemetery/postgres/tree/feature/gssencrypt12
I've started taking a look at this as it's a capability I've wanted us
to support for a *long* time.
> Subject: [PATCH 1/3] Move common GSSAPI code into its own files
Didn't look too closely at this as it's mostly just moving stuff around.
I'll review it more closely once the other items are addressed though.
> Subject: [PATCH 2/3] Connection encryption support for GSSAPI
> diff --git a/src/backend/libpq/auth.c b/src/backend/libpq/auth.c
> index 73d493e..94d95bd 100644
> --- a/src/backend/libpq/auth.c
> +++ b/src/backend/libpq/auth.c
> @@ -596,10 +596,12 @@ sendAuthRequest(Port *port, AuthRequest areq)
> pq_endmessage(&buf);
>
> /*
> - * Flush message so client will see it, except for AUTH_REQ_OK, which
> need
> - * not be sent until we are ready for queries.
> + * In most cases, we do not need to send AUTH_REQ_OK until we are ready
> + * for queries. However, if we are doing GSSAPI encryption, that
> request
> + * must go out immediately to ensure that all messages which follow the
> + * AUTH_REQ_OK are not grouped with it and can therefore be encrypted.
> */
> - if (areq != AUTH_REQ_OK)
> + if (areq != AUTH_REQ_OK || port->gss != NULL)
> pq_flush();
>
> CHECK_FOR_INTERRUPTS();
Do we actually need to send pq_flush *whenever* port->gss is not null?
Shouldn't this actually be port->gss->encrypt?
> diff --git a/src/backend/libpq/be-secure-gssapi.c
> b/src/backend/libpq/be-secure-gssapi.c
[...]
> +/*
> + * Wrapper function indicating whether we are currently performing GSSAPI
> + * connection encryption.
> + *
> + * gss->encrypt is set when connection parameters are processed, which
> happens
> + * immediately after AUTH_REQ_OK is sent.
> + */
> +static bool
> +be_gssapi_should_encrypt(Port *port)
> +{
> + if (port->gss->ctx == GSS_C_NO_CONTEXT)
> + return false;
> + return port->gss->encrypt;
> +}
be_gssapi_should_encrypt returns bool, which seems entirely reasonable,
but...
> +be_gssapi_write(Port *port, void *ptr, size_t len)
> +{
> + OM_uint32 major, minor;
> + gss_buffer_desc input, output;
> + ssize_t ret;
> + int conf;
> + uint32 netlen;
> + char lenbuf[4];
> +
> + ret = be_gssapi_should_encrypt(port);
Why are we storing the result into an ssize_t?
> + if (ret == -1)
> + return -1;
> + else if (ret == 0)
> + return secure_raw_write(port, ptr, len);
And then testing the result against -1...? Or a bare 0 for that matter?
> + /* encrypt the message */
> + output.value = NULL;
> + output.length = 0;
> +
> + input.value = ptr;
> + input.length = len;
> +
> + conf = 0;
> + major = gss_wrap(&minor, port->gss->ctx, 1, GSS_C_QOP_DEFAULT,
> + &input, &conf, &output);
> + if (GSS_ERROR(major))
> + {
> + pg_GSS_error(ERROR,
> + gettext_noop("GSSAPI wrap error"),
> + major, minor);
> + ret = -1;
> + goto cleanup;
> + }
> + else if (conf == 0)
> + {
> + ereport(FATAL, (errmsg("GSSAPI did not provide
> confidentiality")));
> + ret = -1;
> + goto cleanup;
> + }
> +
> + /* format for on-wire: 4 network-order bytes of length, then payload */
> + netlen = htonl(output.length);
> + memcpy(lenbuf, &netlen, 4);
> +
> + appendBinaryStringInfo(&port->gss->writebuf, lenbuf, 4);
> + appendBinaryStringInfo(&port->gss->writebuf, output.value,
> output.length);
That strikes me as a bit of overkill, we tend to just cast the pointer
to a (char *) rather than memcpy'ing the data just to get a different
pointer out of it.
> + /* recur to send any buffered data */
> + gss_release_buffer(&minor, &output);
> + return be_gssapi_write(port, ptr, len);
This feels a bit odd to be doing, honestly. We try to take a lot of
care to consider low-memory situation and to be careufl when it comes to
potential for infinite recursion and there's already a way to ask for
this function to be called again, isn't there?
> + cleanup:
> + if (output.value != NULL)
> + gss_release_buffer(&minor, &output);
> +
> + return ret;
> +}
There's no need for any of this. This goto will never be reached as
either a pg_GSS_error(ERROR) or an ereport(FATAL) isn't going to return
control to this path. That's one of the reasons to be careful with
memory allocation and to use appropriate memory contexts, we're going to
longjmp out of this code path and clean up the memory allocations by
free'ing the contexts that we no longer need. That is, on an ERROR
level failure, on FATAL, we're just going to exit, so we don't have to
worry about memory cleanup in that case. Note that in some cases we'll
actually promote an ERROR to a FATAL; that's particularly relevant here
as we tend to do that when we're in backend startup.
> +ssize_t
> +be_gssapi_read(Port *port, void *ptr, size_t len)
> +{
> + OM_uint32 major, minor;
> + gss_buffer_desc input, output;
> + ssize_t ret;
> + int conf = 0;
> +
> + ret = be_gssapi_should_encrypt(port);
> +
> + if (ret == -1)
> + return -1;
> + else if (ret == 0)
> + return secure_raw_read(port, ptr, len);
This has the same issue as be_gssapi_write(), noted above.
> + /* ensure proper behavior under recursion */
> + if (len == 0)
> + return 0;
> +
> + /* report any buffered data, then recur */
> + if (port->gss->buf.cursor > 0)
> + {
> + ret = be_gssapi_read_from_buffer(port, ptr, len);
> + if (ret > 0)
> + {
> + ssize_t r_ret =
> + be_gssapi_read(port, (char *)ptr + ret, len -
> ret);
> + if (r_ret < 0 && errno != EWOULDBLOCK
> +#ifdef EAGAIN
> + && errno != EAGAIN
> +#endif
> + )
> + /* connection is dead in some way */
> + return r_ret;
> + else if (r_ret < 0)
> + /* no more data right now */
> + return ret;
> + return ret + r_ret;
> + }
> + }
I'm really not excited by all the recursion. Further, I'd segregate the
variable declaration from such a complicated recursive call and probably
throw in another comment or comment-paragraph in there about what's
going on.
> + /* our buffer is now empty */
> + if (port->gss->buf.len < 4)
> + {
> + enlargeStringInfo(&port->gss->buf, 4 - port->gss->buf.len);
> + ret = secure_raw_read(port, port->gss->buf.data +
> port->gss->buf.len,
> + 4 -
> port->gss->buf.len);
> + if (ret < 0)
> + return ret;
> +
> + /* write length to buffer */
> + port->gss->buf.len += ret;
> + port->gss->buf.data[port->gss->buf.len] = '\0';
> + if (port->gss->buf.len < 4)
> + {
> + errno = EWOULDBLOCK;
> + return -1;
> + }
> + }
> +
> + /* we know the length of the packet at this point */
> + memcpy((char *)&input.length, port->gss->buf.data, 4);
> + input.length = ntohl(input.length);
> + enlargeStringInfo(&port->gss->buf, input.length - port->gss->buf.len +
> 4);
I'm aware that enlargeStringInfo() does check and handle the case where
the length ends up >1G, but that feels a bit grotty to me- are you sure
you want the generic enlargeStringInfo() to handle that case?
> + ret = be_gssapi_read_from_buffer(port, ptr, len);
> + cleanup:
> + if (output.value != NULL)
> + gss_release_buffer(&minor, &output);
> +
> + return ret;
Again, probably not much use using the goto's.
Similar comments regarding the libpq side of things.
> Subject: [PATCH 3/3] GSSAPI authentication cleanup
Why wouldn't this be part of patch #2?
Otherwise it looked pretty reasonable.
Thanks!
Stephen
Attachment: signature.asc
Description: Digital signature
Reply via email to
|
{
"url": "https://www.mail-archive.com/[email protected]/msg283866.html",
"source_domain": "www.mail-archive.com",
"snapshot_id": "crawl=CC-MAIN-2018-34",
"warc_metadata": {
"Content-Length": "20122",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5XRDYFIGALKB7T6WX65KXHKPPYEZEX6B",
"WARC-Concurrent-To": "<urn:uuid:a225f0f1-7d04-4d56-a676-13d9375c1692>",
"WARC-Date": "2018-08-20T06:15:04Z",
"WARC-IP-Address": "72.52.77.8",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MVLJ5HWX7ZG3GH6WI4F5UZGYCF242OOJ",
"WARC-Record-ID": "<urn:uuid:977be260-de02-4dd2-978c-6f23f107c892>",
"WARC-Target-URI": "https://www.mail-archive.com/[email protected]/msg283866.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:df9d9fe1-2684-4f60-8682-bdc6756e38b6>"
},
"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-244-94.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
8,
9,
46,
47,
93,
135,
206,
207,
278,
308,
309,
375,
376,
449,
520,
521,
585,
586,
653,
685,
718,
751,
821,
850,
854,
865,
944,
951,
1006,
1086,
1161,
1171,
1251,
1330,
1342,
1375,
1429,
1457,
1461,
1493,
1494,
1565,
1612,
1613,
1666,
1707,
1713,
1719,
1796,
1825,
1831,
1906,
1916,
1961,
1968,
1983,
2023,
2028,
2076,
2106,
2141,
2146,
2147,
2219,
2226,
2227,
2281,
2286,
2318,
2357,
2378,
2396,
2419,
2443,
2447,
2493,
2494,
2541,
2542,
2565,
2592,
2619,
2676,
2677,
2750,
2751,
2785,
2814,
2841,
2845,
2872,
2900,
2904,
2922,
2993,
3059,
3089,
3099,
3135,
3211,
3267,
3293,
3323,
3333,
3361,
3371,
3435,
3458,
3484,
3514,
3524,
3528,
3608,
3647,
3683,
3687,
3752,
3820,
3838,
3839,
3910,
3980,
3999,
4000,
4046,
4091,
4139,
4140,
4209,
4282,
4352,
4399,
4400,
4413,
4447,
4500,
4504,
4524,
4529,
4530,
4599,
4671,
4739,
4812,
4881,
4949,
5020,
5092,
5164,
5217,
5218,
5229,
5282,
5287,
5319,
5358,
5379,
5401,
5405,
5451,
5455,
5478,
5505,
5532,
5588,
5589,
5648,
5649,
5702,
5724,
5750,
5754,
5805,
5844,
5854,
5920,
5949,
5967,
6007,
6086,
6094,
6156,
6173,
6224,
6234,
6268,
6337,
6383,
6427,
6488,
6532,
6576,
6594,
6604,
6605,
6678,
6751,
6819,
6829,
6830,
6868,
6904,
6914,
6990,
7057,
7079,
7142,
7165,
7194,
7230,
7234,
7279,
7322,
7386,
7430,
7448,
7493,
7528,
7546,
7556,
7560,
7621,
7684,
7728,
7808,
7814,
7815,
7887,
7959,
8021,
8022,
8080,
8093,
8127,
8180,
8184,
8204,
8205,
8252,
8253,
8306,
8307,
8360,
8361,
8400,
8401,
8440,
8441,
8449,
8450,
8458,
8459,
8485,
8516,
8517
],
"line_end_idx": [
8,
9,
46,
47,
93,
135,
206,
207,
278,
308,
309,
375,
376,
449,
520,
521,
585,
586,
653,
685,
718,
751,
821,
850,
854,
865,
944,
951,
1006,
1086,
1161,
1171,
1251,
1330,
1342,
1375,
1429,
1457,
1461,
1493,
1494,
1565,
1612,
1613,
1666,
1707,
1713,
1719,
1796,
1825,
1831,
1906,
1916,
1961,
1968,
1983,
2023,
2028,
2076,
2106,
2141,
2146,
2147,
2219,
2226,
2227,
2281,
2286,
2318,
2357,
2378,
2396,
2419,
2443,
2447,
2493,
2494,
2541,
2542,
2565,
2592,
2619,
2676,
2677,
2750,
2751,
2785,
2814,
2841,
2845,
2872,
2900,
2904,
2922,
2993,
3059,
3089,
3099,
3135,
3211,
3267,
3293,
3323,
3333,
3361,
3371,
3435,
3458,
3484,
3514,
3524,
3528,
3608,
3647,
3683,
3687,
3752,
3820,
3838,
3839,
3910,
3980,
3999,
4000,
4046,
4091,
4139,
4140,
4209,
4282,
4352,
4399,
4400,
4413,
4447,
4500,
4504,
4524,
4529,
4530,
4599,
4671,
4739,
4812,
4881,
4949,
5020,
5092,
5164,
5217,
5218,
5229,
5282,
5287,
5319,
5358,
5379,
5401,
5405,
5451,
5455,
5478,
5505,
5532,
5588,
5589,
5648,
5649,
5702,
5724,
5750,
5754,
5805,
5844,
5854,
5920,
5949,
5967,
6007,
6086,
6094,
6156,
6173,
6224,
6234,
6268,
6337,
6383,
6427,
6488,
6532,
6576,
6594,
6604,
6605,
6678,
6751,
6819,
6829,
6830,
6868,
6904,
6914,
6990,
7057,
7079,
7142,
7165,
7194,
7230,
7234,
7279,
7322,
7386,
7430,
7448,
7493,
7528,
7546,
7556,
7560,
7621,
7684,
7728,
7808,
7814,
7815,
7887,
7959,
8021,
8022,
8080,
8093,
8127,
8180,
8184,
8204,
8205,
8252,
8253,
8306,
8307,
8360,
8361,
8400,
8401,
8440,
8441,
8449,
8450,
8458,
8459,
8485,
8516,
8517,
8535
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8535,
"ccnet_original_nlines": 255,
"rps_doc_curly_bracket": 0.001991800032556057,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20987653732299805,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022119339555501938,
"rps_doc_frac_lines_end_with_ellipsis": 0.00390625,
"rps_doc_frac_no_alph_words": 0.471707820892334,
"rps_doc_frac_unique_words": 0.4454443156719208,
"rps_doc_mean_word_length": 5.518560409545898,
"rps_doc_num_sentences": 77,
"rps_doc_symbol_to_word_ratio": 0.00360081996768713,
"rps_doc_unigram_entropy": 5.51210880279541,
"rps_doc_word_count": 889,
"rps_doc_frac_chars_dupe_10grams": 0.043212391436100006,
"rps_doc_frac_chars_dupe_5grams": 0.07786384224891663,
"rps_doc_frac_chars_dupe_6grams": 0.07786384224891663,
"rps_doc_frac_chars_dupe_7grams": 0.0676722377538681,
"rps_doc_frac_chars_dupe_8grams": 0.0676722377538681,
"rps_doc_frac_chars_dupe_9grams": 0.043212391436100006,
"rps_doc_frac_chars_top_2gram": 0.006114960182458162,
"rps_doc_frac_chars_top_3gram": 0.004891970194876194,
"rps_doc_frac_chars_top_4gram": 0.007337950170040131,
"rps_doc_books_importance": -950.8603515625,
"rps_doc_books_importance_length_correction": -950.8603515625,
"rps_doc_openwebtext_importance": -812.1891479492188,
"rps_doc_openwebtext_importance_length_correction": -812.1891479492188,
"rps_doc_wikipedia_importance": -713.5200805664062,
"rps_doc_wikipedia_importance_length_correction": -713.5200805664062
},
"fasttext": {
"dclm": 0.1692647933959961,
"english": 0.7284818887710571,
"fineweb_edu_approx": 1.280058741569519,
"eai_general_math": 0.047114789485931396,
"eai_open_web_math": 0.5197539329528809,
"eai_web_code": 0.13902342319488525
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.758",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "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": "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": "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": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,451,935,088,647,096,000 |
Audra Haag
Audra Haag
1656732567
How to Easily Create A RESTful API with Flask and APIFairy
This tutorial demonstrates how to easily create a RESTful API with Flask and APIFairy.
Objectives
By the end of this tutorial, you'll be able to:
1. Create API endpoints in Flask using the decorators provided by APIFairy
2. Utilize Flask-Marshmallow to define the schemas for inputs/outputs to the API endpoints
3. Generate the API documentation using APIFairy
4. Integrate a relational database with the API endpoints
5. Implement basic and token authentication using Flask-HTTPAuth
Source: https://testdriven.io
#api #flask
What is GEEK
Buddha Community
How to Easily Create A RESTful API with Flask and APIFairy
Easter Deckow
Easter Deckow
1655630160
PyTumblr: A Python Tumblr API v2 Client
PyTumblr
Installation
Install via pip:
$ pip install pytumblr
Install from source:
$ git clone https://github.com/tumblr/pytumblr.git
$ cd pytumblr
$ python setup.py install
Usage
Create a client
A pytumblr.TumblrRestClient is the object you'll make all of your calls to the Tumblr API through. Creating one is this easy:
client = pytumblr.TumblrRestClient(
'<consumer_key>',
'<consumer_secret>',
'<oauth_token>',
'<oauth_secret>',
)
client.info() # Grabs the current user information
Two easy ways to get your credentials to are:
1. The built-in interactive_console.py tool (if you already have a consumer key & secret)
2. The Tumblr API console at https://api.tumblr.com/console
3. Get sample login code at https://api.tumblr.com/console/calls/user/info
Supported Methods
User Methods
client.info() # get information about the authenticating user
client.dashboard() # get the dashboard for the authenticating user
client.likes() # get the likes for the authenticating user
client.following() # get the blogs followed by the authenticating user
client.follow('codingjester.tumblr.com') # follow a blog
client.unfollow('codingjester.tumblr.com') # unfollow a blog
client.like(id, reblogkey) # like a post
client.unlike(id, reblogkey) # unlike a post
Blog Methods
client.blog_info(blogName) # get information about a blog
client.posts(blogName, **params) # get posts for a blog
client.avatar(blogName) # get the avatar for a blog
client.blog_likes(blogName) # get the likes on a blog
client.followers(blogName) # get the followers of a blog
client.blog_following(blogName) # get the publicly exposed blogs that [blogName] follows
client.queue(blogName) # get the queue for a given blog
client.submission(blogName) # get the submissions for a given blog
Post Methods
Creating posts
PyTumblr lets you create all of the various types that Tumblr supports. When using these types there are a few defaults that are able to be used with any post type.
The default supported types are described below.
• state - a string, the state of the post. Supported types are published, draft, queue, private
• tags - a list, a list of strings that you want tagged on the post. eg: ["testing", "magic", "1"]
• tweet - a string, the string of the customized tweet you want. eg: "Man I love my mega awesome post!"
• date - a string, the customized GMT that you want
• format - a string, the format that your post is in. Support types are html or markdown
• slug - a string, the slug for the url of the post you want
We'll show examples throughout of these default examples while showcasing all the specific post types.
Creating a photo post
Creating a photo post supports a bunch of different options plus the described default options * caption - a string, the user supplied caption * link - a string, the "click-through" url for the photo * source - a string, the url for the photo you want to use (use this or the data parameter) * data - a list or string, a list of filepaths or a single file path for multipart file upload
#Creates a photo post using a source URL
client.create_photo(blogName, state="published", tags=["testing", "ok"],
source="https://68.media.tumblr.com/b965fbb2e501610a29d80ffb6fb3e1ad/tumblr_n55vdeTse11rn1906o1_500.jpg")
#Creates a photo post using a local filepath
client.create_photo(blogName, state="queue", tags=["testing", "ok"],
tweet="Woah this is an incredible sweet post [URL]",
data="/Users/johnb/path/to/my/image.jpg")
#Creates a photoset post using several local filepaths
client.create_photo(blogName, state="draft", tags=["jb is cool"], format="markdown",
data=["/Users/johnb/path/to/my/image.jpg", "/Users/johnb/Pictures/kittens.jpg"],
caption="## Mega sweet kittens")
Creating a text post
Creating a text post supports the same options as default and just a two other parameters * title - a string, the optional title for the post. Supports markdown or html * body - a string, the body of the of the post. Supports markdown or html
#Creating a text post
client.create_text(blogName, state="published", slug="testing-text-posts", title="Testing", body="testing1 2 3 4")
Creating a quote post
Creating a quote post supports the same options as default and two other parameter * quote - a string, the full text of the qote. Supports markdown or html * source - a string, the cited source. HTML supported
#Creating a quote post
client.create_quote(blogName, state="queue", quote="I am the Walrus", source="Ringo")
Creating a link post
• title - a string, the title of post that you want. Supports HTML entities.
• url - a string, the url that you want to create a link post for.
• description - a string, the desciption of the link that you have
#Create a link post
client.create_link(blogName, title="I like to search things, you should too.", url="https://duckduckgo.com",
description="Search is pretty cool when a duck does it.")
Creating a chat post
Creating a chat post supports the same options as default and two other parameters * title - a string, the title of the chat post * conversation - a string, the text of the conversation/chat, with diablog labels (no html)
#Create a chat post
chat = """John: Testing can be fun!
Renee: Testing is tedious and so are you.
John: Aw.
"""
client.create_chat(blogName, title="Renee just doesn't understand.", conversation=chat, tags=["renee", "testing"])
Creating an audio post
Creating an audio post allows for all default options and a has 3 other parameters. The only thing to keep in mind while dealing with audio posts is to make sure that you use the external_url parameter or data. You cannot use both at the same time. * caption - a string, the caption for your post * external_url - a string, the url of the site that hosts the audio file * data - a string, the filepath of the audio file you want to upload to Tumblr
#Creating an audio file
client.create_audio(blogName, caption="Rock out.", data="/Users/johnb/Music/my/new/sweet/album.mp3")
#lets use soundcloud!
client.create_audio(blogName, caption="Mega rock out.", external_url="https://soundcloud.com/skrillex/sets/recess")
Creating a video post
Creating a video post allows for all default options and has three other options. Like the other post types, it has some restrictions. You cannot use the embed and data parameters at the same time. * caption - a string, the caption for your post * embed - a string, the HTML embed code for the video * data - a string, the path of the file you want to upload
#Creating an upload from YouTube
client.create_video(blogName, caption="Jon Snow. Mega ridiculous sword.",
embed="http://www.youtube.com/watch?v=40pUYLacrj4")
#Creating a video post from local file
client.create_video(blogName, caption="testing", data="/Users/johnb/testing/ok/blah.mov")
Editing a post
Updating a post requires you knowing what type a post you're updating. You'll be able to supply to the post any of the options given above for updates.
client.edit_post(blogName, id=post_id, type="text", title="Updated")
client.edit_post(blogName, id=post_id, type="photo", data="/Users/johnb/mega/awesome.jpg")
Reblogging a Post
Reblogging a post just requires knowing the post id and the reblog key, which is supplied in the JSON of any post object.
client.reblog(blogName, id=125356, reblog_key="reblog_key")
Deleting a post
Deleting just requires that you own the post and have the post id
client.delete_post(blogName, 123456) # Deletes your post :(
A note on tags: When passing tags, as params, please pass them as a list (not a comma-separated string):
client.create_text(blogName, tags=['hello', 'world'], ...)
Getting notes for a post
In order to get the notes for a post, you need to have the post id and the blog that it is on.
data = client.notes(blogName, id='123456')
The results include a timestamp you can use to make future calls.
data = client.notes(blogName, id='123456', before_timestamp=data["_links"]["next"]["query_params"]["before_timestamp"])
Tagged Methods
# get posts with a given tag
client.tagged(tag, **params)
Using the interactive console
This client comes with a nice interactive console to run you through the OAuth process, grab your tokens (and store them for future use).
You'll need pyyaml installed to run it, but then it's just:
$ python interactive-console.py
and away you go! Tokens are stored in ~/.tumblr and are also shared by other Tumblr API clients like the Ruby client.
Running tests
The tests (and coverage reports) are run with nose, like this:
python setup.py test
Author: tumblr
Source Code: https://github.com/tumblr/pytumblr
License: Apache-2.0 license
#python #api
Wilford Pagac
Wilford Pagac
1594289280
What is REST API? An Overview | Liquid Web
What is REST?
The REST acronym is defined as a “REpresentational State Transfer” and is designed to take advantage of existing HTTP protocols when used for Web APIs. It is very flexible in that it is not tied to resources or methods and has the ability to handle different calls and data formats. Because REST API is not constrained to an XML format like SOAP, it can return multiple other formats depending on what is needed. If a service adheres to this style, it is considered a “RESTful” application. REST allows components to access and manage functions within another application.
REST was initially defined in a dissertation by Roy Fielding’s twenty years ago. He proposed these standards as an alternative to SOAP (The Simple Object Access Protocol is a simple standard for accessing objects and exchanging structured messages within a distributed computing environment). REST (or RESTful) defines the general rules used to regulate the interactions between web apps utilizing the HTTP protocol for CRUD (create, retrieve, update, delete) operations.
What is an API?
An API (or Application Programming Interface) provides a method of interaction between two systems.
What is a RESTful API?
A RESTful API (or application program interface) uses HTTP requests to GET, PUT, POST, and DELETE data following the REST standards. This allows two pieces of software to communicate with each other. In essence, REST API is a set of remote calls using standard methods to return data in a specific format.
The systems that interact in this manner can be very different. Each app may use a unique programming language, operating system, database, etc. So, how do we create a system that can easily communicate and understand other apps?? This is where the Rest API is used as an interaction system.
When using a RESTful API, we should determine in advance what resources we want to expose to the outside world. Typically, the RESTful API service is implemented, keeping the following ideas in mind:
• Format: There should be no restrictions on the data exchange format
• Implementation: REST is based entirely on HTTP
• Service Definition: Because REST is very flexible, API can be modified to ensure the application understands the request/response format.
• The RESTful API focuses on resources and how efficiently you perform operations with it using HTTP.
The features of the REST API design style state:
• Each entity must have a unique identifier.
• Standard methods should be used to read and modify data.
• It should provide support for different types of resources.
• The interactions should be stateless.
For REST to fit this model, we must adhere to the following rules:
• Client-Server Architecture: The interface is separate from the server-side data repository. This affords flexibility and the development of components independently of each other.
• Detachment: The client connections are not stored on the server between requests.
• Cacheability: It must be explicitly stated whether the client can store responses.
• Multi-level: The API should work whether it interacts directly with a server or through an additional layer, like a load balancer.
#tutorials #api #application #application programming interface #crud #http #json #programming #protocols #representational state transfer #rest #rest api #rest api graphql #rest api json #rest api xml #restful #soap #xml #yaml
An API-First Approach For Designing Restful APIs | Hacker Noon
I’ve been working with Restful APIs for some time now and one thing that I love to do is to talk about APIs.
So, today I will show you how to build an API using the API-First approach and Design First with OpenAPI Specification.
First thing first, if you don’t know what’s an API-First approach means, it would be nice you stop reading this and check the blog post that I wrote to the Farfetchs blog where I explain everything that you need to know to start an API using API-First.
Preparing the ground
Before you get your hands dirty, let’s prepare the ground and understand the use case that will be developed.
Tools
If you desire to reproduce the examples that will be shown here, you will need some of those items below.
• NodeJS
• OpenAPI Specification
• Text Editor (I’ll use VSCode)
• Command Line
Use Case
To keep easy to understand, let’s use the Todo List App, it is a very common concept beyond the software development community.
#api #rest-api #openai #api-first-development #api-design #apis #restful-apis #restful-api
Lets Cms
Lets Cms
1652251629
Unilevel MLM Wordpress Rest API FrontEnd | UMW Rest API Woocommerce
Unilevel MLM Wordpress Rest API FrontEnd | UMW Rest API Woocommerce Price USA, Philippines : Our API’s handle the Unilevel MLM woo-commerce end user all functionalities like customer login/register. You can request any type of information which is listed below, our API will provide you managed results for your all frontend needs, which will be useful for your applications like Mobile App etc.
Business to Customer REST API for Unilevel MLM Woo-Commerce will empower your Woo-commerce site with the most powerful Unilevel MLM Woo-Commerce REST API, you will be able to get and send data to your marketplace from other mobile apps or websites using HTTP Rest API request.
Our plugin is used JWT authentication for the authorization process.
REST API Unilevel MLM Woo-commerce plugin contains following APIs.
User Login Rest API
User Register Rest API
User Join Rest API
Get User info Rest API
Get Affiliate URL Rest API
Get Downlines list Rest API
Get Bank Details Rest API
Save Bank Details Rest API
Get Genealogy JSON Rest API
Get Total Earning Rest API
Get Current Balance Rest API
Get Payout Details Rest API
Get Payout List Rest API
Get Commissions List Rest API
Withdrawal Request Rest API
Get Withdrawal List Rest API
If you want to know more information and any queries regarding Unilevel MLM Rest API Woocommerce WordPress Plugin, you can contact our experts through
Skype: jks0586,
Mail: [email protected],
Website: www.letscms.com, www.mlmtrees.com,
Call/WhatsApp/WeChat: +91-9717478599.
more information : https://www.mlmtrees.com/product/unilevel-mlm-woocommerce-rest-api-addon
Visit Documentation : https://letscms.com/documents/umw_apis/umw-apis-addon-documentation.html
#Unilevel_MLM_WooCommerce_Rest_API's_Addon #umw_mlm_rest_api #rest_api_woocommerce_unilevel #rest_api_in_woocommerce #rest_api_woocommerce #rest_api_woocommerce_documentation #rest_api_woocommerce_php #api_rest_de_woocommerce #woocommerce_rest_api_in_android #woocommerce_rest_api_in_wordpress #Rest_API_Woocommerce_unilevel_mlm #wp_rest_api_woocommerce
Lets Cms
Lets Cms
1652251528
Opencart REST API extensions - V3.x | Rest API Integration, Affiliate
Opencart REST API extensions - V3.x | Rest API Integration : OpenCart APIs is fully integrated with the OpenCart REST API. This is interact with your OpenCart site by sending and receiving data as JSON (JavaScript Object Notation) objects. Using the OpenCart REST API you can register the customers and purchasing the products and it provides data access to the content of OpenCart users like which is publicly accessible via the REST API. This APIs also provide the E-commerce Mobile Apps.
Opencart REST API
OCRESTAPI Module allows the customer purchasing product from the website it just like E-commerce APIs its also available mobile version APIs.
Opencart Rest APIs List
Customer Registration GET APIs.
Customer Registration POST APIs.
Customer Login GET APIs.
Customer Login POST APIs.
Checkout Confirm GET APIs.
Checkout Confirm POST APIs.
If you want to know Opencart REST API Any information, you can contact us at -
Skype: jks0586,
Email: [email protected],
Website: www.letscms.com, www.mlmtrees.com
Call/WhatsApp/WeChat: +91–9717478599.
Download : https://www.opencart.com/index.php?route=marketplace/extension/info&extension_id=43174&filter_search=ocrest%20api
View Documentation : https://www.letscms.com/documents/api/opencart-rest-api.html
More Information : https://www.letscms.com/blog/Rest-API-Opencart
VEDIO : https://vimeo.com/682154292
#opencart_api_for_android #Opencart_rest_admin_api #opencart_rest_api #Rest_API_Integration #oc_rest_api #rest_api_ecommerce #rest_api_mobile #rest_api_opencart #rest_api_github #rest_api_documentation #opencart_rest_admin_api #rest_api_for_opencart_mobile_app #opencart_shopping_cart_rest_api #opencart_json_api
|
{
"url": "https://morioh.com/p/0177a2c95f04",
"source_domain": "morioh.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "32959",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LKS5U7EDMJK7L7A3VULVMNYSMV6ALBBT",
"WARC-Concurrent-To": "<urn:uuid:d4d1f45a-fe4d-44e6-a443-149b3962f2af>",
"WARC-Date": "2022-08-16T17:07:55Z",
"WARC-IP-Address": "104.26.5.246",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:POO3VMW7PZ7MNCPW6CUKAQZZEH42DGJA",
"WARC-Record-ID": "<urn:uuid:aee481c8-a552-482c-9905-05ac19d4c4ca>",
"WARC-Target-URI": "https://morioh.com/p/0177a2c95f04",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c3358030-b422-42a6-91ae-17471c912acb>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-91\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
12,
13,
24,
25,
36,
37,
96,
97,
184,
185,
196,
197,
245,
246,
323,
416,
467,
527,
594,
595,
625,
626,
639,
640,
653,
654,
671,
672,
731,
746,
747,
761,
762,
773,
774,
814,
815,
824,
825,
838,
839,
856,
857,
880,
881,
902,
903,
954,
968,
994,
995,
1001,
1002,
1018,
1019,
1145,
1146,
1182,
1204,
1229,
1250,
1272,
1274,
1275,
1326,
1327,
1373,
1374,
1466,
1528,
1605,
1606,
1624,
1625,
1638,
1639,
1701,
1768,
1827,
1898,
1899,
1956,
2017,
2018,
2059,
2104,
2105,
2118,
2119,
2177,
2233,
2285,
2339,
2396,
2485,
2541,
2608,
2609,
2622,
2623,
2638,
2639,
2804,
2805,
2854,
2855,
2953,
3054,
3160,
3214,
3305,
3368,
3369,
3472,
3473,
3495,
3496,
3883,
3884,
3925,
3998,
4124,
4125,
4170,
4239,
4312,
4374,
4375,
4430,
4515,
4616,
4669,
4670,
4691,
4692,
4935,
4936,
4958,
5073,
5074,
5096,
5097,
5307,
5308,
5331,
5417,
5418,
5439,
5440,
5519,
5588,
5657,
5677,
5786,
5863,
5864,
5885,
5886,
6108,
6109,
6129,
6165,
6207,
6217,
6221,
6336,
6337,
6360,
6361,
6810,
6811,
6835,
6936,
6937,
6959,
7075,
7076,
7098,
7099,
7458,
7459,
7492,
7566,
7638,
7639,
7678,
7768,
7769,
7784,
7785,
7937,
7938,
8007,
8098,
8099,
8117,
8118,
8240,
8241,
8301,
8302,
8318,
8319,
8385,
8386,
8446,
8447,
8552,
8553,
8612,
8613,
8638,
8639,
8734,
8735,
8778,
8779,
8845,
8846,
8966,
8967,
8982,
8983,
9012,
9041,
9042,
9072,
9073,
9211,
9212,
9272,
9273,
9305,
9306,
9424,
9425,
9439,
9440,
9503,
9504,
9525,
9526,
9541,
9589,
9617,
9618,
9632,
9633,
9648,
9649,
9663,
9664,
9675,
9676,
9719,
9720,
9734,
9735,
10308,
10309,
10781,
10782,
10798,
10799,
10899,
10900,
10923,
10924,
11230,
11231,
11523,
11524,
11724,
11725,
11797,
11848,
11990,
12094,
12095,
12144,
12145,
12192,
12253,
12317,
12359,
12360,
12427,
12428,
12612,
12698,
12785,
12920,
12921,
13149,
13150,
13213,
13214,
13323,
13324,
13444,
13445,
13698,
13699,
13720,
13721,
13831,
13832,
13838,
13839,
13945,
13946,
13957,
13983,
14017,
14034,
14035,
14044,
14045,
14173,
14174,
14265,
14266,
14275,
14276,
14285,
14286,
14297,
14298,
14366,
14367,
14763,
15040,
15109,
15110,
15177,
15197,
15220,
15239,
15262,
15290,
15318,
15344,
15371,
15399,
15426,
15455,
15483,
15508,
15538,
15566,
15595,
15596,
15748,
15765,
15793,
15837,
15877,
15878,
15970,
15971,
16066,
16067,
16421,
16422,
16431,
16432,
16441,
16442,
16453,
16454,
16524,
16525,
17016,
17017,
17036,
17178,
17179,
17204,
17236,
17269,
17294,
17320,
17347,
17375,
17376,
17377,
17456,
17472,
17501,
17544,
17582,
17583,
17708,
17790,
17856,
17894,
17895
],
"line_end_idx": [
12,
13,
24,
25,
36,
37,
96,
97,
184,
185,
196,
197,
245,
246,
323,
416,
467,
527,
594,
595,
625,
626,
639,
640,
653,
654,
671,
672,
731,
746,
747,
761,
762,
773,
774,
814,
815,
824,
825,
838,
839,
856,
857,
880,
881,
902,
903,
954,
968,
994,
995,
1001,
1002,
1018,
1019,
1145,
1146,
1182,
1204,
1229,
1250,
1272,
1274,
1275,
1326,
1327,
1373,
1374,
1466,
1528,
1605,
1606,
1624,
1625,
1638,
1639,
1701,
1768,
1827,
1898,
1899,
1956,
2017,
2018,
2059,
2104,
2105,
2118,
2119,
2177,
2233,
2285,
2339,
2396,
2485,
2541,
2608,
2609,
2622,
2623,
2638,
2639,
2804,
2805,
2854,
2855,
2953,
3054,
3160,
3214,
3305,
3368,
3369,
3472,
3473,
3495,
3496,
3883,
3884,
3925,
3998,
4124,
4125,
4170,
4239,
4312,
4374,
4375,
4430,
4515,
4616,
4669,
4670,
4691,
4692,
4935,
4936,
4958,
5073,
5074,
5096,
5097,
5307,
5308,
5331,
5417,
5418,
5439,
5440,
5519,
5588,
5657,
5677,
5786,
5863,
5864,
5885,
5886,
6108,
6109,
6129,
6165,
6207,
6217,
6221,
6336,
6337,
6360,
6361,
6810,
6811,
6835,
6936,
6937,
6959,
7075,
7076,
7098,
7099,
7458,
7459,
7492,
7566,
7638,
7639,
7678,
7768,
7769,
7784,
7785,
7937,
7938,
8007,
8098,
8099,
8117,
8118,
8240,
8241,
8301,
8302,
8318,
8319,
8385,
8386,
8446,
8447,
8552,
8553,
8612,
8613,
8638,
8639,
8734,
8735,
8778,
8779,
8845,
8846,
8966,
8967,
8982,
8983,
9012,
9041,
9042,
9072,
9073,
9211,
9212,
9272,
9273,
9305,
9306,
9424,
9425,
9439,
9440,
9503,
9504,
9525,
9526,
9541,
9589,
9617,
9618,
9632,
9633,
9648,
9649,
9663,
9664,
9675,
9676,
9719,
9720,
9734,
9735,
10308,
10309,
10781,
10782,
10798,
10799,
10899,
10900,
10923,
10924,
11230,
11231,
11523,
11524,
11724,
11725,
11797,
11848,
11990,
12094,
12095,
12144,
12145,
12192,
12253,
12317,
12359,
12360,
12427,
12428,
12612,
12698,
12785,
12920,
12921,
13149,
13150,
13213,
13214,
13323,
13324,
13444,
13445,
13698,
13699,
13720,
13721,
13831,
13832,
13838,
13839,
13945,
13946,
13957,
13983,
14017,
14034,
14035,
14044,
14045,
14173,
14174,
14265,
14266,
14275,
14276,
14285,
14286,
14297,
14298,
14366,
14367,
14763,
15040,
15109,
15110,
15177,
15197,
15220,
15239,
15262,
15290,
15318,
15344,
15371,
15399,
15426,
15455,
15483,
15508,
15538,
15566,
15595,
15596,
15748,
15765,
15793,
15837,
15877,
15878,
15970,
15971,
16066,
16067,
16421,
16422,
16431,
16432,
16441,
16442,
16453,
16454,
16524,
16525,
17016,
17017,
17036,
17178,
17179,
17204,
17236,
17269,
17294,
17320,
17347,
17375,
17376,
17377,
17456,
17472,
17501,
17544,
17582,
17583,
17708,
17790,
17856,
17894,
17895,
18207
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 18207,
"ccnet_original_nlines": 397,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27235662937164307,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04185919836163521,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24599075317382812,
"rps_doc_frac_unique_words": 0.3133971393108368,
"rps_doc_mean_word_length": 5.614832401275635,
"rps_doc_num_sentences": 206,
"rps_doc_symbol_to_word_ratio": 0.024463169276714325,
"rps_doc_unigram_entropy": 5.71470308303833,
"rps_doc_word_count": 2508,
"rps_doc_frac_chars_dupe_10grams": 0.031529609113931656,
"rps_doc_frac_chars_dupe_5grams": 0.07591251283884048,
"rps_doc_frac_chars_dupe_6grams": 0.05901150032877922,
"rps_doc_frac_chars_dupe_7grams": 0.04956682026386261,
"rps_doc_frac_chars_dupe_8grams": 0.04076125845313072,
"rps_doc_frac_chars_dupe_9grams": 0.031529609113931656,
"rps_doc_frac_chars_top_2gram": 0.02137479931116104,
"rps_doc_frac_chars_top_3gram": 0.01633290946483612,
"rps_doc_frac_chars_top_4gram": 0.0036216399166733027,
"rps_doc_books_importance": -1286.942138671875,
"rps_doc_books_importance_length_correction": -1286.942138671875,
"rps_doc_openwebtext_importance": -861.7925415039062,
"rps_doc_openwebtext_importance_length_correction": -861.7925415039062,
"rps_doc_wikipedia_importance": -753.35107421875,
"rps_doc_wikipedia_importance_length_correction": -753.35107421875
},
"fasttext": {
"dclm": 0.08191871643066406,
"english": 0.7688409090042114,
"fineweb_edu_approx": 1.8607767820358276,
"eai_general_math": 0.04182333126664162,
"eai_open_web_math": 0.09461790323257446,
"eai_web_code": 0.5685561299324036
}
}
|
{
"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": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,818,215,645,334,624,000 |
Sky's自留地
关注互联网安全，关注安全&攻击技术。
LVS负载均衡之DR模型实例
学习类 生活类 阅读: 3865 0 评
LVS负载均衡中的DR模型是现实生产环境中应用最广泛的一种模型，只要能理解DR模型的原理，实际操作起来是非常简单的。另外LVS是基于四层负载均衡，nginx负载基于七层负载，在应用方向上会有一些区别。
好了，不多说，下面是LVS负载均衡DR模型中Director主机和RealServer机器上配置脚本，不详细解释每一项说明，相信大家都能看懂，另外，因为是实验环境，所以只有一台Director和2台RealServer，如果是生产环境，肯定要考虑Director冗余的问题。
Director主机上面脚本如下：
#!/bin/sh
#chkconfig:2345 08 92
#description:ipvsadm
#
VIP=192.168.16.200
RealServer1=192.168.10.253
RealServer2=192.168.10.254
. /etc/rc.d/init.d/functions
retval=0
start()
{
# Since this is the Director we must be able to forward packets
echo 1 > /proc/sys/net/ipv4/ip_forward
# Add ip address and route
/sbin/ifconfig eth0:0 $VIP broadcast $VIP netmask 255.255.255.255 up
/sbin/route add -host $VIP dev eth0:0
# Clear all iptables rules and Reset iptables counters
/sbin/iptables -F
/sbin/iptables -Z
# Clear all ipvsadm rules
/sbin/ipvsadm -C
# Add ipvsadm rules
/sbin/ipvsadm -A -t $VIP:80 -s wlc -p 120
/sbin/ipvsadm -a -t $VIP:80 -r $RealServer1:80 -g -w 1
/sbin/ipvsadm -a -t $VIP:80 -r $RealServer2:80 -g -w 1
touch /var/lock/subsys/ipvsadm > /dev/null 2 >&1
echo "ipvsadm started [ok]"
}
stop()
{
echo 0 > /proc/sys/net/ipv4/ip_forward
/sbin/ipvsadm -C
ifconfig eth0:0 down
route del $VIP
rm -rf /var/lock/subsys/ipvsadm > /dev/null 2 >&1
echo "ipvsadm stoped [ok]"
}
status()
{
if [ ! -e /var/lock/subsys/ipvsadm ];then
echo "ipvsadm is stoped ..."
exit 1
else
echo "ipvsadm is running ..."
/sbin/ipvsadm -L -n
fi
}
case "$1" in
start)
start
;;
stop)
stop
;;
status)
status
;;
restart)
stop
start
;;
*)
echo $"Usage: $0 {start|stop|restart|status}"
retval=1
esac
exit $retval
</ol>
RealServer主机上面脚本如下：
<ol>
#!/bin/bash
VIP=192.168.16.200
. /etc/rc.d/init.d/functions
case "$1" in
start)
/sbin/ifconfig lo:0 $VIP broadcast $VIP netmask 255.255.255.255 up
/sbin/route add -host $VIP dev lo:0
echo 1 >/proc/sys/net/ipv4/conf/lo/arp_ignore
echo 2 >/proc/sys/net/ipv4/conf/lo/arp_announce
echo 1 >/proc/sys/net/ipv4/conf/all/arp_ignore
echo 2 >/proc/sys/net/ipv4/conf/all/arp_announce
echo "RealServer Start Ok"
;;
stop)
/sbin/ifconfig lo:0 down
/sbin/route del $VIP >/dev/null 2 >&1
echo 0 >/proc/sys/net/ipv4/conf/lo/arp_ignore
echo 0 >/proc/sys/net/ipv4/conf/lo/arp_announce
echo 0 >/proc/sys/net/ipv4/conf/all/arp_ignore
echo 0 >/proc/sys/net/ipv4/conf/all/arp_announce
echo "RealServer Stoped Ok"
;;
status)
islothere=`/sbin/ifconfig lo:0 | grep $VIP`
isrothere=`netstat -rn | grep "lo:0" | grep $VIP`
if [ ! -z "$islothere" -o ! -z "$isrothere" ];then
echo "LVS-DR real server Stopped."
else
echo "LVS-DR real server Running."
fi
*)
echo "Usage: $0 {start|stop|status}"
exit 1
esac
Linux下配置rdate时间服务器
发表评论
撰写评论
|
{
"url": "https://blog.03sec.com/889.shtml",
"source_domain": "blog.03sec.com",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "18416",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2SOUENHKUEPLK7E5KWECKLS7JMGV4BGB",
"WARC-Concurrent-To": "<urn:uuid:956aef79-241a-4f88-b33c-fc4ce7a33eaa>",
"WARC-Date": "2019-11-11T21:58:56Z",
"WARC-IP-Address": "35.221.241.221",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KSPDN4U4NRVJV7I5JIYR3AOXGMS23JZ3",
"WARC-Record-ID": "<urn:uuid:4411d24b-c894-4887-b7d1-535f323be004>",
"WARC-Target-URI": "https://blog.03sec.com/889.shtml",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5b7cc540-bae8-421b-b33f-40c63d6e506c>"
},
"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-14.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,
9,
10,
29,
30,
45,
46,
67,
68,
169,
307,
325,
326,
336,
358,
379,
381,
382,
401,
428,
455,
456,
485,
486,
495,
503,
505,
569,
611,
612,
639,
708,
746,
747,
802,
820,
838,
839,
865,
882,
883,
903,
945,
1000,
1055,
1056,
1115,
1143,
1145,
1146,
1153,
1155,
1197,
1198,
1215,
1216,
1237,
1252,
1253,
1313,
1340,
1342,
1343,
1352,
1354,
1396,
1425,
1432,
1437,
1467,
1487,
1490,
1492,
1493,
1506,
1513,
1519,
1522,
1528,
1533,
1536,
1544,
1551,
1554,
1563,
1568,
1574,
1577,
1580,
1626,
1635,
1640,
1653,
1659,
1679,
1684,
1696,
1715,
1744,
1745,
1758,
1765,
1832,
1868,
1869,
1918,
1969,
2019,
2071,
2072,
2099,
2102,
2108,
2133,
2181,
2182,
2231,
2282,
2332,
2384,
2385,
2413,
2416,
2424,
2468,
2518,
2569,
2604,
2609,
2644,
2647,
2650,
2687,
2694,
2699,
2700,
2719,
2724
],
"line_end_idx": [
9,
10,
29,
30,
45,
46,
67,
68,
169,
307,
325,
326,
336,
358,
379,
381,
382,
401,
428,
455,
456,
485,
486,
495,
503,
505,
569,
611,
612,
639,
708,
746,
747,
802,
820,
838,
839,
865,
882,
883,
903,
945,
1000,
1055,
1056,
1115,
1143,
1145,
1146,
1153,
1155,
1197,
1198,
1215,
1216,
1237,
1252,
1253,
1313,
1340,
1342,
1343,
1352,
1354,
1396,
1425,
1432,
1437,
1467,
1487,
1490,
1492,
1493,
1506,
1513,
1519,
1522,
1528,
1533,
1536,
1544,
1551,
1554,
1563,
1568,
1574,
1577,
1580,
1626,
1635,
1640,
1653,
1659,
1679,
1684,
1696,
1715,
1744,
1745,
1758,
1765,
1832,
1868,
1869,
1918,
1969,
2019,
2071,
2072,
2099,
2102,
2108,
2133,
2181,
2182,
2231,
2282,
2332,
2384,
2385,
2413,
2416,
2424,
2468,
2518,
2569,
2604,
2609,
2644,
2647,
2650,
2687,
2694,
2699,
2700,
2719,
2724,
2728
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2728,
"ccnet_original_nlines": 137,
"rps_doc_curly_bracket": 0.003665690077468753,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0684596598148346,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03545232117176056,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.544009804725647,
"rps_doc_frac_unique_words": 0.4736842215061188,
"rps_doc_mean_word_length": 6.978947162628174,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0.014669929631054401,
"rps_doc_unigram_entropy": 4.6015472412109375,
"rps_doc_word_count": 285,
"rps_doc_frac_chars_dupe_10grams": 0.05832076072692871,
"rps_doc_frac_chars_dupe_5grams": 0.12468577176332474,
"rps_doc_frac_chars_dupe_6grams": 0.10558068752288818,
"rps_doc_frac_chars_dupe_7grams": 0.10558068752288818,
"rps_doc_frac_chars_dupe_8grams": 0.05832076072692871,
"rps_doc_frac_chars_dupe_9grams": 0.05832076072692871,
"rps_doc_frac_chars_top_2gram": 0.012569130398333073,
"rps_doc_frac_chars_top_3gram": 0.019607840105891228,
"rps_doc_frac_chars_top_4gram": 0.027149319648742676,
"rps_doc_books_importance": -316.02679443359375,
"rps_doc_books_importance_length_correction": -316.02679443359375,
"rps_doc_openwebtext_importance": -200.14891052246094,
"rps_doc_openwebtext_importance_length_correction": -200.14891052246094,
"rps_doc_wikipedia_importance": -168.1664581298828,
"rps_doc_wikipedia_importance_length_correction": -168.1664581298828
},
"fasttext": {
"dclm": 0.17042797803878784,
"english": 0.2364567071199417,
"fineweb_edu_approx": 1.508865475654602,
"eai_general_math": 0.0018176999874413013,
"eai_open_web_math": 0.003937900066375732,
"eai_web_code": 0.7918485999107361
}
}
|
{
"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.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": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,131,559,554,994,663,000 |
Highlighted
Connecting to AEM Assets with Companion App using non admin User
Avatar
Avatar
_Sid_
Avatar
_Sid_
_Sid_
21-03-2016
I'm trying to connect to the AEM Assets server using the Companion app, however the only user that i can connect with admin/admin
Wondering how to restrict user access for creative developers while using the companion apps.
I did create some users which could only access specific folder inside dam (works well in touch UI and CRX), but these users fail to connect using the companion app.
Replies
Highlighted
Avatar
Avatar
Mark_Frisbey
Avatar
Mark_Frisbey
Mark_Frisbey
21-03-2016
Hi Sid,
If the user that you're trying to connect with doesn't have access to /content/dam, then you'll need to change the URL that the companion app is using to connect.
For example, if the user only has access to /content/dam/geometrixx, then you would need to change the companion app's URL to something like http://localhost:4502/content/dam/geometrixx. How exactly you do that will differ depending on your OS, so if you need assistance changing the URL then feel free to let me know which operating system you're using and I can help further.
Avatar
Avatar
_Sid_
Avatar
_Sid_
_Sid_
21-03-2016
Thanks Mark,
My user initially had read only permissions on everything, ad R/W permissions only on a specific DAM folder.
This morning, as an experiment, i gave full permissions to the User on the entire CRX structure.
then the companion app was able to connect. After that i gradually removed all those permissions to find which one did the trick, but now i'm down to the original permission and my user still connects.
Looks like that one time admin privilege helped create a temp folder or profile somewhere, due to which my user connects seamlessly now.
FYI - i did not change my connection URL during these tests, since my User did have Read permissions through the /lc/content/dam structure,
I'm going to test read only use cases, and will post back if i notice any anomalies
Highlighted
Avatar
Avatar
_Sid_
Avatar
_Sid_
_Sid_
22-03-2016
mark.frisbey wrote...
Hi Sid,
If the user that you're trying to connect with doesn't have access to /content/dam, then you'll need to change the URL that the companion app is using to connect.
For example, if the user only has access to /content/dam/geometrixx, then you would need to change the companion app's URL to something like http://localhost:4502/content/dam/geometrixx. How exactly you do that will differ depending on your OS, so if you need assistance changing the URL then feel free to let me know which operating system you're using and I can help further.
Further i found that i wasn't much about permissions, some kind of CSRF filter or other security measure kept blocking me from having multiple connections with the same user.
So i went ahead and closed all browsers where this user was logged on to AEM, and then restarted my server to clear any pending connections.
Now that this user can connect, there are still some issues ahead. The user will have Companion app as a mounted drive, so that he can browse the assets in his creative applications.
We tried in lightroom, and the user could very well se the files and import them to lightroom. however he cannot modify any files, although he can export them back as a new copy.
When i look in AEM Security, the user has Read, modify, create and delete permissions on the /content/dam/projects/demo/dev1 folder, any thoughts on that
|
{
"url": "https://experienceleaguecommunities.adobe.com/t5/adobe-experience-manager-assets/connecting-to-aem-assets-with-companion-app-using-non-admin-user/m-p/164733/highlight/true",
"source_domain": "experienceleaguecommunities.adobe.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "531713",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:46DXDRSKWGZDL6Y2UZZZ3YBJVVO6SGS5",
"WARC-Concurrent-To": "<urn:uuid:d8decdc0-4da5-4a4f-9159-fe8d92133c57>",
"WARC-Date": "2020-11-24T02:19:18Z",
"WARC-IP-Address": "13.32.207.12",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VFGBHHNSYEXJSTXT3UVHDKF5L5QNR7ZN",
"WARC-Record-ID": "<urn:uuid:3649f0f9-14a1-4b2b-8196-be3bdd433082>",
"WARC-Target-URI": "https://experienceleaguecommunities.adobe.com/t5/adobe-experience-manager-assets/connecting-to-aem-assets-with-companion-app-using-non-admin-user/m-p/164733/highlight/true",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e510eb56-85de-4894-b7b5-3ecfe24a9c9b>"
},
"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-121.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
12,
13,
78,
79,
86,
87,
94,
95,
101,
102,
109,
110,
116,
117,
123,
124,
135,
136,
266,
267,
362,
363,
529,
530,
538,
539,
551,
552,
559,
560,
567,
568,
581,
582,
589,
590,
603,
604,
617,
618,
629,
630,
638,
639,
802,
803,
1181,
1182,
1189,
1190,
1197,
1198,
1204,
1205,
1212,
1213,
1219,
1220,
1226,
1227,
1238,
1239,
1252,
1253,
1255,
1256,
1365,
1366,
1463,
1464,
1666,
1667,
1804,
1805,
1945,
1946,
2031,
2032,
2044,
2045,
2052,
2053,
2060,
2061,
2067,
2068,
2075,
2076,
2082,
2083,
2089,
2090,
2101,
2102,
2124,
2125,
2133,
2134,
2297,
2298,
2676,
2677,
2679,
2680,
2855,
2856,
2997,
2998,
3181,
3182,
3361,
3362
],
"line_end_idx": [
12,
13,
78,
79,
86,
87,
94,
95,
101,
102,
109,
110,
116,
117,
123,
124,
135,
136,
266,
267,
362,
363,
529,
530,
538,
539,
551,
552,
559,
560,
567,
568,
581,
582,
589,
590,
603,
604,
617,
618,
629,
630,
638,
639,
802,
803,
1181,
1182,
1189,
1190,
1197,
1198,
1204,
1205,
1212,
1213,
1219,
1220,
1226,
1227,
1238,
1239,
1252,
1253,
1255,
1256,
1365,
1366,
1463,
1464,
1666,
1667,
1804,
1805,
1945,
1946,
2031,
2032,
2044,
2045,
2052,
2053,
2060,
2061,
2067,
2068,
2075,
2076,
2082,
2083,
2089,
2090,
2101,
2102,
2124,
2125,
2133,
2134,
2297,
2298,
2676,
2677,
2679,
2680,
2855,
2856,
2997,
2998,
3181,
3182,
3361,
3362,
3515
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3515,
"ccnet_original_nlines": 112,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4277854263782501,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03576340898871422,
"rps_doc_frac_lines_end_with_ellipsis": 0.008849560283124447,
"rps_doc_frac_no_alph_words": 0.16506190598011017,
"rps_doc_frac_unique_words": 0.37804877758026123,
"rps_doc_mean_word_length": 4.782229900360107,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0.0013755200197920203,
"rps_doc_unigram_entropy": 4.897670269012451,
"rps_doc_word_count": 574,
"rps_doc_frac_chars_dupe_10grams": 0.3154827058315277,
"rps_doc_frac_chars_dupe_5grams": 0.3508196771144867,
"rps_doc_frac_chars_dupe_6grams": 0.3508196771144867,
"rps_doc_frac_chars_dupe_7grams": 0.3409835994243622,
"rps_doc_frac_chars_dupe_8grams": 0.3154827058315277,
"rps_doc_frac_chars_dupe_9grams": 0.3154827058315277,
"rps_doc_frac_chars_top_2gram": 0.03497267886996269,
"rps_doc_frac_chars_top_3gram": 0.027322400361299515,
"rps_doc_frac_chars_top_4gram": 0.021857919171452522,
"rps_doc_books_importance": -340.72686767578125,
"rps_doc_books_importance_length_correction": -340.72686767578125,
"rps_doc_openwebtext_importance": -187.63572692871094,
"rps_doc_openwebtext_importance_length_correction": -187.63572692871094,
"rps_doc_wikipedia_importance": -165.2785186767578,
"rps_doc_wikipedia_importance_length_correction": -165.2785186767578
},
"fasttext": {
"dclm": 0.5415453910827637,
"english": 0.9446898698806763,
"fineweb_edu_approx": 1.3367371559143066,
"eai_general_math": 0.1491243839263916,
"eai_open_web_math": 0.2865777015686035,
"eai_web_code": 0.4525874853134155
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,768,320,833,770,449,000 |
Thor Video Codec
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
build
common
dec
enc
scripts
.gitignore
LICENSE
Makefile
README.md
check.sh
config_HDB16_high_efficiency.txt
config_HDB16_low_complexity.txt
config_HDB16_medium_complexity.txt
config_HDB16_qm_high_efficiency.txt
config_HDB16_qm_low_complexity.txt
config_HDB16_qm_medium_complexity.txt
config_HDB_high_efficiency.txt
config_HDB_low_complexity.txt
config_HDB_medium_complexity.txt
config_HDB_qm_high_efficiency.txt
config_HDB_qm_low_complexity.txt
config_HDB_qm_medium_complexity.txt
config_LDB_high_efficiency.txt
config_LDB_low_complexity.txt
config_LDB_medium_complexity.txt
config_LDB_qm_high_efficiency.txt
config_LDB_qm_low_complexity.txt
config_LDB_qm_medium_complexity.txt
config_RA16_high_efficiency.txt
config_RA16_low_complexity.txt
config_RA16_medium_complexity.txt
config_RA_high_efficiency.txt
config_RA_low_complexity.txt
config_RA_medium_complexity.txt
config_RA_qm_high_efficiency.txt
config_RA_qm_low_complexity.txt
config_RA_qm_medium_complexity.txt
README.md
Thor Video Codec
Implementation of https://tools.ietf.org/html/draft-fuldseth-netvc-thor
Build
Windows: Use Visual Studio with build/Thor.sln.
Mac/Linux:
make -j8
Binaries will appear in the build/ directory.
Usage
encoder: Thorenc -cf config.txt -if in.yuv -of str.bit -rf out.yuv -qp N -width [width] -height [height] -f [framerate] -stat out.stat -qp [quant] -n [num frames]
A y4m file can be provided for input, and it will override width, height and framerate values given on the command-line.
decoder: Thordec str.bit out.dec.yuv
|
{
"url": "https://github.com/cisco/thor",
"source_domain": "github.com",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "107105",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:G5ZCZVNNTUYL3DWLPFMFLJBFRFU25F26",
"WARC-Concurrent-To": "<urn:uuid:e8f05288-d3bf-4b2c-9ed2-f61c0c8506d6>",
"WARC-Date": "2019-01-23T20:21:26Z",
"WARC-IP-Address": "192.30.253.113",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4ZG4WV2CNLWY6FBD7PMQTD43F2NF4G2M",
"WARC-Record-ID": "<urn:uuid:4bb48064-a1a6-4946-b4a8-bb65908dd71a>",
"WARC-Target-URI": "https://github.com/cisco/thor",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a24b997d-ccb0-46e2-a847-ff8b6ae98928>"
},
"warc_info": "isPartOf: CC-MAIN-2019-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-152-117-40.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,
17,
35,
59,
107,
117,
161,
203,
209,
216,
220,
224,
232,
243,
251,
260,
270,
279,
312,
344,
379,
415,
450,
488,
519,
549,
582,
616,
649,
685,
716,
746,
779,
813,
846,
882,
914,
945,
979,
1009,
1038,
1070,
1103,
1135,
1170,
1171,
1181,
1182,
1199,
1200,
1272,
1273,
1279,
1280,
1328,
1329,
1340,
1341,
1350,
1351,
1397,
1398,
1404,
1405,
1568,
1569,
1690,
1691
],
"line_end_idx": [
17,
35,
59,
107,
117,
161,
203,
209,
216,
220,
224,
232,
243,
251,
260,
270,
279,
312,
344,
379,
415,
450,
488,
519,
549,
582,
616,
649,
685,
716,
746,
779,
813,
846,
882,
914,
945,
979,
1009,
1038,
1070,
1103,
1135,
1170,
1171,
1181,
1182,
1199,
1200,
1272,
1273,
1279,
1280,
1328,
1329,
1340,
1341,
1350,
1351,
1397,
1398,
1404,
1405,
1568,
1569,
1690,
1691,
1727
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1727,
"ccnet_original_nlines": 67,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10394264757633209,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017921149730682373,
"rps_doc_frac_lines_end_with_ellipsis": 0.014705879613757133,
"rps_doc_frac_no_alph_words": 0.3082437217235565,
"rps_doc_frac_unique_words": 0.8181818127632141,
"rps_doc_mean_word_length": 9.74125862121582,
"rps_doc_num_sentences": 48,
"rps_doc_symbol_to_word_ratio": 0.003584230085834861,
"rps_doc_unigram_entropy": 4.6767659187316895,
"rps_doc_word_count": 143,
"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.02584349922835827,
"rps_doc_frac_chars_top_3gram": 0.02010050043463707,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -67.16903686523438,
"rps_doc_books_importance_length_correction": -56.55574035644531,
"rps_doc_openwebtext_importance": -25.70400619506836,
"rps_doc_openwebtext_importance_length_correction": -25.70400619506836,
"rps_doc_wikipedia_importance": -42.66986083984375,
"rps_doc_wikipedia_importance_length_correction": -35.673851013183594
},
"fasttext": {
"dclm": 0.10374916344881058,
"english": 0.6642829775810242,
"fineweb_edu_approx": 1.471128225326538,
"eai_general_math": 0.0011959100374951959,
"eai_open_web_math": 0.06459701061248779,
"eai_web_code": 0.00035893998574465513
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
9,016,471,553,774,880,000 |
Language : English / Japanese
Illustration techniques and knowledge service [Alpaca School]
Create a GIF animation with FireAlpaca and AlpacaDouga
41364 Views
You may often see a GIF animation on the internet. Don't you want to create your own?
You can create a GIF animation for FREE with FireAlpaca and AlpacaDouga.
Use "Onion Skin Mode" to create an animation with FireAlpaca.
Please see "What is Onion Skin Mode?" for the further details and instruction.
This section explains how to create a GIF animation with AlpacaDouga after creating an animation.
Diagram:Completed GIF animation
Diagram:Completed GIF animation
Diagram:Drawing for a GIF animation
Diagram:Drawing for a GIF animation
Download the sample file (alpaca_gif.mdp)
Export a file after drawing
Once the drawing process is finished, you are going to export images, frame by frame. ...export every frame!? You might think so, but no worry! It is simple and easy.
First, please check that
"View" > "Onion Skin Mode"
is turned on. If this is not turned on, it will not export every frame at all together. So please make sure that this is turned on.
Diagram:Check that Onion Skin Mode is turned on!
Diagram:Check that Onion Skin Mode is turned on!
Go to "File" > "Export Layers (Onion Skin Mode)" to save an image.
Diagram:Export images in a sequential number
Diagram:Export images in a sequential number
Please designate a folder to save images to avoid mixing up with other files.
Example: Create a folder called GIF animation" and export files into this folder.
This tool will export all images in a sequential number, such as 001, 002, 003, 004...
Diagram:Exported sequential images
Diagram:Exported sequential images
You may think, ".png" format is ok for a GIF animation? But that's ok!
Let's move to the next step.
How to create a GIF animation with AlpacaDouga
After exporting images in a sequential number, a dialog window will pop up and asks "Open "AlpacaDouga", the animated GIF convert service, in a browser?" Then click "Yes". If you close the window, please access to the website from the below link:
The animated GIF convert service "AlpacaDouga"
Then drop the exported .png images in the file drop area.
Diagram:Drop or select a file
Diagram:Drop or select a file
You can review the GIF animation setting in the setting window.
• Framework Replay Speed
• Completion Size
• Loop Replay
• Insert FireAlpaca Logo
Diagram:Review the setting in the setting window before creating a GIF animation
Diagram:Review the setting in the setting window before creating a GIF animation
The frame will be shown on the left side. You can change the file order by dragging.
Diagram:Change the file order by dragging
Diagram:Change the file order by dragging
Files will be shown in an alphabetical order. Please assign the file names carefully if you export them manually.
If you fail, you can refresh a page to reset.
Is it possible to create a GIF animation with png or jpg format!?
AlpacaDouga lets you create a GIF animation not only from gif but also from png or jpg.
(As previously mentioned, you can create a GIF animation with the exported png by FireAlpaca)
You can also create a GIF animation from photos. Try and enjoy creating a GIF animation!
Diagram:Create a GIF animation from photos!
Diagram:Create a GIF animation from photos!
Recommend contents.
ページTOPへ
|
{
"url": "http://firealpaca.com/en/topics/Create+a+GIF+animation+with+FireAlpaca+and+AlpacaDouga",
"source_domain": "firealpaca.com",
"snapshot_id": "crawl=CC-MAIN-2019-09",
"warc_metadata": {
"Content-Length": "15741",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZWNPPGASDSLDTIFQSA7WWZQY3H3C4G6J",
"WARC-Concurrent-To": "<urn:uuid:33a7f3d7-2cdc-436c-86ed-3aa2a2dd7f07>",
"WARC-Date": "2019-02-16T17:19:12Z",
"WARC-IP-Address": "54.64.188.226",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:B64TWRGFCHHZM3TWSFKKXPUYDYJ5FGN7",
"WARC-Record-ID": "<urn:uuid:21cbc1bd-d5b3-46ee-b423-27292c787c79>",
"WARC-Target-URI": "http://firealpaca.com/en/topics/Create+a+GIF+animation+with+FireAlpaca+and+AlpacaDouga",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2f716390-0369-487e-b2e2-10c89c911080>"
},
"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-69-73-156.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,
30,
31,
93,
94,
149,
150,
162,
163,
249,
250,
323,
324,
386,
387,
466,
467,
565,
566,
598,
630,
666,
702,
703,
745,
746,
774,
775,
942,
943,
968,
995,
1127,
1128,
1177,
1226,
1227,
1294,
1295,
1340,
1385,
1386,
1464,
1546,
1547,
1634,
1635,
1670,
1705,
1706,
1777,
1778,
1807,
1808,
1855,
1856,
2103,
2104,
2151,
2152,
2210,
2211,
2241,
2271,
2272,
2336,
2337,
2364,
2384,
2400,
2427,
2508,
2589,
2590,
2675,
2676,
2718,
2760,
2761,
2875,
2876,
2922,
2923,
2989,
2990,
3078,
3172,
3173,
3262,
3263,
3307,
3351,
3352,
3372,
3373
],
"line_end_idx": [
30,
31,
93,
94,
149,
150,
162,
163,
249,
250,
323,
324,
386,
387,
466,
467,
565,
566,
598,
630,
666,
702,
703,
745,
746,
774,
775,
942,
943,
968,
995,
1127,
1128,
1177,
1226,
1227,
1294,
1295,
1340,
1385,
1386,
1464,
1546,
1547,
1634,
1635,
1670,
1705,
1706,
1777,
1778,
1807,
1808,
1855,
1856,
2103,
2104,
2151,
2152,
2210,
2211,
2241,
2271,
2272,
2336,
2337,
2364,
2384,
2400,
2427,
2508,
2589,
2590,
2675,
2676,
2718,
2760,
2761,
2875,
2876,
2922,
2923,
2989,
2990,
3078,
3172,
3173,
3262,
3263,
3307,
3351,
3352,
3372,
3373,
3380
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3380,
"ccnet_original_nlines": 94,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31911763548851013,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.036764711141586304,
"rps_doc_frac_lines_end_with_ellipsis": 0.010526319965720177,
"rps_doc_frac_no_alph_words": 0.1764705926179886,
"rps_doc_frac_unique_words": 0.35283362865448,
"rps_doc_mean_word_length": 4.866544723510742,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0.002941180020570755,
"rps_doc_unigram_entropy": 4.7069525718688965,
"rps_doc_word_count": 547,
"rps_doc_frac_chars_dupe_10grams": 0.11870773881673813,
"rps_doc_frac_chars_dupe_5grams": 0.3572501838207245,
"rps_doc_frac_chars_dupe_6grams": 0.27122464776039124,
"rps_doc_frac_chars_dupe_7grams": 0.1788129210472107,
"rps_doc_frac_chars_dupe_8grams": 0.1517655849456787,
"rps_doc_frac_chars_dupe_9grams": 0.1517655849456787,
"rps_doc_frac_chars_top_2gram": 0.09466566145420074,
"rps_doc_frac_chars_top_3gram": 0.08302029222249985,
"rps_doc_frac_chars_top_4gram": 0.05709991976618767,
"rps_doc_books_importance": -200.9608612060547,
"rps_doc_books_importance_length_correction": -200.9608612060547,
"rps_doc_openwebtext_importance": -184.24298095703125,
"rps_doc_openwebtext_importance_length_correction": -184.24298095703125,
"rps_doc_wikipedia_importance": -78.70521545410156,
"rps_doc_wikipedia_importance_length_correction": -78.70521545410156
},
"fasttext": {
"dclm": 0.07731705904006958,
"english": 0.8633965253829956,
"fineweb_edu_approx": 1.969374418258667,
"eai_general_math": 0.15830916166305542,
"eai_open_web_math": 0.08409231901168823,
"eai_web_code": 0.07993245124816895
}
}
|
{
"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": "745.5",
"labels": {
"level_1": "Arts",
"level_2": "Drawing, Decoration and ornament, and Design",
"level_3": "Decorative arts"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,717,286,986,909,633,000 |
Views: 5207
The file .description.php contains a description of the component. This description is used for work with the component (for example, in a visual editor) and also for work in the website editing mode. During the work of the component itself (when invoking the page where the component is located), the description is not used, and the file .description.php is not connected.
The file .description.php must be located in the component folder. The language file connects automatically (it must be located in the folder /lang/<language>/.description.php of the component folder).
Typically, the file .description.php has the following structure:
<?
$arComponentDescription = array(
"NAME" => GetMessage("COMP_NAME"),
"DESCRIPTION" => GetMessage("COMP_DESCR"),
"ICON" => "/images/icon.gif",
"PATH" => array(
"ID" => "content",
"CHILD" => array(
"ID" => "catalog",
"NAME" => "Catalog"
)
),
"AREA_BUTTONS" => array(
array(
'URL' => "javascript:alert('Button');",
'SRC' => '/images/button.jpg',
'TITLE' => "Button"
),
),
"CACHE_PATH" => "Y",
"COMPLEX" => "Y"
);
?>
As we can see, the file determines the array $arComponentDescription which describes the component. This array may have the following keys:
• NAME - name of the component;
• DESCRIPTION - description of the component;
• ICON - path to the pictogram of the component from the component folder. The icon of the component is used in different parts of the system (e.g., in the visual editor);
• PATH - component location in the virtual tree of the component in the visual editor. The value of this element must be an array with the following keys:
• ID - code of the tree branch. Node ID must be unique within the entire component tree (including standard nodes). If the nodes have two equal ID, both of them will not open. E.g., for the proprietary component the ID node = “news” is selected, and such ID already exists for standard components.
• NAME - name of the tree branch. It must be indicated. The NAME is taken from any component from the node. If no NAME is found or there is no language constant necessary, ID is used as a NAME.
• CHILD - a child or subordinate branch. In the element with the CHILD key a subordinate branch of the tree with the same structure as the parent branch can be set up.
The tree is limited to three tiers. As a rule, a two-tier tree is built, and the components are located on the second tier. The following service names of the first tier are reserved and cannot be used: content, service, communication, e-store and utility.
If the PATH key is not established, the component will not be available in the visual editor.
• AREA_BUTTONS - user buttons shown for the component in the website editor mode;
• CACHE_PATH - if the value is equal to Y, the cache flush button of the component is shown in the website editor mode (the cache is supposed to be located at the standard path: /<website code>/<relative path to the component>). If equal to a non-empty line different from Y, the cache flush button of the component is shown in the website editor mode (the cache is located at the path equal to the value with the key CACHE_PATH - for non-standard paths);
• COMPLEX - the element must have the value Y for a composite component and has no significance for simple components.
Courses developed by «Bitrix», Inc.
|
{
"url": "https://training.bitrix24.com/support/training/course/?COURSE_ID=68&LESSON_ID=6083&LESSON_PATH=5936.6078.6083",
"source_domain": "training.bitrix24.com",
"snapshot_id": "crawl=CC-MAIN-2020-24",
"warc_metadata": {
"Content-Length": "196653",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XESFXETR67UJ64AGJHD5B24HF6QO43YO",
"WARC-Concurrent-To": "<urn:uuid:43bb6706-b9f3-4dd1-b93c-f2d8e576c465>",
"WARC-Date": "2020-05-27T02:38:33Z",
"WARC-IP-Address": "99.81.101.35",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:L52WYUZVVLHYWCWDVSXJ5ZMXRDUTEPOJ",
"WARC-Record-ID": "<urn:uuid:bf3e4b5b-ca0c-4400-a099-90fe116d25c9>",
"WARC-Target-URI": "https://training.bitrix24.com/support/training/course/?COURSE_ID=68&LESSON_ID=6083&LESSON_PATH=5936.6078.6083",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:913bbf19-71b5-4035-bd1c-81146dfd9450>"
},
"warc_info": "isPartOf: CC-MAIN-2020-24\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-60.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
12,
13,
388,
389,
591,
592,
658,
659,
662,
695,
733,
779,
812,
832,
857,
881,
909,
938,
946,
952,
980,
993,
1042,
1082,
1111,
1120,
1126,
1150,
1170,
1173,
1176,
1177,
1317,
1318,
1352,
1400,
1574,
1731,
2033,
2231,
2403,
2664,
2665,
2763,
2847,
3305,
3426,
3427,
3428
],
"line_end_idx": [
12,
13,
388,
389,
591,
592,
658,
659,
662,
695,
733,
779,
812,
832,
857,
881,
909,
938,
946,
952,
980,
993,
1042,
1082,
1111,
1120,
1126,
1150,
1170,
1173,
1176,
1177,
1317,
1318,
1352,
1400,
1574,
1731,
2033,
2231,
2403,
2664,
2665,
2763,
2847,
3305,
3426,
3427,
3428,
3463
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3463,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34567901492118835,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0589849092066288,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26611796021461487,
"rps_doc_frac_unique_words": 0.3244274854660034,
"rps_doc_mean_word_length": 4.811068534851074,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.426891326904297,
"rps_doc_word_count": 524,
"rps_doc_frac_chars_dupe_10grams": 0.05791353061795235,
"rps_doc_frac_chars_dupe_5grams": 0.1063070222735405,
"rps_doc_frac_chars_dupe_6grams": 0.05791353061795235,
"rps_doc_frac_chars_dupe_7grams": 0.05791353061795235,
"rps_doc_frac_chars_dupe_8grams": 0.05791353061795235,
"rps_doc_frac_chars_dupe_9grams": 0.05791353061795235,
"rps_doc_frac_chars_top_2gram": 0.085680291056633,
"rps_doc_frac_chars_top_3gram": 0.0555335208773613,
"rps_doc_frac_chars_top_4gram": 0.0190400592982769,
"rps_doc_books_importance": -296.0883483886719,
"rps_doc_books_importance_length_correction": -296.0883483886719,
"rps_doc_openwebtext_importance": -95.47589111328125,
"rps_doc_openwebtext_importance_length_correction": -95.47589111328125,
"rps_doc_wikipedia_importance": -104.46076202392578,
"rps_doc_wikipedia_importance_length_correction": -104.46076202392578
},
"fasttext": {
"dclm": 0.06381028890609741,
"english": 0.8800591826438904,
"fineweb_edu_approx": 2.796417713165283,
"eai_general_math": 0.8876919746398926,
"eai_open_web_math": 0.5619681477546692,
"eai_web_code": 0.6508592367172241
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,282,934,022,160,608,000 |
Survey Form, Element Display Issues
There’s a certain section of code within my Survey Form project that is not displaying properly. Need Help…Code section pasted below
<div>
<p>Pick a fruit out of the following</p>
<label for="watermelon">Watermelon</label>
<input type="radio" id="watermelon" name="fruit-list" value="watermelon">
<label for="apple">Apple</label>
<input type="radio" id="apple" name="fruit-list" value="apple">
<label for="banana">Banana</label>
<input type="radio" id="banana" name="fruit-list" value="banana">
</div>
My project code link pasted as well if you think it’s a general issue or if i made a mistake somewhere up the code chain:
your select tag doesn’t have a closing tag
1 Like
I need help. The corresponding CSS for the following code is giving me issues. I want the labels to display beside the input. i could go the HTML route of use the break tag but i want to learn how to do it via CSS instead. Please Help!!!
<div>
<p>Pick a fruit out of the following</p>
<input type="radio" id="watermelon" class="fruit-list" name="fruit-list" value="watermelon">
<label for="watermelon">Watermelon</label>
<input type="radio" id="apple" class="fruit-list" name="fruit-list" value="apple">
<label for="apple" >Apple</label>
<input type="radio" id="banana" class="fruit-list" name="fruit-list" value="banana">
<label for="banana">Banana</label>
</div>
<div>
<p>What are your sources of meat?</p>
<input type="checkbox" id="domesticated" class="meat-list" name="meat-source" value="domesticated">
<label for="domesticated">Domesticated</label>
<input type="checkbox" id="wild" class="meat-list" name="meat-source" value="wild">
<label for="wild">Wild</label>
<input type="checkbox" id="processed" class="meat-list" name="meat-source" value="processed">
<label for="processed">Processed</label>
</div>
Have you tried reviewing this lesson and this lesson?
Was there something you didn’t understand after doing so? If so, please tell is what it is.
Prior to you adding any styling the labels were next to the radio button inputs and checkbox inputs.
I don’t really understand what you mean, it’s already beside the label?
Do you want it in a column layout?
Yes, i want it in a column layout but the CSS display tag when used with the block attribute gives me a column layout both for the input radio buttons and their labels. I want the input labels to be in a row i.e beside the radio buttons to the right while the radio buttons themselves should be a column format. Hope this description of mine helps.
Do you mean like this?
image
Css issues
@tosinwithlove, the following is your CSS code
.fruit-list {
display: block;
}
.meat-list {
display: block;
}
Here block is not an attribute and display is not a CSS tag.
Block is a value assigned to the property display. In a CSS declaration they are known as a property: value; pair.
There are three other values you can assign other than block.
Try searching for something like css display property
I did but when i applied them to my code, i didn’t really get what i wanted so i had to resort to using the break tag in my HTML to get what i wanted. Anyways, guess i still have more researching and reading to do on the css display property.
Do not use the <br> element to force line breaks or spacing. That’s what CSS is for.
Reference MDN Docs
1 Like
All break tags removed. Have to do some more research on that. New problem. Trying to make my background image more transparent so that my body text would be more visible but everything i tried doesn’t seem to be working. Is it because it’s a hyperlinked image from a hosting site and not from my local drive?.
This topic was automatically closed 182 days after the last reply. New replies are no longer allowed.
|
{
"url": "https://forum.freecodecamp.org/t/survey-form-element-display-issues/492553",
"source_domain": "forum.freecodecamp.org",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "52948",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VPST3H3D2E5W2EXW6AQES2YOBVJMA4GZ",
"WARC-Concurrent-To": "<urn:uuid:efb08ad6-139d-4f08-a1da-ab363e57b329>",
"WARC-Date": "2022-09-26T19:29:07Z",
"WARC-IP-Address": "64.71.144.205",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:22FZZGATJ6F4TC2Z5XBTYOIORK6OF6OM",
"WARC-Record-ID": "<urn:uuid:158eebc6-f019-4f7f-9153-05590b601d6f>",
"WARC-Target-URI": "https://forum.freecodecamp.org/t/survey-form-element-display-issues/492553",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ff24ddf4-f8b0-4fb2-9b30-db610df18519>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-96\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
36,
37,
170,
171,
177,
224,
273,
353,
392,
462,
503,
575,
589,
590,
712,
713,
756,
757,
764,
765,
1003,
1004,
1010,
1057,
1156,
1205,
1294,
1334,
1425,
1466,
1479,
1484,
1495,
1537,
1640,
1693,
1782,
1819,
1918,
1965,
1978,
1979,
2033,
2125,
2126,
2227,
2228,
2300,
2301,
2336,
2337,
2686,
2687,
2710,
2716,
2717,
2728,
2729,
2776,
2777,
2791,
2808,
2810,
2811,
2824,
2842,
2844,
2845,
2906,
3021,
3022,
3084,
3138,
3139,
3382,
3383,
3468,
3487,
3488,
3495,
3496,
3807,
3808
],
"line_end_idx": [
36,
37,
170,
171,
177,
224,
273,
353,
392,
462,
503,
575,
589,
590,
712,
713,
756,
757,
764,
765,
1003,
1004,
1010,
1057,
1156,
1205,
1294,
1334,
1425,
1466,
1479,
1484,
1495,
1537,
1640,
1693,
1782,
1819,
1918,
1965,
1978,
1979,
2033,
2125,
2126,
2227,
2228,
2300,
2301,
2336,
2337,
2686,
2687,
2710,
2716,
2717,
2728,
2729,
2776,
2777,
2791,
2808,
2810,
2811,
2824,
2842,
2844,
2845,
2906,
3021,
3022,
3084,
3138,
3139,
3382,
3383,
3468,
3487,
3488,
3495,
3496,
3807,
3808,
3909
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3909,
"ccnet_original_nlines": 83,
"rps_doc_curly_bracket": 0.001023279968649149,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3410595953464508,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01655629090964794,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.27483445405960083,
"rps_doc_frac_unique_words": 0.4398563802242279,
"rps_doc_mean_word_length": 5.1202874183654785,
"rps_doc_num_sentences": 35,
"rps_doc_symbol_to_word_ratio": 0.0011037499643862247,
"rps_doc_unigram_entropy": 5.0734782218933105,
"rps_doc_word_count": 557,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03716690093278885,
"rps_doc_frac_chars_dupe_6grams": 0.03716690093278885,
"rps_doc_frac_chars_dupe_7grams": 0.022440390661358833,
"rps_doc_frac_chars_dupe_8grams": 0.022440390661358833,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02945302054286003,
"rps_doc_frac_chars_top_3gram": 0.013674610294401646,
"rps_doc_frac_chars_top_4gram": 0.009817670099437237,
"rps_doc_books_importance": -431.4578552246094,
"rps_doc_books_importance_length_correction": -431.4578552246094,
"rps_doc_openwebtext_importance": -245.80010986328125,
"rps_doc_openwebtext_importance_length_correction": -245.80010986328125,
"rps_doc_wikipedia_importance": -176.00338745117188,
"rps_doc_wikipedia_importance_length_correction": -176.00338745117188
},
"fasttext": {
"dclm": 0.1180046796798706,
"english": 0.7841693162918091,
"fineweb_edu_approx": 1.6313239336013794,
"eai_general_math": 0.3787568211555481,
"eai_open_web_math": 0.11873722076416016,
"eai_web_code": 0.6102449297904968
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,220,038,150,822,937,900 |
Jump to content
• Advertisement
Sign in to follow this
Maddibob
Meshes for LOD
This topic is 4956 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.
If you intended to correct an error in the post then please contact us.
Recommended Posts
Does anyone use batches of D3DXMesh's for terrain geometry? I've been reading the latest DX9 docs and they're saying that rendering progressive meshes is quick and very useful for LODs.
Share this post
Link to post
Share on other sites
Advertisement
I tried to use those for terrain once :)
The problems I had were:
I had to keep the edges of each chunk of terrain at the highest detail level to that the edges matched up with the chunk(s) next to it, because there was otherwise no good edge matching algorithm.
Also, there's no blending between levels of detail: it just pops from one detail level to the next. In order to get a nice transition between levels, blending is almost a necessity, because the popping, especially on terrain, is very noticeable to the human eye.
Share this post
Link to post
Share on other sites
I'll take that as a no then :)
So you have your own format? Have you incorporated terrain detail objects (like rocks, etc) into the terrain object and Octree itself?
I'm at a point where I have a large heightmap-based terrain and lots of detail objects that need to go on top of that like rocks, plans, trees, etc. I can't decide whether to include the detail objects into the static terrain vertex buffer that the heightmap-generated terrain uses, or just attach them to each octree node and render them on a model-by-model basis during the draw of each octree node...
Any ideas how this is generally done...?
Share this post
Link to post
Share on other sites
How large is your heightmap? Are you doing any LOD?
If you're doing LOD, you might find that the extra detail geometry gets in the way of the LOD processing if you put it together. In that case, you better treat it as separate objects.
If not, then at first glance, there is no reason why not to put the detail geometry in the same vertex buffer as the relevant parts of the tarrain. But on second thought, the detail objects will likely have different textures than the terrain, different shaders perhaps, maybe some LOD of their own, etc.
So as far as rendering is concerened, you're probably better off to treat them as regular objects, batch by shader-texture-whatever, and so on. Although, if your only terrain LOD is switching from one patch to another (like geomipmapping or similar), and your only object LOD for those detail objects is switching from one model to another (or hide the model entirely, since it's only a small detail model), then you can still link the terrain and detail object LODs together: for LOD 1 of the terrain, store which models are shown on that patch at that LOD level, the same for LOD 2, LOD 3, and so on. Then during rendering, collect which models need to be rendered, batch, do whatever processing you usually do, and render (separately from the terrain, due to the different visual properties).
Share this post
Link to post
Share on other sites
I've only ever heard of D3DX's progressive meshes being used for small objects like characters. The problem is that your terrain is really one single huge mesh that you want to apply different levels of detail to in different places (high LOD near the camera, low LOD far away) - standard PM applies a uniform LOD over the whole mesh.
Check Hughes Hoppe's page out, though. He basically invented PMs, and there's a paper on his site about view-dependent progressive meshes which may be of interest.
Share this post
Link to post
Share on other sites
Luckily, the game I'm working on uses fairly near fogging, so I didn't think it was worth using LODs. I'll try and incorporate my 'objects' which could be vast expanses of rocks (possibly overhanging) into the same vertex buffer. They will be different textures (and pixel shaders), but the indexing system I'm using batches textures and shaders so it should be okay.
My heightmap is any size, but generally for each level it is 256x256x256. But over that there are lots of rock formations, and I wanted to keep it neat by mixing the 'detail objects' in with the terrain. If nothing else, it keeps rendering simple.
Thanks for the replies, guys
Share this post
Link to post
Share on other sites
Sign in to follow this
• Advertisement
×
Important Information
By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.
Participate in the game development conversation and more when you create an account on GameDev.net!
Sign me up!
|
{
"url": "https://www.gamedev.net/forums/topic/285125-meshes-for-lod/",
"source_domain": "www.gamedev.net",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "155383",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:U4ZLTIUAJAHGE6TM7M6GZZH6CITMAKW4",
"WARC-Concurrent-To": "<urn:uuid:e6c0d39c-0d69-4870-9bf1-ef3992ba7fd4>",
"WARC-Date": "2018-06-25T03:07:59Z",
"WARC-IP-Address": "130.211.24.203",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZN6ZUSJLYSOUGY2W7I25WCPMH52MIC4M",
"WARC-Record-ID": "<urn:uuid:b3f284ff-4eb9-4e94-b466-4a119ba11dd5>",
"WARC-Target-URI": "https://www.gamedev.net/forums/topic/285125-meshes-for-lod/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:465448a2-ec42-4aab-882b-7d19fa8f3a1e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-138-204-92.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
16,
34,
59,
68,
69,
84,
85,
205,
206,
278,
279,
297,
298,
484,
485,
501,
502,
503,
516,
537,
551,
592,
593,
618,
619,
816,
817,
1080,
1081,
1097,
1098,
1099,
1112,
1133,
1164,
1165,
1300,
1301,
1705,
1706,
1747,
1748,
1764,
1765,
1766,
1779,
1800,
1852,
1853,
2037,
2038,
2343,
2344,
3140,
3141,
3157,
3158,
3159,
3172,
3193,
3528,
3529,
3693,
3694,
3710,
3711,
3712,
3725,
3746,
4114,
4115,
4363,
4364,
4393,
4394,
4410,
4411,
4412,
4425,
4446,
4471,
4472,
4490,
4492,
4493,
4515,
4516,
4611,
4612,
4713,
4714
],
"line_end_idx": [
16,
34,
59,
68,
69,
84,
85,
205,
206,
278,
279,
297,
298,
484,
485,
501,
502,
503,
516,
537,
551,
592,
593,
618,
619,
816,
817,
1080,
1081,
1097,
1098,
1099,
1112,
1133,
1164,
1165,
1300,
1301,
1705,
1706,
1747,
1748,
1764,
1765,
1766,
1779,
1800,
1852,
1853,
2037,
2038,
2343,
2344,
3140,
3141,
3157,
3158,
3159,
3172,
3193,
3528,
3529,
3693,
3694,
3710,
3711,
3712,
3725,
3746,
4114,
4115,
4363,
4364,
4393,
4394,
4410,
4411,
4412,
4425,
4446,
4471,
4472,
4490,
4492,
4493,
4515,
4516,
4611,
4612,
4713,
4714,
4725
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4725,
"ccnet_original_nlines": 91,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.46693795919418335,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03153610974550247,
"rps_doc_frac_lines_end_with_ellipsis": 0.010869570076465607,
"rps_doc_frac_no_alph_words": 0.142421156167984,
"rps_doc_frac_unique_words": 0.41919806599617004,
"rps_doc_mean_word_length": 4.506682872772217,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0.0020345901139080524,
"rps_doc_unigram_entropy": 5.277489185333252,
"rps_doc_word_count": 823,
"rps_doc_frac_chars_dupe_10grams": 0.06470747292041779,
"rps_doc_frac_chars_dupe_5grams": 0.07441359013319016,
"rps_doc_frac_chars_dupe_6grams": 0.06470747292041779,
"rps_doc_frac_chars_dupe_7grams": 0.06470747292041779,
"rps_doc_frac_chars_dupe_8grams": 0.06470747292041779,
"rps_doc_frac_chars_dupe_9grams": 0.06470747292041779,
"rps_doc_frac_chars_top_2gram": 0.014559179544448853,
"rps_doc_frac_chars_top_3gram": 0.02102993056178093,
"rps_doc_frac_chars_top_4gram": 0.02750067040324211,
"rps_doc_books_importance": -457.5608825683594,
"rps_doc_books_importance_length_correction": -457.5608825683594,
"rps_doc_openwebtext_importance": -241.57052612304688,
"rps_doc_openwebtext_importance_length_correction": -241.57052612304688,
"rps_doc_wikipedia_importance": -168.3623809814453,
"rps_doc_wikipedia_importance_length_correction": -168.3623809814453
},
"fasttext": {
"dclm": 0.05652434006333351,
"english": 0.94922935962677,
"fineweb_edu_approx": 1.5065228939056396,
"eai_general_math": 0.19714397192001343,
"eai_open_web_math": 0.1135643720626831,
"eai_web_code": 0.0011609200155362487
}
}
|
{
"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": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,235,172,221,794,281,000 |
Roon keeps moving to next song
Core Machine (Operating system/System info/Roon build number)
Mac book Pro on latest software
Network Details (Including networking gear model/manufacturer and if on WiFi/Ethernet)
Xfinity high speed wifi.
Audio Devices (Specify what device you’re using and its connection type - USB/HDMI/etc.)
Description Of Issue
Keeps moving to next song and gives error that
“Media is loading slowly and may indicate a network connectivity error”.
My internet is fine and many other devices and apps work fine and check the speed and all is fine.
Hi Ray,
Yup, I know that message!
It typically (in my case) means that Roon is loading up new tracks and is using a lot of processing power. (Excuse my lack of technical terminology)
There have been threads requesting that Roon did not skip under such conditions and just started the track again. Unfortunately, it seems those suggestions have fallen on deaf ears, despite receiving positive feedback by users.
You will typically find that Roon ‘people’ do not accept that such issues are software related and all faults must be either your hardware or network, regardless of your set-up. Further, it is immaterial if other apps work fine, because they are not Roon. :laughing:
When I load up a large(ish) number of albums, I tend to let Roon find them first before playing music. That seems to mitigate any problems that may occur in my case.
Cheers. :musical_note:
1 Like
Hello @Ray_Kunkel, it would help support if you gave some more information about your setup (this link will help)
In particular how your audio components are linked and whether you are using a streaming service.
I am using Roon on my MacBook Pro with wireless and plays through BlueSound Vault which are connected be Ethernet cables
Hello @Ray_Kunkel, can you elaborate on your network setup such as what router you’re using and if there’s any other networking gear in place? Also, is this happening with local content, streamed content? Both?
This topic was automatically closed 365 days after the last reply. New replies are no longer allowed.
|
{
"url": "https://community.roonlabs.com/t/roon-keeps-moving-to-next-song/135538",
"source_domain": "community.roonlabs.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "27942",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:23BQ5O4H3LAW2NQPXZMOIAYX537ULLRU",
"WARC-Concurrent-To": "<urn:uuid:1e3af4b1-b183-43cb-ba22-97e713c13ede>",
"WARC-Date": "2022-11-27T14:44:14Z",
"WARC-IP-Address": "167.172.230.239",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LO5XRAMGWU646RXIPH3WB7JPMYSHQUDB",
"WARC-Record-ID": "<urn:uuid:3a5f7772-e041-45ce-ac7a-f6d23a03b7b2>",
"WARC-Target-URI": "https://community.roonlabs.com/t/roon-keeps-moving-to-next-song/135538",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cfa888ed-40e1-4115-879e-ef1623efc136>"
},
"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-189\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
31,
32,
94,
126,
127,
214,
239,
240,
329,
330,
351,
398,
399,
472,
473,
572,
573,
581,
582,
608,
609,
758,
759,
987,
988,
1255,
1256,
1422,
1423,
1446,
1447,
1454,
1455,
1569,
1570,
1668,
1669,
1790,
1791,
2002,
2003
],
"line_end_idx": [
31,
32,
94,
126,
127,
214,
239,
240,
329,
330,
351,
398,
399,
472,
473,
572,
573,
581,
582,
608,
609,
758,
759,
987,
988,
1255,
1256,
1422,
1423,
1446,
1447,
1454,
1455,
1569,
1570,
1668,
1669,
1790,
1791,
2002,
2003,
2104
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2104,
"ccnet_original_nlines": 41,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39523810148239136,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014285709708929062,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15714286267757416,
"rps_doc_frac_unique_words": 0.6231884360313416,
"rps_doc_mean_word_length": 4.863768100738525,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.122885704040527,
"rps_doc_word_count": 345,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.025029800832271576,
"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.01430273987352848,
"rps_doc_frac_chars_top_3gram": 0.015494639985263348,
"rps_doc_frac_chars_top_4gram": 0.02026222087442875,
"rps_doc_books_importance": -191.40036010742188,
"rps_doc_books_importance_length_correction": -191.40036010742188,
"rps_doc_openwebtext_importance": -114.6322021484375,
"rps_doc_openwebtext_importance_length_correction": -114.6322021484375,
"rps_doc_wikipedia_importance": -58.486358642578125,
"rps_doc_wikipedia_importance_length_correction": -58.486358642578125
},
"fasttext": {
"dclm": 0.03443652018904686,
"english": 0.9408381581306458,
"fineweb_edu_approx": 1.6935484409332275,
"eai_general_math": 0.095866858959198,
"eai_open_web_math": 0.16831940412521362,
"eai_web_code": 0.056927379220724106
}
}
|
{
"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": "780",
"labels": {
"level_1": "Arts",
"level_2": "Music",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,736,380,660,790,204,000 |
CTK Insights
01 Feb
Existence of the Incenter: a Second Look
The three angle bisectors of a triangle meet at incenter of the triangle. Reversing the problem we may ask a relevant question:
Given three concurrent lines: α, β, and γ. Is there always a triangle with the three lines as the angle bisectors. If so, construct the triangle.
Solution
Given three concurrent lines: α, β, and γ. Is there always a triangle with the three lines as the angle bisectors. If so, construct the triangle.
Solution
The answer to the question is in positive, and the triangle can be constructed is as follows.
First construct a triangle for which the three lines serve as the altitudes. The orthic triangle of the latter is the one we are after, because of the mirror property the orthic triangles possess.
Obvioiusly, the construction is not unique, what is unique is the shape of the triangles - they all are similar.
Leave a Reply
© 2014 CTK Insights | Entries (RSS) and Comments (RSS)
Powered by Wordpress, design by Web4 Sudoku, based on Pinkline by GPS Gazette
|
{
"url": "http://www.mathteacherctk.com/blog/2012/02/existence-of-the-incenter-a-seond-look/",
"source_domain": "www.mathteacherctk.com",
"snapshot_id": "crawl=CC-MAIN-2014-23",
"warc_metadata": {
"Content-Length": "41021",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JRRNDI47PK2MWVCQFL3CBREJIUS3ID2B",
"WARC-Concurrent-To": "<urn:uuid:4b068e8c-7a2e-4267-9470-39e18c1fb4ac>",
"WARC-Date": "2014-08-02T00:22:04Z",
"WARC-IP-Address": "67.225.139.76",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:MHKXWEPYSZPWJD56FKLB6MZJELZCYRDT",
"WARC-Record-ID": "<urn:uuid:429752d9-c49e-4f88-aa10-63114845a43e>",
"WARC-Target-URI": "http://www.mathteacherctk.com/blog/2012/02/existence-of-the-incenter-a-seond-look/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:92077323-563f-4bf6-8efa-700eb665011e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-146-231-18.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-23\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for July 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
13,
14,
21,
22,
63,
64,
192,
193,
339,
340,
349,
350,
496,
497,
506,
507,
601,
602,
799,
800,
913,
914,
928,
929,
984,
985
],
"line_end_idx": [
13,
14,
21,
22,
63,
64,
192,
193,
339,
340,
349,
350,
496,
497,
506,
507,
601,
602,
799,
800,
913,
914,
928,
929,
984,
985,
1062
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1062,
"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.4046511650085449,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023255810141563416,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1953488439321518,
"rps_doc_frac_unique_words": 0.49450549483299255,
"rps_doc_mean_word_length": 4.57692289352417,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.077179908752441,
"rps_doc_word_count": 182,
"rps_doc_frac_chars_dupe_10grams": 0.290516197681427,
"rps_doc_frac_chars_dupe_5grams": 0.290516197681427,
"rps_doc_frac_chars_dupe_6grams": 0.290516197681427,
"rps_doc_frac_chars_dupe_7grams": 0.290516197681427,
"rps_doc_frac_chars_dupe_8grams": 0.290516197681427,
"rps_doc_frac_chars_dupe_9grams": 0.290516197681427,
"rps_doc_frac_chars_top_2gram": 0.03001200035214424,
"rps_doc_frac_chars_top_3gram": 0.04681872949004173,
"rps_doc_frac_chars_top_4gram": 0.06002400815486908,
"rps_doc_books_importance": -76.34654235839844,
"rps_doc_books_importance_length_correction": -76.34654235839844,
"rps_doc_openwebtext_importance": -51.09860610961914,
"rps_doc_openwebtext_importance_length_correction": -39.17244338989258,
"rps_doc_wikipedia_importance": -29.7130184173584,
"rps_doc_wikipedia_importance_length_correction": -29.7130184173584
},
"fasttext": {
"dclm": 0.4562806487083435,
"english": 0.9294527173042297,
"fineweb_edu_approx": 1.858385682106018,
"eai_general_math": 0.9471434950828552,
"eai_open_web_math": 0.5898669362068176,
"eai_web_code": 0.038486119359731674
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "516",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
}
},
"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": "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": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,014,393,934,239,679,000 |
EduBlogs Homepage Theme: Deprecated functions
There are a number of warnings and errors with EduBlogs Homepage theme. I've cleaned them up since version 2.1.5 but lost them all when I upgraded to 2.1.6. Since then I have to now run a file comparison to validate the changes. This latest version continues to have the same problems as the previous versions. There are so many deprecated functions and unvalidated variables that it takes several hours to sort through actual changes. For example, /_inc/functions/options-functions.php has 58 uses of deprecated functions or un-validated variables. Also, /_inc/functions/rss-network.php is using the deprecated 'fetch_rss' function. Since the newer 'fetch_feed' has a different implamentation process, I had to rewrite those four sections that utilize the deprecated function.
Is there going to be a update release that addresses these issues soon? I really like the theme but can't upgrade because I spent so much time with the upgrade to the last version
• Barry
• DEV MAN’s Mascot
Depreciated functions are still valid, functioning functions - so don't worry so much about removing them unless you are running your site in debug / full notice reporting mode, which you shouldn't be.
We are currently working on updates to a lot of our plugins / themes in readiness for WP 3.1.
• Richie_KS
• HummingBird
hi meschenbaum
we're on process of updating the themes/plugin for wp 3.1 priority updates soon..
will check on the functions you mention..although recoding all the functions and var call will not be prioritize unless they produce php error or functions not found error.
un-validated variables
which part?...can you list me some example..
we'll also updating the theme with pdf user/theme manual etc..which missing in pre version.
cheers
• meschenbaum
• WPMU DEV Initiate
Thanks for responding back.
It may be best if you just want to do a file comparison with attached modified theme (uh, apparently not. Let me know if you would like me to email the file to you). Note these are quick fixes and there are definitely some better or more efficient ways of addressing these. These are mainly help me get updates to production while satisfying IT's evaluations through log reading.
Oh, and yes I am not running my production environment in debug mode. However, my development environment runs full debug. We've already experienced issues where the development environment wouldn't run because of how many warnings and notices that were produced from multiple plugins and themes.
It should also be noted that even when debug is turned off there is still a performance hit for all of the warnings and notices. WP still handles all the deprecated functions by catching the calls and redirecting them to the proper functions. Also, because the number of calls per page a single warning/notice may occur several times. It may not seem significant but get enough of them from x number of themes, plugins and sites then you'll start noticing the problems.
Sorry, spent the last few days reapplying the same simple updates. I'll get off my soap box now.
Anyways, thanks for responding and let me know if there something else you need.
cheers,
matt
Thank NAME, for their help.
Let NAME know exactly why they deserved these points.
Gift a custom amount of points.
|
{
"url": "https://premium.wpmudev.org/forums/topic/edublogs-homepage-theme-deprecated-functions",
"source_domain": "premium.wpmudev.org",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "115223",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XCDW67F4QAM3C5FFIEG2UIPZTTJP6XMP",
"WARC-Concurrent-To": "<urn:uuid:f041fb60-70be-41ac-bf0d-107adcafd527>",
"WARC-Date": "2019-08-23T13:48:41Z",
"WARC-IP-Address": "104.16.219.51",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CCZF53IDO4BSFYS26WRQVA3FW5VVQCHT",
"WARC-Record-ID": "<urn:uuid:278fe225-fb6a-4d6c-ab04-5a71c931adab>",
"WARC-Target-URI": "https://premium.wpmudev.org/forums/topic/edublogs-homepage-theme-deprecated-functions",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f620649f-ac98-4262-989c-c034f0e8f462>"
},
"warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-52.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
46,
47,
825,
826,
1006,
1007,
1017,
1040,
1041,
1247,
1248,
1346,
1347,
1361,
1379,
1380,
1399,
1485,
1662,
1663,
1690,
1739,
1740,
1836,
1837,
1848,
1849,
1865,
1889,
1890,
1922,
1923,
2307,
2308,
2609,
2610,
3084,
3085,
3186,
3187,
3272,
3273,
3285,
3294,
3295,
3323,
3324,
3378,
3379
],
"line_end_idx": [
46,
47,
825,
826,
1006,
1007,
1017,
1040,
1041,
1247,
1248,
1346,
1347,
1361,
1379,
1380,
1399,
1485,
1662,
1663,
1690,
1739,
1740,
1836,
1837,
1848,
1849,
1865,
1889,
1890,
1922,
1923,
2307,
2308,
2609,
2610,
3084,
3085,
3186,
3187,
3272,
3273,
3285,
3294,
3295,
3323,
3324,
3378,
3379,
3410
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3410,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43007519841194153,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025563910603523254,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16390976309776306,
"rps_doc_frac_unique_words": 0.5120593905448914,
"rps_doc_mean_word_length": 4.931354522705078,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0.0015037599951028824,
"rps_doc_unigram_entropy": 5.276342391967773,
"rps_doc_word_count": 539,
"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.028592929244041443,
"rps_doc_frac_chars_top_3gram": 0.01580134965479374,
"rps_doc_frac_chars_top_4gram": 0.00827690027654171,
"rps_doc_books_importance": -276.6675720214844,
"rps_doc_books_importance_length_correction": -276.6675720214844,
"rps_doc_openwebtext_importance": -163.2373504638672,
"rps_doc_openwebtext_importance_length_correction": -163.2373504638672,
"rps_doc_wikipedia_importance": -102.1183090209961,
"rps_doc_wikipedia_importance_length_correction": -102.1183090209961
},
"fasttext": {
"dclm": 0.021229920908808708,
"english": 0.9446402192115784,
"fineweb_edu_approx": 1.132270336151123,
"eai_general_math": 0.7078914046287537,
"eai_open_web_math": 0.2382870316505432,
"eai_web_code": 0.6431289315223694
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,417,939,342,052,242,400 |
Stack Overflow is a community of 4.7 million programmers, just like you, helping each other.
Join them; it only takes a minute:
Sign up
Join the Stack Overflow community to:
1. Ask programming questions
2. Answer and help your peers
3. Get recognized for your expertise
Possible Duplicate:
Disassembly view of C# 64-bit Release code is 75% longer than 32-bit Debug code?
I have an extremely simple C# Console Application, hat does some sorting on a big number of elements (only a few lines of code with array operations).
When I start the release code from Visual Studio IDE with F5 or Ctrl-F5 the program is about 3x slower than when started directly from Win-Explorer.
41.140 seconds when launched from VS 2010 IDE
13.950 seconds when launched by double-clicking myprogram.exe
Why???
share|improve this question
marked as duplicate by Timbo, Henk Holterman, Guvante, Bryan Crosby, John Humphreys - w00te Oct 9 '12 at 17:49
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
How do you measure? And how do you launch? Start debug in Release mode, or how? – abatishchev Oct 9 '12 at 11:44
It was measured with Stopwatch. The reason is, that CS always attaches a debugger when starting with F5 - no matter whether in debug or in release mode. In C++ this is different! – Knasterbax Oct 9 '12 at 11:56
up vote 2 down vote accepted
Starting a program with the debugger attached will always be significantly slower than without it.
share|improve this answer
Yepp, it is definitively the debugger. I did not know that VS attaches a debugger also in Release-Mode. When I start in Release-Mode with Ctrl-F5 it runs fast!!! – Knasterbax Oct 9 '12 at 11:53
First some details...
Be aware that there are 2 main "optimization" stages in .NET.
• At the C# Compiler level
...the production of different IL (Intermediate Language)...optimized or non-optimized....controlled by whether your project sets the DEBUG flag or not
• At the JITer level
...when the IL is translated into machine code (either through Just-in-Time compilation or via NGEN)....optimized machine code may or may not be produced
Note: it is NOT the IL produced via the compiler in DEBUG or RELEASE mode that controls the JITter optimization setting...it's an independent setting.
The main optimization "wins" occur at the JIT level.
When you are debugging a NET program through Visual Studio, normally you don't want the JITter to produce optimized machine code, because then your program source statements aren't closely in sync with the executing code when you step through it.
So that's why there is an option in Visual Studio to turn off JITter optimizations (this is comparable to turning off JITter optimizations with the AllowOptimize=0 flag)...and by default Visual Studio turns JITter optimizations off:
enter image description here
See this for an explanation of the Suppress option:
When you run a NET application outside of Visual Studio it doesn't matter if that program was compiled as DEBUG (non-optimized IL) or RELEASE (optimized IL)....the JITter will produce optimized machine code by default.
So the behaviour to be noticed is that a NET program will run substantially faster when started outside of Visual Studio than when started from Visual Studio due to the different JITter optimization setting...even when it's a RELEASE mode application....as @Knasterbax observed. In addition, there's additional overhead to add when debugging (F5) and not just running (CTRL+F5) from Visual Studio.
If you run your application (whether RELEASE or DEBUG) from Explorer and then you "attach" to the process with Visual Studio, then your application will be using a JITter that is applying optimizations....your code will run faster...but any source code stepping will not be in sync.
If you untick the "Suppress JIT optimizations" then you can gain faster execution at the expense of a poorer debugging experience in Visual Studio.
To end, there is a way to turn off JITter Optimizations for your application code should you need/want to:
• disable JITter for entire application by putting this into app.config
[.NET Framework Debugging Control]
AllowOptimize=0
• you can tell the JITter not to optimize specified methods by using this attribute
[MethodImpl(MethodImplOptions.NoOptimization)]
on method bodies.
share|improve this answer
Nice hint! By default VS suppresses JIT-optimization in debug mode. But if you are debugging time-consuming code over and over again it can be helpful to switch on optimization... – Knasterbax Oct 9 '12 at 12:22
F5 is start debugging, not "run", it will be doing a lot of things like loading symbols in the background, even if you're attempting to debug a release build.
share|improve this answer
When you compile the code in debug mode, the compiler switches off some optimisations, and it adds some extra instructions, to make it possible to put breakpoints everywhere and to make it possible to single step through the code.
This will make code compiled in debug mode slower than code compiled in release mode.
share|improve this answer
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/12799303/why-is-c-sharp-release-3x-slower-when-launched-from-vs2010-ide/12799346",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2016-26",
"warc_metadata": {
"Content-Length": "85436",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XS3Z7ECPCBE74F4UX7EX3B4MQONJ55XT",
"WARC-Concurrent-To": "<urn:uuid:fffdf38f-62c9-45ac-bd94-b50975b61b1f>",
"WARC-Date": "2016-06-30T05:26:37Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:2BLH42MSNVNSVT6775UD6RDKZAAPYLNF",
"WARC-Record-ID": "<urn:uuid:f94a6fea-af1a-4304-8c34-e01dbe81460a>",
"WARC-Target-URI": "http://stackoverflow.com/questions/12799303/why-is-c-sharp-release-3x-slower-when-launched-from-vs2010-ide/12799346",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5314e9e4-a005-4c08-acd5-21194174b28e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-164-35-72.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-26\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for June 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
93,
94,
129,
130,
138,
176,
207,
239,
278,
279,
299,
380,
381,
532,
533,
682,
683,
729,
791,
792,
799,
800,
828,
829,
940,
941,
1084,
1085,
1090,
1203,
1208,
1419,
1448,
1449,
1548,
1549,
1575,
1580,
1774,
1775,
1797,
1798,
1860,
1861,
1890,
1891,
2047,
2048,
2071,
2072,
2230,
2231,
2386,
2387,
2440,
2441,
2688,
2689,
2922,
2923,
2952,
2953,
3005,
3006,
3225,
3226,
3624,
3625,
3908,
3909,
4057,
4058,
4059,
4166,
4167,
4241,
4242,
4277,
4293,
4294,
4380,
4381,
4428,
4429,
4447,
4448,
4474,
4479,
4691,
4692,
4851,
4852,
4878,
4879,
5110,
5111,
5197,
5198,
5224,
5225
],
"line_end_idx": [
93,
94,
129,
130,
138,
176,
207,
239,
278,
279,
299,
380,
381,
532,
533,
682,
683,
729,
791,
792,
799,
800,
828,
829,
940,
941,
1084,
1085,
1090,
1203,
1208,
1419,
1448,
1449,
1548,
1549,
1575,
1580,
1774,
1775,
1797,
1798,
1860,
1861,
1890,
1891,
2047,
2048,
2071,
2072,
2230,
2231,
2386,
2387,
2440,
2441,
2688,
2689,
2922,
2923,
2952,
2953,
3005,
3006,
3225,
3226,
3624,
3625,
3908,
3909,
4057,
4058,
4059,
4166,
4167,
4241,
4242,
4277,
4293,
4294,
4380,
4381,
4428,
4429,
4447,
4448,
4474,
4479,
4691,
4692,
4851,
4852,
4878,
4879,
5110,
5111,
5197,
5198,
5224,
5225,
5315
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5315,
"ccnet_original_nlines": 100,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3658536672592163,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04221387952566147,
"rps_doc_frac_lines_end_with_ellipsis": 0.009900989942252636,
"rps_doc_frac_no_alph_words": 0.19699811935424805,
"rps_doc_frac_unique_words": 0.4002361297607422,
"rps_doc_mean_word_length": 4.919716835021973,
"rps_doc_num_sentences": 59,
"rps_doc_symbol_to_word_ratio": 0.01594747044146061,
"rps_doc_unigram_entropy": 5.309757232666016,
"rps_doc_word_count": 847,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03575713932514191,
"rps_doc_frac_chars_dupe_6grams": 0.013678910210728645,
"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.028797699138522148,
"rps_doc_frac_chars_top_3gram": 0.007199420128017664,
"rps_doc_frac_chars_top_4gram": 0.009599230252206326,
"rps_doc_books_importance": -462.8222961425781,
"rps_doc_books_importance_length_correction": -462.8222961425781,
"rps_doc_openwebtext_importance": -237.71719360351562,
"rps_doc_openwebtext_importance_length_correction": -237.71719360351562,
"rps_doc_wikipedia_importance": -169.55789184570312,
"rps_doc_wikipedia_importance_length_correction": -169.55789184570312
},
"fasttext": {
"dclm": 0.35807037353515625,
"english": 0.8923724889755249,
"fineweb_edu_approx": 2.0559821128845215,
"eai_general_math": 0.036794960498809814,
"eai_open_web_math": 0.15423643589019775,
"eai_web_code": 0.05466330051422119
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "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": "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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,026,749,472,133,707,000 |
Questions on the Gaussian, or normal probability distribution, which may include multi-dimensional normal distribution.
learn more… | top users | synonyms
0
votes
0answers
16 views
What is the distribution of 'max of some normaldistributions'?
Suppose I have two random variables $a$ and $b$. $a$ follows a normal distribution of parameters $u_1, s_1$. $b$ follows a normal distribution of parameters $u_2, s_2$. $u_1$ and $u_2$ are the ...
0
votes
1answer
32 views
How to approximate a normal distribution?
Suppose I have two random variables $a$ and $b$. $a$ follows a normal distribution of parameters $u_1, s_1$. $b$ follows a normal distribution of parameters $u_2, s_2$. $u_1$ and $u_2$ are the ...
0
votes
0answers
38 views
Is there any closed form for the integration of multiplication of two multivariate normal probability distributions?
I already computed the following integration but it's a messy thing. Is there any easy way to compute it, or does it have any closed form? $V$ and $p$ are known where $V$ and $p<1$ are positive. ...
0
votes
1answer
103 views
Variance with minimal MSE in normal distribution
Given $X_1,...,X_n$ ~ i.i.d. $N(\mu, \sigma^2)$ where the mean is unknown, let the estimator for $\sigma^2$ be $\hat{e} = p\sum_{i=1}^n(X_i-\overline{X})^2$ How do I choose $p$ so that this estimator ...
0
votes
0answers
28 views
First order moment of multivariate Gaussian random vector
Let $X = (X_1,\dotsc, X_n)$ be a random vector distributed as a multivariate Gaussian with mean $0$ and covariance $\Sigma$. What is $\mathbb{E}[X_1\dots X_n]$?
0
votes
2answers
45 views
Covariance between $X$ and $Y$ of a bivariate normal distribution?
$X$ and $Y$ have a bivariate normal distribution with $\sigma_X$= 5 mL, $\sigma_Y$= 2 mL, $\mu_X$= 120 mL, $\mu_Y$= 100 mL, and $\rho$ = 0.6. How do I find the covariance of $X$ and $Y$? I know the ...
1
vote
0answers
30 views
Property of covariance of Normal random variable with an arbitrary function of that random variable
In the paper Sharpee, T., Rust, N.C., Bialek, W.: Analyzing neural responses to natural signals: maximally informative dimensions. Neural Comput. 16, 223–250 (2004). I found the following claim ...
1
vote
0answers
32 views
If B is a N(0,1) R.V., show $E[B^4] = 3$
I've read in Elementary Stochastic Processes by Mikosch (p. 98), that it is a well known fact that: If B is a N(0,1) R.V., $E[B^4] = 3$ I also see something equivalent (but uncited) on the ...
0
votes
0answers
218 views
Expected Value of the absolute value of the sum of random variables
Hi everyone and thanks in advance. Let's say we have a random variable Y which can be expressed as the sum of two other complex random variables X and W, i.e. $ Y = X + W $. $X$ and $W$ are ...
1
vote
0answers
20 views
Scaled distribution of Brownian motion
If I have $X = 5(B_t - B_s)$ Does this have a distribution of $\sim \text{N}(0,25(t-s))$ ? Since $B_t - B_s$ has distribution $\sim \text{N}(0,t-s)$ Then $X = \mu \cdot 0 + \sigma_1 Z$ where $Z ...
0
votes
1answer
40 views
Frequency Distribution and Throughput
I am conducting an experiment on a couple of computer systems but the results I have don't make sense to me. I made each system perform 1000 operations: System A performs operations at a rate of ...
1
vote
1answer
33 views
How to extract a covariance matrix with this information
Referring to the above image, I wanted to know how to get the covariance matrix $\sum$. My understanding is, $A$, is our transformation matrice, such that $\begin{bmatrix} X_1 \\ X_2 \\ ...
0
votes
1answer
65 views
Product of two densities, when one of them is “incomplete”
One can frequently read that the product of two multivariate Gaussian pdfs, $f_1(x)$*$f_2(x)$, is itself a Gaussian function, with parameters as defined for example in: ...
2
votes
1answer
22 views
Linear transforms of Normal dist [closed]
If $X_t = \sqrt{t} Z$ where $Z \sim \text{N}(0,1)$ Then show the distribution of $X_t - X_s$ for $s<t$ Just wanted to check, would this be $\sim \text{N}(0,t-s)$ or $\sim \text{N}(0,(t-s)^2)$ ?
0
votes
2answers
39 views
Distribution of $\int^T_t \sigma (T-u)dW_u$ where $W_t$ is a Brownian motion
I am trying to find the distribution of $\int^T_t \sigma (T-u)dW_u$ where $W_t$ is a Brownian motion. One (very hand-wavey) way is to assume a priori that it is Normally distributed. Then one can ...
0
votes
1answer
33 views
Decision-making with random term
Consider the following situation. There are multiple options to choose from based on an attribute related to those options. For example: ...
0
votes
1answer
24 views
Normal Distribution: Statistics
I'm having a lot of trouble trying to remember the formulas on how to calculate these questions. Any help would be great. An automobile insurer has found that repair claims are Normally distributed ...
1
vote
1answer
54 views
distribution of distance between two points whose coordinates are normal random variables
let there be two random variables $(X_1,Y_1)$ and $(X_2,Y_2)$, where $X_1\sim N(m_1,s)$, $X_2\sim N(m2,s)$, $Y_1\sim N(n,t)$, $Y_2\sim N(n,t)$. What is the distribution of $\|(X_1,Y_1)-(X_2,Y_2)\|$?
0
votes
1answer
49 views
computing p-value with small n
As part of the quality-control program for a catalyst manufacturing line, the raw materials (alumina and a binder) are tested for purity. The process requires that the purity of the alumina be greater ...
0
votes
2answers
56 views
Confusion with Z-Score
Having some issue with the concept of Z score. When exactly do I use $Z = \frac{\bar X - u}{\sigma}$, and when do I use Z = $Z = \frac{\bar X - u}{\frac{\sigma}{\sqrt{n}}}$. I get very confused ...
0
votes
1answer
100 views
Finding the probability using a normal distrubtion.
I have a stats question that says, "An airline flies airplanes that hold 100 passengers. Typically, some 10% of the passengers with reservations do not show up for the flight. The ...
0
votes
0answers
123 views
inequality with gaussian cdf and density involved
in my calculations I've arrived at the following inequality $$ |\frac{4\phi(x)(1-2\Phi(x))}{(1+(1-2\Phi(x))^2)^2}| \leq 0.5 $$ where $\phi$ is Gaussian density, and $\Phi$ Gaussian cdf, which can ...
0
votes
1answer
72 views
Calculate P-Value
In a certain area, regulations require that the chlorine level in wastewater discharges be less than 100 $\mu$/L. In a sample of 85 wastewater specimens, the mean chlorine concentration was 98 ...
0
votes
2answers
118 views
Finding distribution of distance from origin
A shot is fired at a circular target. The vertical and horizontal coordinates of the point of impact (taking the centre of the target as origin) are independent random variables, each distributed ...
0
votes
1answer
67 views
Expectation of a linear combinations of iid standard normal, restricted to a halfspace
Let $u = (u_1, \ldots, u_n)\in\mathbb{R}^n$ be a unit vector in $\mathbb{R}^n$, $Y_i$ be i.i.d standard normal Is there any easy way to calculate $$\mathbb{E} \left[ 1_{\displaystyle \left\{ ...
0
votes
0answers
80 views
How to fit normal cumulative distribution functions
For a normal distribution $N(\mu,\sigma^2)$, we know its cumulative distribution function is $F(x)=\Phi(\frac{x-\mu}{\sigma})$ where $\Phi(x)$ is $cdf$ for standard normal distribution which means $$ ...
1
vote
1answer
56 views
Calculating probabilities for complex random variables
I am having some trouble understanding/formulating how one computes probabilites given a (somehow complex) continuous random variable. For example, if I define a random variable $Z$ as: ...
0
votes
0answers
242 views
The X & Y coordinates for points on a bell curve / normal distribution?
In Short: I want to give a formula the X coordinate and get the Y coordinate from matching a bell curve. Is this possible? In Detail: I'm trying to program a market simulation and to get a product's ...
2
votes
2answers
53 views
How to prove $E[e^{e^y}]=\infty$? y is a normal random variable
The question is, given $Y\sim N(\mu,\sigma^2)$, how to prove$E[e^{e^Y}]=\infty$? I tried to look Y as some kind of Ito's process and apply Ito's formula to it but it doesn't make sense. Next I tried ...
4
votes
1answer
74 views
Almost sure convergence of a sequence of Gaussians with vanishing variance
Let $(X_n)_{n\geq 1} $ a sequence of independent random variables. We assume that $X_n \sim \mathcal{N}(0,\sigma_n^2)$ and that $(\sigma_n)_{n\geq 1}$ is a vanishing sequence of positive numbers. Let ...
-1
votes
1answer
238 views
Normal distribution with dice
I'm wondering how to control the normal distribution that comes from summing dice rolls only using different numbers of dice, different combination of types of dice (d4, d6, d8, d10, d12, d20) and ...
2
votes
1answer
100 views
Expectation of product of two correlated gaussian variables
$\newcommand{\var}{\operatorname{var}}$It seems I can not find the answer anywhere, please point it out how to calculate. Here, I have $X$, $Y$,$G$,$X_D$ and $Y_D$,both are Gaussian variables, and ...
0
votes
1answer
47 views
Variance of a Gaussian Random Variable
Show Variance of a Gaussian random variable $N(\mu,\sigma^2)$ and I know $\mathbb{E}(X)^2 = \mu^2$. So I need $\mathbb{E}(X^2)$ = $\int_{\mathbb{R}} x^2 \frac{1}{\sqrt{2\pi\sigma^2}} ...
0
votes
1answer
91 views
Sigmoid function that approaches infinity as x approaches infinity.
The function I'm looking for looks like an error function, but instead of having asymptotes $1$ and $-1$, the function I'm looking for does not have asymptote. It increases to infinity. The ...
0
votes
0answers
12 views
Regarding the distribution of pivotal functions not depending on their parameter(s)
I have difficulties understanding the part of pivotal functions not depending on their underlying parameters. Let's take a simple example, if Y is a random sample from an $N(\mu,1)$ distribution and ...
2
votes
0answers
69 views
Could we define two random variables such that the product of them is Normal distribution(Gaussian)?
Could we find two random variables $X$ and $Y$ which $XY \sim N(\mu, \sigma^2)$? I found the ratio of two normal distributed random variables is distributed Cauchy distribution. However, on the ...
1
vote
1answer
31 views
finding variance of gaussian distribution from mean
The Gaussian random variable $X$ can be used to model the number of customers that enter a market in 1 minute at a given time of the day. The mean number of customers that enter the market in 1 minute ...
1
vote
3answers
500 views
Finding the probability of loss from standard deviation in normal distribution
I am unsure how to approach the following question. The returns from a project are normally distributed with a mean of \$220,000 and a standard deviation of \$160,000. If the project loses more than ...
0
votes
1answer
20 views
Representation of a non-standard normal variable squared
I have come across a representation of a non-standard normal distributed variable square. It is clear for me that assuming $Z_j \approx N\left ( \theta_j, \frac{\sigma^2}{n} \right )$ we can write ...
0
votes
1answer
39 views
normal approximation of binomial distribution
a school buys 60% of its light bulbs from supplier A and 40% from supplier B. the light bulbs from both suppliers look identical but light bulbs from supplier A have exponentially distributed ...
1
vote
2answers
78 views
Gaussian distribution raised to a power
Given that $X$ follows a Gaussian distribution $e^{-x^2/2\sigma^2}$, what distribution is followed by $X^{1/3}$? How does one start to solve this problem? I guess it isn't ...
0
votes
0answers
29 views
Inequalities in binomial and normal distrubutions
Example Q Foo is normall distrubuted like $$X\sim N(100,15^2)$$ foo of 110 is required. Does that mean that I should find: $$P(X\gt 109) $$ or $$P(X\gt 110) $$ or $$P(X\ge 110) $$ I feel ...
-1
votes
1answer
64 views
How to Normalize the Sum of Two Gaussians
I have the following function: $I(\theta_i) = I_0 + I_1\exp(\mu(\cos(\theta_i - \theta_s) - 1))$. Suppose I have two implementations of this function, whose parameters match with the exception of ...
2
votes
0answers
32 views
Characteristics function and moments of multivariates
I have been reading this paper recently-- http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.199.2157&rep=rep1&type=pdf This is a paper by Nengjiu Ju who uses talyor series to express ...
0
votes
1answer
94 views
Calculate the Probability of a Normally Distributed Random Sample
Please i would like to understand these problems about probability distributions, I can't find a right solution for this problem. I have a variable X which is the level of glucose in blood and is ...
0
votes
0answers
89 views
expected value minimum of bivariate normal distribution
Let $X,Y$ be jointly normal with density $f(x,y)=\dfrac{1}{2\pi\sqrt{1-\rho^2}}\exp(-\dfrac{1}{2(1-\rho^2)}(x^2-2\rho xy+y^2))$. Let $Z=\min(X,Y)$. Show that $E[Z]=\sqrt{\dfrac{1-\rho}{\pi}}$ and ...
1
vote
1answer
22 views
Understanding the normalization of a Gaussian
I have a Gaussian defined as follows: $W(\theta) = j * exp(-0.5 * \theta^2 / \sigma^2)$. I want to set $j$ such that $\frac{1}{360}\int_{-180}^{180} W(\theta)d\theta = 1$. I'm using two values for ...
2
votes
1answer
36 views
variance of multivariate normal
currently trying to compute the first two moments of the multivariate distribution. Got an extremely helpful answer to show that $\mathbb{E}[x]=\mathbb{m}$, with $x \sim ...
1
vote
1answer
46 views
Would the joint distribution of Normal Random Variable and the distribution of a X bar from the same sample be bivariate Normal?
I know this question is somewhat redundant... but here goes: My text asserts that the joint distribution of $$X_1=N(\theta, 1)\text{ and } \bar X = N(\theta, \frac 1n)$$ is Bivariate normal with ...
1
vote
1answer
125 views
The probability that the ratio of two independent standard normal variables is less than $1$
Let the independent random variables $X,Y\sim N(0,1)$. Prove that $P(X/Y < 1) = 3/4. $ Could anyone help me prove this analytically? Thanks. Progress: My first thought was to integrate the joint ...
|
{
"url": "http://math.stackexchange.com/questions/tagged/normal-distribution?page=13&sort=newest&pagesize=15",
"source_domain": "math.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2016-07",
"warc_metadata": {
"Content-Length": "182344",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:G74EAHKNRXDCTUVV4XVB7QPK6HCAX6DB",
"WARC-Concurrent-To": "<urn:uuid:e667c405-fdf3-4eec-a438-d7e596a7405a>",
"WARC-Date": "2016-02-07T04:15:56Z",
"WARC-IP-Address": "104.16.117.182",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:KWCXXIIKCQKT67K2MVY7AKCIZB6YVEH7",
"WARC-Record-ID": "<urn:uuid:f69877fb-1a74-444a-b3e9-3fe7f94c2d59>",
"WARC-Target-URI": "http://math.stackexchange.com/questions/tagged/normal-distribution?page=13&sort=newest&pagesize=15",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:59b2ff95-45c0-4c83-a786-678f9cd697c5>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-182-209.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-07\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
120,
121,
156,
157,
159,
165,
174,
183,
184,
247,
248,
445,
447,
453,
461,
470,
471,
513,
514,
711,
713,
719,
728,
737,
738,
855,
856,
1055,
1057,
1063,
1071,
1081,
1082,
1131,
1132,
1336,
1338,
1344,
1353,
1362,
1363,
1421,
1422,
1583,
1585,
1591,
1600,
1609,
1610,
1677,
1678,
1880,
1882,
1887,
1896,
1905,
1906,
2006,
2007,
2205,
2207,
2212,
2221,
2230,
2231,
2272,
2273,
2466,
2468,
2474,
2483,
2493,
2494,
2562,
2563,
2757,
2759,
2764,
2773,
2782,
2783,
2822,
2823,
3021,
3023,
3029,
3037,
3046,
3047,
3085,
3086,
3285,
3287,
3292,
3300,
3309,
3310,
3367,
3368,
3558,
3560,
3566,
3574,
3583,
3584,
3643,
3644,
3817,
3819,
3825,
3833,
3842,
3843,
3885,
3886,
4080,
4082,
4088,
4097,
4106,
4107,
4184,
4185,
4385,
4387,
4393,
4401,
4410,
4411,
4444,
4445,
4586,
4588,
4594,
4602,
4611,
4612,
4644,
4645,
4847,
4849,
4854,
4862,
4871,
4872,
4962,
4963,
5162,
5164,
5170,
5178,
5187,
5188,
5219,
5220,
5425,
5427,
5433,
5442,
5451,
5452,
5475,
5476,
5674,
5676,
5682,
5690,
5700,
5701,
5753,
5754,
5938,
5940,
5946,
5955,
5965,
5966,
6016,
6017,
6217,
6219,
6225,
6233,
6242,
6243,
6261,
6262,
6459,
6461,
6467,
6476,
6486,
6487,
6532,
6533,
6733,
6735,
6741,
6749,
6758,
6759,
6846,
6847,
7042,
7044,
7050,
7059,
7068,
7069,
7121,
7122,
7326,
7328,
7333,
7341,
7350,
7351,
7406,
7407,
7597,
7599,
7605,
7614,
7624,
7625,
7697,
7698,
7901,
7903,
7909,
7918,
7927,
7928,
7992,
7993,
8196,
8198,
8204,
8212,
8221,
8222,
8297,
8298,
8502,
8505,
8511,
8519,
8529,
8530,
8560,
8561,
8762,
8764,
8770,
8778,
8788,
8789,
8849,
8850,
9051,
9053,
9059,
9067,
9076,
9077,
9116,
9117,
9304,
9306,
9312,
9320,
9329,
9330,
9398,
9399,
9593,
9595,
9601,
9610,
9619,
9620,
9704,
9705,
9908,
9910,
9916,
9925,
9934,
9935,
10036,
10037,
10235,
10237,
10242,
10250,
10259,
10260,
10312,
10313,
10518,
10520,
10525,
10534,
10544,
10545,
10624,
10625,
10828,
10830,
10836,
10844,
10853,
10854,
10911,
10912,
11113,
11115,
11121,
11129,
11138,
11139,
11185,
11186,
11382,
11384,
11389,
11398,
11407,
11408,
11448,
11449,
11625,
11627,
11633,
11642,
11651,
11652,
11702,
11703,
11894,
11897,
11903,
11911,
11920,
11921,
11963,
11964,
12164,
12166,
12172,
12181,
12190,
12191,
12245,
12246,
12440,
12442,
12448,
12456,
12465,
12466,
12532,
12533,
12733,
12735,
12741,
12750,
12759,
12760,
12816,
12817,
13017,
13019,
13024,
13032,
13041,
13042,
13088,
13089,
13290,
13292,
13298,
13306,
13315,
13316,
13348,
13349,
13523,
13525,
13530,
13538,
13547,
13548,
13677,
13678,
13877,
13879,
13884,
13892,
13902,
13903,
13996,
13997
],
"line_end_idx": [
120,
121,
156,
157,
159,
165,
174,
183,
184,
247,
248,
445,
447,
453,
461,
470,
471,
513,
514,
711,
713,
719,
728,
737,
738,
855,
856,
1055,
1057,
1063,
1071,
1081,
1082,
1131,
1132,
1336,
1338,
1344,
1353,
1362,
1363,
1421,
1422,
1583,
1585,
1591,
1600,
1609,
1610,
1677,
1678,
1880,
1882,
1887,
1896,
1905,
1906,
2006,
2007,
2205,
2207,
2212,
2221,
2230,
2231,
2272,
2273,
2466,
2468,
2474,
2483,
2493,
2494,
2562,
2563,
2757,
2759,
2764,
2773,
2782,
2783,
2822,
2823,
3021,
3023,
3029,
3037,
3046,
3047,
3085,
3086,
3285,
3287,
3292,
3300,
3309,
3310,
3367,
3368,
3558,
3560,
3566,
3574,
3583,
3584,
3643,
3644,
3817,
3819,
3825,
3833,
3842,
3843,
3885,
3886,
4080,
4082,
4088,
4097,
4106,
4107,
4184,
4185,
4385,
4387,
4393,
4401,
4410,
4411,
4444,
4445,
4586,
4588,
4594,
4602,
4611,
4612,
4644,
4645,
4847,
4849,
4854,
4862,
4871,
4872,
4962,
4963,
5162,
5164,
5170,
5178,
5187,
5188,
5219,
5220,
5425,
5427,
5433,
5442,
5451,
5452,
5475,
5476,
5674,
5676,
5682,
5690,
5700,
5701,
5753,
5754,
5938,
5940,
5946,
5955,
5965,
5966,
6016,
6017,
6217,
6219,
6225,
6233,
6242,
6243,
6261,
6262,
6459,
6461,
6467,
6476,
6486,
6487,
6532,
6533,
6733,
6735,
6741,
6749,
6758,
6759,
6846,
6847,
7042,
7044,
7050,
7059,
7068,
7069,
7121,
7122,
7326,
7328,
7333,
7341,
7350,
7351,
7406,
7407,
7597,
7599,
7605,
7614,
7624,
7625,
7697,
7698,
7901,
7903,
7909,
7918,
7927,
7928,
7992,
7993,
8196,
8198,
8204,
8212,
8221,
8222,
8297,
8298,
8502,
8505,
8511,
8519,
8529,
8530,
8560,
8561,
8762,
8764,
8770,
8778,
8788,
8789,
8849,
8850,
9051,
9053,
9059,
9067,
9076,
9077,
9116,
9117,
9304,
9306,
9312,
9320,
9329,
9330,
9398,
9399,
9593,
9595,
9601,
9610,
9619,
9620,
9704,
9705,
9908,
9910,
9916,
9925,
9934,
9935,
10036,
10037,
10235,
10237,
10242,
10250,
10259,
10260,
10312,
10313,
10518,
10520,
10525,
10534,
10544,
10545,
10624,
10625,
10828,
10830,
10836,
10844,
10853,
10854,
10911,
10912,
11113,
11115,
11121,
11129,
11138,
11139,
11185,
11186,
11382,
11384,
11389,
11398,
11407,
11408,
11448,
11449,
11625,
11627,
11633,
11642,
11651,
11652,
11702,
11703,
11894,
11897,
11903,
11911,
11920,
11921,
11963,
11964,
12164,
12166,
12172,
12181,
12190,
12191,
12245,
12246,
12440,
12442,
12448,
12456,
12465,
12466,
12532,
12533,
12733,
12735,
12741,
12750,
12759,
12760,
12816,
12817,
13017,
13019,
13024,
13032,
13041,
13042,
13088,
13089,
13290,
13292,
13298,
13306,
13315,
13316,
13348,
13349,
13523,
13525,
13530,
13538,
13547,
13548,
13677,
13678,
13877,
13879,
13884,
13892,
13902,
13903,
13996,
13997,
14195
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 14195,
"ccnet_original_nlines": 403,
"rps_doc_curly_bracket": 0.008453680202364922,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.263938307762146,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06168445944786072,
"rps_doc_frac_lines_end_with_ellipsis": 0.1163366287946701,
"rps_doc_frac_no_alph_words": 0.33096083998680115,
"rps_doc_frac_unique_words": 0.3253345489501953,
"rps_doc_mean_word_length": 4.832487106323242,
"rps_doc_num_sentences": 156,
"rps_doc_symbol_to_word_ratio": 0.014828000217676163,
"rps_doc_unigram_entropy": 5.613152503967285,
"rps_doc_word_count": 2167,
"rps_doc_frac_chars_dupe_10grams": 0.03686020150780678,
"rps_doc_frac_chars_dupe_5grams": 0.08059587329626083,
"rps_doc_frac_chars_dupe_6grams": 0.05595875158905983,
"rps_doc_frac_chars_dupe_7grams": 0.0439266599714756,
"rps_doc_frac_chars_dupe_8grams": 0.03686020150780678,
"rps_doc_frac_chars_dupe_9grams": 0.03686020150780678,
"rps_doc_frac_chars_top_2gram": 0.016615739092230797,
"rps_doc_frac_chars_top_3gram": 0.018621079623699188,
"rps_doc_frac_chars_top_4gram": 0.009931249544024467,
"rps_doc_books_importance": -1638.871337890625,
"rps_doc_books_importance_length_correction": -1638.871337890625,
"rps_doc_openwebtext_importance": -858.905029296875,
"rps_doc_openwebtext_importance_length_correction": -858.905029296875,
"rps_doc_wikipedia_importance": -610.1560668945312,
"rps_doc_wikipedia_importance_length_correction": -610.1560668945312
},
"fasttext": {
"dclm": 0.6932300925254822,
"english": 0.8731581568717957,
"fineweb_edu_approx": 1.6288175582885742,
"eai_general_math": 0.862419843673706,
"eai_open_web_math": 0.7852075695991516,
"eai_web_code": 0.009516780264675617
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "519.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,232,889,694,917,134,000 |
Qué es un sistema operativo. Algunos conceptos básicos
Qué es un sistema operativo. Algunos conceptos básicos
Qué es un sistema operativo
Desde hace un tiempo estamos comentando diversas alternativas de código abierto que tanto las autoridades como los profesionales y los usuarios particulares pueden utilizar para momentos de crisis. En estos días nos estamos dedicando a describir herramientas; servicios web y programas que pueden resultar útiles para la creación de contenidos educativos.
El artículo siguiente va a estar enfocado a los sistemas operativos. Como es probable que despierte interés de gente que no es lectora habitual de Linux Adictos, considero conveniente dedicar este a repasar algunos conceptos introductorios. Si estás familiarizado con Linux, puedes saltártelo tranquilamente.
Qué es un sistema operativo
Un sistema operativo es el software principal que gestiona todo el hardware y demás software de un ordenador. Entre otras cosas maneja los dispositivos de entrada y salida. Hace esto utilizando controladores de dispositivos escritos por los fabricantes de hardware o por terceros para facilitar la comunicación con esos dispositivos. Por otra parte, provee bibliotecas e interfaces de programación de aplicaciones que los desarrolladores pueden utilizar al momento de escribir programas para un sistema operativo en particular..
El sistema operativo actua como intérprete entre las aplicaciones que se ejecutan y el hardware, utilizando a los controladores de hardware como intérpretes entre ambos.
Pongamos un ejemplo
Supongamos que un usuario tiene instalado un navegador de Internet, un programa de procesamiento de textos y una aplicación de dibujo. Estos tres programas incluyen la función de impresión. Ahora bien, si los desarrolladores de cada uno de estos programas tuviera que crear una rutina para esta función, se alargaría el tiempo de desarrollo y aumentaría el espacio de almacenamiento necesario. Sobre todo porque habría que repetir el procedimiento para cada función del programa y para cada dispositivo de hardware disponible en el mercado.
Si el usuario quisiera imprimir en el mismo momento una página web, un documento y un dibujo, teniendo cada aplicación una rutina de impresión diferente, se armaría un cuello de botella.
Lo que sucede en realidad, es que cada una de las aplicaciones le avisa al sistema operativo que quiere imprimir algo. El sistema operativo le envia las peticiones al controlador de la impresora, y el controlador las envía por turno al dispositivo.
El núcleo o kernel
El kernel es el corazón del sistema operativo de una computadora. Es el primer programa que se carga, y maneja todas las funciones fundamentales del ordenador.
Se encarga de asignar memoria, convertir las funciones de software en instrucciones para la CPU de la computadora y de manejar las entradas y salidas de los dispositivos de hardware. El núcleo se ejecuta generalmente en un área aislada para evitar que sea manipulado por otros programas de la computadora.
Aunque, desde el punto de vista del usuario parece que en el núcleo todas las tareas se ejecutan de manera simultánea, en realidad se hacen en forma secuencial. El sistema operativo le dedica a cada tarea un cierto lapso de tiempo y pasa a la siguiente de la lista.
Es posible que leyendo la descripción, esta metodología parezca ineficiente. Sin embargo es ella la que nos permite hacer varias tareas al mismo tiempo como escribir en el procesador de textos y escuchar música. La latencia es el tiempo en que el sistema tarda en completar una tarea. Los kernel de baja latencia le dan prioridad a las solicitudes de tareas que tienen orígenes externos como el ingreso de señales de audio y video o la ejecución de instrumentos musicales virtuales.
Distribuciones Linux
Si seguiste leyendo hasta acá, es probable que te estés preguntando que tiene que ver todo esto con la creación de contenidos educativos.
Es porque en el próximo artículo vamos a introducir a los sistemas operativos para propósitos espcciales.
A diferencia de Windows y Mac, Linux está disponible bajo la forma de distribuciones.
Si te compras un Mac, adquieres una combinación de hardware y software integrados y desarrollados. Si instalas Windows en tu computadora, todos los componentes del sistema operativo estarán desarrollados por Microsoft. En el caso de una distribución Linux, lo que tienes es un paquete de componentes de distintos orígenes
Algunos de ellos son:
• El kernel Linux.
• Utilidades del sistema desarrolladas por el proyecto GNU.
• Controladores de dispositivos creados por los fabricantes o por terceros aplicando ingeniería inversa.
• Servidor gráfico.
• Gestores de ventanas.
• Escritorios.
• Coleccion de software.
Dependiendo de la combinacion de programas que se haga, estas distribuciones podrán servir para propósitos generales o para usos específicos como producción multimedia, informática forense, juegos, etc.
2 comentarios, deja el tuyo
Deja tu comentario
Tu dirección de correo electrónico no será publicada. Los campos obligatorios están marcados con *
*
*
1. Responsable de los datos: Miguel Ángel Gatón
2. Finalidad de los datos: Controlar el SPAM, gestión de comentarios.
3. Legitimación: Tu consentimiento
4. Comunicación de los datos: No se comunicarán los datos a terceros salvo por obligación legal.
5. Almacenamiento de los datos: Base de datos alojada en Occentus Networks (UE)
6. Derechos: En cualquier momento puedes limitar, recuperar y borrar tu información.
1. Joel Guillén dijo
Interesante artículo, ahora me asalta una duda ¿se podría decir que una distribución GNU/Linux es un sistema operativo? recuerdo que alguna vez @belinuxo en Twitter dijo que para considerarse como tal debería construirse desde cero incluyendo el Kernel, así por ejemplo, Ubuntu no era un sistema operativo.
1. Ninguna de las definiciones que consulté de sistemas operativos pone la condición de estar desarrollada desde cero. En mi opinión sería como decir que Windows XP no era un sistema operativo porque gran parte de sus componentes venían de Windows NT,
En mi opinión cualquier distribución GNU/Linux si es un sistema operativo en razón de las funciones que cumple.
Gracias por tu comentario.
|
{
"url": "https://www.linuxadictos.com/que-es-un-sistema-operativo-algunos-conceptos-basicos.html",
"source_domain": "www.linuxadictos.com",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "87687",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PEQJKIXW5R26JKZBBFFOKTZQGK2OG4GF",
"WARC-Concurrent-To": "<urn:uuid:f2a149e0-0ec5-4002-988f-ac6ff94b5766>",
"WARC-Date": "2020-09-25T01:21:36Z",
"WARC-IP-Address": "178.255.231.229",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WMUM4YWUGIQGL3V5OQPDHDDGQYPSS2WU",
"WARC-Record-ID": "<urn:uuid:d4008d0d-fa0d-4eb4-bdd5-b7c2b9b1042a>",
"WARC-Target-URI": "https://www.linuxadictos.com/que-es-un-sistema-operativo-algunos-conceptos-basicos.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:06152ec6-05ad-4175-847c-8b75b27bd4c1>"
},
"warc_info": "isPartOf: CC-MAIN-2020-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-108.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
57,
58,
113,
114,
142,
143,
499,
500,
809,
810,
838,
839,
1368,
1369,
1539,
1540,
1560,
1561,
2102,
2103,
2290,
2291,
2540,
2541,
2560,
2561,
2721,
2722,
3028,
3029,
3295,
3296,
3779,
3780,
3801,
3802,
3940,
3941,
4047,
4048,
4134,
4135,
4457,
4479,
4480,
4501,
4563,
4670,
4692,
4718,
4735,
4762,
4763,
4966,
4967,
4968,
4996,
4997,
5016,
5017,
5116,
5117,
5119,
5120,
5122,
5123,
5173,
5245,
5282,
5381,
5463,
5550,
5551,
5576,
5577,
5888,
5889,
6145,
6263
],
"line_end_idx": [
57,
58,
113,
114,
142,
143,
499,
500,
809,
810,
838,
839,
1368,
1369,
1539,
1540,
1560,
1561,
2102,
2103,
2290,
2291,
2540,
2541,
2560,
2561,
2721,
2722,
3028,
3029,
3295,
3296,
3779,
3780,
3801,
3802,
3940,
3941,
4047,
4048,
4134,
4135,
4457,
4479,
4480,
4501,
4563,
4670,
4692,
4718,
4735,
4762,
4763,
4966,
4967,
4968,
4996,
4997,
5016,
5017,
5116,
5117,
5119,
5120,
5122,
5123,
5173,
5245,
5282,
5381,
5463,
5550,
5551,
5576,
5577,
5888,
5889,
6145,
6263,
6295
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6295,
"ccnet_original_nlines": 79,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08973173052072525,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008325619623064995,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.116558738052845,
"rps_doc_frac_unique_words": 0.42989692091941833,
"rps_doc_mean_word_length": 5.380412578582764,
"rps_doc_num_sentences": 59,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.303262710571289,
"rps_doc_word_count": 970,
"rps_doc_frac_chars_dupe_10grams": 0.02299291081726551,
"rps_doc_frac_chars_dupe_5grams": 0.049051541835069656,
"rps_doc_frac_chars_dupe_6grams": 0.02299291081726551,
"rps_doc_frac_chars_dupe_7grams": 0.02299291081726551,
"rps_doc_frac_chars_dupe_8grams": 0.02299291081726551,
"rps_doc_frac_chars_dupe_9grams": 0.02299291081726551,
"rps_doc_frac_chars_top_2gram": 0.049051541835069656,
"rps_doc_frac_chars_top_3gram": 0.03448937088251114,
"rps_doc_frac_chars_top_4gram": 0.02299291081726551,
"rps_doc_books_importance": -419.3648681640625,
"rps_doc_books_importance_length_correction": -419.3648681640625,
"rps_doc_openwebtext_importance": -232.67196655273438,
"rps_doc_openwebtext_importance_length_correction": -232.67196655273438,
"rps_doc_wikipedia_importance": -114.9560546875,
"rps_doc_wikipedia_importance_length_correction": -114.9560546875
},
"fasttext": {
"dclm": 0.9477395415306091,
"english": 0.0005792099982500076,
"fineweb_edu_approx": 1.3995192050933838,
"eai_general_math": 0.0002327599941054359,
"eai_open_web_math": 0.6136263012886047,
"eai_web_code": 0.6050555109977722
}
}
|
{
"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.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,966,394,705,238,187,000 |
Blog
Hands-On Testing and Analysis
All About Data Protection Part 5 – From Patterson to Products
Flash Drive RAID Array 300x203
I read an interview with Randy Katz of the original RAID paper where he said the academics initially thought that RAID would be used as a performance solution aggregating the performance of many spindles. He went on to say that they were surprised that it was the file server crowd who couldn’t afford more reliable drives, which cost 10X or more as much per GB as the 5 ¼” HDDs we were using, that adopted RAID for resiliency.
Of course 10 years later we were short stroking 15K RPM drives to tweak a few more IOPS out of our Clariions and Syms so RAID ended up taking over the whole storage world for a time but the 21st century is a time for another blog post.
Now that we’ve reviewed the basic taxonomy of RAID it’s time for another look at computer history, or at least my personal journey through computer history.
The mainframes, minicomputers and VAXen of my school days each had a string of 14” disk drives from SMD drives that looked like they came out of the Maytag factory to 6u Priam drives. My first real business, ProComp Systems, turned those Priam, and later 5 ¼” HDDs into subsystems with SASI (Shugart Associates Standard Interface the predecessor to SCSI) controllers and BIOS code for S-100 bus MP/M and TurboDOS systems and PC desktops for NetWare Servers.
The NetWare systems we built in the ‘80s used software mirroring until RAID controllers from Compaq, Mylex, StorageDimensions and TriCord hit the market in the mid ‘90s. Once they did we shifted to RAID pretty much whole hog from internal RAID with Mylex cards and SmartArrays to eternal SCSI to SCSI RAID systems including Data General’s Clariion.
By the time I refocused from NetWare to Windows NT 3.51 as my server platform the built in volume manager included striped and concatenated volumes with RAID5ish striped volumes with parity but Microsoft never optimized their software RAID making hardware RAID controllers a requirement for most applications.
It turns out the ‘386 through Pentium Pro processors of the day didn’t implement XOR as a native microcode instruction so it took many clock cycles to calculate, or check, the parity for each I/O. Intel had another processor in the parts bin, the i960 RISC processor that could perform XORs in just a few clock cycles and that i960 was the brains behind pretty much every RAID controller well into the 2000s.
As a Windows guy I made the transition to SAN technology a bit after some of my Unix sysadmin brethren so we’ll end this chapter around the turn of the century and Windows storage technology at SCSI arrays with up to a dozen SCSI ports for host connections. Windows Server Clustering, codename WolfPack, was brand new and relied on these shared SCSI systems.
vDisks, Volumes, and LUNS, Oh My
The basic function of a RAID controller, whether that’s a hardware device like a Compaq SmartArray or a software module in a host operating system’s volume manager, to aggregate together the drives in a RAIDset and present that capacity as a virtualized disk drive.
Over the years the storage community has decided to call the virtual disks an array presents to a host as a LUN. The acronym LUN stands for Logical Unit Number which in SCSI-speak is the bus address for a specific drive, a concept that dates back to when SCSI was a 50 or 68 line parallel bus and each device on the bus needed a unique address.
Next time we’ll start looking at how smart engineers have managed to extend the concepts of RAID to build ever better products by combining them.
|
{
"url": "http://www.deepstorage.net/NEW/all-about-data-protection-part-5-from-patterson-to-products/",
"source_domain": "www.deepstorage.net",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "40185",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2YPI25GNUFRLFFM75OX7LEDZ4Q6IJJRZ",
"WARC-Concurrent-To": "<urn:uuid:a31962d7-991a-4331-9766-7e9a890549d8>",
"WARC-Date": "2017-12-16T07:01:44Z",
"WARC-IP-Address": "66.147.242.178",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OPTI2RAI6JICR4RP63ACAM5YWRHO5CED",
"WARC-Record-ID": "<urn:uuid:f2b13705-de35-45e5-8a36-514a42a39b5d>",
"WARC-Target-URI": "http://www.deepstorage.net/NEW/all-about-data-protection-part-5-from-patterson-to-products/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a3ba13da-a743-4f86-a3eb-ed30ff260bdd>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-101-239-49.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,
5,
6,
36,
37,
99,
100,
131,
132,
560,
561,
797,
798,
955,
956,
1414,
1415,
1764,
1765,
2075,
2076,
2485,
2486,
2845,
2846,
2879,
2880,
3146,
3147,
3492,
3493
],
"line_end_idx": [
5,
6,
36,
37,
99,
100,
131,
132,
560,
561,
797,
798,
955,
956,
1414,
1415,
1764,
1765,
2075,
2076,
2485,
2486,
2845,
2846,
2879,
2880,
3146,
3147,
3492,
3493,
3638
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3638,
"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.4002828896045685,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06647808104753494,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10466761142015457,
"rps_doc_frac_unique_words": 0.5395569801330566,
"rps_doc_mean_word_length": 4.662974834442139,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.342360973358154,
"rps_doc_word_count": 632,
"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.00508992001414299,
"rps_doc_frac_chars_top_3gram": 0.004750589840114117,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -340.9517517089844,
"rps_doc_books_importance_length_correction": -340.9517517089844,
"rps_doc_openwebtext_importance": -189.3802032470703,
"rps_doc_openwebtext_importance_length_correction": -189.3802032470703,
"rps_doc_wikipedia_importance": -108.68245697021484,
"rps_doc_wikipedia_importance_length_correction": -108.68245697021484
},
"fasttext": {
"dclm": 0.03766918182373047,
"english": 0.9522386789321899,
"fineweb_edu_approx": 1.7744238376617432,
"eai_general_math": 0.23342329263687134,
"eai_open_web_math": 0.1971423625946045,
"eai_web_code": 0.19598042964935303
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.62",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,408,419,540,250,426,000 |
Anyone experience freezes in Tetris DS (Wi-Fi)
Discussion in 'Other Flashing Hardware & Software' started by joeinnit, Oct 1, 2006.
1. joeinnit
OP
joeinnit Member
Newcomer
25
0
May 19, 2006
The past few days I've been playing Tetris Wi-Fi and experienced a few freezeups (2 in about 6 hours of play). One occured while loading a level, the other one in the middle of a match. My card was freshly formatted and updated. Anyone experience anything similar?
2. tama_mog
tama_mog Kupo
Member
1,288
0
May 6, 2006
United States
never had a problem with freezing on wifing with my gf before both using g6's......and we did put in some significant hours. Then again I used an older version of the existing loader.
3. adgloride
adgloride Its A Wii Wario
Member
2,261
2
Apr 2, 2003
Maybe nintendo could have been having problems, or it was a problem at your end causing the freezes. 2 freezes in 6 hours doesn't seem that bad to me. How are you connecting to nintendo Wi-fi via a wireless router or the nintendo Wi-fi dongle?
Loading...
|
{
"url": "https://gbatemp.net/threads/anyone-experience-freezes-in-tetris-ds-wi-fi.37669/",
"source_domain": "gbatemp.net",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "71573",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SBSIYTF4FL74D5K3IJTM653A3DDMD4GT",
"WARC-Concurrent-To": "<urn:uuid:897c0bc3-02df-44e6-b096-94fd31cb2ad9>",
"WARC-Date": "2018-04-23T17:41:20Z",
"WARC-IP-Address": "62.210.180.159",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WMSUS7DUKXHASECNBXRZOKG6Y2OXL2U2",
"WARC-Record-ID": "<urn:uuid:8f20443c-25ec-4fb0-a044-bb009221e92c>",
"WARC-Target-URI": "https://gbatemp.net/threads/anyone-experience-freezes-in-tetris-ds-wi-fi.37669/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d750cd04-ee22-4f5d-9075-7605e1f6f0ab>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-228-153-209.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-17\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for April 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
47,
48,
133,
134,
148,
155,
156,
176,
177,
190,
197,
203,
220,
489,
495,
509,
510,
528,
529,
540,
550,
556,
572,
590,
778,
784,
799,
800,
830,
831,
842,
852,
858,
874,
1122,
1128
],
"line_end_idx": [
47,
48,
133,
134,
148,
155,
156,
176,
177,
190,
197,
203,
220,
489,
495,
509,
510,
528,
529,
540,
550,
556,
572,
590,
778,
784,
799,
800,
830,
831,
842,
852,
858,
874,
1122,
1128,
1138
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1138,
"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.2982456088066101,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021929819136857986,
"rps_doc_frac_lines_end_with_ellipsis": 0.027027029544115067,
"rps_doc_frac_no_alph_words": 0.2631579041481018,
"rps_doc_frac_unique_words": 0.6740331649780273,
"rps_doc_mean_word_length": 4.408839702606201,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0.013157890178263187,
"rps_doc_unigram_entropy": 4.630500316619873,
"rps_doc_word_count": 181,
"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.04010025039315224,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -104.76697540283203,
"rps_doc_books_importance_length_correction": -104.76697540283203,
"rps_doc_openwebtext_importance": -72.63712310791016,
"rps_doc_openwebtext_importance_length_correction": -68.2104721069336,
"rps_doc_wikipedia_importance": -62.100196838378906,
"rps_doc_wikipedia_importance_length_correction": -62.100196838378906
},
"fasttext": {
"dclm": 0.025768760591745377,
"english": 0.9495600461959839,
"fineweb_edu_approx": 1.1008188724517822,
"eai_general_math": 0.009129050187766552,
"eai_open_web_math": 0.16166192293167114,
"eai_web_code": 0.00006330000178422779
}
}
|
{
"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": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-9,125,442,092,827,711,000 |
html5-img
1 / 34
What is Calculus?
What is Calculus?. Origin of calculus. The word Calculus comes from the Greek name for pebbles Pebbles were used for counting and doing simple algebra…. Google answer.
merrill
Download Presentation
What is Calculus?
An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.
E N D
Presentation Transcript
1. What is Calculus?
2. Origin of calculus • The word Calculus comes from the Greek name for pebbles • Pebbles were used for counting and doing simple algebra…
3. Google answer • “A method of computation or calculation in a special notation (like logic or symbolic logic). (You'll see this at the end of high school or in college.)” • “The hard deposit of mineralized plaque that forms on the crown and/or root of the tooth. Also referred to as tartar.”
4. Google answers • “The branch of mathematics involving derivatives and integrals.” • “The branch of mathematics that is concerned with limits and with the differentiation and integration of functions”
5. My definition • The branch of mathematics that attempts to “do things” with very large numbers and very small numbers • Formalising the concept of very • Developing tools to work with very large/small numbers • Solving interesting problems with these tools.
6. Examples • Limits of sequences: lim an = a n
7. Examples • Limits of sequences: lim an = a THAT’S CALCULUS! (the study of what happens when n gets very very large) n
8. Examples • Instantaneous velocity
9. Examples • Instantaneous velocity
10. Examples • Instantaneous velocity
11. distance time = lim both go to 0 Examples • Instantaneous velocity
12. distance time = lim both go to 0 Examples • Instantaneous velocity THAT’S CALCULUS TOO! (the study of what happens when things get very very small)
13. Examples • Local slope = lim variation in F(x) variation in x both go to 0
14. Important new concepts! • So far, we have always dealt with actual numbers (variables) • Example: f(x) = x2 + 1 is a rule for taking actual values of x, and getting out actual values f(x). • Now we want to create a mathematical formalism to manipulate functions when x is no longer a number, but a concept of something very large, or very small!
15. Important new concepts! • Leibnitz, followed by Newton (end of 17th century), created calculus to do that and much much more. • Mathematical revolution! New notations and new tools facilitated further mathematical developments enormously. • Similar advancements • The invention of the “0” (India, sometimes in 7th century) • The invention of negative numbers (same, invented for banking purposes) • The invention of arithmetic symbols (+, -, x, = …) is very recent (from 16th century!)
16. Plan • Keep working with functions • Understand limits (for very small and very large numbers) • Understand the concept of continuity • Learn how to find local slopes of functions (derivatives) = differential calculus • Learn how to use them in many applications
17. Chapter V: Limits and continuityV.1: An informal introduction to limits
18. V.1.1: Introduction to limits at infinity. • Similar concept to limits of sequences at infinity: what happens to a function f(x) when x becomes very large. • This time, x can be either positive or negative so the limit is at both + infinity and - infinity: • lim x + f(x) • limx - f(x)
19. Example of limits at infinity • The function can converge The function converges to a single value (1), called the limit of f. We write limx + f(x) = 1
20. Example of limits at infinity • The function can converge The function converges to a single value (0), called the limit of f. We write limx + f(x) = 0
21. Example of limits at infinity • The function can diverge The function doesn’t converge to a single value but keeps growing. It diverges. We can write limx + f(x) = +
22. Example of limits at infinity • The function can diverge The function doesn’t converge to a single value but its amplitude keeps growing. It diverges.
23. Example of limits at infinity • The function may neither converge nor diverge!
24. Example of limits at infinity • The function can do all this either at + infinity or - infinity The function converges at - and diverges at + . We can write limx + f(x) = + limx - f(x) = 0
25. Example of limits at infinity • The function can do all this either at + infinity or - infinity The function converges at + and diverges at -. We can write limx + f(x) = 0
26. Calculus… • Helps us understand what happens to a function when x is very large (either positive or negative) • Will give us tools to study this without having to plot the function f(x) for all x! • So we don’t fall into traps…
27. V.1.2: Introduction to limits at a point • Limit of a function at a point: New concept! • What happens to a function f(x) when x tends to a specific value. • Be careful! A specific value can be approached from both sides so we have a limit from the left, and a limit from the right.
28. Examples of limits at x=0 (x becomes very small!) • The function can have asymptotes (it diverges). The limit at 0 doesn’t exist…
29. Examples of limits at x=0 • The function can have a gap! The limit at 0 doesn’t exist…
30. Examples of limits at x=0 • The function can behave in a complicated (exciting) way.. (the limit at 0 doesn’t exist)
31. Examples of limits at x=0 • But most functions at most points behave in a simple (boring) way. The function has a limit when x tends to 0 and that limit is 0. We write limx 0 f(x) = 0
32. Limits at a point • All these behaviours also exist when x tends to another number • Remember: if g(x) = f(x-c) then the graph of g is the same as the graph of f but shifted right by an amount c
33. Limits at a point f(x) = 1/x g(x) = f(x-2) = 1/(x-2) 0 2 x
More Related
|
{
"url": "https://www.slideserve.com/merrill/what-is-calculus",
"source_domain": "www.slideserve.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "92447",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UOMUSSIG5U52JCHHBKRJMFCNX6DVN2VV",
"WARC-Concurrent-To": "<urn:uuid:f5e9a509-1123-408f-bd43-e90bc74ebc0a>",
"WARC-Date": "2024-04-12T11:03:51Z",
"WARC-IP-Address": "146.75.37.91",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CAINPFYUSHOJDROER74YMJCZVFHF3Y4N",
"WARC-Record-ID": "<urn:uuid:12247f1c-e716-4de4-8c94-86553eaa18cc>",
"WARC-Target-URI": "https://www.slideserve.com/merrill/what-is-calculus",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:722fab79-1921-4b96-a60d-ba0a30de7e8b>"
},
"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-150\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
10,
17,
18,
36,
37,
205,
206,
214,
236,
237,
255,
256,
878,
879,
885,
886,
910,
911,
912,
935,
936,
1077,
1078,
1374,
1375,
1580,
1581,
1844,
1845,
1898,
1899,
2025,
2026,
2065,
2066,
2105,
2106,
2146,
2147,
2220,
2221,
2375,
2376,
2457,
2458,
2810,
2811,
3303,
3304,
3573,
3574,
3652,
3653,
3951,
3952,
4112,
4113,
4273,
4274,
4449,
4450,
4607,
4608,
4693,
4694,
4896,
4897,
5079,
5080,
5314,
5315,
5604,
5605,
5741,
5742,
5835,
5836,
5959,
5960,
6152,
6153,
6354,
6355,
6420,
6421
],
"line_end_idx": [
10,
17,
18,
36,
37,
205,
206,
214,
236,
237,
255,
256,
878,
879,
885,
886,
910,
911,
912,
935,
936,
1077,
1078,
1374,
1375,
1580,
1581,
1844,
1845,
1898,
1899,
2025,
2026,
2065,
2066,
2105,
2106,
2146,
2147,
2220,
2221,
2375,
2376,
2457,
2458,
2810,
2811,
3303,
3304,
3573,
3574,
3652,
3653,
3951,
3952,
4112,
4113,
4273,
4274,
4449,
4450,
4607,
4608,
4693,
4694,
4896,
4897,
5079,
5080,
5314,
5315,
5604,
5605,
5741,
5742,
5835,
5836,
5959,
5960,
6152,
6153,
6354,
6355,
6420,
6421,
6433
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6433,
"ccnet_original_nlines": 85,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35933148860931396,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013927579857409,
"rps_doc_frac_lines_end_with_ellipsis": 0.046511631458997726,
"rps_doc_frac_no_alph_words": 0.28203344345092773,
"rps_doc_frac_unique_words": 0.317051500082016,
"rps_doc_mean_word_length": 4.35435152053833,
"rps_doc_num_sentences": 89,
"rps_doc_symbol_to_word_ratio": 0.004874649923294783,
"rps_doc_unigram_entropy": 5.139374256134033,
"rps_doc_word_count": 1126,
"rps_doc_frac_chars_dupe_10grams": 0.19783805310726166,
"rps_doc_frac_chars_dupe_5grams": 0.3257189393043518,
"rps_doc_frac_chars_dupe_6grams": 0.29247400164604187,
"rps_doc_frac_chars_dupe_7grams": 0.26820313930511475,
"rps_doc_frac_chars_dupe_8grams": 0.2641240060329437,
"rps_doc_frac_chars_dupe_9grams": 0.23169487714767456,
"rps_doc_frac_chars_top_2gram": 0.040383439511060715,
"rps_doc_frac_chars_top_3gram": 0.02243524044752121,
"rps_doc_frac_chars_top_4gram": 0.027534160763025284,
"rps_doc_books_importance": -664.6021728515625,
"rps_doc_books_importance_length_correction": -664.6021728515625,
"rps_doc_openwebtext_importance": -408.0957946777344,
"rps_doc_openwebtext_importance_length_correction": -408.0957946777344,
"rps_doc_wikipedia_importance": -213.3759307861328,
"rps_doc_wikipedia_importance_length_correction": -213.3759307861328
},
"fasttext": {
"dclm": 0.03184003010392189,
"english": 0.8858009576797485,
"fineweb_edu_approx": 3.249392032623291,
"eai_general_math": 0.9917463660240173,
"eai_open_web_math": 0.8332728147506714,
"eai_web_code": 0.04773766174912453
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "515",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,696,313,917,872,922,000 |
Distracted compassion
Much has been written about the joys and woes of technology. It can keep us connected when distance keeps us apart and it can disconnect us although we’re in the same room. It can enable us to be more productive and achieve our goals, and it can distract us from being productive and achieving our goals.
One impact I hadn’t recognised until recently was the toll on my emotions and compassion as I flit back and forth between digital connections.
In the space of half an hour I had 5 different overlapping conversations on WhatsApp. Responding with a message on one chat while waiting for a response on another.
I was simultaneously congratulating a friend on stepping out of her comfort zone, sending meeting dates to a stranger, laughing with a friend about an incident that had happened earlier in the day, sorting out logistics with someone coming to stay with us for the weekend and discovering my friends brother had been taken into hospital.
Each “chat” was a completely different space where I not only wore a different hat but also experience a different emotion as I responded to the digital letters appearing on my phone.
This just isn’t natural! I exclaimed to my husband as he came to see if I wanted a cup of tea. His lovely offer in that moment like felt like a demand on me to wear yet another hat and feel another emotion that I simply couldn’t manage. Exasperated I realised if those conversation were all happening in real life I would finish one before starting the next, those able to see me engrossed in one conversation would wait or catch up with me at a more convenient moment. At the end of 5 back to back conversations on such differing topics the introvert in me wouldn’t be surprised at feeling tired, and the loving offer of a cup of tea would be have been very welcome.
But I had chosen to allow technology to enable me to multitask, and split my attention and compassion between 5 different situations. None of whom got my best least of all the person who needed me the most. None of which left me feeling like I’d had a fulfilling human connection. All of which, no matter how light hearted the response, left me feeling tired and depleted and enhanced the feeling that I had no words of comfort to offer my friend in crisis.
So I’m learning to take time to reply to messages, to give you my full attention because we both deserve it.
Leave a Reply
Fill in your details below or click an icon to log in:
WordPress.com Logo
You are commenting using your WordPress.com account. Log Out / Change )
Google photo
You are commenting using your Google account. Log Out / Change )
Twitter picture
You are commenting using your Twitter account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
Connecting to %s
|
{
"url": "https://beckylewis.co.uk/2022/01/12/distracted-compassion/",
"source_domain": "beckylewis.co.uk",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "85743",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WVGSIKF3XOTT3HWRZWRL22GVG366EWGD",
"WARC-Concurrent-To": "<urn:uuid:691609fd-e9e8-449f-9834-18d4c1e6892f>",
"WARC-Date": "2022-01-21T07:26:32Z",
"WARC-IP-Address": "192.0.78.25",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KEPPM7G2H4U6EN7E3RCDWYFKGMBLCG7D",
"WARC-Record-ID": "<urn:uuid:1dc16906-e783-4e60-8990-9a78badce679>",
"WARC-Target-URI": "https://beckylewis.co.uk/2022/01/12/distracted-compassion/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5640524f-f7a1-4bd2-bf86-61f9e844af83>"
},
"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-11\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,
22,
23,
328,
329,
472,
473,
638,
639,
976,
977,
1161,
1162,
1830,
1831,
2289,
2290,
2399,
2400,
2401,
2415,
2416,
2471,
2472,
2491,
2492,
2565,
2566,
2579,
2580,
2646,
2647,
2663,
2664,
2731,
2732,
2747,
2748,
2816,
2817
],
"line_end_idx": [
22,
23,
328,
329,
472,
473,
638,
639,
976,
977,
1161,
1162,
1830,
1831,
2289,
2290,
2399,
2400,
2401,
2415,
2416,
2471,
2472,
2491,
2492,
2565,
2566,
2579,
2580,
2646,
2647,
2663,
2664,
2731,
2732,
2747,
2748,
2816,
2817,
2833
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2833,
"ccnet_original_nlines": 39,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4776386320590973,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026833629235625267,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10017888993024826,
"rps_doc_frac_unique_words": 0.5090543031692505,
"rps_doc_mean_word_length": 4.549295902252197,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.126646041870117,
"rps_doc_word_count": 497,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.048651039600372314,
"rps_doc_frac_chars_dupe_6grams": 0.026536930352449417,
"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.00884564034640789,
"rps_doc_frac_chars_top_3gram": 0.028306059539318085,
"rps_doc_frac_chars_top_4gram": 0.037151701748371124,
"rps_doc_books_importance": -256.57470703125,
"rps_doc_books_importance_length_correction": -256.57470703125,
"rps_doc_openwebtext_importance": -133.34994506835938,
"rps_doc_openwebtext_importance_length_correction": -133.34994506835938,
"rps_doc_wikipedia_importance": -107.16448211669922,
"rps_doc_wikipedia_importance_length_correction": -107.16448211669922
},
"fasttext": {
"dclm": 0.024164019152522087,
"english": 0.9580259919166565,
"fineweb_edu_approx": 1.1493232250213623,
"eai_general_math": -0.000006199999916134402,
"eai_open_web_math": 0.05239427089691162,
"eai_web_code": -0.000009780000254977494
}
}
|
{
"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.8",
"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": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,272,085,006,014,337,000 |
[Date Prev][Date Next] [Thread Prev][Thread Next] [Date Index] [Thread Index]
Re: where to search for s390x workers for ci.debian.net?
Paul, in case Mark Post didn't CC you on his reply to LINUX-390 he suggested:
Sure, the IBM LinuxONE Community Cloud. See
https://developer.ibm.com/components/ibm-linuxone/gettingstarted/ for
more information.
They do give 90-day Linux on VM accounts but you can't install an OS, you take what they give you (RedHat).
On 05.10.20 21:05, Paul Gevers wrote:
> Does
> any of you have ideas where we would be able to get access to s390x
> hosts to run autopkgtests on?
--
---
Jack Woehr # Woehr's Asymptote: The ratio of the time spent
Box 51, Golden CO 80402 # administering productivity software over the time
http://www.softwoehr.com # saved by said software eventually approximates 1.
Reply to:
|
{
"url": "https://lists.debian.org/debian-s390/2020/10/msg00003.html",
"source_domain": "lists.debian.org",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "8547",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MGKQTCWK6OCZ54QB5PZWOKXHFOUWBYUM",
"WARC-Concurrent-To": "<urn:uuid:0445ef94-33fd-4f7c-8b7a-db125feca0f4>",
"WARC-Date": "2023-11-30T19:10:15Z",
"WARC-IP-Address": "82.195.75.100",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LRKHPUNDDDQB2S33MMRCCFEROR44ZWJX",
"WARC-Record-ID": "<urn:uuid:a50180b4-7995-4360-b245-bd221677dffa>",
"WARC-Target-URI": "https://lists.debian.org/debian-s390/2020/10/msg00003.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ee8269bc-1aad-4c2d-a250-3ad0fcbae7b6>"
},
"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,
1,
79,
80,
137,
138,
139,
140,
218,
219,
263,
333,
351,
352,
460,
461,
499,
507,
577,
609,
610,
611,
612,
615,
619,
693,
770,
847,
848,
849
],
"line_end_idx": [
1,
79,
80,
137,
138,
139,
140,
218,
219,
263,
333,
351,
352,
460,
461,
499,
507,
577,
609,
610,
611,
612,
615,
619,
693,
770,
847,
848,
849,
858
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 858,
"ccnet_original_nlines": 29,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24752475321292877,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029702970758080482,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.32673266530036926,
"rps_doc_frac_unique_words": 0.7580645084381104,
"rps_doc_mean_word_length": 5.096774101257324,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0.014851490035653114,
"rps_doc_unigram_entropy": 4.407331943511963,
"rps_doc_word_count": 124,
"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.022151900455355644,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -105.27861785888672,
"rps_doc_books_importance_length_correction": -105.27861785888672,
"rps_doc_openwebtext_importance": -58.53330993652344,
"rps_doc_openwebtext_importance_length_correction": -54.527862548828125,
"rps_doc_wikipedia_importance": -31.160799026489258,
"rps_doc_wikipedia_importance_length_correction": -31.160799026489258
},
"fasttext": {
"dclm": 0.028168920427560806,
"english": 0.874685525894165,
"fineweb_edu_approx": 1.4650895595550537,
"eai_general_math": 0.016178429126739502,
"eai_open_web_math": 0.4693397283554077,
"eai_web_code": -0.000003099999958067201
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02856",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
101,409,175,186,920,400 |
584
Is it possible to construct a snippet of code in Java that would make a hypothetical java.lang.ChuckNorrisException uncatchable?
Thoughts that came to mind are using for example interceptors or aspect-oriented programming.
• 31
What can you throw in Java? – Jacob Schoen Dec 14 '12 at 17:12
• 2
using the suggestion from the link @jschoen provided (disable the byte code verifier) you can throw something which doesn't extend Throwable! described in my answer below. – jtahlborn Dec 14 '12 at 17:42
• 4
This excerpt from aioobe's answer sums up the question @jschoen linked quite well: "I.e., your question can be interpreted as 'If a JVM deviates from the specification, can it do weird stuff such as throwing primitivs' and the answer is of course, yes." – Dan Neely Dec 14 '12 at 18:26
• 2
@Max - Can you elaborate on practical uses for this? – Vineet Bhatia Dec 15 '12 at 20:36
• 3
how about an exception that rethrow itself on the finalize()? – Lie Ryan Dec 16 '12 at 8:53
17 Answers 17
308
I haven't tried this, so I don't know if the JVM would restrict something like this, but maybe you could compile code which throws ChuckNorrisException, but at runtime provide a class definition of ChuckNorrisException which does not extend Throwable.
UPDATE:
It doesn't work. It generates a verifier error:
Exception in thread "main" java.lang.VerifyError: (class: TestThrow, method: ma\
in signature: ([Ljava/lang/String;)V) Can only throw Throwable objects
Could not find the main class: TestThrow. Program will exit.
UPDATE 2:
Actually, you can get this to work if you disable the byte code verifier! (-Xverify:none)
UPDATE 3:
For those following from home, here is the full script:
Create the following classes:
public class ChuckNorrisException
extends RuntimeException // <- Comment out this line on second compilation
{
public ChuckNorrisException() { }
}
public class TestVillain {
public static void main(String[] args) {
try {
throw new ChuckNorrisException();
}
catch(Throwable t) {
System.out.println("Gotcha!");
}
finally {
System.out.println("The end.");
}
}
}
Compile classes:
javac -cp . TestVillain.java ChuckNorrisException.java
Run:
java -cp . TestVillain
Gotcha!
The end.
Comment out "extends RuntimeException" and recompile ChuckNorrisException.java only :
javac -cp . ChuckNorrisException.java
Run:
java -cp . TestVillain
Exception in thread "main" java.lang.VerifyError: (class: TestVillain, method: main signature: ([Ljava/lang/String;)V) Can only throw Throwable objects
Could not find the main class: TestVillain. Program will exit.
Run without verification:
java -Xverify:none -cp . TestVillain
The end.
Exception in thread "main"
• 18
OK, so what if you catch Object instead of Throwable, then? (The compiler won't allow it, but since we've already disabled the verifier, maybe one could hack the bytecode to do it.) – Ilmari Karonen Dec 14 '12 at 18:40
• 10
According to What can you throw in Java you can still catch things that don't extend throwable, but throwing and catching them is undefined behavior. – VolatileDream Dec 14 '12 at 19:49
• 8
@dzieciou They can be true together. You might be able to catch them using your version of the Java environment on your specific version of your operating system on your processor type. But if it's not specified in the standard whether it CAN be caught, it's called undefined behavior, because other implementations of Java might choose to make it non-catchable. – heinrich5991 Dec 15 '12 at 12:39
• 2
Hmmph. I was hoping that for 176 upvotes, you'd written some JNI code that monkey-patches the entire call stack to rethrow your exception (called by the ctor, of course). – kdgregory Jan 1 '13 at 12:58
• 3
When doing all of this, it's also a great idea to stand on one leg, pat your head and rub your tummy while whistling dixie...;) ;) – Glen Best May 29 '13 at 14:33
115
After having pondered this, I have successfully created an uncatchable exception. I chose to name it JulesWinnfield, however, rather than Chuck, because it is one mushroom-cloud-laying-mother-exception. Furthermore, it might not be exactly what you had in mind, but it certainly can't be caught. Observe:
public static class JulesWinnfield extends Exception
{
JulesWinnfield()
{
System.err.println("Say 'What' again! I dare you! I double dare you!");
System.exit(25-17); // And you shall know I am the LORD
}
}
public static void main(String[] args)
{
try
{
throw new JulesWinnfield();
}
catch(JulesWinnfield jw)
{
System.out.println("There's a word for that Jules - a bum");
}
}
Et voila! Uncaught exception.
Output:
run:
Say 'What' again! I dare you! I double dare you!
Java Result: 8
BUILD SUCCESSFUL (total time: 0 seconds)
When I have a little more time, I'll see if I can't come up with something else, as well.
Also, check this out:
public static class JulesWinnfield extends Exception
{
JulesWinnfield() throws JulesWinnfield, VincentVega
{
throw new VincentVega();
}
}
public static class VincentVega extends Exception
{
VincentVega() throws JulesWinnfield, VincentVega
{
throw new JulesWinnfield();
}
}
public static void main(String[] args) throws VincentVega
{
try
{
throw new JulesWinnfield();
}
catch(JulesWinnfield jw)
{
}
catch(VincentVega vv)
{
}
}
Causes a stack overflow - again, exceptions remain uncaught.
• 31
+1 for using Stack Overflow in your answer. Just kidding, really good answer. – Josiah Dec 15 '12 at 23:20
• 7
A proper "uncatchable exception" would ensure that all enclosing finally blocks would execute without any intervening catches. Killing the system doesn't throw an exception--it just kills the system. – supercat Dec 15 '12 at 23:54
• 4
How do you "throw" the JulesWinfield? Won't the system come to a screeching halt before it's thrown? – supercat Dec 16 '12 at 0:25
• 4
@mikeTheLiar: The system exits during the constructor, does it not? The statement throw new Whatever() is really two parts: Whatever it = new Whatever(); throw it;, and the system dies before it reaches the second part. – supercat Dec 16 '12 at 0:40
• 5
@mikeTheLiar you actually can catch Jules or Vincent quite easily... if you manage to throw it. It's easy to create an exception that you can't throw: class cn extends exception{private cn(){}} – John Dvorak Dec 18 '12 at 20:55
85
With such an exception it would obviously be mandatory to use a System.exit(Integer.MIN_VALUE); from the constructor because this is what would happen if you threw such an exception ;)
• 32
+1; IMO this is the only possible solution. An uncatchable exception is should terminate the program... – home Dec 14 '12 at 17:15
• 7
No, it would not be what happens when you throw such an exception. An uncaught exception will terminate a single thread, it will not exit the jvm, in some contexts System.exit itself will even cause a SecurityException - not every piece of code is allowed to shutdown a program. – josefx Dec 15 '12 at 18:53
• 3
You can use while(true){} instead of System.exit(). – Piotr Praszmo Dec 15 '12 at 22:14
• 2
actually, you can prevent System.exit() from working by installing a security manager which disallows it. that would turn the constructor into a different exception (SecurityException), which could be caught. – jtahlborn Dec 16 '12 at 13:21
• 5
Umm, technically you never threw an exception. You haven't even constructed the object to throw yet! – Thomas Eding Dec 18 '12 at 8:14
45
Any code can catch Throwable. So no, whatever exception you create is going to be a subclass of Throwable and will be subject to being caught.
• 11
Throwable would hang itself in an attempt to catch ChuckNorrisException :P – PermGenError Dec 15 '12 at 9:09
35
public class ChuckNorrisException extends Exception {
public ChuckNorrisException() {
System.exit(1);
}
}
(Granted, technically this exception is never actually thrown, but a proper ChuckNorrisException can't be thrown -- it throws you first.)
• 4
A colleague of mine had suggested sticking 'for(;;){}' as he felt a 'System.exit(1)' call could throw a Security Exception. I'm voting this one up for creativity! – Phil Street Dec 18 '12 at 22:00
• I agree with the end of your answer. Never mess with ChuckNorris, Exception or not. – Benj Jul 29 '16 at 12:26
28
Any exception you throw has to extend Throwable, so it can be always caught. So answer is no.
If you want to make it difficult to handle, you can override methods getCause(), getMessage(), getStackTrace(), toString() to throw another java.lang.ChuckNorrisException.
• 2
Hmm, catch(Throwable t) call any methods or otherwise mutate the object? It may be possible to cause a catch clause to further throw an exception therefor making it impossible. – Colton Dec 14 '12 at 18:33
• 1
I think catch(Throwable t) only stores it into variable so my suggestions only apply in the next block when user want to cope with the exception – mirelon Dec 14 '12 at 20:52
23
My answer is based on @jtahlborn's idea, but it's a fully working Java program, that can be packaged into a JAR file and even deployed to your favorite application server as a part of a web application.
First of all, let's define ChuckNorrisException class so that it doesn't crash JVM from the beginning (Chuck really loves crashing JVMs BTW :)
package chuck;
import java.io.PrintStream;
import java.io.PrintWriter;
public class ChuckNorrisException extends Exception {
public ChuckNorrisException() {
}
@Override
public Throwable getCause() {
return null;
}
@Override
public String getMessage() {
return toString();
}
@Override
public void printStackTrace(PrintWriter s) {
super.printStackTrace(s);
}
@Override
public void printStackTrace(PrintStream s) {
super.printStackTrace(s);
}
}
Now goes Expendables class to construct it:
package chuck;
import javassist.*;
public class Expendables {
private static Class clz;
public static ChuckNorrisException getChuck() {
try {
if (clz == null) {
ClassPool pool = ClassPool.getDefault();
CtClass cc = pool.get("chuck.ChuckNorrisException");
cc.setSuperclass(pool.get("java.lang.Object"));
clz = cc.toClass();
}
return (ChuckNorrisException)clz.newInstance();
} catch (Exception ex) {
throw new RuntimeException(ex);
}
}
}
And finally the Main class to kick some butt:
package chuck;
public class Main {
public void roundhouseKick() throws Exception {
throw Expendables.getChuck();
}
public void foo() {
try {
roundhouseKick();
} catch (Throwable ex) {
System.out.println("Caught " + ex.toString());
}
}
public static void main(String[] args) {
try {
System.out.println("before");
new Main().foo();
System.out.println("after");
} finally {
System.out.println("finally");
}
}
}
Compile and run it with following command:
java -Xverify:none -cp .:<path_to_javassist-3.9.0.GA.jar> chuck.Main
You will get following output:
before
finally
No surprise - it's a roundhouse kick after all :)
• very nice! haven't done much with class definition manipulation myself. do you still need the "verify:none" on the commandline? – jtahlborn Dec 21 '12 at 14:46
• @jtahlborn Yes, attempt to throw an object not being descendant of Throwable fails without "verify:none". – Wildfire Dec 22 '12 at 11:51
• oh, i got the impression this somehow got around that constraint. so how is this different from my answer? – jtahlborn Dec 22 '12 at 15:03
• 2
The main difference is that it's working java code without compile-time hacking – Wildfire Dec 23 '12 at 10:12
15
In the constructor you could start a thread which repeatedly calls originalThread.stop (ChuckNorisException.this)
The thread could catch the exception repeatedly but would keep throwing it until it dies.
• Only way to do it – Demi May 9 '14 at 4:09
13
No. All exceptions in Java must subclass java.lang.Throwable, and although it may not be good practice, you can catch every type of exception like so:
try {
//Stuff
} catch ( Throwable T ){
//Doesn't matter what it was, I caught it.
}
See the java.lang.Throwable documentation for more information.
If you're trying to avoid checked exceptions (ones that must be explicitly handled) then you will want to subclass Error, or RuntimeException.
9
Actually the accepted answer is not so nice because Java needs to be run without verification, i.e. the code would not work under normal circumstances.
AspectJ to the rescue for the real solution!
Exception class:
package de.scrum_master.app;
public class ChuckNorrisException extends RuntimeException {
public ChuckNorrisException(String message) {
super(message);
}
}
Aspect:
package de.scrum_master.aspect;
import de.scrum_master.app.ChuckNorrisException;
public aspect ChuckNorrisAspect {
before(ChuckNorrisException chuck) : handler(*) && args(chuck) {
System.out.println("Somebody is trying to catch Chuck Norris - LOL!");
throw chuck;
}
}
Sample application:
package de.scrum_master.app;
public class Application {
public static void main(String[] args) {
catchAllMethod();
}
private static void catchAllMethod() {
try {
exceptionThrowingMethod();
}
catch (Throwable t) {
System.out.println("Gotcha, " + t.getClass().getSimpleName() + "!");
}
}
private static void exceptionThrowingMethod() {
throw new ChuckNorrisException("Catch me if you can!");
}
}
Output:
Somebody is trying to catch Chuck Norris - LOL!
Exception in thread "main" de.scrum_master.app.ChuckNorrisException: Catch me if you can!
at de.scrum_master.app.Application.exceptionThrowingMethod(Application.java:18)
at de.scrum_master.app.Application.catchAllMethod(Application.java:10)
at de.scrum_master.app.Application.main(Application.java:5)
8
A variant on the theme is the surprising fact that you can throw undeclared checked exceptions from Java code. Since it is not declared in the methods signature, the compiler won't let you catch the exception itself, though you can catch it as java.lang.Exception.
Here's a helper class that lets you throw anything, declared or not:
public class SneakyThrow {
public static RuntimeException sneak(Throwable t) {
throw SneakyThrow.<RuntimeException> throwGivenThrowable(t);
}
private static <T extends Throwable> RuntimeException throwGivenThrowable(Throwable t) throws T {
throw (T) t;
}
}
Now throw SneakyThrow.sneak(new ChuckNorrisException()); does throw a ChuckNorrisException, but the compiler complains in
try {
throw SneakyThrow.sneak(new ChuckNorrisException());
} catch (ChuckNorrisException e) {
}
about catching an exception that is not thrown if ChuckNorrisException is a checked exception.
6
The only ChuckNorrisExceptions in Java should be OutOfMemoryError and StackOverflowError.
You can actually "catch" them in the means that a catch(OutOfMemoryError ex) will execute in case the exception is thrown, but that block will automatically rethrow the exception to the caller.
I don't think that public class ChuckNorrisError extends Error does the trick but you could give it a try. I found no documentation about extending Error
• 1
Error still extends Throwable so no way to prevent catching it. That is by design of the Java language. – JasonM1 Dec 15 '12 at 18:22
• 1
@JasonM1 I don't think the OP asked for an actually "uncatchable" exception, and I meant that Error propagates even if you catch it. So, any Throwable is catchable but these two will eventually propagate no matter what you do – usr-local-ΕΨΗΕΛΩΝ Dec 15 '12 at 18:36
• To be tricky ChuckNorrisException could extend Throwable directly then it would be neither Exception nor Error! – JasonM1 Dec 15 '12 at 19:01
• 3
Error does not propagate even if you catch it, i'm not sure where you got that idea. – jtahlborn Dec 17 '12 at 13:12
• 2
I think you are well confused about Erros, they are normal exceptions like everything that extends Throwable or even Throwable, itself. – bestsss Dec 21 '12 at 10:30
6
Is it possible to construct a snippet of code in java that would make a hypothetical java.lang.ChuckNorrisException uncatchable?
Yes, and here's the answer: Design your java.lang.ChuckNorrisException such that it is not an instance of java.lang.Throwable. Why? An unthrowable object is uncatchable by definition because you can never catch something that can never be thrown.
• 2
But then it is not an exception. – dolbi Dec 18 '12 at 19:47
• 8
@dolbi: I can find no place in the OP's question that states java.lang.ChuckNorrisException must be an exception, let alone throwable – Thomas Eding Dec 18 '12 at 19:57
• 1
I guess its not stated, but it is implied. You are a mathematician :-) , aren't you? – dolbi Dec 20 '12 at 7:48
• I'm a programmer, but I studied math in school as my primary subject. – Thomas Eding Dec 20 '12 at 18:36
3
You can keep ChuckNorris internal or private and encapsulate him or swollow him...
try { doChuckAction(); } catch(ChuckNorrisException cne) { /*do something else*/ }
• 7
I don't believe the idea was to catch it. I think the idea is to prevent it from being caught. – Patrick Roberts Dec 15 '12 at 4:43
• Correct me if I am wrong but if you make it internal you cannot get to it without reflection. – Jay Dec 15 '12 at 15:23
• 5
yes, but as long as you can catch Exception or Throwable the visibility of the actual type is irrelevant. – KeithS Dec 15 '12 at 16:25
3
Two fundamental problems with exception handling in Java are that it uses the type of an exception to indicate whether action should be taken based upon it, and that anything which takes action based upon an exception (i.e. "catch"es it) is presumed to resolve the underlying condition. It would be useful to have a means by which an exception object could decide which handlers should execute, and whether the handlers that have executed so far have cleaned things up enough for the present method to satisfy its exit conditions. While this could be used to make "uncatchable" exceptions, two bigger uses would be to (1) make exceptions which will only be considered handled when they're caught by code that actually knows how to deal with them, and (2) allow for sensible handling of exceptions which occur in a finally block (if a FooException during a finally block during the unwinding of a BarException, both exceptions should propagate up the call stack; both should be catchable, but unwinding should continue until both have been caught). Unfortunately, I don't think there would be any way to make existing exception-handling code work that way without breaking things.
• an interesting idea, but i don't think the low-level code would know what a particular exception "means" to the caller, so i don't think it would ever make sense for the thrower to decide which handlers should execute. – jtahlborn Dec 16 '12 at 13:24
• @jtahlborn: Right now, the thrower decides what exception handlers should execute via the choice of exception type. This makes it all but impossible to handle some scenarios cleanly. Among other things: (1) if an exception occurs while a finally block is cleaning up from an earlier exception, it's quite possible that either exception, in the absence of the other, may be something which code would be expect to handle and continue on, but that handling one and ignoring the other would be bad. There's no mechanism, though, to produce a composite exception that both handlers would process. – supercat Dec 16 '12 at 20:10
• @jtahlborn: Also, it makes it makes it very difficult to allow exceptions that occur within callbacks to be handled by the outer application layer. If the callback's exception is wrapped in another exception type, the type of callback exception cannot be used in the outer layer in deciding whether to catch it; if it isn't wrapped, an "accidental" mid-layer exception may be mistaken for one that occurs in the callback. If a wrapped exception object were told when it was passed up to the outer application layer, it could then start answering to the types of the wrapped exceptions. – supercat Dec 16 '12 at 20:15
• i wasn't arguing your other points, just the statement about the exception object deciding on which handlers will execute. to some extent exception types do that already, but it sounds like you wanted something more dynamic, which i was disagreeing with. i think your major argument (which you are kind of coming at sideways) is to capture as much information as you can at the bottom and let the upper layers see and work with all of that information. on this general point i agree with you, however the devil is in the details/implementation. – jtahlborn Dec 16 '12 at 20:32
• @jtahlborn: My intention was not to have the virtual methods implement anything particularly "dynamic", but essentially say "Is there a condition of the indicated type which should be acted upon". One thing I forgot to mention, though, is that there should be a means via which code which calls Foo can distinguish between an exception which Foo either threw itself or deliberately wants to pretend it threw itself, from one which Foo was not expecting to occur when it was calling some other method. That's what the notion of "checked" exceptions should be "about". – supercat Dec 16 '12 at 20:55
1
It is easily possible to simulate a uncaught exception on the current thread. This will trigger the regular behavior of an uncaught exception, and thus gets the job done semantically. It will, however, not necessarily stop the current thread's execution, as no exception is actually thrown.
Throwable exception = /* ... */;
Thread currentThread = Thread.currentThread();
Thread.UncaughtExceptionHandler uncaughtExceptionHandler =
currentThread.getUncaughtExceptionHandler();
uncaughtExceptionHandler.uncaughtException(currentThread, exception);
// May be reachable, depending on the uncaught exception handler.
This is actually useful in (very rare) situations, for example when proper Error handling is required, but the method is invoked from a framework catching (and discarding) any Throwable.
0
Call System.exit(1) in the finalize, and just throw a copy of the exception from all the other methods, so that the program will exit.
protected by Nick Larsen Dec 15 '12 at 13:30
Thank you for your interest in this question. Because it has attracted low-quality or spam answers that had to be removed, posting an answer now requires 10 reputation on this site (the association bonus does not count).
Would you like to answer one of these unanswered questions instead?
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://stackoverflow.com/questions/13883166/uncatchable-chucknorrisexception/14001288",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2019-22",
"warc_metadata": {
"Content-Length": "253073",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:67JIRE26E5RVFJTJUNAYSHIDECVHVV6U",
"WARC-Concurrent-To": "<urn:uuid:a289b572-9f39-43b3-83e0-23d0cacfc836>",
"WARC-Date": "2019-05-27T08:42:20Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:C5ATWTBFXLHEZLJRKW2QOCG2G6B3PWOP",
"WARC-Record-ID": "<urn:uuid:fc6f64a2-5d00-4d5c-a2f0-5950c941d53a>",
"WARC-Target-URI": "https://stackoverflow.com/questions/13883166/uncatchable-chucknorrisexception/14001288",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5694c8b2-6042-4e05-b18a-18f9452c7606>"
},
"warc_info": "isPartOf: CC-MAIN-2019-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-168-187-224.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,
4,
5,
134,
135,
229,
230,
237,
304,
310,
518,
524,
814,
820,
913,
919,
1015,
1016,
1030,
1031,
1035,
1036,
1288,
1289,
1297,
1298,
1346,
1347,
1428,
1499,
1561,
1562,
1572,
1573,
1663,
1664,
1674,
1675,
1731,
1732,
1762,
1763,
1797,
1876,
1878,
1916,
1918,
1919,
1946,
1991,
2005,
2051,
2061,
2090,
2133,
2143,
2161,
2205,
2215,
2221,
2223,
2224,
2241,
2242,
2297,
2298,
2303,
2304,
2327,
2335,
2344,
2345,
2431,
2432,
2470,
2471,
2476,
2477,
2500,
2652,
2716,
2717,
2743,
2744,
2781,
2790,
2817,
2824,
3047,
3054,
3244,
3250,
3652,
3658,
3864,
3870,
4037,
4041,
4042,
4347,
4348,
4401,
4403,
4424,
4430,
4510,
4574,
4580,
4582,
4583,
4584,
4623,
4632,
4640,
4646,
4682,
4689,
4718,
4724,
4793,
4799,
4801,
4802,
4832,
4833,
4841,
4842,
4847,
4848,
4897,
4898,
4913,
4914,
4955,
4956,
5046,
5047,
5069,
5070,
5123,
5125,
5181,
5187,
5220,
5226,
5228,
5229,
5279,
5281,
5334,
5340,
5376,
5382,
5384,
5385,
5386,
5444,
5446,
5447,
5455,
5461,
5497,
5503,
5532,
5538,
5539,
5545,
5571,
5577,
5578,
5584,
5586,
5587,
5648,
5649,
5656,
5767,
5773,
6008,
6014,
6149,
6155,
6409,
6415,
6647,
6650,
6651,
6836,
6837,
6844,
6979,
6985,
7297,
7303,
7395,
7401,
7646,
7652,
7791,
7794,
7795,
7938,
7939,
7946,
8059,
8062,
8116,
8152,
8176,
8182,
8184,
8185,
8323,
8324,
8330,
8531,
8646,
8649,
8650,
8744,
8745,
8917,
8918,
8924,
9134,
9140,
9319,
9322,
9323,
9526,
9527,
9670,
9671,
9686,
9687,
9715,
9743,
9744,
9798,
9799,
9835,
9841,
9842,
9856,
9890,
9911,
9917,
9918,
9932,
9965,
9992,
9998,
9999,
10013,
10062,
10096,
10102,
10103,
10117,
10166,
10200,
10206,
10208,
10209,
10253,
10254,
10269,
10270,
10290,
10291,
10318,
10319,
10349,
10350,
10402,
10416,
10447,
10504,
10573,
10637,
10673,
10687,
10747,
10780,
10824,
10834,
10840,
10842,
10843,
10889,
10890,
10905,
10906,
10926,
10927,
10979,
11017,
11023,
11024,
11048,
11062,
11092,
11125,
11184,
11194,
11200,
11201,
11246,
11260,
11302,
11332,
11373,
11393,
11436,
11446,
11452,
11454,
11455,
11498,
11499,
11568,
11569,
11600,
11601,
11608,
11616,
11617,
11667,
11668,
11832,
11973,
12116,
12122,
12237,
12240,
12241,
12355,
12356,
12446,
12447,
12494,
12497,
12498,
12649,
12650,
12656,
12668,
12693,
12740,
12742,
12743,
12807,
12808,
12951,
12952,
12954,
12955,
13107,
13108,
13153,
13154,
13171,
13172,
13201,
13202,
13263,
13313,
13337,
13343,
13345,
13346,
13354,
13355,
13387,
13388,
13437,
13438,
13472,
13541,
13620,
13641,
13647,
13649,
13650,
13670,
13671,
13700,
13701,
13728,
13773,
13799,
13805,
13806,
13849,
13863,
13902,
13912,
13942,
14023,
14033,
14039,
14040,
14092,
14156,
14162,
14164,
14165,
14173,
14174,
14222,
14312,
14396,
14471,
14535,
14537,
14538,
14803,
14804,
14873,
14874,
14901,
14955,
15020,
15024,
15025,
15125,
15142,
15146,
15148,
15149,
15271,
15272,
15278,
15333,
15368,
15370,
15371,
15466,
15467,
15469,
15470,
15560,
15561,
15755,
15756,
15910,
15911,
15917,
16055,
16061,
16331,
16477,
16483,
16604,
16610,
16780,
16782,
16783,
16912,
16913,
17160,
17161,
17167,
17232,
17238,
17411,
17417,
17533,
17642,
17644,
17645,
17728,
17729,
17812,
17813,
17819,
17955,
18079,
18085,
18224,
18226,
18227,
19407,
19408,
19663,
20291,
20912,
21493,
22095,
22097,
22098,
22389,
22390,
22423,
22470,
22529,
22578,
22648,
22714,
22715,
22902,
22903,
22905,
22906,
23041,
23042,
23087,
23088,
23309,
23310,
23378,
23379
],
"line_end_idx": [
4,
5,
134,
135,
229,
230,
237,
304,
310,
518,
524,
814,
820,
913,
919,
1015,
1016,
1030,
1031,
1035,
1036,
1288,
1289,
1297,
1298,
1346,
1347,
1428,
1499,
1561,
1562,
1572,
1573,
1663,
1664,
1674,
1675,
1731,
1732,
1762,
1763,
1797,
1876,
1878,
1916,
1918,
1919,
1946,
1991,
2005,
2051,
2061,
2090,
2133,
2143,
2161,
2205,
2215,
2221,
2223,
2224,
2241,
2242,
2297,
2298,
2303,
2304,
2327,
2335,
2344,
2345,
2431,
2432,
2470,
2471,
2476,
2477,
2500,
2652,
2716,
2717,
2743,
2744,
2781,
2790,
2817,
2824,
3047,
3054,
3244,
3250,
3652,
3658,
3864,
3870,
4037,
4041,
4042,
4347,
4348,
4401,
4403,
4424,
4430,
4510,
4574,
4580,
4582,
4583,
4584,
4623,
4632,
4640,
4646,
4682,
4689,
4718,
4724,
4793,
4799,
4801,
4802,
4832,
4833,
4841,
4842,
4847,
4848,
4897,
4898,
4913,
4914,
4955,
4956,
5046,
5047,
5069,
5070,
5123,
5125,
5181,
5187,
5220,
5226,
5228,
5229,
5279,
5281,
5334,
5340,
5376,
5382,
5384,
5385,
5386,
5444,
5446,
5447,
5455,
5461,
5497,
5503,
5532,
5538,
5539,
5545,
5571,
5577,
5578,
5584,
5586,
5587,
5648,
5649,
5656,
5767,
5773,
6008,
6014,
6149,
6155,
6409,
6415,
6647,
6650,
6651,
6836,
6837,
6844,
6979,
6985,
7297,
7303,
7395,
7401,
7646,
7652,
7791,
7794,
7795,
7938,
7939,
7946,
8059,
8062,
8116,
8152,
8176,
8182,
8184,
8185,
8323,
8324,
8330,
8531,
8646,
8649,
8650,
8744,
8745,
8917,
8918,
8924,
9134,
9140,
9319,
9322,
9323,
9526,
9527,
9670,
9671,
9686,
9687,
9715,
9743,
9744,
9798,
9799,
9835,
9841,
9842,
9856,
9890,
9911,
9917,
9918,
9932,
9965,
9992,
9998,
9999,
10013,
10062,
10096,
10102,
10103,
10117,
10166,
10200,
10206,
10208,
10209,
10253,
10254,
10269,
10270,
10290,
10291,
10318,
10319,
10349,
10350,
10402,
10416,
10447,
10504,
10573,
10637,
10673,
10687,
10747,
10780,
10824,
10834,
10840,
10842,
10843,
10889,
10890,
10905,
10906,
10926,
10927,
10979,
11017,
11023,
11024,
11048,
11062,
11092,
11125,
11184,
11194,
11200,
11201,
11246,
11260,
11302,
11332,
11373,
11393,
11436,
11446,
11452,
11454,
11455,
11498,
11499,
11568,
11569,
11600,
11601,
11608,
11616,
11617,
11667,
11668,
11832,
11973,
12116,
12122,
12237,
12240,
12241,
12355,
12356,
12446,
12447,
12494,
12497,
12498,
12649,
12650,
12656,
12668,
12693,
12740,
12742,
12743,
12807,
12808,
12951,
12952,
12954,
12955,
13107,
13108,
13153,
13154,
13171,
13172,
13201,
13202,
13263,
13313,
13337,
13343,
13345,
13346,
13354,
13355,
13387,
13388,
13437,
13438,
13472,
13541,
13620,
13641,
13647,
13649,
13650,
13670,
13671,
13700,
13701,
13728,
13773,
13799,
13805,
13806,
13849,
13863,
13902,
13912,
13942,
14023,
14033,
14039,
14040,
14092,
14156,
14162,
14164,
14165,
14173,
14174,
14222,
14312,
14396,
14471,
14535,
14537,
14538,
14803,
14804,
14873,
14874,
14901,
14955,
15020,
15024,
15025,
15125,
15142,
15146,
15148,
15149,
15271,
15272,
15278,
15333,
15368,
15370,
15371,
15466,
15467,
15469,
15470,
15560,
15561,
15755,
15756,
15910,
15911,
15917,
16055,
16061,
16331,
16477,
16483,
16604,
16610,
16780,
16782,
16783,
16912,
16913,
17160,
17161,
17167,
17232,
17238,
17411,
17417,
17533,
17642,
17644,
17645,
17728,
17729,
17812,
17813,
17819,
17955,
18079,
18085,
18224,
18226,
18227,
19407,
19408,
19663,
20291,
20912,
21493,
22095,
22097,
22098,
22389,
22390,
22423,
22470,
22529,
22578,
22648,
22714,
22715,
22902,
22903,
22905,
22906,
23041,
23042,
23087,
23088,
23309,
23310,
23378,
23379,
23469
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 23469,
"ccnet_original_nlines": 511,
"rps_doc_curly_bracket": 0.00545400008559227,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32801344990730286,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013439729809761047,
"rps_doc_frac_lines_end_with_ellipsis": 0.0019531199941411614,
"rps_doc_frac_no_alph_words": 0.3000839948654175,
"rps_doc_frac_unique_words": 0.2815820574760437,
"rps_doc_mean_word_length": 5.142561912536621,
"rps_doc_num_sentences": 277,
"rps_doc_symbol_to_word_ratio": 0.0010499800555408,
"rps_doc_unigram_entropy": 5.901104927062988,
"rps_doc_word_count": 3388,
"rps_doc_frac_chars_dupe_10grams": 0.021236300468444824,
"rps_doc_frac_chars_dupe_5grams": 0.10279516130685806,
"rps_doc_frac_chars_dupe_6grams": 0.07513056695461273,
"rps_doc_frac_chars_dupe_7grams": 0.050622738897800446,
"rps_doc_frac_chars_dupe_8grams": 0.029501229524612427,
"rps_doc_frac_chars_dupe_9grams": 0.0247948095202446,
"rps_doc_frac_chars_top_2gram": 0.010101590305566788,
"rps_doc_frac_chars_top_3gram": 0.005624750163406134,
"rps_doc_frac_chars_top_4gram": 0.007231819909065962,
"rps_doc_books_importance": -2303.710693359375,
"rps_doc_books_importance_length_correction": -2303.710693359375,
"rps_doc_openwebtext_importance": -1308.16064453125,
"rps_doc_openwebtext_importance_length_correction": -1308.16064453125,
"rps_doc_wikipedia_importance": -818.5512084960938,
"rps_doc_wikipedia_importance_length_correction": -818.5512084960938
},
"fasttext": {
"dclm": 0.23002314567565918,
"english": 0.8625018000602722,
"fineweb_edu_approx": 1.9325361251831055,
"eai_general_math": 0.815151572227478,
"eai_open_web_math": 0.17762422561645508,
"eai_web_code": 0.6664972901344299
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,413,920,704,759,027,000 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free.
I'm trying to include two tables off of one base table, and provide a "where" statement on the second table, but I'm getting a very confusing error (below). Any thoughts on the issue/solution?
ObjectQuery<STATE> productQuery =
LeadsContext.STATE.Include("REGION")
.Where("it.REGION.BRAND.BRAND_ID = @brand", new ObjectParameter("brand", brand))
.OrderBy("it.STATE_ABBV");
Basic table layout: STATE ------ REGION ------ BRAND
BRAND_ID is in BRAND
'BRAND' is not a member of 'Transient.collection[Citizens.Leads.Data.REGION(Nullable=True,DefaultValue=)]'. To extract properties out of collections, you must use a sub-query to iterate over the collection., near multipart identifier, line 8, column 1.
share|improve this question
2 Answers 2
up vote 6 down vote accepted
It sounds as if State.REGION is actually a collection of Region entities.
In which case you can't just access the BRAND navigation directly like that, because your statement tries to access the BRAND property of a Collection, rather than the BRAND property of an element in the collection.
If you were writing this query using LINQ to Entities rather than query builder methods you could do it like this:
var productQuery = from s in LeadsContext.State
from r in s.REGION
where r.Brand.Brand_ID == brand
orderby s.STATE_ABBR
select s;
Of course that wouldn't eagerly load REGION(s) so you might think you could write this:
var productQuery = from s in LeadsContext.State.Include("REGION")
from r in s.REGION
where r.Brand.Brand_ID == brand
orderby s.STATE_ABBR
select s;
But that won't work because your INCLUDE is lost when you do a Select Many (i.e. from y in z from x in y).
So you have to do the Include at the end like this:
var productQuery = (from s in LeadsContext.State
from r in s.REGION
where r.Brand.Brand_ID == brand
orderby s.STATE_ABBR
select s) as ObjectQuery<State>).Include("REGION");
See tip 22 for more on this workaround.
I'm not 100% sure that our query builder methods, i.e. Where(string), support sub-selects which is what is required.
So I'm not sure what the syntax would be in there.
Anyway I hope this helps
Alex
share|improve this answer
this helps a ton, thanks! – CodeMonkey1313 Oct 5 '09 at 12:07
If anyone has the Query Builder syntax that works with the first LINQ query here, that would be very helpful. I'm just trying to get a feel for the difference between the two. – CodeMonkey1313 Oct 5 '09 at 12:19
Alex, you can achieve something similar in query builder by approaching the query differently. Query builder supports exists. The query will look something like this:
ObjectQuery productQuery =
LeadsContext.STATE.Include("REGION")
.Where("EXISTS(SELECT 1 FROM it.REGION.BRAND as b WHERE b.BRAND_ID
= @brand)", new ObjectParameter("brand", brand))
.OrderBy("it.STATE_ABBV");
share|improve this answer
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/1511626/entity-framework-include-with-where-with-3-tables",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-35",
"warc_metadata": {
"Content-Length": "78448",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JVPIZ773GSJTRL5MZVA7A4YRL7KFR4XK",
"WARC-Concurrent-To": "<urn:uuid:cf32e95d-483d-48b5-a603-80a1377433d5>",
"WARC-Date": "2015-09-02T00:52:43Z",
"WARC-IP-Address": "104.16.102.85",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:KFLUYKYSHB3H7ISMXUUIHD7YBRNMI3I7",
"WARC-Record-ID": "<urn:uuid:e455f7ac-b983-4445-b961-a2182194ace5>",
"WARC-Target-URI": "http://stackoverflow.com/questions/1511626/entity-framework-include-with-where-with-3-tables",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:46484abb-0f75-4dce-a319-38fd63eec908>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-96-226.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
131,
132,
325,
326,
361,
402,
489,
522,
523,
576,
577,
598,
599,
852,
853,
881,
882,
894,
895,
924,
925,
999,
1000,
1216,
1217,
1332,
1333,
1381,
1419,
1470,
1510,
1539,
1540,
1628,
1629,
1695,
1733,
1784,
1824,
1853,
1854,
1961,
1962,
2014,
2015,
2064,
2102,
2153,
2193,
2264,
2265,
2305,
2306,
2423,
2424,
2475,
2476,
2501,
2502,
2507,
2508,
2534,
2539,
2602,
2607,
2820,
2821,
2988,
2989,
3018,
3063,
3140,
3189,
3226,
3227,
3253,
3254,
3266,
3267,
3269,
3277,
3278,
3356,
3357
],
"line_end_idx": [
25,
131,
132,
325,
326,
361,
402,
489,
522,
523,
576,
577,
598,
599,
852,
853,
881,
882,
894,
895,
924,
925,
999,
1000,
1216,
1217,
1332,
1333,
1381,
1419,
1470,
1510,
1539,
1540,
1628,
1629,
1695,
1733,
1784,
1824,
1853,
1854,
1961,
1962,
2014,
2015,
2064,
2102,
2153,
2193,
2264,
2265,
2305,
2306,
2423,
2424,
2475,
2476,
2501,
2502,
2507,
2508,
2534,
2539,
2602,
2607,
2820,
2821,
2988,
2989,
3018,
3063,
3140,
3189,
3226,
3227,
3253,
3254,
3266,
3267,
3269,
3277,
3278,
3356,
3357,
3447
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3447,
"ccnet_original_nlines": 85,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36389684677124023,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06590258330106735,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26217764616012573,
"rps_doc_frac_unique_words": 0.4913419783115387,
"rps_doc_mean_word_length": 5.266233921051025,
"rps_doc_num_sentences": 63,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.050031661987305,
"rps_doc_word_count": 462,
"rps_doc_frac_chars_dupe_10grams": 0.11385121196508408,
"rps_doc_frac_chars_dupe_5grams": 0.1853678673505783,
"rps_doc_frac_chars_dupe_6grams": 0.14344431459903717,
"rps_doc_frac_chars_dupe_7grams": 0.11385121196508408,
"rps_doc_frac_chars_dupe_8grams": 0.11385121196508408,
"rps_doc_frac_chars_dupe_9grams": 0.11385121196508408,
"rps_doc_frac_chars_top_2gram": 0.024660909548401833,
"rps_doc_frac_chars_top_3gram": 0.023427870124578476,
"rps_doc_frac_chars_top_4gram": 0.028360050171613693,
"rps_doc_books_importance": -290.92169189453125,
"rps_doc_books_importance_length_correction": -290.92169189453125,
"rps_doc_openwebtext_importance": -151.8537139892578,
"rps_doc_openwebtext_importance_length_correction": -151.8537139892578,
"rps_doc_wikipedia_importance": -117.35340118408203,
"rps_doc_wikipedia_importance_length_correction": -117.35340118408203
},
"fasttext": {
"dclm": 0.5544018149375916,
"english": 0.8609911799430847,
"fineweb_edu_approx": 1.4701330661773682,
"eai_general_math": 0.00447928998619318,
"eai_open_web_math": 0.09866095334291458,
"eai_web_code": 0.004875900223851204
}
}
|
{
"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": "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": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,135,857,084,780,241,500 |
What is Multi-Factor Authentication (MFA)
Image result for mfa microsoft
Multi-Factor Authentication, similar to Two-Factor Authentication, is a way to further protect you, your business, and employees from the threats of cybercrime. With the ever-rising rate of hacking and and data breaches, it's more crucial than ever to safeguard your sensitive information. It's no longer enough to just have a strong password. This is where MFA comes into play. Let's break it down:
What is Multi-Factor Authentication?
MFA is a second layer of security that you can use for your email logins, device logins, and many other places that you store sensitive information. It's usually broken down into three concepts:
• Things you know (knowledge), such as a password or PIN
• Things you have (possession), such as a badge or smartphone
• Things you are (inheritance), indicated through biometrics, like fingerprints or voice recognition¹
The combinations of the three above concepts work to create a more personalized layer of security for your devices. You may have seen these in use when you forget your email password and Google or Yahoo sends you an authentication code via text to your phone, or if you have the newer iPhone, they use biometrics like facial recognition to make sure it's really you, and not just someone who has your passcode.
Those examples above help you in your personal life, but what about your work life? Often times it's not only your personal information at risk when you or your whole business gets hacked. All of your coworkers and your clients get affected as well. Too many times we see breaches that could have been prevented if something as simple as multi-factor authentication was implemented.
The main idea of Multi-factor Authentication is to force hackers or bad actors to work harder to gain access to your data in the event that they get your password through breaches of other companies like Yahoo!, or Google. When they try to log into your account they will be forced to prove who they are through Multi-factor Authentication and they won't have that additional access to your device to log in.
Image result for mfa microsoft
How Do I Use It?
MFA is simple to use. There's multiple options to choose from such as text verification, phone calls, and the Microsoft Authenticator app. Based on your settings, when you log into an Office 365 application you'll be asked to enter a 6 digit code to verify your login. Here is a document explaining the setup process.
After you enable MFA you may be prompted to log in and authenticate some of your accounts again. Most Microsoft products fall under this requirement including your Desktop Outlook, One Drive for Business, Teams, Sharepoint, and the Office 365 Portal (For OWA or any other Office 365 Features).
How Do I Get MFA?
Is the fear of a data breach on your mind lately? The good news is that if you have Office 365, you likely already have access to Multi-Factor AuthenticationIf you're interested in MFA, call us at (201) 796-0404 and we'd be happy to set it up for you.
Comments
Post a Comment
Popular posts from this blog
Cybersecurity Awareness Month: SMB Edition
12 Cyber Readiness Strategies You Can Implement Today
Is Your Business’s IT Ready for the Coronavirus?
|
{
"url": "https://blog.baroan.com/2019/04/what-is-multi-factor-authentication.html",
"source_domain": "blog.baroan.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "111596",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RFGXW4ES2IXGLI5XKEWEAYNSB3CVY3VC",
"WARC-Concurrent-To": "<urn:uuid:19e6316c-b1d4-4a4e-ba9a-3eea00052022>",
"WARC-Date": "2020-11-30T01:08:42Z",
"WARC-IP-Address": "172.217.164.147",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:FXVP5EKRMGWKMRSR5PJCHDCWJUPJAQR6",
"WARC-Record-ID": "<urn:uuid:a8df23fa-ba63-4a5a-ae0f-3eee404ecb06>",
"WARC-Target-URI": "https://blog.baroan.com/2019/04/what-is-multi-factor-authentication.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d05182c7-2eb0-43e6-9239-e2a82aaa01ec>"
},
"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,
42,
43,
74,
75,
475,
476,
513,
514,
709,
772,
840,
948,
1359,
1360,
1743,
1744,
2154,
2155,
2156,
2157,
2188,
2189,
2206,
2207,
2526,
2527,
2822,
2823,
2841,
2842,
3094,
3095,
3096,
3097,
3098,
3099,
3100,
3109,
3110,
3125,
3126,
3155,
3156,
3199,
3200,
3254,
3255
],
"line_end_idx": [
42,
43,
74,
75,
475,
476,
513,
514,
709,
772,
840,
948,
1359,
1360,
1743,
1744,
2154,
2155,
2156,
2157,
2188,
2189,
2206,
2207,
2526,
2527,
2822,
2823,
2841,
2842,
3094,
3095,
3096,
3097,
3098,
3099,
3100,
3109,
3110,
3125,
3126,
3155,
3156,
3199,
3200,
3254,
3255,
3303
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3303,
"ccnet_original_nlines": 47,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44122135639190674,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019847329705953598,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1450381726026535,
"rps_doc_frac_unique_words": 0.4890909194946289,
"rps_doc_mean_word_length": 4.7654547691345215,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.121477127075195,
"rps_doc_word_count": 550,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04578404873609543,
"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.057230059057474136,
"rps_doc_frac_chars_top_3gram": 0.011446010321378708,
"rps_doc_frac_chars_top_4gram": 0.023655090481042862,
"rps_doc_books_importance": -214.89002990722656,
"rps_doc_books_importance_length_correction": -214.89002990722656,
"rps_doc_openwebtext_importance": -154.42770385742188,
"rps_doc_openwebtext_importance_length_correction": -154.42770385742188,
"rps_doc_wikipedia_importance": -124.71183013916016,
"rps_doc_wikipedia_importance_length_correction": -124.71183013916016
},
"fasttext": {
"dclm": 0.2777487635612488,
"english": 0.9350054860115051,
"fineweb_edu_approx": 1.9305778741836548,
"eai_general_math": 0.004380519967526197,
"eai_open_web_math": 0.11086226254701614,
"eai_web_code": 0.001891199965029955
}
}
|
{
"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.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,563,440,675,312,926,000 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
How can i select the value from the List of keyvaluepair based on checking the key value
List<KeyValuePair<int, List<Properties>> myList = new List<KeyValuePair<int, List<Properties>>();
Here I want to get the
list myList[2].Value when myLisy[2].Key=5.
How can i achieve this?
share|improve this question
1
Is there a special reason why you need a List<KeyValuePair<int, ...>> instead of just a Dictionary<int, ...>>? – Јοеу Jul 9 '12 at 7:20
Key contains duplicate values also. So that here used keyvaluepair instead of Dictionary – Devi Jul 9 '12 at 8:29
is that work for you ?? – Pranay Rana Jul 9 '12 at 9:09
Yes. It worked... – Devi Jul 9 '12 at 9:44
Great! Would be good if you marked the answer that helped you as "accepted". – Thorsten Dittmar Jul 10 '12 at 15:11
add comment
4 Answers
up vote 3 down vote accepted
If you need to use the List anyway I'd use LINQ for this query:
var matches = from val in myList where val.Key == 5 select val.Value;
foreach (var match in matches)
{
foreach (Property prop in match)
{
// do stuff
}
}
You may want to check the match for null.
share|improve this answer
add comment
Use Dictionary<int, List<Properties>>. Then you can do
List<Properties> list = dict[5];
As in:
Dictionary<int, List<Properties>> dict = new Dictionary<int, List<Properties>>();
dict[0] = ...;
dict[1] = ...;
dict[5] = ...;
List<Properties> item5 = dict[5]; // This works if dict contains a key 5.
List<Properties> item6 = null;
// You might want to check whether the key is actually in the dictionary. Otherwise
// you might get an exception
if (dict.ContainsKey(6))
item6 = dict[6];
share|improve this answer
This is a good idea, but you have to be sure that you do not have duplicate keys (int values) in your collection. You can store duplicate keys in a list, but not in a dictionary. – Marek Dzikiewicz Jul 9 '12 at 7:30
Yes. This is also what I understand the OP wants: Here I want to get the list myList[2].Value when myLisy[2].Key=5. If more than one key had the value of 5, which one would he take? – Thorsten Dittmar Jul 9 '12 at 7:30
add comment
If you're stuck with the List, you can use
myList.First(kvp => kvp.Key == 5).Value
Or if you want to use a dictionary (which might suit your needs better than the list as stated in the other answers) you convert your list to a dictionary easily:
var dictionary = myList.ToDictionary(kvp => kvp.Key);
var value = dictionary[5].Value;
share|improve this answer
add comment
NOTE
The generic Dictionary class, introduced in .NET 2.0, uses KeyValuePair.
ITs better you make use of
Dictionary<TKey, TValue>.ICollection<KeyValuePair<TKey, TValue>>
and use ContainsKey Method to check the the key is there or not ..
Example :
ICollection<KeyValuePair<String, String>> openWith =
new Dictionary<String, String>();
openWith.Add(new KeyValuePair<String,String>("txt", "notepad.exe"));
openWith.Add(new KeyValuePair<String,String>("bmp", "paint.exe"));
openWith.Add(new KeyValuePair<String,String>("dib", "paint.exe"));
openWith.Add(new KeyValuePair<String,String>("rtf", "wordpad.exe"));
if (!openWith.ContainsKey("txt"))
{
Console.WriteLine("Contains Given key");
}
EDIT
To get value
string value = "";
if (openWith.TryGetValue("tif", out value))
{
Console.WriteLine("For key = \"tif\", value = {0}.", value);
//in you case
//var list= dict.Values.ToList<Property>();
}
in your caseu it will be
var list= dict.Values.ToList<Property>();
share|improve this answer
Thanks. From this we can check the key of keyvaluepair. But List<KeyValuePair<int, List<Properties>> contains List of Properties. How can i get that properties based on Index and also key of keyvalue pair. Ho do check both conditions? – Devi Jul 9 '12 at 7:36
@Devi - check my edited answer – Pranay Rana Jul 9 '12 at 7:44
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/11390561/select-value-of-list-of-keyvaluepair?answertab=votes",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "84047",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FLSZRNTYKQ5NKO7F54EMVPQL4F5RKT7D",
"WARC-Concurrent-To": "<urn:uuid:8f9af768-7835-455d-80a9-bc9105b142cb>",
"WARC-Date": "2014-03-15T03:11:50Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:UCKTCPBPCUNFACZV4GQHKTOMXUMSKR25",
"WARC-Record-ID": "<urn:uuid:222aff74-63cb-437b-b24d-7b691ed4a1db>",
"WARC-Target-URI": "http://stackoverflow.com/questions/11390561/select-value-of-list-of-keyvaluepair?answertab=votes",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5b95c644-53ff-48a4-9db3-3aa637336cc4>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
157,
158,
247,
248,
346,
347,
370,
371,
414,
415,
439,
440,
468,
472,
609,
611,
726,
728,
785,
787,
831,
833,
950,
962,
963,
973,
974,
1003,
1004,
1068,
1069,
1139,
1170,
1172,
1209,
1215,
1235,
1241,
1243,
1244,
1286,
1287,
1313,
1325,
1326,
1381,
1382,
1415,
1416,
1423,
1424,
1506,
1521,
1536,
1551,
1552,
1626,
1657,
1658,
1742,
1772,
1797,
1818,
1844,
1846,
2063,
2065,
2285,
2297,
2298,
2341,
2342,
2382,
2383,
2546,
2547,
2601,
2634,
2660,
2672,
2673,
2678,
2679,
2752,
2753,
2780,
2781,
2846,
2847,
2914,
2915,
2925,
2926,
2979,
3025,
3094,
3161,
3228,
3297,
3298,
3332,
3334,
3382,
3384,
3385,
3390,
3391,
3404,
3405,
3424,
3468,
3470,
3535,
3554,
3602,
3604,
3605,
3630,
3631,
3674,
3700,
3702,
3963,
3965,
4029,
4041,
4042,
4054,
4055,
4057,
4065,
4066,
4144,
4145
],
"line_end_idx": [
25,
157,
158,
247,
248,
346,
347,
370,
371,
414,
415,
439,
440,
468,
472,
609,
611,
726,
728,
785,
787,
831,
833,
950,
962,
963,
973,
974,
1003,
1004,
1068,
1069,
1139,
1170,
1172,
1209,
1215,
1235,
1241,
1243,
1244,
1286,
1287,
1313,
1325,
1326,
1381,
1382,
1415,
1416,
1423,
1424,
1506,
1521,
1536,
1551,
1552,
1626,
1657,
1658,
1742,
1772,
1797,
1818,
1844,
1846,
2063,
2065,
2285,
2297,
2298,
2341,
2342,
2382,
2383,
2546,
2547,
2601,
2634,
2660,
2672,
2673,
2678,
2679,
2752,
2753,
2780,
2781,
2846,
2847,
2914,
2915,
2925,
2926,
2979,
3025,
3094,
3161,
3228,
3297,
3298,
3332,
3334,
3382,
3384,
3385,
3390,
3391,
3404,
3405,
3424,
3468,
3470,
3535,
3554,
3602,
3604,
3605,
3630,
3631,
3674,
3700,
3702,
3963,
3965,
4029,
4041,
4042,
4054,
4055,
4057,
4065,
4066,
4144,
4145,
4235
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4235,
"ccnet_original_nlines": 135,
"rps_doc_curly_bracket": 0.0023612799122929573,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2577733099460602,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009027079679071903,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3550651967525482,
"rps_doc_frac_unique_words": 0.41430947184562683,
"rps_doc_mean_word_length": 5.114808559417725,
"rps_doc_num_sentences": 68,
"rps_doc_symbol_to_word_ratio": 0.006018050014972687,
"rps_doc_unigram_entropy": 5.077229976654053,
"rps_doc_word_count": 601,
"rps_doc_frac_chars_dupe_10grams": 0.031229669228196144,
"rps_doc_frac_chars_dupe_5grams": 0.08425503969192505,
"rps_doc_frac_chars_dupe_6grams": 0.05627845972776413,
"rps_doc_frac_chars_dupe_7grams": 0.04359140992164612,
"rps_doc_frac_chars_dupe_8grams": 0.031229669228196144,
"rps_doc_frac_chars_dupe_9grams": 0.031229669228196144,
"rps_doc_frac_chars_top_2gram": 0.011711129918694496,
"rps_doc_frac_chars_top_3gram": 0.015614829957485199,
"rps_doc_frac_chars_top_4gram": 0.020819779485464096,
"rps_doc_books_importance": -398.1526794433594,
"rps_doc_books_importance_length_correction": -398.1526794433594,
"rps_doc_openwebtext_importance": -221.2082061767578,
"rps_doc_openwebtext_importance_length_correction": -221.2082061767578,
"rps_doc_wikipedia_importance": -229.620361328125,
"rps_doc_wikipedia_importance_length_correction": -229.620361328125
},
"fasttext": {
"dclm": 0.3022666573524475,
"english": 0.7035068273544312,
"fineweb_edu_approx": 1.993049144744873,
"eai_general_math": 0.038016799837350845,
"eai_open_web_math": 0.12313193082809448,
"eai_web_code": 0.000568629999179393
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,837,602,268,378,604,000 |
Browser environment, specs
The JavaScript language was initially created for web browsers. Since then, it has evolved and become a language with many uses and platforms.
A platform may be a browser, or a web-server, or a washing machine, or another host. Each of them provides platform-specific functionality. The JavaScript specification calls that a host environment.
A host environment provides platform-specific objects and functions additional to the language core. Web browsers give a means to control web pages. Node.js provides server-side features, and so on.
Here’s a bird’s-eye view of what we have when JavaScript runs in a web-browser:
There’s a “root” object called window. It has two roles:
1. First, it is a global object for JavaScript code, as described in the chapter Evrensel Objeler.
2. Second, it represents the “browser window” and provides methods to control it.
For instance, here we use it as a global object:
function sayHi() {
alert("Hello");
}
// global functions are accessible as properties of window
window.sayHi();
And here we use it as a browser window, to see the window height:
alert(window.innerHeight); // inner window height
There are more window-specific methods and properties, we’ll cover them later.
DOM (Document Object Model)
The document object gives access to the page content. We can change or create anything on the page using it.
For instance:
// change the background color to red
document.body.style.background = "red";
// change it back after 1 second
setTimeout(() => document.body.style.background = "", 1000);
Here we used document.body.style, but there’s much, much more. Properties and methods are described in the specification:
DOM is not only for browsers
The DOM specification explains the structure of a document and provides objects to manipulate it. There are non-browser instruments that use it too.
For instance, server-side tools that download HTML pages and process them use the DOM. They may support only a part of the specification though.
CSSOM for styling
CSS rules and stylesheets are not structured like HTML. There’s a separate specification CSSOM that explains how they are represented as objects, and how to read and write them.
CSSOM is used together with DOM when we modify style rules for the document. In practice though, CSSOM is rarely required, because usually CSS rules are static. We rarely need to add/remove CSS rules from JavaScript, so we won’t cover it right now.
BOM (Browser object model)
Browser Object Model (BOM) are additional objects provided by the browser (host environment) to work with everything except the document.
For instance:
• The navigator object provides background information about the browser and the operating system. There are many properties, but the two most widely known are: navigator.userAgent – about the current browser, and navigator.platform – about the platform (can help to differ between Windows/Linux/Mac etc).
• The location object allows us to read the current URL and can redirect the browser to a new one.
Here’s how we can use the location object:
alert(location.href); // shows current URL
if (confirm("Go to wikipedia?")) {
location.href = "https://wikipedia.org"; // redirect the browser to another URL
}
Functions alert/confirm/prompt are also a part of BOM: they are directly not related to the document, but represent pure browser methods of communicating with the user.
BOM is the part of the general HTML specification.
Yes, you heard that right. The HTML spec at https://html.spec.whatwg.org is not only about the “HTML language” (tags, attributes), but also covers a bunch of objects, methods and browser-specific DOM extensions. That’s “HTML in broad terms”. Also, some parts have additional specs listed at https://spec.whatwg.org.
Summary
Talking about standards, we have:
DOM specification
Describes the document structure, manipulations and events, see https://dom.spec.whatwg.org.
CSSOM specification
Describes stylesheets and style rules, manipulations with them and their binding to documents, see https://www.w3.org/TR/cssom-1/.
HTML specification
Describes the HTML language (e.g. tags) and also the BOM (browser object model) – various browser functions: setTimeout, alert, location and so on, see https://html.spec.whatwg.org. It takes the DOM specification and extends it with many additional properties and methods.
Additionally, some classes are described separately at https://spec.whatwg.org/.
Please note these links, as there’s so much stuff to learn it’s impossible to cover and remember everything.
When you’d like to read about a property or a method, the Mozilla manual at https://developer.mozilla.org/en-US/search is also a nice resource, but the corresponding spec may be better: it’s more complex and longer to read, but will make your fundamental knowledge sound and complete.
To find something, it’s often convenient to use an internet search “WHATWG [term]” or “MDN [term]”, e.g https://google.com?q=whatwg+localstorage, https://google.com?q=mdn+localstorage.
Now we’ll get down to learning DOM, because the document plays the central role in the UI.
Eğitim haritası
Yorumlar
yorum yapmadan önce lütfen okuyun...
• Eğer geliştirme ile alakalı bir öneriniz var ise yorum yerine github konusu gönderiniz.
• Eğer makalede bir yeri anlamadıysanız lütfen belirtiniz.
• Koda birkaç satır eklemek için <code> kullanınız, birkaç satır eklemek için ise <pre> kullanın. Eğer 10 satırdan fazla kod ekleyecekseniz plnkr kullanabilirsiniz)
|
{
"url": "https://tr.javascript.info/browser-environment",
"source_domain": "tr.javascript.info",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "30306",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PS3WH57SLB66VCQYVE3QBHZDA7DKKJSI",
"WARC-Concurrent-To": "<urn:uuid:f7473766-6177-41e3-85af-7c24e2adccc0>",
"WARC-Date": "2019-11-21T03:44:39Z",
"WARC-IP-Address": "104.26.12.17",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2QVI7D3XSO2CLWHAWJZ4KKOSEOX4ALY5",
"WARC-Record-ID": "<urn:uuid:2d16377d-b6c8-47dc-9dcb-d5453c7add0b>",
"WARC-Target-URI": "https://tr.javascript.info/browser-environment",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5891093f-5998-4186-87bc-07b781fa094d>"
},
"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-116.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
27,
28,
171,
172,
372,
373,
572,
573,
653,
654,
711,
712,
813,
897,
898,
947,
948,
967,
985,
987,
988,
1047,
1063,
1064,
1130,
1131,
1181,
1182,
1261,
1262,
1290,
1291,
1400,
1401,
1415,
1416,
1454,
1494,
1495,
1528,
1589,
1590,
1712,
1713,
1742,
1743,
1892,
1893,
2038,
2039,
2057,
2058,
2236,
2237,
2486,
2487,
2514,
2515,
2653,
2654,
2668,
2669,
2977,
3078,
3079,
3122,
3123,
3166,
3201,
3283,
3285,
3286,
3455,
3456,
3507,
3508,
3824,
3825,
3833,
3834,
3868,
3869,
3887,
3980,
4000,
4131,
4150,
4423,
4424,
4505,
4506,
4615,
4616,
4901,
4902,
5087,
5088,
5179,
5180,
5196,
5197,
5206,
5207,
5244,
5336,
5397
],
"line_end_idx": [
27,
28,
171,
172,
372,
373,
572,
573,
653,
654,
711,
712,
813,
897,
898,
947,
948,
967,
985,
987,
988,
1047,
1063,
1064,
1130,
1131,
1181,
1182,
1261,
1262,
1290,
1291,
1400,
1401,
1415,
1416,
1454,
1494,
1495,
1528,
1589,
1590,
1712,
1713,
1742,
1743,
1892,
1893,
2038,
2039,
2057,
2058,
2236,
2237,
2486,
2487,
2514,
2515,
2653,
2654,
2668,
2669,
2977,
3078,
3079,
3122,
3123,
3166,
3201,
3283,
3285,
3286,
3455,
3456,
3507,
3508,
3824,
3825,
3833,
3834,
3868,
3869,
3887,
3980,
4000,
4131,
4150,
4423,
4424,
4505,
4506,
4615,
4616,
4901,
4902,
5087,
5088,
5179,
5180,
5196,
5197,
5206,
5207,
5244,
5336,
5397,
5563
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5563,
"ccnet_original_nlines": 106,
"rps_doc_curly_bracket": 0.0007190399919636548,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3192407190799713,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.034512508660554886,
"rps_doc_frac_lines_end_with_ellipsis": 0.00934579037129879,
"rps_doc_frac_no_alph_words": 0.2364107072353363,
"rps_doc_frac_unique_words": 0.4330024719238281,
"rps_doc_mean_word_length": 5.466501235961914,
"rps_doc_num_sentences": 91,
"rps_doc_symbol_to_word_ratio": 0.0008628100040368736,
"rps_doc_unigram_entropy": 5.32375431060791,
"rps_doc_word_count": 806,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.006354969926178455,
"rps_doc_frac_chars_dupe_6grams": 0.006354969926178455,
"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.014979570172727108,
"rps_doc_frac_chars_top_3gram": 0.012256010435521603,
"rps_doc_frac_chars_top_4gram": 0.004993190057575703,
"rps_doc_books_importance": -525.3366088867188,
"rps_doc_books_importance_length_correction": -525.3366088867188,
"rps_doc_openwebtext_importance": -302.2569885253906,
"rps_doc_openwebtext_importance_length_correction": -302.2569885253906,
"rps_doc_wikipedia_importance": -210.11805725097656,
"rps_doc_wikipedia_importance_length_correction": -210.11805725097656
},
"fasttext": {
"dclm": 0.11444211006164551,
"english": 0.8413692116737366,
"fineweb_edu_approx": 3.007887601852417,
"eai_general_math": 0.8182193040847778,
"eai_open_web_math": 0.2732597589492798,
"eai_web_code": 0.9038841128349304
}
}
|
{
"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": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-809,210,582,337,128,300 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
This should be an really easy task using the re library. However, I can't seem to split my string at the delimiters ] and [.
I already read Splitting a string with multiple delimiters in Python, Python: Split string with multiple delimiters, and Python: How to get multiple elements inside square brackets.
My string:
data = "This is a string spanning over multiple lines.
At somepoint there will be square brackets.
[like this]
And then maybe some more text.
[And another text in square brackets]"
It should return:
['This is a string spanning over multiple lines.\nAt somepoint there will be square brackets.','like this', 'And then maybe some more text.', 'And another text in square brackets']
A short example to try:
data2 = 'A new string. [with brackets] another line [and a bracket]'
I tried:
re.split(r'(\[|\])', data2)
re.split(r'([|])', data2)
But those would either result in having the delimiter in my resulting list or a wrong list altogether:
['A new string. ', '[', 'with brackets', ']', ' another line ', '[', 'and a bracket', ']', '']
Result should be:
['A new string.', 'with brackets', 'another line', 'and a bracket']
As a special requirement all newline characters and white spaces before and after a delimiter should be removed and not be included in the list either.
share|improve this question
add comment
4 Answers
up vote 6 down vote accepted
>>> re.split(r'\[|\]', data2)
['A new string. ', 'with brackets', ' another line ', 'and a bracket', '']
share|improve this answer
1
Yeah, that's a simpler approach than the non-capturing groups I recommended. – Peter DeGlopper Jun 11 '13 at 17:02
1
Works great. Just as an addition: How would I remove all newline characters und white spaces at the end/beginning of an element? – cherrun Jun 11 '13 at 18:07
Ok. Figured it out. Using strip() on each element in the list. Thanks again. – cherrun Jun 11 '13 at 18:11
@cherrun How about re.split(r'\s*[\[\]]\s*', data2) – arshajii Jun 11 '13 at 18:11
add comment
As arshajii points out, you don't need groups at all for this particular regexp.
If you did need groups to express a more complex regexp, you could use noncapturing groups to split without capturing the delimited. It's potentially useful for other situations but syntactically messy overkill here.
(?:...)
A non-capturing version of regular parentheses. Matches whatever regular expression is inside the parentheses, but the substring matched by the group cannot be retrieved after performing a match or referenced later in the pattern.
http://docs.python.org/2/library/re.html
So the unnecessarily complex but demonstrative example here would be:
re.split(r'(?:\[|\])', data2)
share|improve this answer
add comment
use this instead (without capture group):
re.split(r'\s*\[|]\s*', data)
or shorter:
re.split(r'\s*[][]\s*', data)
share|improve this answer
add comment
Couuld either split or findall all, eg:
data2 = 'A new string. [with brackets] another line [and a bracket]'
Using split and filtering out leading/trailing spaces:
import re
print filter(None, re.split(r'\s*[\[\]]\s*', data2))
# ['A new string.', 'with brackets', 'another line', 'and a bracket']
Or possibly, adapt a findall approach:
print re.findall(r'[^\b\[\]]+', data2)
# ['A new string. ', 'with brackets', ' another line ', 'and a bracket'] # needs a little work on leading/trailing stuff...
share|improve this answer
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/17049617/split-at-multiple-delimiter-without-delimiter-in-the-list",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "78368",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JMCDTQ4R2MT3OZAH4ZRLNM4QD65SFUEX",
"WARC-Concurrent-To": "<urn:uuid:5969726c-1402-4a0c-a7b5-6b2818cd8d39>",
"WARC-Date": "2014-03-16T18:53:14Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5KFPGXXO6CTNEOBRR5RQY5BSNX7W5VQD",
"WARC-Record-ID": "<urn:uuid:df525203-03e4-4907-b281-b649275e373c>",
"WARC-Target-URI": "http://stackoverflow.com/questions/17049617/split-at-multiple-delimiter-without-delimiter-in-the-list",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6f98e3f7-c614-4688-a6f7-f7d047f17981>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
157,
158,
283,
284,
466,
467,
478,
479,
534,
586,
587,
607,
608,
647,
648,
695,
696,
714,
715,
896,
897,
921,
922,
991,
992,
1001,
1002,
1030,
1056,
1057,
1160,
1161,
1256,
1257,
1275,
1276,
1344,
1345,
1497,
1498,
1526,
1538,
1539,
1549,
1550,
1579,
1609,
1684,
1710,
1714,
1830,
1834,
1994,
1996,
2104,
2106,
2190,
2202,
2203,
2284,
2285,
2502,
2503,
2511,
2512,
2743,
2744,
2785,
2786,
2856,
2857,
2887,
2913,
2925,
2926,
2968,
2969,
2999,
3000,
3012,
3013,
3043,
3069,
3081,
3082,
3122,
3123,
3192,
3193,
3248,
3249,
3259,
3312,
3382,
3383,
3422,
3423,
3462,
3586,
3612,
3624,
3625,
3637,
3638,
3640,
3648,
3649,
3727,
3728
],
"line_end_idx": [
25,
157,
158,
283,
284,
466,
467,
478,
479,
534,
586,
587,
607,
608,
647,
648,
695,
696,
714,
715,
896,
897,
921,
922,
991,
992,
1001,
1002,
1030,
1056,
1057,
1160,
1161,
1256,
1257,
1275,
1276,
1344,
1345,
1497,
1498,
1526,
1538,
1539,
1549,
1550,
1579,
1609,
1684,
1710,
1714,
1830,
1834,
1994,
1996,
2104,
2106,
2190,
2202,
2203,
2284,
2285,
2502,
2503,
2511,
2512,
2743,
2744,
2785,
2786,
2856,
2857,
2887,
2913,
2925,
2926,
2968,
2969,
2999,
3000,
3012,
3013,
3043,
3069,
3081,
3082,
3122,
3123,
3192,
3193,
3248,
3249,
3259,
3312,
3382,
3383,
3422,
3423,
3462,
3586,
3612,
3624,
3625,
3637,
3638,
3640,
3648,
3649,
3727,
3728,
3818
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3818,
"ccnet_original_nlines": 110,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3241296410560608,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016806719824671745,
"rps_doc_frac_lines_end_with_ellipsis": 0.009009010158479214,
"rps_doc_frac_no_alph_words": 0.29411765933036804,
"rps_doc_frac_unique_words": 0.4193548262119293,
"rps_doc_mean_word_length": 4.982079029083252,
"rps_doc_num_sentences": 48,
"rps_doc_symbol_to_word_ratio": 0.006002400070428848,
"rps_doc_unigram_entropy": 5.014284610748291,
"rps_doc_word_count": 558,
"rps_doc_frac_chars_dupe_10grams": 0.16151079535484314,
"rps_doc_frac_chars_dupe_5grams": 0.2568345367908478,
"rps_doc_frac_chars_dupe_6grams": 0.19748200476169586,
"rps_doc_frac_chars_dupe_7grams": 0.18525180220603943,
"rps_doc_frac_chars_dupe_8grams": 0.16151079535484314,
"rps_doc_frac_chars_dupe_9grams": 0.16151079535484314,
"rps_doc_frac_chars_top_2gram": 0.032374098896980286,
"rps_doc_frac_chars_top_3gram": 0.02517985925078392,
"rps_doc_frac_chars_top_4gram": 0.03525179997086525,
"rps_doc_books_importance": -357.7556457519531,
"rps_doc_books_importance_length_correction": -357.7556457519531,
"rps_doc_openwebtext_importance": -198.86282348632812,
"rps_doc_openwebtext_importance_length_correction": -198.86282348632812,
"rps_doc_wikipedia_importance": -143.61949157714844,
"rps_doc_wikipedia_importance_length_correction": -143.61949157714844
},
"fasttext": {
"dclm": 0.4098583459854126,
"english": 0.7949228882789612,
"fineweb_edu_approx": 1.4065431356430054,
"eai_general_math": 0.013694940134882927,
"eai_open_web_math": 0.2077537178993225,
"eai_web_code": 0.0016705399611964822
}
}
|
{
"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": "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": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,209,864,044,157,428,700 |
Diese Seite wurde zuletzt September 2021 aktualisiert und ist korrekt für Router Version 1.5.0.
About Reseed hosts
Reseed hosts are needed to for bootstrapping, that is, providing the initial set of I2P nodes for your I2P node to talk to. Depending on the status of your node it may need to bootstrap every now and then if many of the nodes it knows of aren't contactable.
Reseeding is done over an encrypted connection and all of the bootstrap information is signed by the reseed host you connect to, making it impossible for an unauthenticated source to provide you with false information.
Running a Reseed host
Operating a reseed server can be accessible to any sysadmin familiar with I2P, and we encourage new reseed operators to get in contact with us at the development forums. The more reseed hosts that are run, the more resilient the I2P network becomes, and the harder it is to prevent users of I2P from connecting to the network.
Other ways of Reseeding
In order to make I2P more reslient, other kinds of reseeding are possible. One important way of carrying out a reseed is the file-based reseed, where a user with a running I2P router generates a reseed file for a friend and transfers it to them as a .zip file. Others use cloud-based infrastructure to resist censorship. These reseed methods provide functionality which aids people in situations where reseeds are restricted.
Thank you Reseed Operators
If you are running a reseed server, We would like to thank you for helping to make the I2P network stronger and more resilient than ever.
Vielen Dank.
|
{
"url": "https://geti2p.net/de/docs/reseed",
"source_domain": "geti2p.net",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "29837",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VRB6QEVDPRXLGQTQK5BRJHQLIDY3VNFX",
"WARC-Concurrent-To": "<urn:uuid:2b4b26a5-6530-4af1-9aab-a5d4b953958e>",
"WARC-Date": "2022-08-16T13:33:49Z",
"WARC-IP-Address": "81.7.7.63",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LYW7AHBK4VIX2CTX7MRD4CZQPSMU24ZQ",
"WARC-Record-ID": "<urn:uuid:48315db7-a924-4bb8-bdec-14325262d0b6>",
"WARC-Target-URI": "https://geti2p.net/de/docs/reseed",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:12d05a8f-7aea-4ae7-99e8-0c2b4552c814>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-222\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
96,
97,
116,
117,
375,
376,
595,
596,
618,
619,
946,
947,
971,
972,
1398,
1399,
1426,
1427,
1565,
1566
],
"line_end_idx": [
96,
97,
116,
117,
375,
376,
595,
596,
618,
619,
946,
947,
971,
972,
1398,
1399,
1426,
1427,
1565,
1566,
1578
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1578,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43521595001220703,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02657807059586048,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1029900312423706,
"rps_doc_frac_unique_words": 0.5464683771133423,
"rps_doc_mean_word_length": 4.736059665679932,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.591823101043701,
"rps_doc_word_count": 269,
"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.02747252956032753,
"rps_doc_frac_chars_top_3gram": 0.021978020668029785,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -128.59182739257812,
"rps_doc_books_importance_length_correction": -115.44696044921875,
"rps_doc_openwebtext_importance": -52.255470275878906,
"rps_doc_openwebtext_importance_length_correction": -52.255470275878906,
"rps_doc_wikipedia_importance": -37.02924728393555,
"rps_doc_wikipedia_importance_length_correction": -23.209579467773438
},
"fasttext": {
"dclm": 0.07150357961654663,
"english": 0.875840425491333,
"fineweb_edu_approx": 2.234297037124634,
"eai_general_math": 0.5519276261329651,
"eai_open_web_math": 0.2450340986251831,
"eai_web_code": 0.18171089887619019
}
}
|
{
"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.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,244,148,775,536,836,000 |
Data is mostly a company’s best asset, operating personalized customer experiences, automatic marketing messaging, and science-driven ideas. While this is an excellent thing, it also means that companies are collecting a great ever-increasing quantity of personal information from other customers. As a result, many people are concerned about how businesses are using their info. This is why putting a priority in data personal privacy is so vital for companies and consumers similar.
What Is Info Privacy?
Data privacy is mostly a set of standards and laws that protect personal information from unauthorized access, use or disclosure. It includes from the personal data you present to a friend in social media for the confidential business facts that you keep in your accounting system. It truly is about understanding what you are sharing and with whom, understanding how it might be used against you, and gaining consent for its work with.
It is also about making sure that you are keeping your data secure data management safe and destroying that securely around july no longer needed. The best way to achieve this is always to embed privacy into your devices, services and products right from the start – a process known as ‘privacy simply by design’.
Putting first data privateness empowers individuals to maintain control over their particular personal information helping drive creativity. It is also an essential component of establishing trust, complying with rules, maintaining ethical practices and upholding individual autonomy. Consequently, it is an vital part of the digital economy.
|
{
"url": "https://www.kaffbd.com/2023/08/20/the-importance-of-data-privateness/",
"source_domain": "www.kaffbd.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "40265",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YTFH4WJF5DT23DDHP7HLOQHONSDOKM4S",
"WARC-Concurrent-To": "<urn:uuid:41230506-1dcf-40f6-a4f3-062a7aea2a03>",
"WARC-Date": "2024-02-25T15:27:26Z",
"WARC-IP-Address": "209.142.64.58",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:W4ECGTUSXHXASJUECFSTBZMVUNK5CDCR",
"WARC-Record-ID": "<urn:uuid:5f766226-cfb2-41f2-87c2-306f6a383295>",
"WARC-Target-URI": "https://www.kaffbd.com/2023/08/20/the-importance-of-data-privateness/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:95449a6d-0eca-4ff6-be08-920846d0281d>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-229\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
485,
486,
508,
509,
946,
947,
1261,
1262
],
"line_end_idx": [
485,
486,
508,
509,
946,
947,
1261,
1262,
1604
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1604,
"ccnet_original_nlines": 8,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42907801270484924,
"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.10638298094272614,
"rps_doc_frac_unique_words": 0.6159999966621399,
"rps_doc_mean_word_length": 5.296000003814697,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.756641387939453,
"rps_doc_word_count": 250,
"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.013595170341432095,
"rps_doc_frac_chars_top_3gram": 0.013595170341432095,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -100.44405364990234,
"rps_doc_books_importance_length_correction": -86.763671875,
"rps_doc_openwebtext_importance": -51.854820251464844,
"rps_doc_openwebtext_importance_length_correction": -51.854820251464844,
"rps_doc_wikipedia_importance": -28.05770492553711,
"rps_doc_wikipedia_importance_length_correction": -14.451635360717773
},
"fasttext": {
"dclm": 0.04819357022643089,
"english": 0.9569436311721802,
"fineweb_edu_approx": 2.301173686981201,
"eai_general_math": 0.005201220046728849,
"eai_open_web_math": 0.009121419861912727,
"eai_web_code": 0.051877979189157486
}
}
|
{
"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": "352.3",
"labels": {
"level_1": "Social sciences",
"level_2": "Public administration and Military art and science",
"level_3": "Local government"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "1",
"label": "About (Org.)"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,557,597,442,920,868,000 |
Connor35
1 Copper
Inspiron 15 7000 7559 GPU not working with certain programs
I am having an issue with certain games where they have sound, but no visual. Using NVIDIA control panel, I can force it to run on my integrated card, which it then runs extremely laggy because its running on the integrated card, VS the 960m.
I only have an issue with this on certain games, some run with absolutely no problem, games like CS:GO, Skyrim, Garry's Mod, and others work fine. But then games like GTA V, Overwatch, World of Warcraft(?), City's: Skylines, Faster Than Light, and more do not work at all if I run it on my NVIDIA card. I see no pattern to any of these games, its just random games work and others don't unless I run them on my integrated Intel GPU.
Let me add I sent my computer to Dell themselves, and they didn't even fix the issue. So I am completely out of options.
0 Kudos
2 Replies
8 Krypton
RE: Inspiron 15 7000 7559 GPU not working with certain programs
Some games require setup for hybrid video -- others won't work with it at all. For WoW,
us.battle.net/.../2593006174
Check with the publisher of other games for their settings/support.
0 Kudos
Connor35
1 Copper
RE: Inspiron 15 7000 7559 GPU not working with certain programs
The problem is there are youtube videos of my exact computer playing those games.
There are more. Just look up dell inspiron 15 7559 [game name]
0 Kudos
|
{
"url": "https://www.dell.com/community/Laptops-General-Read-Only/Inspiron-15-7000-7559-GPU-not-working-with-certain-programs/td-p/5034216",
"source_domain": "www.dell.com",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "149653",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CWBTPEVJNMO7RTFTSHBN4IK3QWOR4XZF",
"WARC-Concurrent-To": "<urn:uuid:b6dd858c-19af-4565-915a-61dc52e49cf1>",
"WARC-Date": "2019-08-21T22:31:56Z",
"WARC-IP-Address": "23.46.236.32",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:U5NESWHRLKGBKZBZXUSDVM2J7P5JVIUR",
"WARC-Record-ID": "<urn:uuid:d2e297de-4dd6-4d8d-8948-7d039bbd2fe3>",
"WARC-Target-URI": "https://www.dell.com/community/Laptops-General-Read-Only/Inspiron-15-7000-7559-GPU-not-working-with-certain-programs/td-p/5034216",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:200505a9-8f63-4e3b-9734-ee305e907694>"
},
"warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-49.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,
9,
18,
19,
79,
80,
323,
324,
757,
758,
879,
880,
888,
898,
908,
909,
973,
974,
1063,
1064,
1093,
1094,
1162,
1163,
1171,
1180,
1189,
1190,
1254,
1255,
1337,
1338,
1401,
1402
],
"line_end_idx": [
9,
18,
19,
79,
80,
323,
324,
757,
758,
879,
880,
888,
898,
908,
909,
973,
974,
1063,
1064,
1093,
1094,
1162,
1163,
1171,
1180,
1189,
1190,
1254,
1255,
1337,
1338,
1401,
1402,
1409
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1409,
"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.3692810535430908,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06862744688987732,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20588235557079315,
"rps_doc_frac_unique_words": 0.5396825671195984,
"rps_doc_mean_word_length": 4.32539701461792,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0.003267969936132431,
"rps_doc_unigram_entropy": 4.677748680114746,
"rps_doc_word_count": 252,
"rps_doc_frac_chars_dupe_10grams": 0.14128440618515015,
"rps_doc_frac_chars_dupe_5grams": 0.14128440618515015,
"rps_doc_frac_chars_dupe_6grams": 0.14128440618515015,
"rps_doc_frac_chars_dupe_7grams": 0.14128440618515015,
"rps_doc_frac_chars_dupe_8grams": 0.14128440618515015,
"rps_doc_frac_chars_dupe_9grams": 0.14128440618515015,
"rps_doc_frac_chars_top_2gram": 0.03669724985957146,
"rps_doc_frac_chars_top_3gram": 0.038532111793756485,
"rps_doc_frac_chars_top_4gram": 0.049541279673576355,
"rps_doc_books_importance": -142.6907958984375,
"rps_doc_books_importance_length_correction": -142.4055633544922,
"rps_doc_openwebtext_importance": -89.0276870727539,
"rps_doc_openwebtext_importance_length_correction": -89.0276870727539,
"rps_doc_wikipedia_importance": -56.474361419677734,
"rps_doc_wikipedia_importance_length_correction": -52.027008056640625
},
"fasttext": {
"dclm": 0.1383655071258545,
"english": 0.9255982637405396,
"fineweb_edu_approx": 0.9692672491073608,
"eai_general_math": 0.43354278802871704,
"eai_open_web_math": 0.18544167280197144,
"eai_web_code": 0.18254703283309937
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,148,074,747,514,847,500 |
L_RotateBitmap | Function References | Raster Imaging C API Help
L_RotateBitmap
#include "l_bitmap.h"
L_LTKRN_API L_INT L_RotateBitmap(pBitmap, nAngle, uFlags, crFill)
Rotates a bitmap by the number of degrees specified.
Parameters
pBITMAPHANDLE pBitmap
Pointer to the bitmap handle referencing the bitmap to be changed.
L_INT nAngle
Hundredths of degrees to rotate (+/-). This can be a number from 0 to 36,000. A positive value will rotate the image in a clockwise rotation, while a negative value will rotate the image in a counter-clockwise rotation.
L_UINT uFlags
Flag to keep the resulting image the same size as the original image or to resize according to the rotation direction specified. Valid values are:
Value Meaning
ROTATE_RESIZE [0x0001] Size resulting image as needed.
ROTATE_RESAMPLE [0x0002] Perform bilinear interpolation when rotating.
ROTATE_BICUBIC [0x0004] Perform bicubic interpolation when rotating.
0 Do not resize the image. Crop it.
L_COLORREF crFill
The background fill color. You can specify a COLORREF value, such as the return value of the Windows RGB macro, or you can use the PALETTEINDEX macro to specify a palette color.
Returns
Value Meaning
SUCCESS The function was successful.
< 1 An error occurred. Refer to Return Codes.
Comments
This function has the following features:
To update a status bar or detect a user interrupt during execution of this function, refer to L_SetStatusCallback.
ROTATE_RESAMPLE and ROTATE_BICUBIC can be combined with ROTATE_RESIZE, but they can not be combined with each other. Therefore, you can pass ROTATE_RESAMPLE|ROTATE_RESIZE, but not ROTATE_RESAMPLE|ROTATE_BICUBIC.
If ROTATE_RESIZE is set, then the image is resized. Otherwise, the image is cropped.
Interpolation can be done while rotating certain images. This produces superior output, eliminating the jaggedness occurring when rotating images at angles that are not multiple of 90. (ie when nAngle is not a multiple of 9000).
The only images that are interpolated are:
For the other images, L_RotateBitmap ignores the resampling flags and the rotation is performed without interpolation.
Required DLLs and Libraries
Platforms
Win32, x64, Linux.
See Also
Functions
Topics
Example
For complete sample code, refer to the FEATURE1 example. This example loads a bitmap and rotates it.
L_INT RotateBitmapExample(L_VOID)
{
L_INT nRet;
BITMAPHANDLE LeadBitmap; /* Bitmap handle to hold the loaded image. */
/* Load the bitmap, keeping the bits per pixel of the file */
nRet = L_LoadBitmap (MAKE_IMAGE_PATH(TEXT("IMAGE1.CMP")), &LeadBitmap, sizeof(BITMAPHANDLE), 0, ORDER_BGR, NULL, NULL);
if(nRet != SUCCESS)
return nRet;
/* Rotate the bitmap 45 degrees counterclockwise, increasing the size as necessary */
nRet = L_RotateBitmap(&LeadBitmap, -4500, ROTATE_RESIZE, RGB(255, 0, 0) );
if(nRet != SUCCESS)
return nRet;
nRet = L_SaveBitmap(MAKE_IMAGE_PATH(TEXT("Result.BMP")), &LeadBitmap, FILE_BMP, 24, 0, NULL);
if(nRet != SUCCESS)
return nRet;
if(LeadBitmap.Flags.Allocated)
L_FreeBitmap(&LeadBitmap);
return SUCCESS;
}
Help Version 20.0.2019.10.13
Products | Support | Contact Us | Intellectual Property Notices
© 1991-2019 LEAD Technologies, Inc. All Rights Reserved.
LEADTOOLS Raster Imaging C API Help
|
{
"url": "https://www.leadtools.com/help/leadtools/v20/main/api/l-rotatebitmap.html",
"source_domain": "www.leadtools.com",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "766393",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:B2DTZSI2ZEVL5NCTPPMWVAK333ZF5GBR",
"WARC-Concurrent-To": "<urn:uuid:75dc44e8-061c-4075-9781-868300a04c5b>",
"WARC-Date": "2019-11-11T20:57:56Z",
"WARC-IP-Address": "216.134.197.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7YU47WGNVSBLJ2E6QTXCQDTZCOYX3PE3",
"WARC-Record-ID": "<urn:uuid:a5f35f72-cc9b-4378-9d13-b425dc5789f5>",
"WARC-Target-URI": "https://www.leadtools.com/help/leadtools/v20/main/api/l-rotatebitmap.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d698415a-c3cf-44ac-8497-eaafca57c8dd>"
},
"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-238.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,
67,
68,
83,
84,
106,
107,
173,
174,
227,
228,
239,
240,
262,
263,
330,
331,
344,
345,
565,
566,
580,
581,
728,
729,
743,
798,
869,
938,
974,
975,
993,
994,
1172,
1173,
1181,
1182,
1196,
1233,
1279,
1280,
1289,
1290,
1332,
1333,
1448,
1449,
1661,
1662,
1747,
1748,
1977,
1978,
2021,
2022,
2141,
2142,
2170,
2171,
2181,
2182,
2201,
2202,
2211,
2212,
2222,
2223,
2230,
2231,
2239,
2240,
2341,
2342,
2377,
2380,
2396,
2473,
2475,
2541,
2665,
2689,
2709,
2799,
2878,
2902,
2922,
2924,
3022,
3046,
3066,
3101,
3137,
3157,
3160,
3161,
3190,
3254,
3311,
3313
],
"line_end_idx": [
67,
68,
83,
84,
106,
107,
173,
174,
227,
228,
239,
240,
262,
263,
330,
331,
344,
345,
565,
566,
580,
581,
728,
729,
743,
798,
869,
938,
974,
975,
993,
994,
1172,
1173,
1181,
1182,
1196,
1233,
1279,
1280,
1289,
1290,
1332,
1333,
1448,
1449,
1661,
1662,
1747,
1748,
1977,
1978,
2021,
2022,
2141,
2142,
2170,
2171,
2181,
2182,
2201,
2202,
2211,
2212,
2222,
2223,
2230,
2231,
2239,
2240,
2341,
2342,
2377,
2380,
2396,
2473,
2475,
2541,
2665,
2689,
2709,
2799,
2878,
2902,
2922,
2924,
3022,
3046,
3066,
3101,
3137,
3157,
3160,
3161,
3190,
3254,
3311,
3313,
3348
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3348,
"ccnet_original_nlines": 98,
"rps_doc_curly_bracket": 0.0005973699735477567,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24878837168216705,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08239094913005829,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.28271403908729553,
"rps_doc_frac_unique_words": 0.5204545259475708,
"rps_doc_mean_word_length": 5.793181896209717,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0.0016155099729076028,
"rps_doc_unigram_entropy": 5.035863876342773,
"rps_doc_word_count": 440,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05806199088692665,
"rps_doc_frac_chars_dupe_6grams": 0.020400160923600197,
"rps_doc_frac_chars_dupe_7grams": 0.020400160923600197,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01569242961704731,
"rps_doc_frac_chars_top_3gram": 0.02236171066761017,
"rps_doc_frac_chars_top_4gram": 0.027069440111517906,
"rps_doc_books_importance": -342.9930114746094,
"rps_doc_books_importance_length_correction": -342.9930114746094,
"rps_doc_openwebtext_importance": -178.60765075683594,
"rps_doc_openwebtext_importance_length_correction": -178.60765075683594,
"rps_doc_wikipedia_importance": -144.84898376464844,
"rps_doc_wikipedia_importance_length_correction": -144.84898376464844
},
"fasttext": {
"dclm": 0.4271029233932495,
"english": 0.6074598431587219,
"fineweb_edu_approx": 2.8337554931640625,
"eai_general_math": 0.31483787298202515,
"eai_open_web_math": 0.3750232458114624,
"eai_web_code": 0.45838767290115356
}
}
|
{
"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.3",
"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": "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": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,885,706,915,085,060,400 |
How to Buy at Kroger if You Are Outside the US
Kroger is one of the largest American retail stores in the US. It was founded in 1883 and its headquarters are located in Downtown Cincinnati. Kroger operates supermarkets, pharmacies, jewelry stores, convenient stores, department stores, clinics, manufacturing facilities, and many more. Kroger offers various items and services to buy, order, or benefit from and the prices are usually affordable for everyone. Kroger’s operations are based in different states in the US.
US stores such as Kroger have many high-quality products at a good price range. This means that many people, even the ones who live outside the US, would want to buy and order from Kroger to benefit from all the good items. However, geo-restrictions and over-pricing can be an issue for the residents of countries outside the US. In the following article, we will give you everything you need to be able to buy and order from Kroger if you live outside the US.
Here Is What to Do to Buy and Order From Kroger From Outside the US
If you are a citizen of a country from outside the US, you will need the help of VPN Unlimited to be able to buy and order from Kroger. VPN Unlimited will change your IP address to allow you to bypass geo-restrictions and shop at Kroger without paying more than the original price. Here is what you should you:
Step 1: Download VPN Unlimited and sign in with an existing account or create a new one.
Step 2: Press the Start button in order to launch the connection with one of the servers located in the US.
Step 3: Go to Kroger’s shop to buy and order all the items you want.
Start using VPN Unlimited
VPN Unlimited is one of the most reliable VPNs in the market. It is a virtual private network that establishes a secure connection whenever you are using public WiFi. VPN Unlimited works by hiding and even changing your IP address to make sure you and your data will stay safe and secure whenever you use the internet. This means that hackers, third parties, and unauthorized users will not have access to your private information. Here are its benefits.
VPN Unlimited Benefits
Bypass geo-restrictions
VPN Unlimited has more than 500 servers in 80+ countries. This will allow you to bypass geo-restrictions and access any content or website from any country.
Ultimate safety and security
VPN Unlimited encrypts all your data and personal information to make them inaccessible to any hacker or cybercriminal. Moreover, VPN Unlimited hides your IP address to allow you to surf the internet anonymously. No one will be able to access your online activities.
Cheap online shopping
VPN Unlimited helps you avoid regional pricing when you are shopping online. By using VPN Unlimited, you will be able to find better and cheaper prices when buying and ordering online.
Benefit from the offered services and stay safe and protected at all times
Download VPN Unlimited now!
other platforms
VPN Unlimited is also part of MonoDefense security bundle.
|
{
"url": "https://www.vpnunlimited.com/help/solutions/how-to-buy-at-kroger-if-you-outside-us",
"source_domain": "www.vpnunlimited.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "168207",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3JTWL3CIMQ36HST4AIJBWYAHDFDAS4C6",
"WARC-Concurrent-To": "<urn:uuid:03489cfe-fdce-48a1-90c7-957fc6d6b2a0>",
"WARC-Date": "2023-06-06T06:52:30Z",
"WARC-IP-Address": "104.22.44.223",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Q4H2G227SHRZG2VUNFNE4ONNKYBT3BFW",
"WARC-Record-ID": "<urn:uuid:0621bee1-823f-47a3-910a-66abc1e1f066>",
"WARC-Target-URI": "https://www.vpnunlimited.com/help/solutions/how-to-buy-at-kroger-if-you-outside-us",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bd5a9174-1c8e-4328-9064-ff2c65f3d6bf>"
},
"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,
47,
48,
522,
523,
984,
985,
987,
988,
1057,
1058,
1369,
1370,
1459,
1460,
1568,
1569,
1638,
1639,
1641,
1642,
1668,
1669,
2124,
2125,
2148,
2149,
2173,
2174,
2331,
2332,
2361,
2362,
2629,
2630,
2652,
2653,
2838,
2839,
2914,
2915,
2943,
2944,
2960,
2961
],
"line_end_idx": [
47,
48,
522,
523,
984,
985,
987,
988,
1057,
1058,
1369,
1370,
1459,
1460,
1568,
1569,
1638,
1639,
1641,
1642,
1668,
1669,
2124,
2125,
2148,
2149,
2173,
2174,
2331,
2332,
2361,
2362,
2629,
2630,
2652,
2653,
2838,
2839,
2914,
2915,
2943,
2944,
2960,
2961,
3019
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3019,
"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.4364261329174042,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04639175161719322,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11168385297060013,
"rps_doc_frac_unique_words": 0.40776699781417847,
"rps_doc_mean_word_length": 4.700970649719238,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.807116508483887,
"rps_doc_word_count": 515,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08921933174133301,
"rps_doc_frac_chars_dupe_6grams": 0.08921933174133301,
"rps_doc_frac_chars_dupe_7grams": 0.04626188054680824,
"rps_doc_frac_chars_dupe_8grams": 0.025609249249100685,
"rps_doc_frac_chars_dupe_9grams": 0.025609249249100685,
"rps_doc_frac_chars_top_2gram": 0.06939280778169632,
"rps_doc_frac_chars_top_3gram": 0.029739780351519585,
"rps_doc_frac_chars_top_4gram": 0.026848409324884415,
"rps_doc_books_importance": -292.4617004394531,
"rps_doc_books_importance_length_correction": -292.4617004394531,
"rps_doc_openwebtext_importance": -144.23703002929688,
"rps_doc_openwebtext_importance_length_correction": -144.23703002929688,
"rps_doc_wikipedia_importance": -153.75669860839844,
"rps_doc_wikipedia_importance_length_correction": -153.75669860839844
},
"fasttext": {
"dclm": 0.3732460141181946,
"english": 0.9516476392745972,
"fineweb_edu_approx": 1.2638335227966309,
"eai_general_math": 0.0025919699110090733,
"eai_open_web_math": 0.026099029928445816,
"eai_web_code": 0.003882939927279949
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.677",
"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": "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": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,299,942,415,714,542,000 |
WeBWorK Problems
parserFunction in answers
parserFunction in answers
by Genevieve Toutain -
Number of replies: 3
Hi again,
I am working on authoring some problems, and I am running into a snag. I would like students to get some practice using function notation, so I would like the required answer to be something like "f(2)" without actually evaluating this to a number.
I have successfully used parserFunction to evaluate a function easily through out a problem, ie:
DOCUMENT();
loadMacros("parserFunction.pl",);
TEXT(beginproblem());
parserFunction(f => "2x");
BEGIN_TEXT
\( f(2) = \) \{ Compute( "f(2)" ) \}
END_TEXT
ENDDOCUMENT();
This prints f(2)=4 nicely, and I can figure out how to have the answer blank check again 4 the value of f(2), but I can't figure out how to have it check against "f(2)" the actual string. As a work around, I have been using a string compare, but it seems like maybe there is a classier way to do this. Especially when it comes to decimals-f(1/2) should be a correct answer to f(.5), but a string comparison will miss that.
Any help would be greatly appreciated!
In reply to Genevieve Toutain
Re: parserFunction in answers
by Davide Cervone -
The usual approach is to use parserFunction to produce a function that is unlikely to be replicated accidentally by a student. For example:
parserFunction(f => "sin(x) + ln(x^2+1)");
In this case, f(2) is not something the students would be likely to type on their own without the use of f().
When you do this, you will also want to set the formatStudentAnswers context flag so that the numeric answer isn't shown, but rather the reduced parsed answer (otherwise the student will see a funny decimal number as their answer rather than f(2)).
Here is an example:
loadMacros("parserFunction.pl");
Context("Numeric");
Context()->flags->set(formatStudentAnswer => "reduced");
parserFunction(f => "sin(x) + ln(x^2+1)");
$a = Compute("f(2)");
BEGIN_TEXT
\(f(2)\) = \{$a->ans_rule\}
END_TEXT
ANS($a->cmp);
Hope that does what you are looking for.
In reply to Davide Cervone
Re: parserFunction in answers
by Paul Pearson -
Hi all,
Davide, your answer was great. I would like to ask a related follow up question. Is it possible to use a custom answer checker that will set the student_value in the answer hash to be something else? In the code below, I am able to set the student_value to something else (in this case, the preview_text_string); however, when I type the answer f(2) in the answer box and click submit answers, the "Entered" answer displays 8 instead of f(2) as I had hoped it would. So, my general question is, "How can I change values in the answer hash and have those changes appear in the answer feedback given to students when they submit their answers?"
Thanks!
Paul Pearson
#####################
DOCUMENT();
loadMacros(
"PGstandard.pl",
"MathObjects.pl",
"parserFunction.pl",
);
TEXT(beginproblem());
Context('Numeric');
parserFunction("f(x)" => "x^3");
$answer = Compute( "f(2)" );
BEGIN_TEXT
\( f(2) = \) \{ ans_rule(10) \}
END_TEXT
ANS( $answer->cmp( checker=>sub {
my ( $correct, $student, $ansHash ) = @_;
warn $ansHash->{student_value}; # can comment this out
$ansHash->{student_value} = $ansHash->{preview_text_string};
warn $ansHash->{student_value}; # can comment this out
return $correct == $student;
} ) );
ENDDOCUMENT();
In reply to Paul Pearson
Re: parserFunction in answers
by Davide Cervone -
The student_value property is the wrong one to change. This is (and should always be) the MathObject that was obtained from parsing the student's answer. It is a mistake to replace this by a string, as other parts of WW may look at this value and expect to have a MathObject (e.g., AnswerHints, or other post-filters).
The field that ends up in the "Entered" column is student_ans (corresponding to corrections, just as student_value corresponds to correct_value). You certainly can set that during a custom answer checker.
But there is an easier way. The formatStudentAnswer flag in the Context controls how the entered field will be displayed. If you want it to be "f(2)" rather than "8", set it to parsed or reduced, as I did in my example above. The difference between the two is that reduced will reduce constant expressions, and so will make "f(2+3)" into "f(5)", while parsed will show the original without any modifications (so would show "f(2+3)").
|
{
"url": "https://webwork.maa.org/moodle/mod/forum/discuss.php?d=3435",
"source_domain": "webwork.maa.org",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "92911",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:K7J2POUXJCY4IUUZSSUFLRNXGM5YRRJG",
"WARC-Concurrent-To": "<urn:uuid:397e21c2-a21f-4271-b3a3-0a874aaa285b>",
"WARC-Date": "2021-10-22T16:14:12Z",
"WARC-IP-Address": "34.204.106.157",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CQKSIWRDPFI7YXCZYQPSRWRWQ42KRXWH",
"WARC-Record-ID": "<urn:uuid:b8aaf779-8ce9-48bb-8793-3ec4e6018cc9>",
"WARC-Target-URI": "https://webwork.maa.org/moodle/mod/forum/discuss.php?d=3435",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d8e2b80f-0e83-481d-ad6b-dd57d5cf9099>"
},
"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-88\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,
17,
18,
44,
45,
71,
72,
95,
116,
127,
128,
379,
380,
477,
478,
498,
499,
533,
534,
556,
557,
584,
585,
596,
597,
634,
635,
645,
646,
669,
670,
671,
1097,
1098,
1099,
1138,
1139,
1140,
1170,
1171,
1201,
1202,
1222,
1362,
1407,
1517,
1518,
1767,
1768,
1788,
1789,
1822,
1823,
1843,
1900,
1901,
1944,
1945,
1967,
1968,
1979,
2007,
2016,
2030,
2031,
2072,
2073,
2100,
2101,
2131,
2132,
2150,
2158,
2159,
2806,
2807,
2815,
2816,
2829,
2830,
2831,
2832,
2854,
2855,
2875,
2876,
2888,
2905,
2923,
2944,
2947,
2948,
2970,
2971,
2991,
3024,
3025,
3054,
3055,
3056,
3067,
3068,
3100,
3101,
3111,
3112,
3146,
3192,
3193,
3252,
3317,
3376,
3377,
3410,
3417,
3418,
3441,
3466,
3467,
3497,
3498,
3518,
3837,
3838,
3839,
4044,
4045,
4046
],
"line_end_idx": [
17,
18,
44,
45,
71,
72,
95,
116,
127,
128,
379,
380,
477,
478,
498,
499,
533,
534,
556,
557,
584,
585,
596,
597,
634,
635,
645,
646,
669,
670,
671,
1097,
1098,
1099,
1138,
1139,
1140,
1170,
1171,
1201,
1202,
1222,
1362,
1407,
1517,
1518,
1767,
1768,
1788,
1789,
1822,
1823,
1843,
1900,
1901,
1944,
1945,
1967,
1968,
1979,
2007,
2016,
2030,
2031,
2072,
2073,
2100,
2101,
2131,
2132,
2150,
2158,
2159,
2806,
2807,
2815,
2816,
2829,
2830,
2831,
2832,
2854,
2855,
2875,
2876,
2888,
2905,
2923,
2944,
2947,
2948,
2970,
2971,
2991,
3024,
3025,
3054,
3055,
3056,
3067,
3068,
3100,
3101,
3111,
3112,
3146,
3192,
3193,
3252,
3317,
3376,
3377,
3410,
3417,
3418,
3441,
3466,
3467,
3497,
3498,
3518,
3837,
3838,
3839,
4044,
4045,
4046,
4479
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4479,
"ccnet_original_nlines": 127,
"rps_doc_curly_bracket": 0.0035722299944609404,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3743641972541809,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029501529410481453,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3041709065437317,
"rps_doc_frac_unique_words": 0.4129429757595062,
"rps_doc_mean_word_length": 5,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.023397760465741158,
"rps_doc_unigram_entropy": 5.059853553771973,
"rps_doc_word_count": 649,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07057011127471924,
"rps_doc_frac_chars_dupe_6grams": 0.05115561932325363,
"rps_doc_frac_chars_dupe_7grams": 0.02650230936706066,
"rps_doc_frac_chars_dupe_8grams": 0.02650230936706066,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.010785819962620735,
"rps_doc_frac_chars_top_3gram": 0.0354391410946846,
"rps_doc_frac_chars_top_4gram": 0.030816640704870224,
"rps_doc_books_importance": -484.1807556152344,
"rps_doc_books_importance_length_correction": -484.1807556152344,
"rps_doc_openwebtext_importance": -238.3912353515625,
"rps_doc_openwebtext_importance_length_correction": -238.3912353515625,
"rps_doc_wikipedia_importance": -202.8462371826172,
"rps_doc_wikipedia_importance_length_correction": -202.8462371826172
},
"fasttext": {
"dclm": 0.5973628759384155,
"english": 0.8628492951393127,
"fineweb_edu_approx": 2.6697378158569336,
"eai_general_math": 0.9615670442581177,
"eai_open_web_math": 0.6067873239517212,
"eai_web_code": 0.952937662601471
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,400,911,244,910,368,000 |
Flowchart Example: Online Order System
Description:
Flowcharts can be used in many different situations. It's very useful in providing an overview of a process, helping you in making right decisions. This is a flowchart for online order system. It shows the typical flow of processing an order, from receiving the order from customer, to confirming and dispatching the order.
Use this flowchart template to get started building your own. Customize the flowchart to reflect your own process. Click Use this Template to start.
What is Flowchart?
A flowchart is a graphical representation of steps and decisions involved in a process or workflow. Step and process elements are represented by simple shapes like rectangle, diamond, oval, etc. They are connected by directional arrows in showing the sequence. The simple layout allows anyone to understand with no difficulty.
How to draw Flowchart?
1. Describe the process in a one-line statement.
2. Start with the 'trigger' event that initiates the process.
3. Note each successive action in concise terms, avoiding ambiguous descriptions.
4. Continue describing each event, action, or decision as it occurs in sequence, until the process is concluded (a 'target' point).
Keen to try VP Online?
No limitations, no obligations, no cancellation fees.
Start a Free Trial
We use cookies to offer you a better experience. By visiting our website, you agree to the use of cookies as described in our Cookie Policy.
OK
|
{
"url": "https://online.visual-paradigm.com/diagrams/templates/flowchart/online-order-system/",
"source_domain": "online.visual-paradigm.com",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "67085",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VFOHZNYOJI7ZE27KJIMWNNIYQBLL5GUV",
"WARC-Concurrent-To": "<urn:uuid:5838254a-b924-429a-b766-0b936b84eeaf>",
"WARC-Date": "2020-04-05T11:36:55Z",
"WARC-IP-Address": "52.6.184.214",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:S4TFGBYQGZOED2XVP5K2FHZLBD7Q3YQJ",
"WARC-Record-ID": "<urn:uuid:c47327be-af8a-44c6-b687-9ba370aedf72>",
"WARC-Target-URI": "https://online.visual-paradigm.com/diagrams/templates/flowchart/online-order-system/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:90321948-7a42-4181-a785-1d91e688f9cb>"
},
"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,
39,
40,
53,
54,
378,
379,
528,
529,
548,
549,
876,
877,
900,
901,
952,
1016,
1100,
1234,
1235,
1258,
1259,
1313,
1314,
1315,
1334,
1335,
1476,
1477
],
"line_end_idx": [
39,
40,
53,
54,
378,
379,
528,
529,
548,
549,
876,
877,
900,
901,
952,
1016,
1100,
1234,
1235,
1258,
1259,
1313,
1314,
1315,
1334,
1335,
1476,
1477,
1479
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1479,
"ccnet_original_nlines": 28,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3581560254096985,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010638300329446793,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1808510571718216,
"rps_doc_frac_unique_words": 0.6008583903312683,
"rps_doc_mean_word_length": 5.055793762207031,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.638647079467773,
"rps_doc_word_count": 233,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.025466889142990112,
"rps_doc_frac_chars_top_3gram": 0.02886248007416725,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -140.9725341796875,
"rps_doc_books_importance_length_correction": -133.8483428955078,
"rps_doc_openwebtext_importance": -71.02992248535156,
"rps_doc_openwebtext_importance_length_correction": -71.02992248535156,
"rps_doc_wikipedia_importance": -45.11944580078125,
"rps_doc_wikipedia_importance_length_correction": -34.4688835144043
},
"fasttext": {
"dclm": 0.09735029935836792,
"english": 0.9246594309806824,
"fineweb_edu_approx": 2.7165725231170654,
"eai_general_math": 0.03258037939667702,
"eai_open_web_math": 0.08761168271303177,
"eai_web_code": 0.010419369675219059
}
}
|
{
"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.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,836,731,544,841,853,000 |
blob: b8e9e7ce94741e454d6a6b88f2b0337a5c6794d0 [file] [log] [blame]
; RUN: opt -S < %s | FileCheck %s
; The intrinsic firstly only took i8*, then it was made polimorphic, then
; it was renamed to launder.invariant.group
define void @test(i8* %p1, i16* %p16) {
; CHECK-LABEL: @test
; CHECK: %p2 = call i8* @llvm.launder.invariant.group.p0i8(i8* %p1)
; CHECK: %p3 = call i8* @llvm.launder.invariant.group.p0i8(i8* %p1)
; CHECK: %p4 = call i16* @llvm.launder.invariant.group.p0i16(i16* %p16)
%p2 = call i8* @llvm.invariant.group.barrier(i8* %p1)
%p3 = call i8* @llvm.invariant.group.barrier.p0i8(i8* %p1)
%p4 = call i16* @llvm.invariant.group.barrier.p0i16(i16* %p16)
ret void
}
; CHECK: Function Attrs: inaccessiblememonly nofree nosync nounwind speculatable willreturn
; CHECK: declare i8* @llvm.launder.invariant.group.p0i8(i8*)
; CHECK: Function Attrs: inaccessiblememonly nofree nosync nounwind speculatable willreturn
; CHECK: declare i16* @llvm.launder.invariant.group.p0i16(i16*)
declare i8* @llvm.invariant.group.barrier(i8*)
declare i8* @llvm.invariant.group.barrier.p0i8(i8*)
declare i16* @llvm.invariant.group.barrier.p0i16(i16*)
|
{
"url": "https://llvm.googlesource.com/llvm-project/+/a87782c34d667d1c1a18fe82a9a7abfc72fd345b/llvm/test/Bitcode/upgrade-invariant-group-barrier.ll",
"source_domain": "llvm.googlesource.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "11981",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:C3TMBUDMXPAOP7M3Y64WYXH7CTI4D6CW",
"WARC-Concurrent-To": "<urn:uuid:1a432e27-032a-4d24-b813-191e553e6948>",
"WARC-Date": "2022-10-04T21:14:06Z",
"WARC-IP-Address": "172.253.115.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XWLZFRF6UH6QLG6KIIYNQL6VHIKSBYFL",
"WARC-Record-ID": "<urn:uuid:db686540-9dbb-45d6-a75e-ee93d533f295>",
"WARC-Target-URI": "https://llvm.googlesource.com/llvm-project/+/a87782c34d667d1c1a18fe82a9a7abfc72fd345b/llvm/test/Bitcode/upgrade-invariant-group-barrier.ll",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2b9b01a6-94da-4c9e-a098-8e9d32ae8cb1>"
},
"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-234\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,
102,
176,
220,
260,
281,
349,
417,
489,
543,
602,
665,
674,
676,
768,
829,
921,
985,
1032,
1084
],
"line_end_idx": [
68,
102,
176,
220,
260,
281,
349,
417,
489,
543,
602,
665,
674,
676,
768,
829,
921,
985,
1032,
1084,
1138
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1138,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0.0017574699595570564,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.03405572846531868,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03405572846531868,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4953560531139374,
"rps_doc_frac_unique_words": 0.4811320900917053,
"rps_doc_mean_word_length": 7.9811320304870605,
"rps_doc_num_sentences": 45,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.7070605754852295,
"rps_doc_word_count": 106,
"rps_doc_frac_chars_dupe_10grams": 0.215130016207695,
"rps_doc_frac_chars_dupe_5grams": 0.3191489279270172,
"rps_doc_frac_chars_dupe_6grams": 0.215130016207695,
"rps_doc_frac_chars_dupe_7grams": 0.215130016207695,
"rps_doc_frac_chars_dupe_8grams": 0.215130016207695,
"rps_doc_frac_chars_dupe_9grams": 0.215130016207695,
"rps_doc_frac_chars_top_2gram": 0.028368789702653885,
"rps_doc_frac_chars_top_3gram": 0.021276600658893585,
"rps_doc_frac_chars_top_4gram": 0.09219858050346375,
"rps_doc_books_importance": -86.86256408691406,
"rps_doc_books_importance_length_correction": -86.86256408691406,
"rps_doc_openwebtext_importance": -34.54014205932617,
"rps_doc_openwebtext_importance_length_correction": -30.113492965698242,
"rps_doc_wikipedia_importance": -34.933284759521484,
"rps_doc_wikipedia_importance_length_correction": -34.933284759521484
},
"fasttext": {
"dclm": 0.9570224285125732,
"english": 0.3204766809940338,
"fineweb_edu_approx": 3.214977502822876,
"eai_general_math": 0.6686148047447205,
"eai_open_web_math": 0.1815987229347229,
"eai_web_code": 0.08952326327562332
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,188,927,074,160,601,000 |
7
\$\begingroup\$
I'm currently trying to develop a Voxel Engine using Direct3D 9 and C++. To keep the memory usage low, i'm only passing the position, the orientation and the offset of the current voxels texture in the texture atlas of each vertex to the vertex shader.
The vertex shader then calculates the normal and passes it to the pixel shader. I found this article which covers, how to texture voxels with just their position and normal in glsl.
This is the part that calculates the texture coordinates in my pixel shader (SM3):
float2 tileUV = float2(dot(input.normal.zxy, input.pos3D),
dot(input.normal.yzx, input.pos3D));
float2 texcoord = input.texOffset + tileSize * frac(tileUV);
This code works fine for faces that point in negative z-direction (normal [0,0,-1]), however, the back is flipped by 180° and the sides and top/bottom squares are flipped by 90°/270°.
I am not sure, if this is correctly translated from glsl, because this behaviour should be the expected one in hlsl, if I calculate it by hand. Is there anything that I have overseen or should I aim for a different approach?
Edit:
I have now managed to successfully texture the faces by replacing the previous calculation with the following:
if(input.normal.y != 0.0f) // handle top/bottom surfaces as front/back faces
{
input.pos3D.y = input.pos3D.z;
input.normal.z = -input.normal.y;
input.normal.y = 0.0f;
}
texcoord.x = input.texOffset.x + tileSize * frac(float3(1.0f, 1.0f, 1.0f) + cross(frac(input.pos3D), input.normal)).y;
texcoord.y = input.texOffset.y + tileSize * (1.0f - frac(input.pos3D.y));
Is there any way that I can simplify/optimize the equation? I may also mention that the voxels are all axis aligned and clamped to integer coordinates.
Edit2:
This is the modified formula of zogi's answer which works as expected.
float3 n = abs(normal.xyz);
float2 texcoord = float2(input.texOffset.x + tileSize * dot(n, frac(input.pos3D.zxx)),
input.texOffset.y + tileSize + tileSize * dot(-n, frac(input.pos3D.yzy)));
\$\endgroup\$
2
\$\begingroup\$
The first formula you mentioned is not suitable for the result you want to achieve. I suggest the following formula instead:
float3 n = abs(input.normal.xyz);
float2 tileUV = float2(dot(n, input.pos3D.zxx),
dot(-n, input.pos3D.yzy));
The n vector basically selects the side of the cube, as exactly one coordinate is 1, the others are 0. Because the origin in texture coordinate space is at the top left corner of the texture in DirectX, while it is at the bottom left in OpenGL, the second texture coordinate has to be negated.
\$\endgroup\$
1
• \$\begingroup\$ Thanks, with small modifications, this works as expected. See my edit for the final formula. \$\endgroup\$ Jul 22 '14 at 11:24
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://gamedev.stackexchange.com/questions/72963/hlsl-voxel-texturing",
"source_domain": "gamedev.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "167848",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PFTNPB27WQPNNGFWCZRQHVYCFCNSV7WO",
"WARC-Concurrent-To": "<urn:uuid:e2f8592b-e952-4630-8a4e-4418a9cc53b6>",
"WARC-Date": "2021-10-21T14:19:02Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FR7ZGM5E67ALFCDR3G3E5OTVD3DJFEF2",
"WARC-Record-ID": "<urn:uuid:d19f8f09-0fb0-4b06-a352-1ad4f298cd71>",
"WARC-Target-URI": "https://gamedev.stackexchange.com/questions/72963/hlsl-voxel-texturing",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3aabc5f7-4541-48d9-9df6-547ebdd6b505>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-40\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
18,
19,
272,
273,
455,
456,
539,
540,
600,
641,
702,
703,
887,
888,
1113,
1114,
1120,
1121,
1232,
1233,
1310,
1312,
1347,
1385,
1412,
1414,
1535,
1609,
1610,
1762,
1763,
1770,
1771,
1842,
1843,
1871,
1958,
2037,
2051,
2053,
2069,
2070,
2195,
2196,
2230,
2279,
2329,
2330,
2624,
2625,
2639,
2641,
2788,
2789,
2801,
2802,
2902,
2903
],
"line_end_idx": [
2,
18,
19,
272,
273,
455,
456,
539,
540,
600,
641,
702,
703,
887,
888,
1113,
1114,
1120,
1121,
1232,
1233,
1310,
1312,
1347,
1385,
1412,
1414,
1535,
1609,
1610,
1762,
1763,
1770,
1771,
1842,
1843,
1871,
1958,
2037,
2051,
2053,
2069,
2070,
2195,
2196,
2230,
2279,
2329,
2330,
2624,
2625,
2639,
2641,
2788,
2789,
2801,
2802,
2902,
2903,
2993
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2993,
"ccnet_original_nlines": 59,
"rps_doc_curly_bracket": 0.0006682300008833408,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2842857241630554,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01714286021888256,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.31142857670783997,
"rps_doc_frac_unique_words": 0.5415676832199097,
"rps_doc_mean_word_length": 5.311163902282715,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.015514850616455,
"rps_doc_word_count": 421,
"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.006708410102874041,
"rps_doc_frac_chars_top_3gram": 0.013416820205748081,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -309.5474853515625,
"rps_doc_books_importance_length_correction": -309.5474853515625,
"rps_doc_openwebtext_importance": -227.1503143310547,
"rps_doc_openwebtext_importance_length_correction": -227.1503143310547,
"rps_doc_wikipedia_importance": -123.14605712890625,
"rps_doc_wikipedia_importance_length_correction": -123.14605712890625
},
"fasttext": {
"dclm": 0.8472000360488892,
"english": 0.793428361415863,
"fineweb_edu_approx": 1.6721428632736206,
"eai_general_math": 0.16158074140548706,
"eai_open_web_math": 0.07223021984100342,
"eai_web_code": 0.04517168179154396
}
}
|
{
"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": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,350,201,756,445,179,000 |
Saturday, January 26, 2013
basic concepts c++ language programming
C++ (pronounced "see plus plus") is a statically typed, free-form, multi-paradigm, compiled, general-purpose programming language. It is regarded as an intermediate-level language, as it comprises a combination of both high-level and low-level language features. It was developed by Bjarne Stroustrup starting in 1979 at Bell Labs as an enhancement to the C language and originally named C with Classes. It was renamed C++ in 1983.
C++ is one of the most popular programming languages and its application domains include systems software (such as Microsoft Windows), application software, device drivers, embedded software, high-performance server and client applications, and entertainment software such as video games. Several groups provide both free and proprietary C++ compiler software, including the GNU Project, Microsoft, Intel and Embarcadero Technologies. C++ has greatly influenced many other popular programming languages, most notably C# and Java.
C++ is also used for hardware design, where the design is initially described in C++, then analyzed, architecturally constrained, and scheduled to create a register-transfer level hardware description language via high-level synthesis.
The language began as enhancements to C, first adding classes, then virtual functions, operator overloading, multiple inheritance, templates, and exception handling among other features. After years of development, the C++ programming language standard was ratified in 1998 as ISO/IEC 14882:1998. That standard is still current, but is amended by the 2003 technical corrigendum, ISO/IEC 14882:2003. The next standard version (known informally as C++0x, in reference to the long-standing expectation that it would be released sometime before 2010) is in development; its final draft was approved on March 25, 2011 and the formal specification is expected to be published in the summer of 2011.
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
C++ Blog Topics
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
1. All about the array's in the C++
2. C++ Typecasting
3. C++ Typecasting Revisited
4. Preprocessor's in C++
5. Structure Padding in C++
6. Copy Constructor & Assignment Operator : The Basic Rule.
7. Auto Pointer's in C++ <auto_ptr>
8. Stack unwinding (C++ only)
9. Virtual Constructor (forcefully achieving the same effect)
10.All About inline function
11.Error handling - a complete guide
12.Pointer's a closer look
13.Why Program in C++
14.Operators - a quick review concept
15.Controls Statements basic
16.Branching Statements (if, else, switch)
17.Loops (for, while, do)
18.What is Function and its Basic
19.Object - What is it ?
20.Object Defined
21.Scope and Storage for a Class and its variables
22.const_cast
23.downcasting
24.namespace std
25.Header Files
26.Allocators
27.const vs #define
28.enum hack in c++
29.Initializer list in c++ (structure)
30.widening in C++
31.escape sequence
32.setprecision function
33.integer overflow
34.scientific notation
35.enum
36.precision of floating point numbers
37.signed and unsigned data type ranges
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
C++ Saample Codes
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
1. Searching a string from a File
2. Sample Makefile to build the c++ code
3. Using namespace in C++
4. Generates a random string of 32 hexadecimal digits
5. Liner Search
6. const_cast example
7. static member variable example
8. static member function example
9. Initializer list
10.using structure
11.typedef
12.modulus operator
13.escape sequence
14.setprecision example
15.scientific notation usage
16.integer overflow
17.ascending order sorting of an array
No comments:
Post a Comment
|
{
"url": "http://www.ccplusplus.com/2013/01/basic-concepts-c-language-programming.html",
"source_domain": "www.ccplusplus.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "94692",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Z6D53W4N67JNRE4LG6TLGMPQH5FV7SCP",
"WARC-Concurrent-To": "<urn:uuid:b1f770e6-31c2-4222-919f-5cabeeea3e26>",
"WARC-Date": "2021-10-22T16:33:49Z",
"WARC-IP-Address": "142.250.81.211",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JHTK6XMYRVKLJCXPKISATG5GO4F67JAS",
"WARC-Record-ID": "<urn:uuid:18098a92-25d5-44dc-ae0e-2c677efca477>",
"WARC-Target-URI": "http://www.ccplusplus.com/2013/01/basic-concepts-c-language-programming.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2e58fe77-6ccc-4561-9e52-89677b9face1>"
},
"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-180\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,
27,
28,
68,
69,
70,
503,
1033,
1270,
1963,
1964,
1965,
2027,
2066,
2128,
2129,
2165,
2184,
2213,
2239,
2267,
2327,
2363,
2393,
2455,
2484,
2521,
2548,
2570,
2608,
2637,
2680,
2706,
2740,
2765,
2783,
2834,
2848,
2863,
2880,
2896,
2910,
2930,
2950,
2989,
3008,
3009,
3028,
3053,
3073,
3096,
3104,
3143,
3183,
3184,
3246,
3283,
3345,
3379,
3420,
3446,
3500,
3516,
3538,
3572,
3606,
3626,
3645,
3656,
3676,
3695,
3719,
3748,
3768,
3807,
3808,
3821,
3822
],
"line_end_idx": [
27,
28,
68,
69,
70,
503,
1033,
1270,
1963,
1964,
1965,
2027,
2066,
2128,
2129,
2165,
2184,
2213,
2239,
2267,
2327,
2363,
2393,
2455,
2484,
2521,
2548,
2570,
2608,
2637,
2680,
2706,
2740,
2765,
2783,
2834,
2848,
2863,
2880,
2896,
2910,
2930,
2950,
2989,
3008,
3009,
3028,
3053,
3073,
3096,
3104,
3143,
3183,
3184,
3246,
3283,
3345,
3379,
3420,
3446,
3500,
3516,
3538,
3572,
3606,
3626,
3645,
3656,
3676,
3695,
3719,
3748,
3768,
3807,
3808,
3821,
3822,
3836
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3836,
"ccnet_original_nlines": 77,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.22357724606990814,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.046070460230112076,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.32655826210975647,
"rps_doc_frac_unique_words": 0.6086105704307556,
"rps_doc_mean_word_length": 5.9921722412109375,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0.002710029948502779,
"rps_doc_unigram_entropy": 5.318076133728027,
"rps_doc_word_count": 511,
"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.008817769587039948,
"rps_doc_frac_chars_top_3gram": 0.01763552986085415,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -255.73348999023438,
"rps_doc_books_importance_length_correction": -255.73348999023438,
"rps_doc_openwebtext_importance": -175.18161010742188,
"rps_doc_openwebtext_importance_length_correction": -175.18161010742188,
"rps_doc_wikipedia_importance": -129.45132446289062,
"rps_doc_wikipedia_importance_length_correction": -129.45132446289062
},
"fasttext": {
"dclm": 0.6329136490821838,
"english": 0.8739877343177795,
"fineweb_edu_approx": 2.915975570678711,
"eai_general_math": 0.126906156539917,
"eai_open_web_math": 0.11947823315858841,
"eai_web_code": 0.23937076330184937
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"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": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,071,205,060,164,221,000 |
Cours gratuits » Cours informatique » Cours programmation » Cours visual basic » Cours générale de la Programmation structurée en Visual Basic
Cours générale de la Programmation structurée en Visual Basic
Problème à signaler:
Télécharger
★★★★★★★★★★3.5 étoiles sur 5 basé sur 1 votes.
Votez ce document:
Cours générale de la Programmation structurée en Visual Basic
...
Les types de variables
On recommande fortement de déclarer les variables utilisées dans un programme.
• Integer : de -32 768 à 32 767
• Long : de -2 147 483 648 à 2 147 483 647
• Single : décimaux en simple précision : 39 chiffres significatifs
• Double : décimaux en double précision : plus de 300 chiffres significatifs !
• <
span style="font-size: 8pt;">String : de 0 à 65 535 octets
• Variant : de type nombre , texte ou objet selon l'affectation faite.
• Boolean :de type logique
• Syntaxe de déclaration :
Dim <NomVariable> As <Type>
Pour la lisibilité du code on peut les commenter après une apostrophe ( ‘ )
Exemples :
Dim Taux As Single ‘ Taux de la TVA
Dim Réponse As String ‘ Mot proposé par le joueur
Pour éviter tout problème il est préférable d’initialiser les variables déclarées.
Compteur = 0
Taux = 20,6
Le langage Basic utilise 7 types de données dont les plus utilisés sont le type String (chaîne de caractères), le type Integer (entier relatif) et le type Single (décimal).
Portée d'une variable
• Si une variable est déclarée au début de la procédure qui la manipule (Dim ou Private) elle n’est alors valide que pour cette procédure. L'existence et la valeur de la variable disparaissent avec l'instruction End Sub. Toute référence à cette variable en dehors de cette procédure provoquera une erreur de compilation.
• Si une variable est déclarée dans la section des déclarations d’un module elle est valide dans toutes les procédures du module.
• Une variable peut aussi être déclarée Public ou Global et sera alors valide pour toute l’application.
Exemple : Global MotCommun As String
Les tableaux et les boucles
Structure d’un tableau
On a souvent besoin de travailler sur un ensemble de données.
Un exemple : les températures moyennes des 12 mois de l'année.
On pourrait déclarer 12 variables identiques :
Dim Temp1, Temp2, Temp3, Temp4, … … …, Temp12 as Single
On dispose d'une structure de données appelée Tableau qui permet de conserver dans une seule "entité" plusieurs valeurs de même type.
Le nom du tableau est une variable qu'il est recommandé de préfixer par Tab. Le nombre de valeurs de types identiques est à déclarer entre parenthèses. Exemple de déclaration d’un tableau à une dimension :
Dim TabTemp(12) As Single
Numéro 1 2 3 4 5 …
Température 6 5,5 7 11,5 15 …
L'accés à la case numéro 3 se fait par TabTemp(3) qui vaut 7.
Exemple de déclaration d’un tableau à deux dimensions :
Dim TabMajMin(1 to 2,65 to 90) As String
Numéro 65 66 67 … 89 90
L'accés à la case qui contient le petit "c"se grâce à la syntaxe suivante :
TabMajMin(2,67) qui vaut "c".
Boucles en nombre défini
Cette boucle est utilisée lorqu’on connaît à l’avance le nombre de fois qu’elle sera parcourue.
Syntaxe :
For Compteur = Début To Fin [Step Incrément]
Instructions
[ ... Exit For]
[Instructions]
Next [Compteur]
Le test est effectué au début de la boucle.
La variable numérique Compteur est incrémentée à chaque fin de boucle du nombre indiqué par l’incrément. Si l’incrément n’est pas spécifié il est fixé à 1.
Si la valeur de Fin est inférieure à la valeur de Début l’incrément est négatif.
La valeur de Compteur peut être utilisée (par exemple pour numéroter le passage dans la boucle) mais ne doit pas être modifiée dans le corps de la boucle.
Exemple :
For i = 1 To 50
TabInitial(i) = 0 ‘ Initialisation de chaque case à 0
Next i
- Remplissage d'un tableau
Pour remplir un tableau on le balaye avec une boucle For … To … Next (car le nombre de cases est connu à l'avance).
Exemple 1 :
Dim TabTemp(12) As Single
Dim Compteur As Integer
For Compteur = 1 To 12
TabTemp(Compteur)=InputBox("Température N° " & Compteur)
Next Compteur
Exemple 2 :
Dim TabTirageLoto(6) As Integer
Dim Compteur As Integer
For Compteur = 1 To 6
TabTirageLoto (Compteur)=Rnd * 48 + 1
Next Compteur
Les boucles :
Si le programme doit exécuter un bloc d'instructions en nombre prédéfini on utilise la boucle For … To … Next.
Exemple :
For i = 1 To 49
TabLoto(i) = i ‘chaque case contient son numéro
Next i
Si le nombre de passages dans la boucle est inconnu au départ, mais dépend d'une condition dont la réalisation est imprévisible cette structure n'est pas adaptée.
Exemple 1 :
Demander le mot de passe tant que la réponse n'est pas le bon mot de passe.
Demander le mot de passe jusqu'à ce que la réponse soit le bon mot de passe.
Exemple 2 :
Demander la saisie d'une note tant que la réponse n'est pas un nombre entre 0 et 20.
Demander la saisie d'une note jusqu'à ce que la réponse soit un nombre entre 0 et 20.
Boucle tant que
Syntaxe première version :
Do While Condition
Instructions
[... Exit Do]
[Instructions]
Loop
La condition est ici testée au début c'est à dire à l’entrée de la boucle.
Avec While (tant que) la boucle est répétée tant que la condition est vraie.
Si la condition n’est pas vraie au départ les instructions de la boucle ne sont pas exécutées.
Exemple :
Do While MotProposé <> MotDePasse
MotProposé = InputBox("Donnez votre mot de passe")
Loop
Cela présuppose MotProposé initialisé par une valeur autre que MotDePasse (par exemple la valeur par défaut "").
Syntaxe deuxième version :
Do
Instructions
[... Exit Do]
[Instructions]
Loop While Condition
La condition est alors testée à la fin de la boucle.
Avec While (tant que) la boucle est répétée tant que la condition est vraie. Les instructions de la boucle sont donc exécutées au moins une fois. Exemple :
Do
MotProposé = InputBox("Donnez votre mot de passe")
Loop While MotProposé <> MotDePasse
Cet exemple ne présuppose aucune initialisation de MotProposé.
Les boucles Tant que , jusqu’à
Syntaxe première version :
Do while Condition
Instructions
[... Exit Do]
[Instructions]
Loop
La condition est ici testée au début c'est à dire à l’entrée de la boucle.
Avec while (tant que) la boucle est répétée tant que la condition n’est pas vérifiée.
Si la condition est vraie dès le départ les instructions de la boucle ne sont pas exécutées.
Exemple :
Do while MotProposé <> MotDePasse
MotProposé = InputBox("Donnez votre mot de passe")
Loop
Cela présuppose MotProposé initialisé par une valeur autre que MotDePasse (par exemple la valeur par défaut : "").
Syntaxe deuxième version :
Do
Instructions
[... Exit Do]
[Instructions]
Loop Until Condition
La condition est alors testée à la fin de la boucle.
Les instructions de la boucle sont donc exécutées au moins une fois.
Avec Until (jusqu'à) la boucle est répétée jusqu'à ce que la condition soit vraie.
Exemple :
Do
MotProposé = InputBox("Donnez votre mot de passe")
Loop Until MotProposé = MotDePasse
Cet exemple ne présuppose aucune initialisation de MotProposé.
Boucle For … Each … Next
C’est une extension de la boucle For ... To … Next. Elle est utilisée pour parcourir les collections(ensembles).
Syntaxe :
For Each Elément In Ensemble
Instructions
[ ... Exit For]
[Instructions]
Next [Elément]
Ensemble est le plus souvent un tableau.
Exemple :
Dim TabHasard(100) As Integer
Dim Cellule As Integer
Dim Réponse As String
Randomize
For Each Cellule In TabHasard
Cellule = Rnd * 100 + 1
Next
For Each Cellule In TabHasard
Réponse = Réponse & Cellule & " "
Next
MsgBox (Réponse)
Traitement des chaînes de caractères
Nécessité de ces traitements
Les données manipulées par un programme sont essentiellement de type numérique ou chaîne de caractères.
Si les types numériques sont très utilisés par les programmes scientifiques, le type chaîne est incontournable pour des étudiants en Lettres et Sciences Humaines.
Une variable chaîne de caractères se déclare de type String.
Exemple 1 :
Dim MotProposé As String
La variable contient alors une chaîne de longueur variable selon l'affectation qui suivra.
Exemple 2 :
Dim Lettre As String * 1
La variable contient alors une chaîne de longueur 1 c'est à dire un seul caractère.
Exemple 3 :
Dim Adresse As String * 30
La variable contient alors une chaîne de longueur 30. Si l'on n'affecte que 18 caractères dans une telle chaîne, le reste est rempli d'espaces. Si l'on affecte plus de 30 caractères le surplus est tronqué.
Comparaison des chaînes de caractères
Longueur d'une chaîne :
La longueur d'une chaîne est donnée par la fonction Len.
Exemple :
Phrase = "Visual Basic”
La fonction Len(Phrase) retournera la valeur 12.
Il est évident que si deux chaînes de caractères n'ont pas la même longueur elles sont différentes. Par contre deux chaînes de même longueur ne sont pas forcément identiques.
Comparaison binaire :
On compare deux chaînes par la fonction StrComp.
Elle renvoie la valeur numérique 0 si les deux chaînes sont rigoureusement identiques et la valeur numérique 1 si les chaînes diffèrent même par un seul octet.
Exemple :
Phrase1 = "Visual Basic."
Phrase2 = "Visual basic."
Phrase3 = " Visual Basic.”
La fonction StrComp(Phrase1,Phrase2) retournera la valeur …
La fonction StrComp(Phrase1,Phrase3) retournera la valeur …
Recherche d'une chaîne de caractères
• La fonction InStr permet de rechercher si une chaîne de caractères existe à l'intérieur d'une autre chaîne de caractères. Si c’est le cas, elle retourne la position de la première occurrence de la chaîne recherchée.
Syntaxe :
InStr(Chaîne1, Chaîne2)
Chaîne1 est la chaîne de caractères à traiter (sur laquelle porte la recherche).
Chaîne2 est la chaîne de caractères recherchée dans Chaîne1. Exemple :
Chaîne1 = "Visual Basic et ses fonctions" Chaîne2 = "Basic"
Chaîne3 = "Basics"
La fonction InStr(Chaîne1,Chaîne2) retournera la valeur 8 La fonction InStr(Chaîne1,Chaîne3) retournera la valeur 0.
• La fonction Ucase met tout le texte en majuscules et permet de rechercher indépendamment une lettre minuscule ou majuscule.
• La fonction Lcase met tout le texte en minuscules et permet…
Extraction d'une chaîne de caractères
• La fonction Right donne la partie droite d'une chaîne de caractères. Le nombre de caractères de cette partie doit être précisé.
Exemple :
Chaîne = "Visual Basic et ses fonctions"
La fonction Right(Chaîne,5) retournera la valeur "tions"
• La fonction Left donne la partie gauche d'une chaîne de caractères. Le nombre de caractères de cette partie doit être précisé.
Exemple :
Chaîne = "Visual Basic et ses fonctions"
La fonction Left(Chaîne,5) retournera la valeur "Visua"
• La fonction Mid extrait une partie d'une chaîne de caractères.
Le nombre de caractères de cette partie doit être précisé ainsi que la position du premier caractère extrait.
Syntaxe :
Mid(Texte, Position, Nombre) Texte est la chaîne de caractère à traiter.
Position est la position du caractère à partir duquel il faut extraire une sous-chaîne de caractères.
Nombre est le nombre de caractères à extraire. Exemple :
Chaîne = "Visual Basic et ses fonctions"
La fonction Mid(Chaîne,8,5) retournera la valeur "Basic"
La fonction Mid(Chaîne,21) retournera la valeur "fonctions"
Applications
La plupart des problèmes sur les chaînes de caractères se traitent à l'aide des fonctions ci-dessus. Leur maniement est assez délicat et les résultats quelquefois difficiles à prévoir. Seule la pratique de leur programmation vous permettra d'en vérifier l'efficacité.
Exemple1 :
Ce programme recherche un mot dans une chaîne de caractères :
Dim Chaine, Mot As String
Dim Position As Integer
Chaine = "Visual Basic et ses fonctions." Mot = InputBox("Taper le mot à rechercher") Position = InStr(Chaine, Mot)
If Position = 0 Then
MsgBox "Le mot '" & Mot & "'" & " n'a pas été introuvé !")
Else
MsgBox("Le mot '" & Mot & "'"&" a été trouvé à la position "_ & Position)
End If
Exemple2 :
Ce programme compte le nombre d'espaces dans une phrase.
Dim Phrase, Caractère As String
Dim Compteur, Longueur, i As Integer Phrase = InputBox("Tapez votre phrase") Longueur = Len (Phrase)
For i = 1 To Longueur
Caractère = Mid(Phrase, i, 1)
If Caractère = " " Then Compteur = Compteur + 1
Next i
MsgBox("Cette phrase contient " & Compteur & " espaces.")
Fonctions de date et d'heure
• La fonction Date donne la date système.
Date retourne la date du jour courant.
• La fonction Time donne l'heure système.
Time retourne l’heure courante.
• La fonction Day() donne le numéro du jour dans le mois.
Day(Date) retourne le numéro du jour du mois courant (compris entre 1 et 31)a valeur 8
• La fonction Month() donne le numéro du mois dans l'année.
Month(Date) retournera le numéro du mois courant( compris entre 1 et 12). Ex : 11.
• La fonction Year() donne le numéro de l'année.
Year(Date) retournera le numéro de l’année courante. Ex : 2000.
• La fonction WeekDay() donne le numéro du jour dans la semaine sachant que le dimanche porte le numéro 1.
WeekDay(Date) retournera le numéro d’aujourd'hui (compris entre 1 et 7) .
• La fonction FormatDateTime(date [, constante vb]) donne Retourne une expression formatée sous forme de date ou d’heure. Les crochets s.
Où constante vb peut prendre les valeurs suivantes : [, vGeneralDate ou vbLongDate, vbShortDate, vbShortTime, …]
Autres fonctions
1) Get Déclare le nom, les arguments et le code formant le corps d'une procédure Property, qui lit la valeur d'une propriété.
Syntaxe:
[Public | Private | Friend] [Static] Property Get NomPropriété [(arglist)] [As type]
[instructions]
[Exit Property]
[instructions]
End Property
2) Let : Déclare le nom, les arguments et le code formant le corps d'une procédure Property Let, qui attribue une valeur à une propriété.
Syntaxe
[Public | Private | Friend] [Static] Property Let name ([arglist,] value)
[instructions]
[Exit Property]
[instructions]
End Property
Exemple
Private dblBalance As Double
Public Property Get Balance() As Double
Balance = dblBalance
End Property
Property Let Balance(dblNewBalance As Double)
dblBalance = dblNewBalance
End Property
4) CallByName : cette fonction permet d’obtenir ou de définir une propriété ou d’invoquer une méthode pendant l’exécution.
Syntaxe : CallByName(Objet, NomProcédure,CallType)
Où :
- Objet(objet variant) est le nom de l’objet sur lequel on souhaite exécuter la fonction CallByName.
- NomProcédure (variant) désigne le nom de la propriété ou de la méthode de l’objet .
- CallType est une constante qui représente le type de procédure appelée(vbGet, VbLet,vbMethod).
Exemple :
- Obtenir le contenu de la propriété NomGroupe de l’objet objGroupe :
Resulat = CallByName(objgroupe, “NomGroupe”, VbGet)
- Définir la propriété NomGroupe de l’objet objGroupe :
CallByName(objgroupe, ObjField.Name, VbLet)
- Exécuter la méthode "InitialisationObj" de l’objet objGroupe :
CallByName(objgroupe, “InitialisationObj”, Vbmethod)
Procédures et fonctions
Visual Basic permet de définir et d’utiliser trois types de sous-routines :
Les procédures proprement dites :
Une procédure est un ensemble d'instructions qui traite une tâche donnée.
Elle débute par le mot réservé Sub et se termine par End Sub.
Exemple de procédure événementielle :
Private Sub cmdQuitter_Click
End
End Sub
Si un bloc d'instructions doit être utilisé à plusieurs endroits (par exemple dans plusieurs procédures événementielles) il est préférable d'en faire une procédure publique qui sera pourra être appelée dans n’importe quel autre sous-programme du module.
Exemple de procédure publique :
Public Sub SaisieNote()
Do
Note = InputBox("Tapez une note")
Loop Until Note>=0 And Note<=20
End Sub
Pour utiliser cette procédure il suffira de l'appeler par son nom : SaisieNote
Les fonctions :
Elles sont comparables aux procédures quant à leur mode d’écriture. La différence ce qu’une fonction débute par le mot réservé Function et se termine par End Function. De plus, elle a un type et peut retourner une valeur contenue dans le nom même de la fonction. Cette valeur pourra être utilisée par la suite dans une autre expression.
Exemple de fonction :
Public Function Carré(x) As Single
Carré = x * x
End Function
Par exemple Carré(7) retournera la valeur 49.
Les procédures Property :
Elles servent à définir les propriétés d’un objet par exemple dans un module, dans une classe ou dans une feuille. Elles sont délimitée par les mots clés Property et End Property.
Exemple de propriété :
Public Property Let Nom(ByVal parametre As String)
mvarNom = parametre
End Property
Remarques :
ByVal Indique que l'argument est passé par valeur.
ByRef(valeur par défaut). Indique que l'argument est passé par référence
INTERFACE DE DEVELOPPEMENT DE VISUAL BASIC
L'éditeur de code de Visual Basic
Composé de 3 parties :
1. La partie supérieure est la zone des déclarations (séparée du reste par un trait horizontal). On y place les options et les déclarations de variables publiques.
Exemple :
Option Explicit
Public NomJoueur As String Private PrenomJour as String
1. La partie suivante est la zone des procédures publiques (chaque procédure est séparée des autres par un trait horizontal). On y place les procédures publiques utilisables par toutes les autresprocédures du module.
Exemple :
Public Function Carré(x) As Single Carré = x * x
End Function
1. Enfin la partie suivante est la zone des procédures événementielles (chaque procédure est séparée des autres par un trait horizontal).
Exemple :
Private Sub cmdCalculer_Click() End Sub
Algorithmique
Quand on a un problème à résoudre par programmation on doit tout d'abord trouver une stratégie pour y parvenir.
Celle-ci doit bien sûr être "programmable" dans un langage de programmation. Il faut donc bien connaître les caractéristiques et les possibilités de ce langage.
Le plus souvent on écrit un algorithme en français (c'est la stratégie adoptée) que l'on pourra ensuite coder dans le langage de programmation choisi.
Exemple1 :
Déterminer la carte la plus forte sur un ensemble de 6 cartes posées à l'endroit sur la table.
La résolution de ce problème par un être humain ou par un programme informatique est complètement différente.
Algorithme en français
Prendre la 1ere carte. Noter sa hauteur dans une variable.
De la 2eme à la dernière :
Prendre une carte.
Si sa hauteur est supérieure à celle notée dans la variable elle devient la plus forte
Recommencer
Exemple2 :
Trier en ordre décroissant les nombre contenus dans un tableau de 100 entiers.
Différentes stratégies sont à notre disposition. La plus classique est celle du tri à bulles.
Il s'agit de comparer chaque nombre à son suivant et de mettre en premier le plus grand des deux. On recommence ainsi jusqu'à ce que plus aucune permutation ne soit effectuée. Alors le tableau est trié.
Algorithme en français
Début
Faire
Permuté 0
Pour i = 1 à 99
Si Case i < Case i+1 alors
Auxiliaire Case i
Case i Case i+1
Case i+1 Auxiliaire
Permuté 1
Fin de Si
Nouveau i
Recommencer tant que Permuté = 1
Fin
EXEMPLE D'UTILISATION DES METHODES EXECUTE, REQUERY ET CLEAR
L'exemple ci-dessous décrit la méthode Execute exécutée à partir d'un objet Command et d'un objet Connection. Il utilise également la méthode Requery pour récupérer les données en cours dans un jeu d'enregistrements, puis la méthode Clear pour supprimer le contenu de la collection Errors. Les procédures ExecuteCommand et PrintOutput sont nécessaires à l'exécution de cette procédure.
Public Sub ExecuteX()
Dim strSQLChange As String
Dim strSQLRestore As String
Dim strCnn As String
Dim cnn1 As ADODB.Connection
Dim cmdChange As ADODB.Command
Dim rstTitles As ADODB.Recordset
Dim errLoop As ADODB.Error
' Définit deux instructions SQL à exécuter en tant que texte de commande.
strSQLChange = "UPDATE Titles SET Type = " & _ "'self_help' WHERE Type = 'psychology'" strSQLRestore = "UPDATE Titles SET Type = " & _
"'psychology' WHERE Type = 'self_help'"
' Ouvre une connexion.
strCnn = "Provider=sqloledb;" & _
"Data Source=srv;Initial Catalog=pubs;User Id=sa;Password=; "
Set cnn1 = New ADODB.Connection
cnn1.Open strCnn
' Crée un objet de commande.
Set cmdChange = New ADODB.Command
Set cmdChange.ActiveConnection = cnn1
cmdChange.CommandText = strSQLChange
' Ouvre la table des titres.
Set rstTitles = New ADODB.Recordset rstTitles.Open "titles", cnn1, , , adCmdTable
' Imprime l'état des données initiales. Debug.Print _
"Data in Titles table before executing the query" PrintOutput rstTitles
' Supprime les autres erreurs de la collection Errors. cnn1.Errors.Clear
' Appelle la sous-routine ExecuteCommand pour
' exécuter la commande cmdChange.
ExecuteCommand cmdChange, rstTitles
' Imprime l'état des nouvelles données. Debug.Print _
"Data in Titles table after executing the query" PrintOutput rstTitles
' Utilise la méthode d'exécution de l'objet Connection pour
' exécuter des instructions SQL de restauration des données.
' Intercepte les erreurs, en vérifiant la collection Errors si nécessaire. On Error GoTo Err_Execute
cnn1.Execute strSQLRestore, , adExecuteNoRecords On Error GoTo 0
Récupère les données en cours en interrogeant de nouveau
' le jeu d'enregistrements.
rstTitles.Requery
' Imprime l'état des données restaurées. Debug.Print "Data after executing the query " & _
"to restore the original information" PrintOutput rstTitles rstTitles.Close
cnn1.Close
Exit Sub
Err_Execute:
' Avertit l'utilisateur des éventuelles erreurs pouvant résulter de
' l'exécution de la requête.
If Errors.Count > 0 Then
For Each errLoop In Errors
MsgBox "Error number: " & errLoop.Number & vbCr & _ errLoop.Description
Next errLoop
End If
Resume Next
End Sub
Public Sub ExecuteCommand(cmdTemp As ADODB.Command, _ rstTemp As ADODB.Recordset)
Dim errLoop As Error
' Exécute l'objet Command spécifié. Intercepte les
' erreurs, en vérifiant la collection Errors si nécessaire. On Error GoTo Err_Execute
cmdTemp.Execute On Error GoTo 0
' Récupère les données en cours en interrogeant de nouveau
' le jeu d'enregistrements.
rstTemp.Requery
Exit Sub
Err_Execute:
' Avertit l'utilisateur des éventuelles erreurs pouvant résulter de
' l'exécution de la requête.
If Errors.Count > 0 Then
For Each errLoop In Errors
MsgBox "Error number: " & errLoop.Number & vbCr & _ errLoop.Description
Next errLoop
End If
Resume Next
End Sub
Public Sub PrintOutput(rstTemp As ADODB.Recordset)
' Répertorie le Recordset. Do While Not rstTemp.EOF
Debug.Print " " & rstTemp!Title & _ ", " & rstTemp!Type
rstTemp.MoveNext Loop
End Sub
VERSION VBSCRIPT
Voici le même exemple, écrit en VBScript pour pouvoir être utilisé dans une page ASP. Pour visualiser cet exemple fonctionnel, vous devez créer un DSN appelé AdvWorks à l'aide de la source de données AdvWorks.mdb installée avec IIS et située dans C:\InetPub\ASPSamp\AdvWorks. Il s'agit d'un fichier de base de données Microsoft
Access. Utilisez Find pour retrouver le fichier Adovbs.inc et placez-le dans le répertoire que vous souhaitez utiliser. Coupez et collez le code ci-dessous dans le Bloc-notes ou un autre éditeur de texte, puis sauvegardez-le sous le nom Execute.asp. Vous pouvez visualiser le résultat sous n'importe quel navigateur client.
<!-- #Include file="ADOVBS.INC" -->
<HTML><HEAD>
<TITLE>ADO Execute Method</TITLE></HEAD>
<BODY>
<FONT FACE="MS SANS SERIF" SIZE=2>
<Center><H3>ADO Execute Method</H3><H4>Recordset Retrieved Using Connection Object</H4>
<TABLE WIDTH=600 BORDER=0>
<TD VALIGN=TOP ALIGN=LEFT COLSPAN=3><FONT SIZE=2>
<!--- Recordsets retrieved using Execute method of Connection and Command Objects-->
<%
Set OBJdbConnection = Server.CreateObject("ADODB.Connection") OBJdbConnection.Open "AdvWorks" SQLQuery = "SELECT * FROM Customers"
'Premier Recordset RSCustomerList
Set RSCustomerList = OBJdbConnection.Execute(SQLQuery)
Set OBJdbCommand = Server.CreateObject("ADODB.Command")
OBJdbCommand.ActiveConnection = OBJdbConnection
SQLQuery2 = "SELECT * From Products"
OBJdbCommand.CommandText = SQLQuery2
Set RsProductList = OBJdbCommand.Execute
%>
<TABLE COLSPAN=8 CELLPADDING=5 BORDER=0>
<!-- BEGIN column header row for Customer Table--> <TR><TD ALIGN=CENTER BGCOLOR="#008080">
<FONT STYLE="ARIAL NARROW" COLOR="#ffffff" SIZE=1>Company Name</FONT> </TD>
<TD ALIGN=CENTER BGCOLOR="#008080">
<FONT STYLE="ARIAL NARROW" COLOR="#ffffff" SIZE=1>Contact Name</FONT> </TD>
<TD ALIGN=CENTER WIDTH=150 BGCOLOR="#008080">
<FONT STYLE="ARIAL NARROW" COLOR="#ffffff" SIZE=1>E-mail address</FONT> </TD>
<TD ALIGN=CENTER BGCOLOR="#008080">
<FONT STYLE="ARIAL NARROW" COLOR="#ffffff" SIZE=1>City</FONT> </TD>
<TD ALIGN=CENTER BGCOLOR="#008080">
<FONT STYLE="ARIAL NARROW" COLOR="#ffffff" SIZE=1>State/Province</FONT> </TD></TR>
<!--Display ADO Data from Customer Table--> <% Do While Not RScustomerList.EOF %>
<TR>
<TD BGCOLOR="f7efde" ALIGN=CENTER>
<FONT STYLE="ARIAL NARROW" SIZE=1>
<%= RSCustomerList("CompanyName")%>
</FONT></TD>
<TD BGCOLOR="f7efde" ALIGN=CENTER>
<FONT STYLE="ARIAL NARROW" SIZE=1>
<%= RScustomerList("ContactLastName") & ", " %> <%= RScustomerList("ContactFirstName") %> </FONT></TD>
<TD BGCOLOR="f7efde" ALIGN=CENTER>
<FONT STYLE="ARIAL NARROW" SIZE=1>
<%= RScustomerList("ContactLastName")%> </FONT></TD>
<TD BGCOLOR="f7efde" ALIGN=CENTER>
<FONT STYLE="ARIAL NARROW" SIZE=1>
<%= RScustomerList("City")%>
</FONT></TD>
<TD BGCOLOR="f7efde" ALIGN=CENTER>
<FONT STYLE="ARIAL NARROW" SIZE=1>
<%= RScustomerList("StateOrProvince")%>
</FONT></TD>
</TR>
<!-Next Row = Record Loop and add to html table--> <%
RScustomerList.MoveNext
Loop
RScustomerList.Close
%>
227
|
{
"url": "https://www.cours-gratuit.com/cours-visual-basic/cours-programmation-structuree-en-visual-basic-pdf",
"source_domain": "www.cours-gratuit.com",
"snapshot_id": "crawl=CC-MAIN-2018-39",
"warc_metadata": {
"Content-Length": "146813",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5C2PIACNWJNX6TOC4WXJOWCK3OFXJ6ZL",
"WARC-Concurrent-To": "<urn:uuid:b35be5da-6967-4b8d-a0b4-cd65ce2d2ba6>",
"WARC-Date": "2018-09-24T09:57:27Z",
"WARC-IP-Address": "23.235.211.68",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:SAS3ULFGA7MZ57GSFHHQ3RYU5752LDRS",
"WARC-Record-ID": "<urn:uuid:9c95117b-0b4c-480b-93f9-776ca0a80eca>",
"WARC-Target-URI": "https://www.cours-gratuit.com/cours-visual-basic/cours-programmation-structuree-en-visual-basic-pdf",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bcde4b9f-4ee4-46d7-98f9-0612bdf9edcd>"
},
"warc_info": "isPartOf: CC-MAIN-2018-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-51-154-251.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,
145,
146,
208,
209,
230,
231,
243,
244,
245,
246,
292,
311,
312,
374,
375,
379,
380,
403,
404,
483,
484,
518,
563,
633,
714,
720,
779,
852,
881,
910,
911,
943,
944,
1024,
1025,
1040,
1041,
1081,
1082,
1136,
1137,
1224,
1225,
1242,
1243,
1259,
1260,
1437,
1438,
1464,
1465,
1790,
1924,
2032,
2033,
2074,
2075,
2107,
2108,
2149,
2150,
2216,
2217,
2284,
2285,
2336,
2337,
2397,
2398,
2536,
2537,
2747,
2748,
2778,
2779,
2891,
2892,
2994,
2995,
3061,
3062,
3122,
3123,
3168,
3169,
3277,
3278,
3358,
3359,
3393,
3394,
3437,
3438,
3538,
3539,
3553,
3554,
3603,
3604,
3621,
3622,
3642,
3643,
3663,
3664,
3684,
3685,
3733,
3734,
3894,
3895,
3980,
3981,
4140,
4141,
4155,
4156,
4176,
4177,
4235,
4236,
4247,
4248,
4279,
4280,
4400,
4401,
4417,
4418,
4448,
4449,
4477,
4478,
4505,
4506,
4567,
4568,
4586,
4587,
4603,
4604,
4640,
4641,
4669,
4670,
4696,
4697,
4739,
4740,
4758,
4759,
4777,
4778,
4893,
4894,
4908,
4909,
4929,
4930,
4982,
4983,
4994,
4995,
5162,
5163,
5179,
5180,
5260,
5261,
5342,
5343,
5359,
5360,
5449,
5450,
5540,
5541,
5561,
5562,
5593,
5594,
5617,
5618,
5636,
5637,
5656,
5657,
5676,
5677,
5686,
5687,
5766,
5767,
5848,
5849,
5948,
5949,
5963,
5964,
6002,
6003,
6058,
6059,
6068,
6069,
6186,
6187,
6218,
6219,
6226,
6227,
6244,
6245,
6263,
6264,
6283,
6284,
6309,
6310,
6367,
6368,
6528,
6529,
6536,
6537,
6592,
6593,
6633,
6634,
6701,
6702,
6737,
6738,
6769,
6770,
6793,
6794,
6811,
6812,
6830,
6831,
6850,
6851,
6860,
6861,
6940,
6941,
7031,
7032,
7129,
7130,
7144,
7145,
7183,
7184,
7239,
7240,
7249,
7250,
7369,
7370,
7401,
7402,
7409,
7410,
7427,
7428,
7446,
7447,
7466,
7467,
7492,
7493,
7550,
7551,
7624,
7625,
7712,
7713,
7727,
7728,
7735,
7736,
7791,
7792,
7831,
7832,
7899,
7900,
7929,
7930,
8047,
8048,
8062,
8063,
8096,
8097,
8114,
8115,
8135,
8136,
8155,
8156,
8175,
8176,
8221,
8222,
8236,
8237,
8271,
8272,
8299,
8300,
8326,
8327,
8341,
8342,
8376,
8377,
8405,
8406,
8415,
8416,
8450,
8451,
8499,
8500,
8509,
8510,
8531,
8532,
8573,
8574,
8607,
8608,
8716,
8717,
8884,
8885,
8950,
8951,
8967,
8968,
8997,
8998,
9093,
9094,
9110,
9111,
9140,
9141,
9229,
9230,
9246,
9247,
9278,
9279,
9489,
9490,
9532,
9533,
9561,
9562,
9623,
9624,
9638,
9639,
9667,
9668,
9721,
9722,
9901,
9902,
9928,
9929,
9982,
9983,
10147,
10148,
10162,
10163,
10193,
10194,
10224,
10225,
10256,
10257,
10321,
10322,
10386,
10387,
10428,
10429,
10651,
10652,
10666,
10667,
10695,
10696,
10781,
10782,
10857,
10858,
10922,
10923,
10946,
10947,
11068,
11069,
11199,
11266,
11267,
11309,
11310,
11444,
11445,
11459,
11460,
11505,
11506,
11567,
11568,
11701,
11702,
11716,
11717,
11762,
11763,
11823,
11824,
11893,
11894,
12008,
12009,
12023,
12024,
12101,
12102,
12208,
12209,
12270,
12271,
12316,
12317,
12378,
12379,
12443,
12444,
12461,
12462,
12734,
12735,
12750,
12751,
12817,
12818,
12848,
12849,
12877,
12878,
12998,
12999,
13024,
13025,
13088,
13089,
13098,
13099,
13177,
13178,
13189,
13190,
13205,
13206,
13267,
13268,
13304,
13305,
13410,
13411,
13437,
13438,
13472,
13473,
13525,
13526,
13537,
13538,
13600,
13601,
13634,
13635,
13681,
13682,
13725,
13726,
13772,
13773,
13809,
13810,
13872,
13873,
13964,
13965,
14029,
14030,
14117,
14118,
14171,
14172,
14240,
14241,
14352,
14353,
14431,
14432,
14574,
14575,
14692,
14693,
14714,
14715,
14856,
14857,
14870,
14871,
14960,
14961,
14980,
14981,
15001,
15002,
15021,
15022,
15039,
15040,
15193,
15194,
15206,
15207,
15285,
15286,
15305,
15306,
15326,
15327,
15346,
15347,
15364,
15365,
15377,
15378,
15411,
15412,
15456,
15457,
15482,
15483,
15500,
15501,
15551,
15552,
15583,
15584,
15601,
15602,
15740,
15741,
15796,
15797,
15806,
15807,
15925,
15926,
16029,
16030,
16144,
16145,
16159,
16160,
16247,
16248,
16304,
16305,
16378,
16379,
16427,
16428,
16510,
16511,
16568,
16569,
16597,
16598,
16678,
16679,
16717,
16718,
16796,
16797,
16863,
16864,
16906,
16907,
16940,
16941,
16949,
16950,
16962,
16963,
17221,
17222,
17258,
17259,
17287,
17288,
17295,
17296,
17334,
17335,
17371,
17372,
17384,
17385,
17468,
17469,
17489,
17490,
17831,
17832,
17858,
17859,
17898,
17899,
17917,
17918,
17935,
17936,
17986,
17987,
18017,
18018,
18202,
18203,
18230,
18231,
18286,
18287,
18311,
18312,
18329,
18330,
18346,
18347,
18405,
18406,
18493,
18494,
18514,
18515,
18562,
18563,
18601,
18602,
18629,
18630,
18798,
18799,
18813,
18814,
18834,
18835,
18895,
18896,
19117,
19118,
19132,
19133,
19186,
19187,
19204,
19205,
19347,
19348,
19362,
19363,
19407,
19408,
19426,
19427,
19543,
19544,
19709,
19710,
19865,
19866,
19881,
19882,
19981,
19982,
20096,
20097,
20124,
20125,
20188,
20189,
20220,
20221,
20244,
20245,
20336,
20337,
20353,
20354,
20369,
20370,
20453,
20454,
20552,
20553,
20760,
20761,
20788,
20789,
20799,
20800,
20810,
20811,
20827,
20828,
20848,
20849,
20880,
20881,
20905,
20906,
20928,
20929,
20955,
20956,
20972,
20973,
20987,
20988,
21002,
21003,
21040,
21041,
21049,
21050,
21115,
21116,
21506,
21507,
21533,
21534,
21565,
21566,
21598,
21599,
21624,
21625,
21658,
21659,
21694,
21695,
21732,
21733,
21764,
21765,
21857,
21858,
21997,
21998,
22042,
22043,
22070,
22071,
22109,
22110,
22176,
22177,
22213,
22214,
22235,
22236,
22269,
22270,
22308,
22309,
22351,
22352,
22393,
22394,
22427,
22428,
22514,
22515,
22587,
22588,
22664,
22665,
22756,
22757,
22821,
22822,
22874,
22875,
22915,
22916,
22988,
22989,
23064,
23065,
23143,
23144,
23223,
23224,
23343,
23344,
23413,
23414,
23491,
23492,
23538,
23539,
23561,
23562,
23671,
23672,
23752,
23753,
23768,
23769,
23782,
23783,
23800,
23801,
23887,
23888,
23935,
23936,
23965,
23966,
23997,
23998,
24074,
24075,
24092,
24093,
24104,
24105,
24121,
24122,
24134,
24135,
24221,
24222,
24247,
24248,
24317,
24318,
24422,
24423,
24459,
24460,
24537,
24538,
24584,
24585,
24605,
24606,
24620,
24621,
24638,
24639,
24725,
24726,
24773,
24774,
24803,
24804,
24835,
24836,
24912,
24913,
24930,
24931,
24942,
24943,
24959,
24960,
24972,
24973,
25028,
25029,
25099,
25100,
25160,
25161,
25187,
25188,
25200,
25201,
25222,
25223,
25555,
25556,
25884,
25885,
25925,
25926,
25943,
25944,
25989,
25990,
26001,
26002,
26041,
26042,
26134,
26135,
26166,
26167,
26221,
26222,
26311,
26312,
26319,
26320,
26455,
26456,
26494,
26495,
26554,
26555,
26615,
26616,
26668,
26669,
26710,
26711,
26752,
26753,
26798,
26799,
26806,
26807,
26852,
26853,
26948,
26949,
27029,
27030,
27070,
27071,
27151,
27152,
27202,
27203,
27285,
27286,
27326,
27327,
27399,
27400,
27440,
27441,
27528,
27529,
27615,
27616,
27625,
27626,
27665,
27666,
27705,
27706,
27746,
27747,
27764,
27765,
27804,
27805,
27844,
27845,
27952,
27953,
27992,
27993,
28032,
28033,
28090,
28091,
28130,
28131,
28170,
28171,
28204,
28205,
28222,
28223,
28262,
28263,
28302,
28303,
28347,
28348,
28365,
28366,
28376,
28377,
28435,
28436,
28464,
28465,
28474,
28475,
28500,
28501,
28508,
28509,
28510
],
"line_end_idx": [
2,
145,
146,
208,
209,
230,
231,
243,
244,
245,
246,
292,
311,
312,
374,
375,
379,
380,
403,
404,
483,
484,
518,
563,
633,
714,
720,
779,
852,
881,
910,
911,
943,
944,
1024,
1025,
1040,
1041,
1081,
1082,
1136,
1137,
1224,
1225,
1242,
1243,
1259,
1260,
1437,
1438,
1464,
1465,
1790,
1924,
2032,
2033,
2074,
2075,
2107,
2108,
2149,
2150,
2216,
2217,
2284,
2285,
2336,
2337,
2397,
2398,
2536,
2537,
2747,
2748,
2778,
2779,
2891,
2892,
2994,
2995,
3061,
3062,
3122,
3123,
3168,
3169,
3277,
3278,
3358,
3359,
3393,
3394,
3437,
3438,
3538,
3539,
3553,
3554,
3603,
3604,
3621,
3622,
3642,
3643,
3663,
3664,
3684,
3685,
3733,
3734,
3894,
3895,
3980,
3981,
4140,
4141,
4155,
4156,
4176,
4177,
4235,
4236,
4247,
4248,
4279,
4280,
4400,
4401,
4417,
4418,
4448,
4449,
4477,
4478,
4505,
4506,
4567,
4568,
4586,
4587,
4603,
4604,
4640,
4641,
4669,
4670,
4696,
4697,
4739,
4740,
4758,
4759,
4777,
4778,
4893,
4894,
4908,
4909,
4929,
4930,
4982,
4983,
4994,
4995,
5162,
5163,
5179,
5180,
5260,
5261,
5342,
5343,
5359,
5360,
5449,
5450,
5540,
5541,
5561,
5562,
5593,
5594,
5617,
5618,
5636,
5637,
5656,
5657,
5676,
5677,
5686,
5687,
5766,
5767,
5848,
5849,
5948,
5949,
5963,
5964,
6002,
6003,
6058,
6059,
6068,
6069,
6186,
6187,
6218,
6219,
6226,
6227,
6244,
6245,
6263,
6264,
6283,
6284,
6309,
6310,
6367,
6368,
6528,
6529,
6536,
6537,
6592,
6593,
6633,
6634,
6701,
6702,
6737,
6738,
6769,
6770,
6793,
6794,
6811,
6812,
6830,
6831,
6850,
6851,
6860,
6861,
6940,
6941,
7031,
7032,
7129,
7130,
7144,
7145,
7183,
7184,
7239,
7240,
7249,
7250,
7369,
7370,
7401,
7402,
7409,
7410,
7427,
7428,
7446,
7447,
7466,
7467,
7492,
7493,
7550,
7551,
7624,
7625,
7712,
7713,
7727,
7728,
7735,
7736,
7791,
7792,
7831,
7832,
7899,
7900,
7929,
7930,
8047,
8048,
8062,
8063,
8096,
8097,
8114,
8115,
8135,
8136,
8155,
8156,
8175,
8176,
8221,
8222,
8236,
8237,
8271,
8272,
8299,
8300,
8326,
8327,
8341,
8342,
8376,
8377,
8405,
8406,
8415,
8416,
8450,
8451,
8499,
8500,
8509,
8510,
8531,
8532,
8573,
8574,
8607,
8608,
8716,
8717,
8884,
8885,
8950,
8951,
8967,
8968,
8997,
8998,
9093,
9094,
9110,
9111,
9140,
9141,
9229,
9230,
9246,
9247,
9278,
9279,
9489,
9490,
9532,
9533,
9561,
9562,
9623,
9624,
9638,
9639,
9667,
9668,
9721,
9722,
9901,
9902,
9928,
9929,
9982,
9983,
10147,
10148,
10162,
10163,
10193,
10194,
10224,
10225,
10256,
10257,
10321,
10322,
10386,
10387,
10428,
10429,
10651,
10652,
10666,
10667,
10695,
10696,
10781,
10782,
10857,
10858,
10922,
10923,
10946,
10947,
11068,
11069,
11199,
11266,
11267,
11309,
11310,
11444,
11445,
11459,
11460,
11505,
11506,
11567,
11568,
11701,
11702,
11716,
11717,
11762,
11763,
11823,
11824,
11893,
11894,
12008,
12009,
12023,
12024,
12101,
12102,
12208,
12209,
12270,
12271,
12316,
12317,
12378,
12379,
12443,
12444,
12461,
12462,
12734,
12735,
12750,
12751,
12817,
12818,
12848,
12849,
12877,
12878,
12998,
12999,
13024,
13025,
13088,
13089,
13098,
13099,
13177,
13178,
13189,
13190,
13205,
13206,
13267,
13268,
13304,
13305,
13410,
13411,
13437,
13438,
13472,
13473,
13525,
13526,
13537,
13538,
13600,
13601,
13634,
13635,
13681,
13682,
13725,
13726,
13772,
13773,
13809,
13810,
13872,
13873,
13964,
13965,
14029,
14030,
14117,
14118,
14171,
14172,
14240,
14241,
14352,
14353,
14431,
14432,
14574,
14575,
14692,
14693,
14714,
14715,
14856,
14857,
14870,
14871,
14960,
14961,
14980,
14981,
15001,
15002,
15021,
15022,
15039,
15040,
15193,
15194,
15206,
15207,
15285,
15286,
15305,
15306,
15326,
15327,
15346,
15347,
15364,
15365,
15377,
15378,
15411,
15412,
15456,
15457,
15482,
15483,
15500,
15501,
15551,
15552,
15583,
15584,
15601,
15602,
15740,
15741,
15796,
15797,
15806,
15807,
15925,
15926,
16029,
16030,
16144,
16145,
16159,
16160,
16247,
16248,
16304,
16305,
16378,
16379,
16427,
16428,
16510,
16511,
16568,
16569,
16597,
16598,
16678,
16679,
16717,
16718,
16796,
16797,
16863,
16864,
16906,
16907,
16940,
16941,
16949,
16950,
16962,
16963,
17221,
17222,
17258,
17259,
17287,
17288,
17295,
17296,
17334,
17335,
17371,
17372,
17384,
17385,
17468,
17469,
17489,
17490,
17831,
17832,
17858,
17859,
17898,
17899,
17917,
17918,
17935,
17936,
17986,
17987,
18017,
18018,
18202,
18203,
18230,
18231,
18286,
18287,
18311,
18312,
18329,
18330,
18346,
18347,
18405,
18406,
18493,
18494,
18514,
18515,
18562,
18563,
18601,
18602,
18629,
18630,
18798,
18799,
18813,
18814,
18834,
18835,
18895,
18896,
19117,
19118,
19132,
19133,
19186,
19187,
19204,
19205,
19347,
19348,
19362,
19363,
19407,
19408,
19426,
19427,
19543,
19544,
19709,
19710,
19865,
19866,
19881,
19882,
19981,
19982,
20096,
20097,
20124,
20125,
20188,
20189,
20220,
20221,
20244,
20245,
20336,
20337,
20353,
20354,
20369,
20370,
20453,
20454,
20552,
20553,
20760,
20761,
20788,
20789,
20799,
20800,
20810,
20811,
20827,
20828,
20848,
20849,
20880,
20881,
20905,
20906,
20928,
20929,
20955,
20956,
20972,
20973,
20987,
20988,
21002,
21003,
21040,
21041,
21049,
21050,
21115,
21116,
21506,
21507,
21533,
21534,
21565,
21566,
21598,
21599,
21624,
21625,
21658,
21659,
21694,
21695,
21732,
21733,
21764,
21765,
21857,
21858,
21997,
21998,
22042,
22043,
22070,
22071,
22109,
22110,
22176,
22177,
22213,
22214,
22235,
22236,
22269,
22270,
22308,
22309,
22351,
22352,
22393,
22394,
22427,
22428,
22514,
22515,
22587,
22588,
22664,
22665,
22756,
22757,
22821,
22822,
22874,
22875,
22915,
22916,
22988,
22989,
23064,
23065,
23143,
23144,
23223,
23224,
23343,
23344,
23413,
23414,
23491,
23492,
23538,
23539,
23561,
23562,
23671,
23672,
23752,
23753,
23768,
23769,
23782,
23783,
23800,
23801,
23887,
23888,
23935,
23936,
23965,
23966,
23997,
23998,
24074,
24075,
24092,
24093,
24104,
24105,
24121,
24122,
24134,
24135,
24221,
24222,
24247,
24248,
24317,
24318,
24422,
24423,
24459,
24460,
24537,
24538,
24584,
24585,
24605,
24606,
24620,
24621,
24638,
24639,
24725,
24726,
24773,
24774,
24803,
24804,
24835,
24836,
24912,
24913,
24930,
24931,
24942,
24943,
24959,
24960,
24972,
24973,
25028,
25029,
25099,
25100,
25160,
25161,
25187,
25188,
25200,
25201,
25222,
25223,
25555,
25556,
25884,
25885,
25925,
25926,
25943,
25944,
25989,
25990,
26001,
26002,
26041,
26042,
26134,
26135,
26166,
26167,
26221,
26222,
26311,
26312,
26319,
26320,
26455,
26456,
26494,
26495,
26554,
26555,
26615,
26616,
26668,
26669,
26710,
26711,
26752,
26753,
26798,
26799,
26806,
26807,
26852,
26853,
26948,
26949,
27029,
27030,
27070,
27071,
27151,
27152,
27202,
27203,
27285,
27286,
27326,
27327,
27399,
27400,
27440,
27441,
27528,
27529,
27615,
27616,
27625,
27626,
27665,
27666,
27705,
27706,
27746,
27747,
27764,
27765,
27804,
27805,
27844,
27845,
27952,
27953,
27992,
27993,
28032,
28033,
28090,
28091,
28130,
28131,
28170,
28171,
28204,
28205,
28222,
28223,
28262,
28263,
28302,
28303,
28347,
28348,
28365,
28366,
28376,
28377,
28435,
28436,
28464,
28465,
28474,
28475,
28500,
28501,
28508,
28509,
28510,
28517
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 28517,
"ccnet_original_nlines": 1024,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.05583949014544487,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.040128711611032486,
"rps_doc_frac_lines_end_with_ellipsis": 0.005853659939020872,
"rps_doc_frac_no_alph_words": 0.2879045903682709,
"rps_doc_frac_unique_words": 0.274541974067688,
"rps_doc_mean_word_length": 5.59010124206543,
"rps_doc_num_sentences": 239,
"rps_doc_symbol_to_word_ratio": 0.006814309861510992,
"rps_doc_unigram_entropy": 5.991662502288818,
"rps_doc_word_count": 3657,
"rps_doc_frac_chars_dupe_10grams": 0.14043927192687988,
"rps_doc_frac_chars_dupe_5grams": 0.27354106307029724,
"rps_doc_frac_chars_dupe_6grams": 0.23890818655490875,
"rps_doc_frac_chars_dupe_7grams": 0.20804187655448914,
"rps_doc_frac_chars_dupe_8grams": 0.19439417123794556,
"rps_doc_frac_chars_dupe_9grams": 0.16465294361114502,
"rps_doc_frac_chars_top_2gram": 0.005674310028553009,
"rps_doc_frac_chars_top_3gram": 0.012718290090560913,
"rps_doc_frac_chars_top_4gram": 0.0058699799701571465,
"rps_doc_books_importance": -2262.973388671875,
"rps_doc_books_importance_length_correction": -2262.973388671875,
"rps_doc_openwebtext_importance": -1357.0687255859375,
"rps_doc_openwebtext_importance_length_correction": -1357.0687255859375,
"rps_doc_wikipedia_importance": -895.4806518554688,
"rps_doc_wikipedia_importance_length_correction": -895.4806518554688
},
"fasttext": {
"dclm": 0.22106367349624634,
"english": 0.006115190219134092,
"fineweb_edu_approx": 1.2084263563156128,
"eai_general_math": 0.024833260104060173,
"eai_open_web_math": 0.7396948337554932,
"eai_web_code": 0.8567346334457397
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,888,703,850,191,984,000 |
wiki:macros
Version 28 (modified by michael.gruenewald, 12 years ago) ( diff )
--
Macro Support for Squeak
Macros is a framework which provides compile-time macros for Squeak. It is primarily focused on macros that need to generate additional methods or check constraints. Basic integration with OmniBrowser and the Squeak Debugger is provided.
Already exemplarily implemented use-cases are:
• optional parameters
• protocol delegation
• automatically created setters and getters
• immutable classes
• sealed classes
• ...
How to Install
Environment
4.1, 4.2
Any
Any
Sources
ConfigurationOfMacros
Macros
CTM
CTMOB optional
OmniBrowser optional
Misc
Macros@SqueakSource
Use the Metacello configuration or just load the CTM package (CTM stands for compile-time metaprogramming). If you also want OmniBrowser support, load the CTMOB package, too.
You can find the following categories in the packages:
CTM-Core
core implemenation including the event listener
CTM-Operations
supported operations, currently those for methods
CTM-Tests
some basic tests, all should pass
CTM-Examples
basic macros, see the class documentation of each for details
CTMOB
OmniBrowser support
How to Use
Applying Macros
To apply macros, just add pragmas to methods and classes. Method pragmas are added in the usual way, between the signature line and the code; class pragmas are added by placing them above the subclass: call in the class definition window. Examples:
withAll: aNumberArray
<shortcuts: #with count: 3>
^ self new addAll: aNumberArray
<immutable>
Object subclass: #Klasse1
instanceVariableNames: ''
classVariableNames: ''
poolDictionaries: ''
category: 'Playground'
Creating New Macros
To create a macro you have to subclass the CTMMacro class. The first thing to do is to decide on which pragmas the macro should listen. You need to implement at least one of those two methods:
matchMethodPragma: aPragma
This should return true if the macro wants to process a method annotated with aPragma or false otherwise. Additionally the method can be used to store additional information that are found in the pragma, e.g. pragma parameters.
matchClassPragma: aPragma
Same as matchMethodPragma: but for classes and their pragmas.
Depending on the use-case and the decision you made above, implement one or more of the following methods which are called when an event in a relevant entity occurs:
methodAdded: aMethod in: aClass
methodCompiled: aCompiledMethod in: aClass from: anOldCompiledMethodOrNil
methodModified: aMethod in: aClass from: anOldMethod
methodRemoved: aMethod in: aClass
Those are called if a method event occurred.
classAdded: aClass
classCompiled: aClass from: anOldClassOrNil
classModified: aClass from: anOldClass
classRemoved: aClass
Those are called if a class event occurred.
To perform actions on the classes and methods related to the entity in the event, the methods should return a collection of CTMOperation elements. At this time, only method operations are implemented. You can add methods to classes or remove them using the following operation constructors:
CTMMethodOperation class>>add: aSelector in: aClass for: aClassOrMethod with: aSourceString
returns an operation to add a method to a class, the parameters should be self-explanatory
CTMMethodOperation class>>remove: aSelector in: aClass
removes a method from a class in the same way
See the CTM-Examples category for some macro implementations.
Some Hints
• Our macros implementation and its operations system ensure that (a) your hand-written code will never be overridden, (b) you cannot change generated methods and (c) you cannot apply macros that would break (a).
• The debugger always steps through generated methods. They will still appear on the stack though. If you want to step into a generated method, hold Shift while clicking on Step Into.
• Monticello cannot see generated methods. This is a design decision to simplify cooperative work on a code base and to prevent merge decisions resulting in inconsistent states.
• When you use class pragmas, those classes might not be loadable in a Squeak system without the macro system. However, it will not affect classes not using class pragmas.
How to Extend
For starters, be aware that some of the components are deeply integrated with the Squeak system. There is a significant number of override and extension methods.
The basic control flow is as follows:
The CTMEventListener singleton is registered as a listener for all system events. Its event: method dispatches the events to methodEvent: and classEvent:. Those two methods find a all relevant macros, run them and finally execute the generated operations when no conflicts occurred.
One common way to extend the system is to support more kinds of tracked operations. To implement those, you have to subclass CTMOperation. Its four methods should be self-explanatory.
Acknowledgments
To date, the following people contributed to this project:
• Michael Grünewald
• Stefan Richter
Note: See TracWiki for help on using the wiki.
|
{
"url": "https://www.hpi.uni-potsdam.de/hirschfeld/trac/SqueakCommunityProjects/wiki/macros?version=28",
"source_domain": "www.hpi.uni-potsdam.de",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "21054",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7TOK4T5ZMG3WVEKLPL7Y4HGFFIAQUR3U",
"WARC-Concurrent-To": "<urn:uuid:70f72401-1c7e-4acb-a3a2-fe2ffc86f212>",
"WARC-Date": "2022-12-02T06:22:43Z",
"WARC-IP-Address": "141.89.225.120",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HGQDBX3JGWVGSBYII3RDOAVOYPPYOSSS",
"WARC-Record-ID": "<urn:uuid:b964f3c0-790d-4169-9b7a-80ab7f590100>",
"WARC-Target-URI": "https://www.hpi.uni-potsdam.de/hirschfeld/trac/SqueakCommunityProjects/wiki/macros?version=28",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dbe0bb91-2708-4a16-a4fe-c936292ee9c3>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-71\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
12,
13,
80,
81,
84,
85,
110,
111,
349,
350,
397,
398,
422,
446,
492,
514,
533,
541,
542,
557,
558,
570,
579,
583,
587,
595,
617,
624,
628,
643,
664,
669,
689,
690,
865,
866,
921,
922,
931,
979,
994,
1044,
1054,
1088,
1101,
1163,
1169,
1189,
1190,
1201,
1202,
1218,
1219,
1468,
1469,
1491,
1519,
1520,
1553,
1565,
1591,
1618,
1642,
1664,
1688,
1689,
1709,
1710,
1903,
1904,
1931,
2159,
2185,
2247,
2248,
2414,
2415,
2447,
2521,
2574,
2608,
2653,
2672,
2716,
2755,
2776,
2820,
2821,
3112,
3113,
3205,
3296,
3351,
3397,
3398,
3460,
3461,
3472,
3473,
3688,
3874,
4054,
4228,
4229,
4243,
4244,
4406,
4407,
4445,
4728,
4729,
4913,
4914,
4930,
4931,
4990,
4991,
5013,
5032
],
"line_end_idx": [
12,
13,
80,
81,
84,
85,
110,
111,
349,
350,
397,
398,
422,
446,
492,
514,
533,
541,
542,
557,
558,
570,
579,
583,
587,
595,
617,
624,
628,
643,
664,
669,
689,
690,
865,
866,
921,
922,
931,
979,
994,
1044,
1054,
1088,
1101,
1163,
1169,
1189,
1190,
1201,
1202,
1218,
1219,
1468,
1469,
1491,
1519,
1520,
1553,
1565,
1591,
1618,
1642,
1664,
1688,
1689,
1709,
1710,
1903,
1904,
1931,
2159,
2185,
2247,
2248,
2414,
2415,
2447,
2521,
2574,
2608,
2653,
2672,
2716,
2755,
2776,
2820,
2821,
3112,
3113,
3205,
3296,
3351,
3397,
3398,
3460,
3461,
3472,
3473,
3688,
3874,
4054,
4228,
4229,
4243,
4244,
4406,
4407,
4445,
4728,
4729,
4913,
4914,
4930,
4931,
4990,
4991,
5013,
5032,
5078
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5078,
"ccnet_original_nlines": 119,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3366120159626007,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012021860107779503,
"rps_doc_frac_lines_end_with_ellipsis": 0.008333330042660236,
"rps_doc_frac_no_alph_words": 0.18469944596290588,
"rps_doc_frac_unique_words": 0.44161075353622437,
"rps_doc_mean_word_length": 5.508724689483643,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0.0032786899246275425,
"rps_doc_unigram_entropy": 5.252155780792236,
"rps_doc_word_count": 745,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.011208579875528812,
"rps_doc_frac_chars_dupe_6grams": 0.011208579875528812,
"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.007309940177947283,
"rps_doc_frac_chars_top_3gram": 0.010964909568428993,
"rps_doc_frac_chars_top_4gram": 0.00828460045158863,
"rps_doc_books_importance": -399.8462219238281,
"rps_doc_books_importance_length_correction": -399.8462219238281,
"rps_doc_openwebtext_importance": -253.841552734375,
"rps_doc_openwebtext_importance_length_correction": -253.841552734375,
"rps_doc_wikipedia_importance": -224.19566345214844,
"rps_doc_wikipedia_importance_length_correction": -224.19566345214844
},
"fasttext": {
"dclm": 0.05259174108505249,
"english": 0.8244411945343018,
"fineweb_edu_approx": 2.1289100646972656,
"eai_general_math": 0.8568716645240784,
"eai_open_web_math": 0.373576819896698,
"eai_web_code": 0.655943751335144
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,416,034,706,601,008,000 |
David Slowinski works for Cray computers. He found seven Mersenne primes between 1979 and 1996 by using a version of the Lucas-Lehmer test that he has convinced many Cray labs around the world to run in their spare time (time that would be lost otherwise). He had to delay announcing one of his prime records until he got permission to begin looking for it. Since then, he has joined GIMPS. His search for record primes is "not so organized as you would suppose" (his words), as he does not search systematically.
Log in or registerto write something here or to contact authors.
|
{
"url": "https://everything2.com/title/David+Slowinski",
"source_domain": "everything2.com",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "15011",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:55XH2FNKULX2DIAXPWPFS2W2IXWVJDW3",
"WARC-Concurrent-To": "<urn:uuid:0ee6bddc-d3f4-4b40-803e-90825df4e78e>",
"WARC-Date": "2017-03-31T01:15:43Z",
"WARC-IP-Address": "54.212.251.95",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:RZ3S6B7IHV7QYFY4ZT6XHST2MICP7D7Z",
"WARC-Record-ID": "<urn:uuid:30d0acaf-79fe-40af-9a78-5eceb48cbb7c>",
"WARC-Target-URI": "https://everything2.com/title/David+Slowinski",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:15fbbe02-6178-4c6c-ad63-538e11b19b45>"
},
"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,
514,
515
],
"line_end_idx": [
514,
515,
579
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 579,
"ccnet_original_nlines": 2,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.47413793206214905,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008620689623057842,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12931033968925476,
"rps_doc_frac_unique_words": 0.7549019455909729,
"rps_doc_mean_word_length": 4.529411792755127,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.223901748657227,
"rps_doc_word_count": 102,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.021645020693540573,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -62.20143508911133,
"rps_doc_books_importance_length_correction": -76.50770568847656,
"rps_doc_openwebtext_importance": -35.7495002746582,
"rps_doc_openwebtext_importance_length_correction": -50.0557746887207,
"rps_doc_wikipedia_importance": -15.431631088256836,
"rps_doc_wikipedia_importance_length_correction": -29.737905502319336
},
"fasttext": {
"dclm": 0.02928120084106922,
"english": 0.9861084222793579,
"fineweb_edu_approx": 1.323151707649231,
"eai_general_math": 0.4607975482940674,
"eai_open_web_math": 0.46896183490753174,
"eai_web_code": 0.0016695900121703744
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "2",
"label": "About (Personal)"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,861,282,045,151,374,000 |
tag:blogger.com,1999:blog-63229262017-12-10T19:11:11.802-08:00doofusdanDan BeckerDan [email protected]:blogger.com,1999:blog-6322926.post-12337927157328933992015-01-24T17:42:00.001-08:002015-01-24T17:42:21.285-08:00Doofusdan.com is mine at lastFeels like I've been waiting for it to became available for 20 years - somebody had been squatting on it for ages and as far as I know, never used it. At last, they let the registration lapse and now it's mine! Bwah-ha-ha....<br /><br />I just noticed I haven't posted anything here in over a year - though I did post a few things over on <a href="http://www.MassivelyUseful.com">MassivelyUseful</a><br /><br />Mostly it's because I've been quite busy, and having a great time, at my new gig at <a href="http://www.tableau.com">Tableau</a>. We're hiring, so if you're awesome, <a href="http://careers.tableau.com">check us out and get in touch</a>! <br /><br /><br /><br />Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-36047391720242636562013-06-25T14:59:00.001-07:002013-06-25T14:59:25.227-07:00Papa's Tech Class: Help your kids deconstruct a computerMy 8-year-old son I. loves taking things apart. He loves to see what's under the covers - and he also loves the destruction!<br /><br />He's long had his eyes on the three old desktop computers lurking in our basement. Taking them apart was the first thing he mentioned when we started talking about what we'd do for Papa's Tech Class.<br /><br />To give you an idea of the vintage, I built the newest PC to run betas of <a href="https://en.wikipedia.org/wiki/Windows_Vista">what turned out to be Windows Vista</a>; there's also a G4 PowerMac one of my friends acquired when his employer was getting rid of obsolete computers, and an even older PC that once ran software like AudioGalaxy (in its awesome <a href="http://crave.cnet.co.uk/gadgets/the-greatest-defunct-web-sites-and-dotcom-disasters-49296926/9/">first incarnation</a>).<br /><br />If you have an obsolete PC lying around, taking it apart can be a fun activity with your kids. Unlike building a new PC, there's no worry if they damage anything.<br /><br />Unlike most laptop computers, desktops can be disassembled with tools you probably already have around the house. You can get it pretty far apart with just a Philips head screwdriver (#2 and #1 sizes - the most common). If you've also got a small pair of pliers, that can help young fingers get a good grip to pull out on those really jammed-in cables.<br /><table align="center" cellpadding="0" cellspacing="0" class="tr-caption-container" style="margin-left: auto; margin-right: auto; text-align: center;"><tbody><tr><td style="text-align: center;"><a href="http://4.bp.blogspot.com/-wC6ZTXiLA6A/UcoQjOupxRI/AAAAAAAAC7c/SwJzxMslfhc/s1600/IMG_4828.JPG" imageanchor="1" style="margin-left: auto; margin-right: auto;"><img border="0" height="400" src="http://4.bp.blogspot.com/-wC6ZTXiLA6A/UcoQjOupxRI/AAAAAAAAC7c/SwJzxMslfhc/s400/IMG_4828.JPG" width="300" /></a></td></tr><tr><td class="tr-caption" style="text-align: center;">All you really need to disassemble most desktop computers is a screwdriver with standard bits. A small pair of pliers is the next most useful tool.</td></tr></tbody></table>For protection, check the metal edges of the case. Some PC's have pretty raw edges that can cut fingers — especially little, uncalloused fingers.<br /><br />You can do this easily on a living room or kitchen table, but put down some newspaper or cardboard to protect the work surface and make it easier to rotate the computer.<br /><br />Depending on your kid, you may have fun identifying the major components of computers (CPU, RAM, motherboard, input and output ports, hard drive, CD/DVD drive, graphics card & CPU). You can also trace the paths data flows through in terms of things the kids will be used to. For example, when you surf the web, the web page comes in over the network connection; when you put in a game disc, the software on the disk is read from the DVD drive and goes over these cables to RAM, and the CPU reads the instructions from RAM and follows them, then it tells the GPU what to draw on the screen, and the GPU sends a video signal out to the display, and plays sounds through the speakers...<br /><br />Finally, if the thought of rendering a functional piece of hardware non-functional rankles you, you can always donate them - there are many <a href="http://your.kingcounty.gov/solidwaste/takeitback/electronics/index.asp">eCycling options around Seattle</a>. Another approach to consider for making use of PC's that can't handle current operating system versions is installing Linux. But here at PTC, we have a <a href="http://www.raspberrypi.org/">Raspberry Pi</a> for our Linux hacking, which uses a fraction of the power - and we also have several unused laptops of more recent vintage.Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-30152456958565548422013-06-18T12:55:00.001-07:002013-06-18T13:38:03.265-07:00"Papa Tech Class" - summer hacking with my kidsAfter completing graduate school, I'm taking the summer off with my boys, ages 8 (I) & 11 (Z). One of the things they asked to do this summer is "Papa Tech Class."<br /><br />Today, on the first day of summer with just the three of us at home, Z asked to get a blog set up so he could write about one of his passions: soccer. <br /><br />Z had previously asked about making web pages, and he learned how to do basic HTML by hand. He learned inserting images, creating links, and basic page structure. He could see the results by opening the HTML file locally in a web browser. We uploaded the file to a web server and he could see the page on the Internet. I think it's useful to at least see what's going on one layer down - though HTML and FTP are still pretty far above bare wire & bare metal!<br /><br />To make the blog an ongoing concern, we signed up for a free blog hosted on <a href="http://wordpress.com/">WordPress.com</a>. WordPress provides great blogging features like ready-made templates, WYSIWYG editing, and it's a very popular platform for blogs of all sizes. So it's got a great deal of room to grow, if Zeb wants to get fancier later on. So using WordPress lets Z focus on what he really wants to do: write about soccer.<br /><br />I knew we wanted to have prior review & approval of anything Z wants to post, at least while he's getting started and learning the ropes. To set that up, I created one account for the parents to use, and created the blog during the sign-up process. So the parents' account owns the blog.<br /><br />Next, I logged out of WordPress.com, and then created a second WordPress.com account for Z to use. During the sign-up process, you have the option to <a href="https://signup.wordpress.com/signup/?user=1">sign up for just a username</a> without creating a blog, and that's what I did. <br /><br />Finally, I logged back into the parental account, and <a href="http://en.support.wordpress.com/user-roles/#contributor">added Z's account as a contributor</a> to the blog. This way he can write articles any time he likes, but he can't publish them on his own. When he is done, instead of having a "publish" button, he has a "submit for review" button. This will send an email to the parents. We can then review the post and approve it, edit it ourselves, or discuss with Z what needs to be changed and why.<br /><br />This isn't perfect; to make changes to the blog itself, like changing the theme or adding widgets, I'll need to log him in under the parents' account - but since I don't use that account for any other blogs, there's no worries there.<br /><br />You can follow Z's blog at http://zebsoccer.wordpress.com. Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-57271967148178495272013-02-18T22:52:00.001-08:002013-09-19T23:33:35.176-07:00Getting Raspberry Pi DHCP working with internet sharing from OS XMy sons asked to learn more about computers, so we got a <a href="http://www.raspberrypi.org/">Raspberry Pi</a>. We also got <a href="http://learn.adafruit.com/adafruit-pi-cobbler-kit/overview">Adafruit's Pi Cobbler kit</a>. Using <a href="http://learn.adafruit.com/adafruit-raspberry-pi-educational-linux-distro/occidentalis-v0-dot-2">Adafruit's Occidentalis distro</a> of Raspbian, I had to do a little configuration to make the following setup work, and it turned into a little bit of a networking lesson for my kids, too. I figured I'd write it up in case some other Googling Pi user needs to learn & solve this particular combination of problems - or in case I forget and need to re-do this sometime. :-)<br /><br />The goal was to have the Pi share a wifi-equipped Mac's network connection.<br /><br />Mac running Lion (OS X 10.7) is connected to Internet via wifi.<br /><br />Pi connected via Ethernet cable to Mac.<br /><br />Share the Mac's Internet connection: on the Mac, go to System Preferences - Sharing.<br /><ul><li>Check the box Internet Sharing from the list of services. </li><li>Confirm that that the sharing status is On. </li><li>Confirm that Ethernet is checked on the list of ports to share to.</li></ul><div class="separator" style="clear: both; text-align: center;"><a href="http://3.bp.blogspot.com/-ucWCpuPXWh8/USMPVQKr4EI/AAAAAAAAC18/hMrQ1CnwgYw/s1600/Screen+Shot+2013-02-18+at+9.36.20+PM.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="270" src="http://3.bp.blogspot.com/-ucWCpuPXWh8/USMPVQKr4EI/AAAAAAAAC18/hMrQ1CnwgYw/s320/Screen+Shot+2013-02-18+at+9.36.20+PM.png" width="320" /></a></div>Now power on the Pi. It should get an IP address assigned via DHCP, and it should be on the network. Thanks to Occidentalis, the Pi is registered with Rendezvous using the name <span style="font-family: Courier New, Courier, monospace;">raspberrypi.local</span>. If DHCP and Rendezvous are both working, you can reach the Pi from the Mac using that name. This is great, because you can plug in and access a headless Pi quite easily this way.<br /><br /><br /><span style="font-family: Courier New, Courier, monospace;">Macintosh:~ dan$ <b>ping raspberrypi.local</b></span><br /><span style="font-family: Courier New, Courier, monospace;">PING raspberrypi.local (192.168.2.2): 56 data bytes</span><br /><span style="font-family: Courier New, Courier, monospace;">64 bytes from 192.168.2.2: icmp_seq=0 ttl=64 time=0.720 ms</span><br /><span style="font-family: Courier New, Courier, monospace;">64 bytes from 192.168.2.2: icmp_seq=1 ttl=64 time=0.982 ms</span><br /><span style="font-family: Courier New, Courier, monospace;">64 bytes from 192.168.2.2: icmp_seq=2 ttl=64 time=0.919 ms</span><br /><span style="font-family: Courier New, Courier, monospace;">^C</span><br /><span style="font-family: Courier New, Courier, monospace;">--- raspberrypi.local ping statistics ---</span><br /><span style="font-family: Courier New, Courier, monospace;">3 packets transmitted, 3 packets received, 0.0% packet loss</span><br /><span style="font-family: Courier New, Courier, monospace;">round-trip min/avg/max/stddev = 0.720/0.874/0.982/0.112 ms</span><br /><div><br /></div><br />But, it wasn't working for us. The Pi wasn't registering its name, we couldn't reach it from the Mac. Pings just resulted in "ping: cannot resolve raspberrypi.local: Unknown host". We tried all the suggestions on the FAQ and troubleshooting wiki (cable swapping, reflashing the Pi's software, swapping power supplies) but they did not help.<br /><br />There were two problems: the Pi's network configuration needed to be changed, and the Mac's Internet Sharing needed to be restarted.<br /><br />Fixing the network configuration on the Pi, <a href="https://sites.google.com/a/davidsingleton.org/www2/home/stuff-i-had-to-do-to-get-raspberry-pi-debian-image-working">David Singleton's web page</a> gave me a clue about needing to enable the Ethernet interface on the Pi to make it get configuration from DHCP.<br /><br />This is the original network interface configuration on Occidentalis:<br /><br /><span style="font-family: Courier New, Courier, monospace;">pi@raspberrypi:~$ <b>cat /etc/network/interfaces</b></span><br /><span style="font-family: Courier New, Courier, monospace;">auto lo</span><br /><span style="font-family: Courier New, Courier, monospace;"><br /></span><span style="font-family: Courier New, Courier, monospace;">iface lo inet loopback</span><br /><span style="font-family: Courier New, Courier, monospace;">iface eth0 inet dhcp</span><br /><span style="font-family: Courier New, Courier, monospace;"><br /></span><span style="font-family: Courier New, Courier, monospace;">auto wlan0</span><br /><span style="font-family: Courier New, Courier, monospace;">allow-hotplug wlan0</span><br /><span style="font-family: Courier New, Courier, monospace;">iface wlan0 inet dhcp</span><br /><span style="font-family: Courier New, Courier, monospace;"> wpa-ssid "my-network-ssid"</span><br /><span style="font-family: Courier New, Courier, monospace;"> wpa-psk "my-wifi-password"</span><br /><br />Using nano, and opening the file as superuser because it is a restricted system file,<br /><br /><span style="font-family: Courier New, Courier, monospace;">pi@raspberrypi:~$ <b>sudo nano /etc/network/interfaces</b></span><br /><br />we make the following additions (in <b>bold</b>):<br /><br /><span style="font-family: Courier New, Courier, monospace;">auto lo</span><br /><span style="font-family: Courier New, Courier, monospace;"><br /></span><span style="font-family: Courier New, Courier, monospace;">iface lo inet loopback</span><br /><b><span style="font-family: Courier New, Courier, monospace;">auto eth0</span></b><br /><span style="font-family: Courier New, Courier, monospace;">iface eth0 inet dhcp</span><br /><span style="font-family: Courier New, Courier, monospace;"><br /></span><span style="font-family: Courier New, Courier, monospace;"><b>#</b>auto wlan0 allow-hotplug wlan0 iface wlan0 inet dhcp</span><br /><span style="font-family: Courier New, Courier, monospace;"><b>#</b> wpa-ssid "my-network-ssid"</span><br /><span style="font-family: Courier New, Courier, monospace;"><b>#</b> wpa-psk "my-wifi-password"</span><br /><div><br /></div>Here, <span style="font-family: Courier New, Courier, monospace;">eth0</span> is the Ethernet interface, <span style="font-family: Courier New, Courier, monospace;">lo</span> is the <a href="http://en.wikipedia.org/wiki/Loopback#Virtual_network_interface">loopback</a> interface, and <span style="font-family: Courier New, Courier, monospace;">wlan0</span> is the wireless interface.<br /><br />We don't have a wireless adapter on our Pi, so we commented out the three lines of wireless interface configuration.<br /><br />Then, we restart the network, forcing it to load the new interfaces file.<br /><br /><br /><span style="font-family: Courier New, Courier, monospace;">pi@raspberrypi:~$ <b>sudo /etc/init.d/networking restart</b></span><br /><div><span style="font-family: Courier New, Courier, monospace;"><b><br /></b></span></div><br />That worked better. The Pi was now coming up and making a DHCP request. But it wasn't getting a response. That's not a Pi problem, that's a problem with the Mac's Internet Connection Sharing.<br /><br />Off to Google again - this thread showed <a href="http://forums.macrumors.com/showthread.php?t=1192376">other people had problems with ICS in Lion</a>. The easiest suggestion was to simply stop and restart the service, and this worked. One more restart of the Pi's networking, and as David says: "yay, network!"Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-35685299598487424692012-04-09T23:43:00.001-07:002012-04-09T23:43:01.167-07:00Coping with metadata problems in book searchesI'll soon be facing the same issue and using the same workaround that <a target="_blank" href="http://blog.findings.com/post/16123547547/find-in-a-local-library">findings.com</a> did:<br /><br /><blockquote>Whenever we can, we will supply WorldCat with an ISBN or other identifier to bring you straight to a book…but sometimes you will see a number of search results based on an author and Title. We would like this to be as seamless as possible, but the world of book publishing metadata is riddled with information gaps and geographic thorns.<br /></blockquote><br /><br /><br /><br /><br />Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-88597636756335977662012-04-09T23:16:00.001-07:002012-04-09T23:16:02.708-07:00ebooks need skimabilityStephen Johnson, <a target="_blank" href="http://blog.findings.com/post/17661615384/how-we-will-read-an-interview-with-stevenbjohnson">talking</a> to Findability: <br /><br /><blockquote><b>If you could move one feature of paper books to digital books, what would that be?<br /></b><br />Skimming. It’s a funny thing with print vs. ebooks; the digital age is supposed to be all about attention deficit disorder and hypertextual distractions, but ebooks lock you into reading them in a linear fashion more than print books do. It’s much easier to pick up a print book and flip through the pages, get a sense of the argument or structure, than it is with an ebook (or magazine.) It’s a very interesting interface challenge: I think it’s probably solvable, and I know many smart folks are working on it, but we don’t have a true solution yet.</blockquote><br /><br />I agree. It's one reason browsing in bookstores is still better than shopping online, even with Amazon's "look inside this book" - since flipping through the pages hasn't yet been implemented. <br /><br />It's just a matter of time, though - I'd guess next year or two. Might just need the next generation of mobile CPUs & GPUs to ship. Flipping pages in a book requires some serious framerates!<br />Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-60208146330013709342012-04-07T22:23:00.001-07:002012-04-07T22:26:24.796-07:00The New Aesthetic<a target="_blank" href="http://m.wired.com/beyond_the_beyond/2012/04/an-essay-on-the-new-aesthetic/">Bruce Sterling</a>:<br /><blockquote>The evidence is impossible to refute. Anybody with a spark of perception who looks through this thing:<br /><a target="_blank" href="http://new-aesthetic.tumblr.com/">http://new-aesthetic.tumblr.com/</a><br />must recognize that modern reality is on display there. What we think about that, or do about that, is another matter. That it exists is not in question. </blockquote><br />Also, be sure to read <a target="_blank" href="http://www.riglondon.com/blog/2011/05/06/the-new-aesthetic/">James Bridle</a> and also <a target="_blank" href="http://booktwo.org/notebook/sxaesthetic/">this</a>:<br /><blockquote>People are “acting” in ways we may or may not understand, which may or may not have an effect in the real world, whether it’s signing petitions, organising riots (on BBM), clicking, ‘liking’ KONY, whatever, the correct (maybe) response is not to have an opinion (default internet response, still) or a moral position, but to live inside the thing as it unfolds.</blockquote><br />And there's <a target="_blank" href="http://thecreatorsproject.com/blog/in-response-to-bruce-sterlings-essay-on-the-new-aesthetic">even more</a>!<br />Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-81999038233225982342012-04-07T02:02:00.001-07:002012-04-07T02:02:42.022-07:00We Are Creators, Not ConsumersMy <a href="http://courses.washington.edu/css590/2012.Spring/">class</a> reading this quarter is <a target="_blank" href="http://mobiledesign.org/">Mobile Design and Development</a>, which you can read free online.<br /><br />Author Brian Fling <a target="_blank" href="http://mobiledesign.org/we_are_creator_not_consumers?s[]=creators&s[]=not&s[]=consumers">says</a>:<br /><br /><blockquote><b>We Are Creators, Not Consumers<br /></b><br />The final principle of Mobile 2.0 is recognizing that we are in a new age of consumerism. Yesterday’s consumer does not look anything like today’s consumer. The people of today’s market don’t view themselves as consumers, but rather as creators.</blockquote><br /><br />He's talking about "user-generated content" as creation. But to me, "create" doesn't feel like the right verb for what makes social constructs happen. <br /><br />Still, my reaction - being bothered by that equation and needing to probe at it like a sore tooth - tells me I should take a closer look at what is happening there. <br /><br />Ok, brain, whatever you say. <br /><br />(That's right, Pinky.)<br /><br /><br />Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-8285910040179844022012-03-17T14:39:00.001-07:002012-03-17T14:39:48.913-07:00IT buzzwords and memes of the moment: cloud & consumerizarionPeter Kretzman, <a target="_blank" href="http://www.wired.com/cloudline/2012/03/death-of-the-cio/">IT Consumerization, the Cloud and the Alleged Death of the CIO</a>:<br /><blockquote>Let me be clear once again: this frequent linking of cloud and IT consumerization to the looming demise of the CIO and IT is not just misguided, but actually gets it completely backwards. In fact, I argue that IT consumerization and the cloud will actually elevate the importance of IT within a company, as both a service and a strategic focus.<br /><br />Let’s list and then discuss some of the ways that combining these memes (IT consumerization, cloud, and the ensuing heralded death of the CIO) falls down when measured against common sense and reality:<br /><br />It fails to understand the full range of what a CIO (or IT) actually provides for modern-day companies.<br />It fails to recognize the profound pitfalls of a decentralized and fragmented approach for company systems and technologies.<br />It erroneously equates IT consumerization with the BYOD trend, missing the larger important picture that underscores the strategic need for IT.<br />It misunderstands the interplay of commoditization and competitive strategic advantage.</blockquote><br />Writing in "Wired Cloudline sponsored by IBM."<br /><br /><br />Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-69708831115344277112012-03-17T14:19:00.001-07:002012-03-17T14:19:15.535-07:00IT is hard enough already - why do things you don't need to?<a href="http://www.infoworld.com/d/mobile-technology/worried-about-4g-data-costs-heres-simple-solution-188319?page=0,0">Galen Gruman in Infoworld</a>:<br /><br /><blockquote>I don't get why IT itself takes on so many management challenges unrelated to technology operations or strategy.</blockquote><br /><br />Yes, it's not a good use of limited resources. But I don't think the problem of taking on things that don't need to be done is unique to IT. <br /><br />Looking at IT for an answer to this is misplaced; instead, I'd start by looking at psychology, both organizational and individual.<br />Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-57621264163793158362012-03-17T02:05:00.001-07:002012-03-17T02:05:41.434-07:00Close Encounters of the Collaborative KindGood article in this month's IEEE Computer magazine, <a target="_blank" href="http://www.computer.org/csdl/mags/co/2012/03/mco2012030024-abs.html">Close Encounters of the Collaborative Kind</a>:<br /><blockquote>The participants in a collaborative interdisciplinary project found that developing a shared, project-specific communication style helped them overcome cultural barriers, understand the nuances of each other's work, and enhance the accuracy, interpretability, and utility of their models.</blockquote><br /><br />Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-67936613746721612342012-02-29T00:19:00.000-08:002012-02-29T00:27:13.846-08:00Taming Complexity and Tesler's LawI always have a good think when I read <a href="http://jnd.org/">Don Norman</a>. Just started reading his <a href="http://www.jnd.org/books/living-with-complexity.html">Living with Complexity</a> and it's holding true to form. It's worth reading the whole book just to be reminded of Tesler's Law.<br /><div class="separator" style="clear: both; text-align: center;"><a href="http://www.jnd.org/books/living-with-complexity.html" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="200" src="http://www.jnd.org/images/lwc_large.jpg" width="134" /></a></div><blockquote class="tr_bq">Complexity can be tamed, but it requires considerable effort to do it well. Decreasing the number of buttons and displays is not the solution. The solution is to understand the total system, to design it in a way that allows all the pieces fit nicely together, so that initial learning as well as usage are both optimal. Years ago, Larry Tesler, then a vice president of Apple, argued that the total complexity of a system is a constant: as you make the person's interaction simpler, the hidden complexity behind the scenes increases. Make one part of the system simpler, said Tesler, and the rest of the system gets more complex. This principle is known today as <b>Tesler's law of the conservation of complexity.</b> Tesler described it as a tradeoff: making things easier for the user means making it more difficult for the designer or engineer. <b>“Every application has an inherent amount of irreducible complexity. The only question is who wil have to deal with it, the user or the developer.”</b> (<a href="http://www.designingforinteraction.com/tesler.html">Tesler and Saffer, 2007</a>) With technology, simplifications at the level of usage invariably result in added complexity of the underlying mechanism.</blockquote>If you are a Don Norman newbie, start with <a href="http://www.amazon.com/Design-Everyday-Things-Donald-Norman/dp/0465067107">The Design of Everyday Things</a>, that's a classic. I liked the first edition's title better, Psychology of Everyday Things. He called it POET for short.<br /><div class="separator" style="clear: both; text-align: center;"><a href="http://www.amazon.com/Design-Everyday-Things-Donald-Norman/dp/0465067107" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" src="http://books.google.com/books?id=w8pM72p_dpoC&printsec=frontcover&img=1&zoom=1&l=220" /></a></div><br />I also just read an article Don wrote for core77: <a href="http://www.core77.com/blog/columns/act_first_do_the_research_later_20051.asp">Act First, Do the Research Later</a>, where he demonstrates that pragmatism matters, and there are many paths to good design.<br /><blockquote class="tr_bq">Today we teach the importance of doing design research first, then going through a period of ideation, prototyping and iterative refinement. Lots of us like this method. I do. I teach it. But this makes no sense when practical reality dictates that we do otherwise. If there is never enough time to start with research, then why do we preach such an impractical method? We need to adjust our methods to reality, not to some highfalutin, elegant theory that only applies in the perfect world of academic dreams. We should develop alternative strategies for design.</blockquote><blockquote class="tr_bq"><b>Why it is not necessary to start with design research: </b>Here are five very different arguments to support the practical reality of starting by designing, not through design research. First, the existence of good design that was not preceded by research. Second, the argument that experienced designers already have acquired the knowledge that would come from research. Third, the research effort of a company ought to be continually ongoing, so that results are available instantly. Fourth, and most controversial, research might inhibit creativity. And fifth, when the product is launched and the team assembled, it is already too late. </blockquote>That's particularly fun given that I'm taking a course right now which is all about design research. I do enjoy holding two opposed ideas in my head at the same time. (No one should think F. Scott Fitzgerald was literally setting this as a true, singular test of a first-rate intellect; it's a necessary quality, but not sufficient on its own.)<br /><br />Hey! I just found <a href="http://en.wikiquote.org/wiki/F._Scott_Fitzgerald">the whole quote</a>, and there's two more sentences to it that I've not seen before.<br /><blockquote class="tr_bq">Before I go on with this short history, let me make a general observation – the test of a first-rate intelligence is the ability to hold two opposed ideas in the mind at the same time, and still retain the ability to function. <b>One should, for example, be able to see that things are hopeless and yet be determined to make them otherwise. </b>This philosophy fitted on to my early adult life, when I saw the improbable, the implausible, often the "impossible," come true.</blockquote>Seeing that things are hopeless and yet being determined to make them otherwise. Yup. That's worth doing.<br /><br />If you want to investigate more about reconciling opposing ideas, I suggest <a href="http://rogerlmartin.com/library/books/the-opposable-mind/">The Opposable Mind</a>.<br /><div class="separator" style="clear: both; text-align: center;"><a href="http://rogerlmartin.com/library/books/the-opposable-mind/" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="200" src="http://rogerlmartin.com/wp-content/uploads/2009/10/book_opposable_mind.jpg" width="143" /></a></div><br />Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-46060021861260067132012-02-26T00:15:00.001-08:002012-02-26T00:28:46.032-08:00Jamming for Joy with Jaco<br />Watching this is bringing me joy.<br /><br />Jaco Pastorius is one of my favorite musicians; but I never saw him play live before his untimely death in '87. In fact, I've never even seen video of him playing. Until tonight.<br /><br />I'm watching him play <a href="http://movies.netflix.com/WiMovie/Jaco_Pastorius_Live_and_Outrageous/">Montreaux '82 with Randy Brecker</a>. Streaming on Netflix, natch.<br /><div class="separator" style="clear: both; text-align: center;"><a href="http://movies.netflix.com/WiMovie/Jaco_Pastorius_Live_and_Outrageous/" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" src="http://cdn-7.nflximg.com/en_us/boxshots/gsd/70061897.jpg" /></a></div><br />You might know Jaco as the bass player on several of Joni Mitchell's albums, like <a href="http://en.wikipedia.org/wiki/Hejira_(album)">Hejira</a> (the one with Coyote on it).<br /><div class="separator" style="clear: both; text-align: center;"><a href="http://en.wikipedia.org/wiki/Hejira_(album)" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="195" src="http://upload.wikimedia.org/wikipedia/en/9/9e/Hejira_cover.jpg" width="200" /></a></div><br />He also played on several of Pat Metheny's best albums like his debut, <a href="http://en.wikipedia.org/wiki/Bright_Size_Life">Bright Size Life</a>, which some say is <a href="http://100greatestjazzalbums.blogspot.com/2008/12/bright-size-life-pat-metheny-ecm.html">one of the 100 Greatest Jazz albums of all time</a>.<br /><div class="separator" style="clear: both; text-align: center;"><a href="http://en.wikipedia.org/wiki/Bright_Size_Life" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="199" src="http://upload.wikimedia.org/wikipedia/en/0/0e/Pat_Metheny_-_Bright_Size_Life.jpg" width="200" /></a></div><br />Jaco was a member of Weather Report with Wayne Shorter and Joe Zawinul - listen to Birdland on <a href="http://en.wikipedia.org/wiki/Heavy_Weather_(album)">Heavy Weather</a>.<br /><div class="separator" style="clear: both; text-align: center;"><a href="http://en.wikipedia.org/wiki/Heavy_Weather_(album)" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="200" src="http://upload.wikimedia.org/wikipedia/en/6/66/Weather_Report-Heavy_Weather.jpg" width="198" /></a></div><br /><a href="http://draft.blogger.com/"></a><br />Finally check out his masterpiece, <a href="http://en.wikipedia.org/wiki/Word_of_Mouth_(Jaco_Pastorius_album)">Word of Mouth</a>, with an all-star big band of fusion jazz greats, from Herbie Hancock to Toots Thielman and Jack DeJohnette. I rank it with Sergeant Pepper and Uh-huh as one of my personal favorite albums.<br /><div class="separator" style="clear: both; text-align: center;"><a href="http://en.wikipedia.org/wiki/Word_of_Mouth_(Jaco_Pastorius_album)" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="198" src="http://upload.wikimedia.org/wikipedia/en/0/0d/Jacowordofmouth.jpg" width="200" /></a></div><br /><br />Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-32619327879692639562012-02-19T17:02:00.000-08:002012-02-19T17:15:23.733-08:00Business metrics as solution requirementsIn my day job, my team has started using a few old-school tools in our infrastructure architecture practice. One of these is <a href="http://www.isixsigma.com/tools-templates/qfd-house-of-quality/qfd-when-and-how-does-it-fit-software-development/">Quality Function Deployment</a> (aka QFD, aka House of Quality) which has its roots in Six Sigma manufacturing quality practices.<br /><table align="center" cellpadding="0" cellspacing="0" class="tr-caption-container" style="margin-left: auto; margin-right: auto; text-align: center;"><tbody><tr><td style="text-align: center;"><a href="http://www.isixsigma.com/tools-templates/qfd-house-of-quality/qfd-when-and-how-does-it-fit-software-development/" imageanchor="1" style="margin-left: auto; margin-right: auto;"><img border="0" height="320" src="http://www.isixsigma.com/wp-content/uploads/images/stories/migrated/graphics/179a.gif" width="266" /></a></td></tr><tr><td class="tr-caption" style="text-align: center;">QFD House of Quality graphic from iSixSigma.com</td></tr></tbody></table>While looking for a bit of information, I stumbled across an article titled “<a href="http://www.strategyn.com/resources/white-papers/retiring-house-quality/">Retiring the House of Quality</a>.” Since we're just beginning to use QFD, I wanted to see what the problem was. Turns out the article wasn't critiquing QFD itself, but the (mis)use of QFD in “innovation processes.” <br /><br />The article ties into many of the themes we’re investigating in my current <a href="https://uw.instructure.com/courses/201073/assignments/syllabus">graduate school class on Evidence-Based Design</a> (aka Human-Centered Design or <a href="http://www.userfocus.co.uk/pdf/fable.pdf">User-Centered Design</a>).<br /><br />I liked the distinction made between concept innovation and technical innovation; I found that quite useful.<br /><table align="center" cellpadding="0" cellspacing="0" class="tr-caption-container" style="margin-left: auto; margin-right: auto; text-align: center;"><tbody><tr><td style="text-align: center;"><a href="http://3.bp.blogspot.com/-hSwdJlfnrds/T0GZGZTKzAI/AAAAAAAACdA/Ws6KdxRyf4U/s1600/Screen+shot+2012-02-19+at+4.50.46+PM.png" imageanchor="1" style="margin-left: auto; margin-right: auto;"><img border="0" height="213" src="http://3.bp.blogspot.com/-hSwdJlfnrds/T0GZGZTKzAI/AAAAAAAACdA/Ws6KdxRyf4U/s320/Screen+shot+2012-02-19+at+4.50.46+PM.png" width="320" /></a></td></tr><tr><td class="tr-caption" style="text-align: center;">Distinguishing initial concept innovation from downstream technical innovation - from Retiring the House of Quality</td></tr></tbody></table>But more importantly, I really appreciated the reframing around requirements where there were existing business processes with defined success metrics.<br /><br />Consider the traditional approach of assuming that the technical solution team can identify certain technical requirements for the solution, and assuming that what is built meets those solution requirements are met, then the solution will address the business problem.<br /><br />Instead of that approach, the authors suggest <b>having the existing business process success metrics directly become the solution requirements</b>.<br /><br /><blockquote class="tr_bq">The outcome-driven innovation methodology uses customer-defined metrics (desired outcome statements) to guide the formulation, evaluation, and selection of new product and service concepts. The resulting concepts are tied directly to the customer’s desired outcomes—and the job the customer is trying to get done—increasing the likelihood that the customer will value the new concepts’ features. Because the inputs used to guide concept innovation are tied directly to the customer’s actual inputs, no translation is required.</blockquote><br />Taking the business process requirements as the solution requirements rather than having to invent intermediate solution requirements is a great insight.<br /><br />Literally, this is <a href="http://en.wikipedia.org/wiki/Disintermediation">disintermediation</a>, but instead of disintermediating two parties by removing a middleman, it disintermediates a set of, well, intermediate requirements.<br /><br />And because its exactly in that translation process of generating the intermediate requirements where technical solutions go wrong so often, it looks very promising for improving overall business satisfaction with solutions.Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-53178955168757513342012-02-19T16:26:00.000-08:002012-02-19T16:28:23.058-08:00If you teach people, they have this miraculous capability...<span class="Apple-style-span" style="-webkit-tap-highlight-color: rgba(26, 26, 26, 0.292969); font-size: medium;">I greatly enjoyed reading <a href="http://architectureforhumanity.org/">Architecture for Humanity</a>'s book <i><a href="http://designlikeyougiveadamn.architectureforhumanity.org/">Design Like You Give A Damn</a>. </i>It is full of wonderful, creative responses to hairy problems, often with incredible design constraints and stakes of life and death.<i> </i></span><br /><span class="Apple-style-span" style="-webkit-tap-highlight-color: rgba(26, 26, 26, 0.292969); font-size: medium;"></span><br /><div style="font-size: medium;"><span class="Apple-style-span" style="-webkit-tap-highlight-color: rgba(26, 26, 26, 0.292969); font-size: medium;"><span class="Apple-style-span" style="-webkit-tap-highlight-color: rgba(26, 26, 26, 0.292969); font-size: medium;">One of my favorite lines was this quote from Maurice Cox:</span></span></div><blockquote class="tr_bq" style="font-size: medium;"><span class="Apple-style-span" style="-webkit-tap-highlight-color: rgba(26, 26, 26, 0.292969); font-size: medium;"><span class="Apple-style-span" style="-webkit-tap-highlight-color: rgba(26, 26, 26, 0.292969); font-size: medium;">I have come to believe that if you teach people what their options are, they have this miraculous capability to make the decision that is in their best interest. It was amazing to watch this unfold. </span></span></blockquote><span class="Apple-style-span" style="-webkit-tap-highlight-color: rgba(26, 26, 26, 0.292969); font-size: medium;">I liked DLYGAD so much, I added it to my list of <a href="http://www.amazon.com/Architecture-books-for-IT-architects/lm/R2O4CM8HD9QZ5J/ref=cm_lm_byauthor_title_full">(physical) architecture books for IT architects</a>. </span><br /><div style="font-size: medium;"></div><br /><div class="separator" style="clear: both; text-align: center;"><a href="http://ecx.images-amazon.com/images/I/61W3VWY3VGL._SL500_AA300_.jpg" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" src="http://ecx.images-amazon.com/images/I/61W3VWY3VGL._SL500_AA300_.jpg" /></a></div><span style="font-size: medium;">A </span><a href="http://www.amazon.com/Design-Like-You-Give-Damn/dp/0810997029" style="font-size: large;">second volume of DLYGAD is coming out soon</a><span style="font-size: medium;">. I can't wait to read it.</span><br /><div><div></div></div>Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-52373300537573330142011-10-13T08:37:00.000-07:002012-02-20T01:24:11.583-08:00Technical DebtI saw a great Steve McConnell (author of the crucial book <a href="http://www.amazon.com/Code-Complete-Practical-Handbook-Construction/dp/0735619670">Code Complete</a>) webcast on Technical Debt and wanted to get these links published: <strike><a href="http://forums.construx.com/blogs/stevemcc/archive/2007/11/01/technical-debt-2.aspx">blog post</a>, <a href="https://event.on24.com/eventRegistration/EventLobbyServlet?target=registration.jsp&eventid=347946&sessionid=1&key=906C459BBBF4F99D80792A52857B7F8A&sourcepage=register">webcast replay</a>. The webcast replay has a link to a slide deck you can download - just register for the webcast.</strike> Highly recommended. Here's Steve's opening blurb: <br /><blockquote>The term technical debt was coined by Ward Cunningham to describe the obligation that a software organization incurs when it chooses a design or construction approach that's expedient in the short term but that increases complexity and is more costly in the long term. Ward didn't develop the metaphor in very much depth. The few other people who have discussed technical debt seem to use the metaphor mainly to communicate the concept to technical staff. I agree that it's a useful metaphor for communicating with technical staff, but I'm more interested in the metaphor's incredibly rich ability to explain a critical technical concept to non-technical project stakeholders.</blockquote><div class="separator" style="clear: both; text-align: center;"><a href="https://event.on24.com/eventRegistration/EventLobbyServlet?target=registration.jsp&eventid=347946&sessionid=1&key=906C459BBBF4F99D80792A52857B7F8A&sourcepage=register" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="302" src="http://2.bp.blogspot.com/-rEp-SUP4sXU/TpcFsycJLRI/AAAAAAAACbA/W7MGBcfAK3c/s400/Screen%2Bshot%2B2011-10-13%2Bat%2B8.36.28%2BAM.png" width="400" /></a></div><div class="separator" style="clear: both; text-align: center;"><br /></div><div class="separator" style="clear: both; text-align: center;"><br /></div><div class="separator" style="clear: both; text-align: left;"><span style="text-align: -webkit-auto;">Update Feb 20 2012: the webcast replay links above no longer work, but Construx has posted the webcast on YouTube. </span></div><br /><iframe allowfullscreen="" frameborder="0" height="315" src="http://www.youtube.com/embed/lEKvzEyNtbk" width="420"></iframe>And they posted the slides on SlideShare: <br /><div id="__ss_9450187" style="width: 425px;"><strong style="display: block; margin: 12px 0 4px;"><a href="http://www.slideshare.net/construx_software/managing-technical-debt" target="_blank" title="Managing Technical Debt">Managing Technical Debt</a></strong> <iframe frameborder="0" height="355" marginheight="0" marginwidth="0" scrolling="no" src="http://www.slideshare.net/slideshow/embed_code/9450187" width="425"></iframe> <br /><div style="padding: 5px 0 12px;">Last but not least, Construx has the same content <a href="http://www.construx.com/File.ashx?cid=2797">in whitepaper form</a>.</div></div>Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-81990670094581396082011-10-08T16:06:00.000-07:002011-10-08T16:06:26.022-07:00#OccupySesameStreet<div class="separator" style="clear: both; text-align: center;"><a href="http://1.bp.blogspot.com/-GFWoa9fYHSc/TpDXMX_pVVI/AAAAAAAACa4/z2G_8WhZxnU/s1600/99%2525cookiemonster.png" imageanchor="1" style="clear:left; float:left;margin-right:1em; margin-bottom:1em"><img border="0" height="312" width="400" src="http://1.bp.blogspot.com/-GFWoa9fYHSc/TpDXMX_pVVI/AAAAAAAACa4/z2G_8WhZxnU/s400/99%2525cookiemonster.png" /></a></div> 99% of da wurldz cookeez r eatn by 1% of da wurldz monsterz. OM NOM NOM NOM. Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-22157807609203499212011-10-08T00:12:00.000-07:002011-10-08T00:21:05.781-07:00Learn to be a better troubleshooter<span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif;"><br /></span><br /><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif; line-height: 17px;">The very best technical talents often have massive troubleshooting chops. But troubleshooting isn't inherently a technical skill; it's a set of tools to achieve clear thinking and knowledge. </span><br /><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif; line-height: 17px;"><br /></span><br /><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif; line-height: 17px;">This is science!</span><br /><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif; line-height: 17px;"><br /></span><br /><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif; line-height: 17px;">For your consideration: the clearest expositions of technical troubleshooting strategies and tactics since <a href="http://www.google.com/webhp?q=sun+tzu+art+of+war">Sun Tzu did it for war</a>.</span><br /><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif; line-height: 17px;"><br /></span><br /><span class="Apple-style-span" style="font-family: 'Trebuchet MS', sans-serif;"><span class="Apple-style-span" style="; line-height: 17px;">In no particular order, here are links and a few choice excerpts.</span></span><br /><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif; line-height: 17px;"><br /></span><br /><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif; line-height: 17px;">ESR, the <a href="http://xkcd.com/225/">ninja-slicing</a>, <a href="http://www.gnu.org/gnu/manifesto.html">recursive-software-naming, Free Software advocate</a> who is a key figure in the culture of open-source, wrote one of the foundational documents of hackerdom. As of this writing, it's at version 3.7, last updated December 2010. The beauty of it is, in telling you how to ask questions the smart way, it also teaches you troubleshooting. </span><br /><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif; line-height: 17px;"><br /></span><br /><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif;"><br /></span><br /><div><blockquote><a href="http://catb.org/~esr/faqs/smart-questions.html"><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif;">How To Ask Questions The Smart Way</span></a><br /><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif;"><span class="firstname">Eric</span> <span class="othername">Steven</span> <span class="surname">Raymond</span></span><br /><ul><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;"><li>Be precise and informative about your problem</li><li>Describe the symptoms of your problem or bug carefully and clearly.</li><li>Describe the environment in which it occurs (machine, OS, application, whatever). Provide your vendor's distribution and release level (e.g.: <span class="quote">“<span class="quote">Fedora Core 7</span>â€</span>, <span class="quote">“<span class="quote">Slackware 9.1</span>â€</span>, etc.).</li><li>Describe the research you did to try and understand the problem before you asked the question.</li><li>Describe the diagnostic steps you took to try and pin down the problem yourself before you asked the question.</li><li>Describe any possibly relevant recent changes in your computer or software configuration.</li><li>If at all possible, provide a way to <span class="emphasis"><em>reproduce the problem in a controlled environment</em></span>.</li></span></ul><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif;"><span class="surname"></span>Do the best you can to anticipate the questions a hacker will ask, and answer them in advance in your request for help. </span></blockquote><blockquote><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif;">Giving hackers the ability to reproduce the problem in a controlled environment is especially important if you are reporting something you think is a bug in code. When you do this, your odds of getting a useful answer and the speed with which you are likely to get that answer both improve tremendously.</span></blockquote></div><div><div class="author"><div><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;"><br /></span><br /><div><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;">ESR also says: </span></div><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;"><br /></span><br /><blockquote><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;">Simon Tatham has written an excellent essay entitled <a class="ulink" href="http://www.chiark.greenend.org.uk/~sgtatham/bugs.html" target="_top">How to Report Bugs Effectively</a>. I strongly recommend that you read it.</span></blockquote><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;"></span><br /><div><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;">I agree! <a href="http://www.chiark.greenend.org.uk/~sgtatham/bugs.html">Check it out</a>:</span></div><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;"></span><br /><blockquote><ul><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;"><li>The first aim of a bug report is to let the programmer see the failure with their own eyes. If you can't be with them to make it fail in front of them, give them detailed instructions so that they can make it fail for themselves.</li></span></ul><ul><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;"><li>In case the first aim doesn't succeed, and the programmer <em>can't</em> see it failing themselves, the second aim of a bug report is to describe what went wrong. Describe everything in detail. State what you saw, and also state what you expected to see. Write down the error messages, <em>especially</em> if they have numbers in.</li></span></ul><ul><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;"><li>When your computer does something unexpected, <em>freeze</em>. Do nothing until you're calm, and don't do anything that you think might be dangerous.</li></span></ul><ul><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;"><li>By all means try to diagnose the fault yourself if you think you can, but if you do, you should still report the symptoms as well.</li></span></ul><ul><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;"><li>Be ready to provide extra information if the programmer needs it. If they didn't need it, they wouldn't be asking for it. They aren't being deliberately awkward. Have version numbers at your fingertips, because they will probably be needed.</li></span></ul><ul><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;"><li>Write clearly. Say what you mean, and make sure it can't be misinterpreted.</li></span></ul><ul><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;"><li>Above all, <em>be precise</em>. Programmers like precision.</li></span></ul></blockquote><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;"></span><br /><div><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;">But the first place I send people when I want them to understand what I'd like to get as a good bug report is <a href="http://www.joelonsoftware.com/AboutMe.html">Joel Spolsky</a>'s story of <a href="http://www.joelonsoftware.com/articles/fog0000000029.html">Jane, the very, very good software tester</a>.<span class="Apple-style-span"> </span></span></div><span class="surname" style="; font-family: 'Trebuchet MS', sans-serif;"><div><span class="Apple-style-span"></span><br /><blockquote>It's pretty easy to remember the rule for a good bug report. <b style="font-weight: bold;">Every good bug report needs exactly three things.</b></blockquote><blockquote><ol style="line-height: 23px; margin-bottom: 1em; margin-top: 0px;"><li>Steps to reproduce,</li><li>What you expected to see, and</li><li>What you saw instead.</li></ol>Seems easy, right? Maybe not. As a programmer, people regularly assign me bugs where they left out one piece or another.<br />If you don't tell me how to repro the bug, I probably will have no idea what you are talking about. "The program crashed and left a smelly turd-like object on the desk." That's nice, honey. I can't do anything about it unless you tell me <i>what you were doing</i>.</blockquote><span class="Apple-style-span"></span><br /><blockquote><span class="Apple-style-span">If you don't specify <i>what you expected to see</i>, I may not understand why this is a bug. The splash screen has blood on it. So what? I cut my fingers when I was coding it. What did you expect? Ah, you say that the spec required <i>no blood</i>! Now I understand why you consider this a bug.</span><br /><span class="Apple-style-span">Part three. <i>What you saw instead.</i> If you don't tell me this, I don't know what the bug is. That one is kind of obvious.</span></blockquote><span class="Apple-style-span"></span><br /><div class="separator" style="clear: both; text-align: left;"><span class="Apple-style-span">Check out this book: <a href="http://www.amazon.com/Are-Your-Lights-Figure-Problem/dp/0932633161">Are Your Lights On: How to find out what the problem <i>really</i> is</a>, by Gause and Weinberg. They <a href="http://www.amazon.com/Exploring-Requirements-Quality-Before-Design/dp/0932633137">wrote the book</a> on requirements, too. </span></div><div class="separator" style="clear: both; text-align: center;"><br /></div><div class="separator" style="clear: both; text-align: center;"><a href="http://ecx.images-amazon.com/images/I/518RFH9TYYL._SL500_AA300_.jpg" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" src="http://ecx.images-amazon.com/images/I/518RFH9TYYL._SL500_AA300_.jpg" /></a></div><div class="separator" style="clear: both; text-align: center;"><br /></div><span class="Apple-style-span"><br /></span></div><div><span class="Apple-style-span">Here's some random guy's 2 minute video review of it: </span><br /><span class="Apple-style-span"><br /></span></div><iframe allowfullscreen="" frameborder="0" height="315" src="http://www.youtube.com/embed/XgC3OkJhdXc" width="420"></iframe><div><br /></div><div><br /><span class="Apple-style-span" style="line-height: 17px;"><a href="http://support.microsoft.com/kb/555375">KB555375</a> might be Microsoft's best KB article of all time - but by all means, if you know a better one, say so in the comments.</span></div></span></div></div></div><span class="Apple-style-span" style=";"><span class="Apple-style-span" style="font-family: 'Trebuchet MS', sans-serif;"></span></span><br /><div class="articleProperty" style="color: #999999; margin-bottom: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; padding-bottom: 2px; padding-left: 2px; padding-right: 2px; padding-top: 2px;"><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif;"><br /></span></div><blockquote><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif;">Microsoft Support Knowledgebase Article ID: 555375 - Last Review: July 22, 2005 - Revision: 1.0</span><br /><span class="Apple-style-span" style=";"><span class="Apple-style-span" style="font-family: 'Trebuchet MS', sans-serif;"><a href="http://support.microsoft.com/kb/555375">How to ask a question</a></span> </span></blockquote><blockquote><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif;"><span class="label" style="font-weight: bold;">Author:</span> <span class="text">Daniel Petri MVP</span></span><br /><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif;"><span class="Apple-style-span" style="line-height: 17px;">Good examples of questions will include information from most of the following categories:</span><span class="Apple-style-span" style="line-height: 17px;"> </span><span class="Apple-style-span" style="line-height: 17px;">- What are you trying to do?</span><span class="Apple-style-span" style="line-height: 17px;">- Why are you trying to do it?</span><span class="Apple-style-span" style="line-height: 17px;">- What did you try already, why, and what was the result of your actions?</span><span class="Apple-style-span" style="line-height: 17px;">- What was the exact error message that you received?</span><span class="Apple-style-span" style="line-height: 17px;">- How long have you been experiencing this problem?</span><span class="Apple-style-span" style="line-height: 17px;">- Have you searched the relevant forum/newsgroup archives?</span><span class="Apple-style-span" style="line-height: 17px;">- Have you searched for any tools or KB articles or any other resources?</span><span class="Apple-style-span" style="line-height: 17px;">- Have you recently installed or uninstalled any software or hardware?</span><span class="Apple-style-span" style="line-height: 17px;">- What changes were made to the system between the time everything last worked and when you noticed the problem?</span><span class="Apple-style-span" style="line-height: 17px;"> </span><span class="Apple-style-span" style="line-height: 17px;">Don't let us assume, tell us right at the beginning.</span></span></blockquote><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif;">In fact, if you know of ANY other top-notch sources of troubleshooting wisdom, put a link in the comments!</span><br /><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif;"><br /></span><br /><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif;">There's one I'm trying to find that I had as a mousepad - it was about 10 troubleshooting tips - one of them was something like "Problems don't just go away on their own. If you haven't fixed the problem, the problem isn't fixed." Anybody know what that's from?</span><br /><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif;"><br /></span><br /><span class="Apple-style-span" style="; font-family: 'Trebuchet MS', sans-serif;">(I'll try to fix the formatting on this post later, ok?)</span><br /><span class="Apple-style-span" style="font-family: 'Trebuchet MS', sans-serif;"><span class="Apple-style-span" style="line-height: 17px;"><br /></span></span>Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-59536575791763603942011-09-02T01:12:00.000-07:002011-09-02T01:12:35.745-07:00Client software installation methods as children's toysHey, kids - it's time for everyone's favorite IT game: torture the analogy! Ready to play? Yay!<br /><br />Imagine you get a brand-new employer-issued, Windows computer. It's fresh and pristine, and working great. It's got Office, and a web browser (well, let's be honest - it has Internet Explorer). It can do basic stuff.<br /><br />But it doesn't have the software you need to do the parts of your job that make it different from every other job that involves sitting in front of a computer.<br /><br /><a href="http://www.beinteriordecorator.com/wp-content/uploads/2011/03/white-interior-so-beautiful-bedroom-with-white-carpet-with-a-pillow-and-a-pink-chair.jpg" imageanchor="1" style="clear: right; float: right; margin-bottom: 1em; margin-left: 1em;"><img border="0" height="240" src="http://www.beinteriordecorator.com/wp-content/uploads/2011/03/white-interior-so-beautiful-bedroom-with-white-carpet-with-a-pillow-and-a-pink-chair.jpg" width="320" /></a>You've got to put that software on top of your fresh, pristine computer.<br /><br />It's like a little kid in a room that's white from the shag carpet to the velour wallpaper.<br /><br />Think of the different ways you can get your software on this computer as different toys that kid could have in their hand.<br /><br /><br /><br /><br /><br />Manual install from media or download from vendor : marker<br /><br /><div class="separator" style="clear: both; text-align: center;"><a href="http://www.westfield.ma.edu/personalpages/draker/edcom/final/sp10/sectiona/hightide/markers.jpg" imageanchor="1" style="clear: left; float: left; margin-bottom: 1em; margin-right: 1em;"><img border="0" height="200" src="http://www.westfield.ma.edu/personalpages/draker/edcom/final/sp10/sectiona/hightide/markers.jpg" width="200" /></a></div><br /><br /><br /><br /><br /><br /><div class="separator" style="clear: both; text-align: center;"><br /></div>Packaged installers (automated install) : pencil<br /><br /><div class="separator" style="clear: both; text-align: center;"></div><div class="separator" style="clear: both; text-align: center;"><a href="http://www.westhillgolfcourse.com/images/pencil.jpg" imageanchor="1" style="clear: left; float: left; margin-bottom: 1em; margin-right: 1em;"><img border="0" height="200" src="http://www.westhillgolfcourse.com/images/pencil.jpg" width="200" /></a></div><br /><br /><br /><br /><br /><br /><br /><br /><br /><br /><br /><br /><br />Terminal Services / Citrix XenApp (née Metaframe) : ViewMaster<br /><br /><div class="separator" style="clear: both; text-align: center;"><a href="http://www.3dimages.co.uk/gallery/d/862-2/ViewMaster_red_with_reel.jpg" imageanchor="1" style="clear: left; float: left; margin-bottom: 1em; margin-right: 1em;"><img border="0" height="200" src="http://www.3dimages.co.uk/gallery/d/862-2/ViewMaster_red_with_reel.jpg" width="200" /></a></div><br /><br /><br /><br /><br /><br /><br /><br /><br /><br /><br /><br /><br />App-V / Thinstall (app isolation) : Colorforms <br /><br /><div class="separator" style="clear: both; text-align: center;"><a href="http://en.wikipedia.org/wiki/Colorforms" imageanchor="1" style="clear: left; float: left; margin-bottom: 1em; margin-right: 1em;"><img border="0" height="188" src="http://www.alphamom.com/legacy/holiday/holiday_colorforms.jpg" width="200" /></a></div><br /><br /><br /><br /><br /><br /><br /><br /><br /><br /><br /><br />I always did like Colorforms.Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-54930481156123104592011-08-12T21:18:00.000-07:002011-08-12T21:37:49.340-07:00An incomplete history of source code version control from SCCS to MercurialOnce upon a time, in the 1970s, there was <a href="http://en.wikipedia.org/wiki/Source_Code_Control_System">SCCS</a>. It was big on PDP-11's and the like.<br /><br />Then came <a href="http://en.wikipedia.org/wiki/Revision_Control_System">RCS</a>, which could do version control for individual files, but not for entire projects.<br /><br />Finally, <a href="http://en.wikipedia.org/wiki/Concurrent_Versions_System">CVS</a> arrived in the 1980s and people said "ok, finally we have something that can be credibly called source code version control."<br /><br />And people used CVS for a good long while. And it was <i>way</i> better than not having version control.<br /><br />But there were some problems.<br /><br />Turns out that giving multiple people the ability to travel through time and alter the history of incredibly complicated documents with complex interdepencies can have a few wrinkles to it. Who woulda thunk it?<br /><br />So, once we all survived Y2k, <a href="http://en.wikipedia.org/wiki/Subversion_(software)">SVN</a> was created, to be pretty much just like CVS, but working correctly.<br /><br />Whole teams could work on projects, and fork, and branch, and all sorts of lovely things, all out of a central repository. A rich ecosystem built on SVN; IDEs integrated SVN functionality; issue tracking systems linked in so that commit messages could update the status of bugs; and vice versa. And not only is it well understood how to operate the software, even the business processes around code management using SVN are well understood and documented - for example, a <a href="http://pragprog.com/book/svn2/pragmatic-version-control-using-subversion">very pragmatic book</a> about it. <br /><br />And that went pretty darned well for a good long while. Talk about mature!<br /><br /><div>But then Linus came along and started an open source project with thousands of contributors all around the world. Mind-bogglingly large scaling issues here. In fact, it had to be distributed - there couldn't be a single central store. And this just exceeded SVN's capabilities. </div><div><br />So Linus created <a href="http://en.wikipedia.org/wiki/Git_(software)">G</a>it. And lo, Git is mighty. It can handle just about everything you can imagine. It's used by nearly everyone who operates at that scale, and all the open-source hackers who want free hosting at places like <a href="http://code.google.com/hosting/">Google Code</a> and <a href="https://github.com/">Github</a>. The best practices are mature.<br /><br />So, here's the state of play these days:<br /><br />SCCS and RCS are legacy software, like COBOL - still plays a valuable role, but generally not chosen for any new implementations.<br /><br />There are old CVS implementations out there, often cursed at by the poor programmers who haven't been able to convince their management to upgrade to SVN. CVS is kind of the Internet Explorer 6 of version control systems these days.<br /><br />Most enterprises have at least SVN (or some commercial equivalents, like the version control built into Visual Studio) and it's hard to think of an IDE with version control support that doesn't support SVN.<br /><br />Many modern IDEs have added native support for GIT; tons of tech companies are using it. Including <a href="http://code.google.com/p/support/wiki/DVCSAnalysis">some folks who are pretty hard-core</a>.<br /><br /></div><div>And there's an <a href="http://doofusdan.blogspot.com/2009/05/great-software-writing-can-be-mercurial.html">incredibly elegant</a> system called <a href="http://en.wikipedia.org/wiki/Mercurial">Mercurial</a> (Hg). Many people like to <a href="http://stackoverflow.com/questions/1598759/git-and-mercurial-compare-and-contrast">compare and contrast Git and Mercurial</a>.<br /><br />So, here we are, with Subversion, Git and Mercurial as obvious choices to select from, whether you're an open source project looking for <a href="http://code.google.com/p/support/wiki/GettingStarted#Working_with_your_Source_Repository">free hosting on Google Code</a>, a one person iPhone developer, or a Fortune 500 company.</div><div><br /></div><div>If you care, here are links to my delicious tags for:</div><div><a href="http://www.delicious.com/fullerbecker/versioncontrol">Version Control</a></div><div><a href="http://www.delicious.com/fullerbecker/subversion">Subversion</a><br /><a href="http://www.delicious.com/fullerbecker/git">Git</a></div><div><a href="http://www.delicious.com/fullerbecker/mercurial">Mercurial</a></div><div><br />(Did you notice I only discussed open source version control systems? Yeah. I said it was incomplete.)</div>Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-80746005588150626092011-08-12T20:26:00.000-07:002011-08-12T20:26:52.041-07:00Architecture & The Book of Five RingsMiyamoto Musashi's The Book of Five Rings is a classic text of the martial arts, written in 17th century Japan. I'm reading <a href="http://www.amazon.com/Book-Five-Rings-Miyamoto-Musashi/dp/1590302486/ref=tmm_mmp_title_0">Thomas Cleary's excellent translation</a>.<br /><br />Cleary argues that Musashi intended his work to apply not just to fighting, but to every endeavor of life. I'm certainly seeing the applicability to IT architecture:<br /><blockquote>The carpenter is used as a metaphor in reference to the notion of a house. We speak of aristocratic houses, military houses, houses of the arts; we speak of a house collapsing or a house continuing; and we speak of such and such a tradition, style, or "house." Since we use the expression "house," therefore, I have employed the way of the master carpenter as a metaphor.</blockquote><blockquote>The world of carpenter is written with characters meaning "great skill" or "master plan." Since the science of martial arts involves great skill and master planning, I am writing about it in terms of comparison with carpentry. </blockquote><blockquote>If you want to learn the science of martial arts, meditate on this book; let the teacher be the needle, let the student be the thread, and practice unremittingly. </blockquote><blockquote><b>Likening the Science of Martial Arts to Carpentry</b></blockquote><blockquote>As the master carpenter is the overall organizer and director of the carpenters, it is the duty of the master carpenter to understand the regulations of the country, find out the iregulations of the locality, and attend ot the regulations of the master carpenter's own establishment. </blockquote><blockquote>The master capenter, knowing the measurements and designs of all sorts of structures, employs people to build houses. In this respect, the master carpenter is the same as the master warrior.</blockquote><blockquote>When sorting out timber for building a house, that which is straight, free from knots, and of good appearance can be used for front pillars. That which has some knots but is straight and strong ca be used for rear pillars. That which is somewhat weak yet has no knots and looks good is variously used for door sills, lintels, doors, and screens. That which is knotted and crookend but nevertheless strong is used thoughtfully in consiration of the strneght of the various members of the house. Then the house will last a long time. </blockquote><blockquote>Even knotted, crooked, and weak timber can be made into scaffolding, and later used for firewood. </blockquote><blockquote>As the master carpenter directs the journeymen, he knows their various levels of skill and gives them appropriate tasks. Some are assigned to the flooring, some to the doors and screens, some to the sills, lintels and ceilings, and so on. He has the unskilled set out floor joists, and gets those even less skilled to carve wedges. When the master carpenter exercises discernment in the assignment of jobs, the work progresses smoothly. </blockquote><blockquote>Efficiency and smooth progress, prudence in all matters, recognizing true courage, recognizing different levels of morale, instilling confidence, and realizing what can and cannot be reasonably expected — such are the matters on the mind of the master carpenter. The principle of martial arts is like this.</blockquote>You can include IT under that metaphor just as easily as martial arts.<br /><blockquote><b>The Science of Martial Arts</b> </blockquote><blockquote>Speaking in terms of carpentry, soldiers sharpen their own tools, make various useful implements, and keep them in their utility boxes. Receiving instructions from a master carpenter, they hew pillars and beams with adzes, shave flors and shelving with planes, even carve openwork and bas relief. Making sure themeasurements are correct, they see to all the necessary tasks in an efficient manner; this is the rule for carpentry. When one has develop practical knowledge of all the skills of the craft, eventually one can become a master carpenter oneself. </blockquote><blockquote>An essential habit for carpenters is to have sharp tools and keep them whetted. Is is up to the carpenter to use these tools masterfully, even making such things as miniature shrines, bookshelves, tables, lamp stands, cutting boards, and pot covers. Being a soldier is like this. This should be given careful reflection. </blockquote><blockquote>Necessary accomplishments of a carpenter are avoiding crookedness, getting joints to fit together, skillful planing, avoiding abrasion, and seeing that there is no subsequent warping. </blockquote><blockquote>If you want to learn this science, then take everything I write to heart and think it over carefully.</blockquote><br />Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-42759909448912235812011-02-25T17:59:00.000-08:002011-02-25T18:00:03.403-08:00Consumerization of Enterprise IT Goes Both WaysLots of talk recently about <a href="http://www.itworld.com/it-managementstrategy/138185/consumerization-it-good-bad-or-just-way-things-are-now">the consumerization of IT</a> and <a href="http://37signals.com/svn/posts/2785-the-end-of-the-it-department">the end of the IT department</a>.<br /><br />I am wrapping up two launches of consumerized IT services in the enterprise right now, and have been talking about this professionally for <a href="http://www.gartner.com/press_releases/asset_138285_11.html">years</a>. Here's what I have to tell you about it:<br /><br />It goes both ways.<br /><br />If you want to consumerize enterprise IT, your enterprise has to act like a retail consumer.<br /><br />The product works the way it works, and that’s that. You can complain about it on Twitter, but you’re not going to have it change features and functionality to suit your every whim - or even to meet mandatory business requirements.<br /><br />It is what it is. If you can live with that, you can have it!<br /><br />The problem comes when enterprises can’t live with that. They DO have mandatory requirements, and the consumer stuff (and many enterprise COTS packages) just doesn’t meet them out of the box.<br /><br />If such enterprises want to consumerize their IT services, then they are going to have to either accept not meeting their requirements for every system, or change their policies to match what is achievable off-the-shelf.<br /><br />In the meantime, their employees are <a href="http://www.amazon.com/gp/product/159184357X?ie=UTF8&tag=wwwhackingwor-20&linkCode=as2&camp=1789&creative=9325&creativeASIN=159184357X">hacking work</a>.Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-88347178965091257962010-11-08T01:03:00.000-08:002010-11-08T08:22:34.851-08:00How to easily load and read .CBR files from your computer onto your iPadInstall <a href="http://itunes.apple.com/us/app/stanza/id284956128?mt=8">Stanza</a> and <a href="http://itunes.apple.com/us/app/dropbox/id327630330?mt=8">Dropbox</a> on your iPad. Set up a free Dropbox account.<br /><br />Upload the .CBR to your Dropbox folder from your computer.<br /><br />Open it in Dropbox app on your iPad. Dropbox will say it can't display the file, never fear.<br /><br />Do "Open in Stanza." (This takes a minute or two. It's still quicker than other methods.)<br /><br />Done.<br /><br />Yes, there are other ways to do it (copy through iTunes, use Stanza's server, etc) but this is quick and easy, even for non-geeks.Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-55995926276862561872009-09-09T12:38:00.001-07:002009-09-09T12:38:18.963-07:00Me, side-by-side with Douglas Adams<div style="float: right; margin-left: 10px; margin-bottom: 10px;"><a href="http://www.flickr.com/photos/76217291@N00/3904827012/" title="photo sharing"><img src="http://farm3.static.flickr.com/2648/3904827012_14027cdbe8_m.jpg" alt="" style="border: solid 2px #000000;" /></a><br /><span style="font-size: 0.9em; margin-top: 0px;"><a href="http://www.flickr.com/photos/76217291@N00/3904827012/">Me, side-by-side with Douglas Adams</a><br />Originally uploaded by <a href="http://www.flickr.com/people/76217291@N00/">fullerbecker</a></span></div>What happens if you search the iTunes store for Towel? <br /><br />You find Douglas Adams, and you find me!<br clear="all" />Dan Beckerhttps://plus.google.com/[email protected]:blogger.com,1999:blog-6322926.post-37644772376586950272009-08-03T10:42:00.001-07:002009-08-03T10:42:56.199-07:00Use Outlook 2007 to make collaborating between organizations easier – share your free/busy times<span xmlns=''><p>Folks who use Outlook and Exchange together are used to being able to use Outlook's free/busy times to tell when other people in their organization are available to meet. But what happens when a vendor or business partner from outside your organization is trying to find a time to meet with you? <br /></p><p>Typically for me, it used to be: find a bunch of available times; write them down and email them to the vendor; then the vendor checks on their end with the folks they need to bring and picks one, but by then, I've been scheduled for three more meetings and that free time isn't free any longer – so like they say on the shampoo bottle, "lather, rinse, repeat." What a waste of time!<br /></p><p>With Outlook 2007* there's a better way! <br /></p><p style='margin-left: 36pt'>Dear vendor, you can see my calendar at this link: <a href='https://calendars.office.microsoft.com/en-us/pubcal/viewer.aspx?path=%2fpubcalstorage%2fdnlhhqlz1065262%2fBecker_Dan_Calendar.ics'>https://calendars.office.microsoft.com/en-us/pubcal/viewer.aspx?path=%2fpubcalstorage%2fdnlhhqlz1065262%2fBecker_Dan_Calendar.ics</a> Please schedule the meeting for a time I'm available. <br /></p><p>[Go ahead and click that link – you'll see my actual availability!]<br /></p><p>How did I do that? <br /></p><p>Outlook 2007 makes it very easy to share your calendar online with people outside your company, using Outlook 2007. <br /></p><p>Interested? Well good! Microsoft has written up just what you need to do to make it happen: <a href='http://office.microsoft.com/en-us/outlook/HA100809831033.aspx'>Publish a calendar on Office Online</a><br /> </p><p><strong>I strongly suggest you use the option to publish Availability only to minimize the risk of information disclosure.</strong><br /> </p><p><br /> </p><p>You can also choose whether to share your calendar information only with specific people, or just publish it for the whole Internet to see. (I'm sure you can guess which is the more secure approach – but you will have to make the calculation about convenience vs. security of your schedule. Since I've blogged, twittered, etc. for quite a while, I'm obviously somewhat comfortable with the Internet knowing quite a bit about me. Your tolerance for that may differ.) <br /></p><p>If you want to restrict access to your calendar to only invited people, you need to sign up for a Windows Live ID account.<br /></p><p>I hope this tip will make collaborating across organizational boundaries a bit easier for you.<br /></p><p>*Yes, you used to be able to do this with earlier versions of Outlook back when Microsoft ran a public free/busy server – but that was shut down years ago. But this one works 'out of the box' with Outlook just by following the instructions, no need to install any extra software.** Easy-peasy!<br /></p><p>**And yes, there are a gazillion other ways to do this, and using Outlook and Exchange is SOOOOO 20<sup>th</sup> century, get with the web2.0 wave, blah blah blah. Ok, if you know that already, then this blog post is not for you! It's for folks who still need to use Outlook & Exchange but also need to collaborate outside their organizational boundaries.<br /></p><p><br /> </p><p><br /> </p></span>Dan Beckerhttps://plus.google.com/[email protected]
|
{
"url": "http://www.doofusdan.com/feeds/posts/default",
"source_domain": "www.doofusdan.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "129720",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7CKRKXNUJ6CVCZNB5QPDQWJRMD3ALNQ2",
"WARC-Concurrent-To": "<urn:uuid:1c3f314c-c737-4813-8286-be8f92a9ddd4>",
"WARC-Date": "2017-12-15T19:48:38Z",
"WARC-IP-Address": "172.217.7.179",
"WARC-Identified-Payload-Type": "application/atom+xml",
"WARC-Payload-Digest": "sha1:QSI2EGWBSHF2LY5LZWTOUP33VVSWYULF",
"WARC-Record-ID": "<urn:uuid:f2953e76-88cb-4fd5-911e-ab1ae696511e>",
"WARC-Target-URI": "http://www.doofusdan.com/feeds/posts/default",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:88c6bd41-b6dd-4c62-b513-7d6207955295>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-142-32-26.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-51\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for December 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
81151
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 81151,
"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.2233656793832779,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017739880830049515,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3767029345035553,
"rps_doc_frac_unique_words": 0.30427855253219604,
"rps_doc_mean_word_length": 6.992034435272217,
"rps_doc_num_sentences": 1043,
"rps_doc_symbol_to_word_ratio": 0.0007350799860432744,
"rps_doc_unigram_entropy": 6.605625152587891,
"rps_doc_word_count": 8788,
"rps_doc_frac_chars_dupe_10grams": 0.05639097839593887,
"rps_doc_frac_chars_dupe_5grams": 0.14573772251605988,
"rps_doc_frac_chars_dupe_6grams": 0.1176154688000679,
"rps_doc_frac_chars_dupe_7grams": 0.08269049227237701,
"rps_doc_frac_chars_dupe_8grams": 0.06535819917917252,
"rps_doc_frac_chars_dupe_9grams": 0.05972724035382271,
"rps_doc_frac_chars_top_2gram": 0.004101159982383251,
"rps_doc_frac_chars_top_3gram": 0.01640464924275875,
"rps_doc_frac_chars_top_4gram": 0.017771700397133827,
"rps_doc_books_importance": -9279.740234375,
"rps_doc_books_importance_length_correction": -9279.740234375,
"rps_doc_openwebtext_importance": -5678.25146484375,
"rps_doc_openwebtext_importance_length_correction": -5678.25146484375,
"rps_doc_wikipedia_importance": -3978.31201171875,
"rps_doc_wikipedia_importance_length_correction": -3978.31201171875
},
"fasttext": {
"dclm": 0.10950464010238647,
"english": 0.7510364055633545,
"fineweb_edu_approx": 1.7814325094223022,
"eai_general_math": 0.025239169597625732,
"eai_open_web_math": 0.23676395416259766,
"eai_web_code": 0.03078800067305565
}
}
|
{
"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": "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": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,348,472,146,141,706,000 |
Args (gb)
Esta clase es una matriz que contiene los argumentos pasados al programa por el shell.
Esta clase es estática.
Esta clase actúa com un array estático de sólo lectura.
Esta clase es enumerable estáticamente con la palabra clave FOR EACH.
Propiedades estáticas
All
Count
Max
Métodos estáticos
Copy
El componente gb.args proporciona un controlador de argumentos de línea de comandos mucho más sofisticado.
|
{
"url": "https://gambaswiki.org/wiki/comp/gb/args?l=es&nl",
"source_domain": "gambaswiki.org",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "12302",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VYNFVKT3SZLOKE2HDPQWF5M6XIJPHHG2",
"WARC-Concurrent-To": "<urn:uuid:ad35df1f-766f-4f5b-8b3e-ffb51d40e18a>",
"WARC-Date": "2024-08-10T20:01:55Z",
"WARC-IP-Address": "172.67.214.45",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:EEUZ5KFBFEZNFP5OWSU2S266XWNHSPJ7",
"WARC-Record-ID": "<urn:uuid:19035157-eca5-4621-977e-31a0d8fc48d7>",
"WARC-Target-URI": "https://gambaswiki.org/wiki/comp/gb/args?l=es&nl",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:604e464b-77b9-4618-9259-7bbf30e804c1>"
},
"warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-211\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
10,
11,
98,
99,
123,
124,
180,
181,
251,
252,
274,
280,
288,
294,
295,
313,
320,
321
],
"line_end_idx": [
10,
11,
98,
99,
123,
124,
180,
181,
251,
252,
274,
280,
288,
294,
295,
313,
320,
321,
427
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 427,
"ccnet_original_nlines": 18,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.054054051637649536,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027027029544115067,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10810811072587967,
"rps_doc_frac_unique_words": 0.7846153974533081,
"rps_doc_mean_word_length": 5.384615421295166,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.8037679195404053,
"rps_doc_word_count": 65,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.10285714268684387,
"rps_doc_frac_chars_top_3gram": 0.09428571164608002,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -37.45466232299805,
"rps_doc_books_importance_length_correction": -37.456275939941406,
"rps_doc_openwebtext_importance": -22.55728530883789,
"rps_doc_openwebtext_importance_length_correction": -22.55889892578125,
"rps_doc_wikipedia_importance": -12.877317428588867,
"rps_doc_wikipedia_importance_length_correction": -12.878931045532227
},
"fasttext": {
"dclm": 0.6129727959632874,
"english": 0.00042440000106580555,
"fineweb_edu_approx": 0.9721413254737854,
"eai_general_math": 0.000044699998397845775,
"eai_open_web_math": 0.2948612570762634,
"eai_web_code": 0.5458024144172668
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,267,236,336,371,009,000 |
Hack 99. Sysctl Command Examples
Linux kernel parameter can be changed on the fly using sysctl command. Sysctl helps to configure the Linux kernel parameters during runtime.
# sysctl –a
dev.cdrom.autoclose = 1
fs.quota.writes = 0
kernel.ctrl-alt-del = 0
kernel.domainname = (none)
kernel.exec-shield = 1
net.core.somaxconn = 128
net.ipv4.tcp_window_scaling = 1
net.ipv4.tcp_wmem = 4096 16384 131072
net.ipv6.route.mtu_expires = 600
sunrpc.udp_slot_table_entries = 16
vm.block_dump = 0
Modify Kernel parameter in /etc/sysctl.conf for permanent change
After modifying the kernel parameter in the /etc/sysctl.conf, execute sysctl –p to commit the changes. The changes will still be there after the reboot.
# vi /etc/sysctl.conf
# sysctl –p
Modify kernel parameter temporarily
To temporarily modify a kernel parameter, execute the following command. Please note that after reboot these changes will be lost.
# sysctl –w {variable-name=value}
Comments on this entry are closed.
|
{
"url": "https://linux.101hacks.com/monitoring-performance/sysctl-command-examples/",
"source_domain": "linux.101hacks.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "6913",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:T7F4UDTO37ONMPMVFRPC5OUR2PB44KDT",
"WARC-Concurrent-To": "<urn:uuid:0350e1fb-2c23-45fc-81b6-21867dca42e7>",
"WARC-Date": "2021-03-01T12:58:07Z",
"WARC-IP-Address": "52.116.215.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HFVOFFI46MKHD2IUQSLQWMPZYYQF7EZ6",
"WARC-Record-ID": "<urn:uuid:730fcd17-7049-4fd3-8f49-d2a3964ade36>",
"WARC-Target-URI": "https://linux.101hacks.com/monitoring-performance/sysctl-command-examples/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cd1f9fb8-a9b7-487d-8654-ed7628714c94>"
},
"warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-43.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
33,
34,
175,
176,
188,
189,
213,
233,
257,
284,
307,
332,
364,
411,
444,
479,
497,
498,
563,
564,
717,
718,
740,
741,
753,
754,
790,
791,
922,
923,
957,
958
],
"line_end_idx": [
33,
34,
175,
176,
188,
189,
213,
233,
257,
284,
307,
332,
364,
411,
444,
479,
497,
498,
563,
564,
717,
718,
740,
741,
753,
754,
790,
791,
922,
923,
957,
958,
992
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 992,
"ccnet_original_nlines": 32,
"rps_doc_curly_bracket": 0.0020161299034953117,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2083333283662796,
"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.3611111044883728,
"rps_doc_frac_unique_words": 0.6065573692321777,
"rps_doc_mean_word_length": 6.2868852615356445,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0.018518520519137383,
"rps_doc_unigram_entropy": 4.0678935050964355,
"rps_doc_word_count": 122,
"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.09778357297182083,
"rps_doc_frac_chars_top_3gram": 0.05475879833102226,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -95.92467498779297,
"rps_doc_books_importance_length_correction": -95.92467498779297,
"rps_doc_openwebtext_importance": -52.30026626586914,
"rps_doc_openwebtext_importance_length_correction": -38.259735107421875,
"rps_doc_wikipedia_importance": -39.57305908203125,
"rps_doc_wikipedia_importance_length_correction": -39.57305908203125
},
"fasttext": {
"dclm": 0.7084376215934753,
"english": 0.5392800569534302,
"fineweb_edu_approx": 3.2576346397399902,
"eai_general_math": 0.9368196129798889,
"eai_open_web_math": 0.4249008893966675,
"eai_web_code": 0.6115942597389221
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,116,265,407,685,219,600 |
Welcome Guest ( Log In | Register )
HOME
INFO
FORUMS
GITHUB
IRC CHAT
RETRO CHANNEL
Recent Changes Random Help Special Pages Upload
SCHG:Music Hacking/DAC Samples, Coordination Flags, Game Specifics, and Real-Time Music Editing
(Difference between revisions)
From Sonic Retro
Jump to: navigation, search
(Sonic 3 and beyond)
(Made explicit some information on fade flag in S1 and S2)
Line 168: Line 168:
|$E3||none||Return from subroutine. See also coord. flag $F8. No parameters.
|$E3||none||Return from subroutine. See also coord. flag $F8. No parameters.
|-
|-
|$E4||none||Fade-in to previous song. Has no parameters (not that it matters...). Can be in any channel; since the DAC channel is the first to be run, this prevents note artifacts from the other channels if placed on it.
+
|$E4||none||Stops the track and initiates a fade-in to previous song. Has no parameters (not that it matters...). Can be in any channel; since the DAC channel is the first to be run, this prevents note artifacts from the other channels if placed on it.
|-
|-
|$E5||$[tt]|| Set dividing timing for the current track to the parameter byte.
|$E5||$[tt]|| Set dividing timing for the current track to the parameter byte.
Line 227: Line 227:
|$E3||none||Return from subroutine. See also coord. flag $F8. No parameters.
|$E3||none||Return from subroutine. See also coord. flag $F8. No parameters.
|-
|-
|$E4||none||Fade-in to previous song. Has no parameters (not that it matters...). Can be in any channel; since the DAC channel is the first to be run, this prevents note artifacts from the other channels if placed on it.
+
|$E4||none||Stops the track and initiates a fade-in to previous song. Has no parameters (not that it matters...). Can be in any channel; since the DAC channel is the first to be run, this prevents note artifacts from the other channels if placed on it.
|-
|-
|$E5||$[tt]|| Set dividing timing for the current track to the parameter byte.
|$E5||$[tt]|| Set dividing timing for the current track to the parameter byte.
Line 283: Line 283:
|-
|-
|$E2||$[ii]||Set 'fade to previous' flag to parameter byte. If this is equal to $29 (one less than 1-Up ID), nothing much will happen: the sound driver will prevent new SFX and music from being played (except for the 1-Up music and the credits music). If the parameter if $FF, it will trigger a fade to the previous song. If set to anything else, the sound driver will play all queued songs and SFX and will not fade in. Note that, unlike what happens in Sonic 1 or Sonic 2, this flag does ''not'' stop the track!
|$E2||$[ii]||Set 'fade to previous' flag to parameter byte. If this is equal to $29 (one less than 1-Up ID), nothing much will happen: the sound driver will prevent new SFX and music from being played (except for the 1-Up music and the credits music). If the parameter if $FF, it will trigger a fade to the previous song. If set to anything else, the sound driver will play all queued songs and SFX and will not fade in. Note that, unlike what happens in Sonic 1 or Sonic 2, this flag does ''not'' stop the track!
|-
|-
|$E3||none||Silences FM channel then stops track (exactly as per coord. flag $F2).
|$E3||none||Silences FM channel then stops track (exactly as per coord. flag $F2).
Line 290: Line 289:
|-
|-
|$E5||$[ii][vv]|| Almost exactly like coord. flag $E6, except that it has two 1-byte parameters, the first of which is ignored and the second of which is added to the volume attenuation.
|$E5||$[ii][vv]|| Almost exactly like coord. flag $E6, except that it has two 1-byte parameters, the first of which is ignored and the second of which is added to the volume attenuation.
|-
|-
|$E6||$[vv]||Adds the parameter byte to the volume attenuation of an FM channel. The result is clamped to the [0-127] range. Has one parameter byte, the change in volume attenuation.
|$E6||$[vv]||Adds the parameter byte to the volume attenuation of an FM channel. The result is clamped to the [0-127] range. Has one parameter byte, the change in volume attenuation.
|-
|-
|$E7||none||Prevent note from attacking. This is reset after every note expires; so to keep it going, you must put this coordination flag before each note you wish to effect. No parameters.
|$E7||none||Prevent note from attacking. This is reset after every note expires; so to keep it going, you must put this coordination flag before each note you wish to effect. No parameters.
Revision as of 15:32, 18 October 2011
Music Hacking: Pointer and Header Format | Voice and Note Editing | DAC Samples, Coordination Flags, Game Specifics, and Real-Time Music Editing | Other Games and Data Locations | Tricks of the Trade
Contents
DAC Samples
DAC samples are raw PCM samples, generally used for drums and voices that you hear in game. You can customize these audio samples to your needs. Here is some information to do so below...
DAC Formats
Mega Drive
Typically (though not always), SMPS games do not store their sample data as 8-bit unsigned LPCM (the way the YM2612 takes it), but rather as 4-bit DPCM with a single shared delta array of
db 0, 1, 2, 4, 8, 10h, 20h, 40h
db -80h, -1, -2, -4, -8, -10h, -20h, -40h
This form is almost always incorrectly referred to as "compressed;" jman2050 Reticon.pngwrote a "compressor/decompressor" to convert samples stored in this format to standard 8-bit LCPM and vice versa.
There are a few exceptions to this rule:
db 0, 1, 2, 4, 8, 10h, 20h, 40h
db -80h, -1, -3, -4, -8, -10h, -20h, -40h
• Streets of Rage has the DPCM delta array for each sample as the first 16 bytes of the sample.
32X
SMPS-32X stores PWM samples as 8-bit unsigned LPCM. Note Tempo uses both DPCM samples on the MD side and PWM samples simultaneously; follow the above rules for the DPCM samples.
Sega CD
Each SMPS-PCM bank has a table of samples which are stored as 8-bit sign-magnitude; the same format as the Sega CD's PCM chip demands them. This means that each byte of the sample always consists of a 1-bit sign and 7-bit magnitude. So -1 would be represented as binary 10000001, which is $81. The only exception is $FF, which is used to mark the end of sample data (and time to go back to the loop point), so don't place this in the sample data.
Sonic 1
Samples in Sonic 1 are inside the Z80 portion of the sound driver, located at $72E7C, and compressed in Kosinski format. All following locations are for the decompressed sound driver.
DAC Sample Pointers
• DAC sample setup index: $D6
Each DAC pointer is listed one after another, and a single entry for one DAC sample is $8 bytes. The format is as follows:
Offset Size Description
$00-$01 Word Location of the DAC sample in decompressed driver.
• NOTE: Value is little endian, so swap the bytes to get the real value.
$02-$03 Word Size of the compressed DAC sample in decompressed driver.
• NOTE: Value is little endian, so swap the bytes to get the real value.
$04 Byte Sample rate/pitch. The lower the value, the faster the sample will play.
$05-$07 3 Bytes Unused/redundant.
Sonic 1 has 3 DAC sample slots - one for the kick, one for the snare, and one for the Timpani. The other pitches of Timpani ($88-$8B) are defined by a special table, located at $71CC4, and are fully editable to suit other samples using the Timpani slot ($83).
Sonic 2
DAC Sample Pointers
• Pointers to DAC Samples in Sonic 2 Beta: $ECDA6
Specifics...
• $ECDA6 - Sample 81 pointer
• $ECDA8 - Sample 81 length
• $ECDAA - Sample 82 pointer
• $ECDAC - Sample 82 length (skip FF)
• $ECDAF - Sample 83 pointer
• $ECDB1 - Sample 83 length
• $ECDB3 - Sample 84 pointer
• $ECDB5 - Sample 84 length (skip FF)
• $ECDB8 - Sample 85 pointer
• $ECDBA - Sample 85 length
• $ECDBC - Sample 86 pointer
• $ECDBE - Sample 86 length -- This one is tricky. You need to skip the second FF, as the first FF is valid.
• Pointers to DAC Samples in Sonic 2 Final: $ECF7C
Specifics...
• $ECF7C - Sample 81 pointer
• $ECF7E - Sample 81 length
• $ECF81 - Sample 82 pointer
• $ECF83 - Sample 82 length
• $ECF85 - Sample 83 pointer
• $ECF87 - Sample 83 length
• $ECF8A - Sample 84 pointer
• $ECF8C - Sample 84 length
• $ECF8E - Sample 85 pointer
• $ECF90 - Sample 85 length
• $ECF93 - Sample 86 pointer
• $ECF95 - Sample 86 length
• $ECF97 - Sample 87 pointer
• $ECF99 - Sample 87 length
These pointers are 4 bytes in size. First two bytes are the pointer to the sample (the pointers add to E0000, little endian, and don't follow the music pointer format. Simple 16-bit absolute), and the other two bytes are the length of the sample (also little endian). If you see an FF, skip it and move on to the next byte.
DAC Master List
• DAC Master List in Sonic 2 Beta: $ECDC1
• DAC Master List in Sonic 2 Final: $ECF9C
These work similarly to the master playlist in concept.. The format is two bytes per sample. First byte defines the sample ID, and the second byte defines the rate that the sample is played at. The lower the rate value, the faster the sample is played. This is used to make certain samples (like toms) appear to have different pitches (high tom, low tom, etc). If you see an FF, skip it and move on to the next byte. If you touch the FF, you fuck the entire sound driver. Don't. :P
Sonic 3
Setup Pointers
• DAC $81-$9A Pointer Index (Adds to $E0000): $E0000
• DAC $9B-$AA Pointer Index (Adds to $E8000): $E8000
• DAC $AB-$C0 Pointer Index (Adds to $F0000): $F0000
These pointer indexes work by pointing to the sample setup data for the particular samples. You'll notice there are 3 pointer indexes - this is since not all the samples can fit in a single bank, so they span 3 banks. The pointers are repeated at all 3 indexes, but only the defined samples for the index (listed above) will be in the relevant ROM bank.
DAC Sample Setup Format
The format for a DAC sample entry is pretty simple. Follow along:
Offset Size Function
$00 Byte Sample rate/pitch. The lower the value, the faster the sample will play.
$01-$02 Word Size of the DAC sample, in bytes.
• NOTE: Value is little endian, so remember to swap the bytes to get the real value.
$03-$04 Word Pointer to the DAC sample, within the current bank.
• NOTE: Value is little endian, so remember to swap the bytes to get the real value.
32X SMPS - PWM
32X games that use the PWM driver for song samples have a sample table of the form
Offset Size Function
$00 Long The virtual (SH-2 side) address of the sample — take out the first byte for the ROM address.
$04 Long Size of the DAC sample, in bytes.
$08 Long Zero. Purpose unknown.
$0C Long Sample rate/pitch. The lower the value, the slower the playback rate. A sample rate of $00000800 is equal to 11025hz.
Coordination flags
Coordination flags are values in the range of $E0-$FF in notation that perform special functions. The use of coordination flags can range from branching to specific locations in the song to altering volume, voice number, pitch, and other variables in real time.
Three of the coordination flags change between S1/S2 and S3/S&K. The rest are the same throughout.
Flamewing ended up showing me a table with more info than this one has, so here we go.
note: flamewing and andlabs are updating the Sega Retro version for non-Sonic game versions of the SMPS driver, while I, kram1024 am updating the Sonic Retro version, so that all differences between sonic 1, 2, and 3 can be seen. Flamewing has given me permission to do this.
what are all these parameter bytes?
Coordinance flags most of the time have parameters to tell the flags what to to just as any commandline does or even the asm in your disassembly do. Here is a list of things in that area and what they mean:
Symbol What it is
[ww] the bits or nibbles inside the brackets are a parameter that the flag actually uses.
{xx} the bits or nibbles inside the braces are a parameter that the flag could use in certain situations.
$ data is represented in hex (0-9,A-F) and can be a byte, word, or long word.
% data is represented in binary (0 and 1) and can be a byte, word, or long word.
Sonic 1
These are the coordinance flags after Flamewing's research completed.
Flag Parameters Purpose
$E0 %[l][r][aa]0[ff] Alter panning. Does not work for PSG tracks. The flag can be used to alter AMS and FMS, but it is not meant to; it can only set those bits if they were zero to begin with -- you can never clear them. Has one parameter byte.
$E1 $[ff] Set the channel frequency displacement to the parameter byte (signed).
$E2 $[vv] Sets RAM variable at $FFFFF007 to the parameter byte. Useless
$E3 none Return from subroutine. See also coord. flag $F8. No parameters.
$E4 none Stops the track and initiates a fade-in to previous song. Has no parameters (not that it matters...). Can be in any channel; since the DAC channel is the first to be run, this prevents note artifacts from the other channels if placed on it.
$E5 $[tt] Set dividing timing for the current track to the parameter byte.
$E6 $[vv] Add parameter byte to volume attenuation, effective immediately. This is not intended for PSG tracks, and will wreak havoc on unrelated FM tracks if used on a PSG track.
$E7 none Prevent note from attacking. This is reset after every note expires; so to keep it going, you must put this coordination flag before each note you wish to effect. No parameters.
$E8 $[ff] Sets note fill to the parameter byte. The note fill is a timeout: the number of frames during which the note will be allowed to play. After that, the note will be killed and will stay dead until it is time for another note.
$E9 $[ff] Adds (signed) parameter to channel key displacement.
$EA $[tt] Set main tempo to the parameter byte. Only affects music, not SFX. Has immediate effect, and may shorten the currently playing notes on all tracks.
$EB $[dd] Sets dividing timing to be equal to the parameter byte for all *music* tracks -- it does not effect SFX.
$EC $[vv] Changes channel volume by adding the parameter byte (signed) to the track's volume. For FM channels, only takes effect on the next voice change.
$ED none Clears 'pushing block' flag. This flag is set when SFX $A7 is played, and prevents it from playing again. No parameters.
$EE none Stops a track. This coordination flag assumes that the track in question is channel FM4 for a sound effect with index $D0-$DF, so don't use it for anything else. If the FM4 channel was being overridden by a normal sound effect, nothing else happens; otherwise, it will upload the current FM4 instrument for the currently playing music. No parameters.
$EF $[vv] Change FM instrument to parameter byte. Uploads the corresponding instrument to the YM2612, which means: NOT for PSG or DAC.
$F0 $[ww][mm][cc][ss] Sets modulation parameters and enables it. Takes 4 1-byte parameters, which are, in order: wait speed before modulation starts, modulation speed, change per step, number of steps. Using this flag will clear accumulated modulation. A wait of zero means no wait; compare with equivalent Sonic 3+ flag.
$F1 none Enables modulation. Can be safely used only after coord. flag $F0 has been used for the current track. No parameters.
$F2 none Stop track. FM voices and PSG noise tones are updated if needed.
$F3 $[nn] Sets PSG track to noise and sets PSG noise to parameter byte, which should be from $E0 to $E7 (inclusive). The transformation into a noise channel is irreversible.
$F4 none Disable modulation. No parameters.
$F5 $[tt] Change PSG tone (index into flutter table) to parameter byte.
$F6 $[dddd] Jump to target location. Parameter is 2-byte Big Endian offset to target location that points to one more than the offset says.
$F7 $[ll][cc][dddd] Repeat section of music. Has 4 bytes of parameters: a 1-byte loop index, a 1-byte repeat count and a 2-byte target for jump. Jump target is 2-byte Big Endian offset to target location that points to one more than the offset says.
$F8 $[dddd] Call subroutine. Stores current location for use with coord. flag $E3. Parameter is 2-byte Big Endian offset to target location that points to one more than the offset says.
$F9 none Sets D1L to maximum volume (minimum attenuation) and RR to maximum for operators 3 and 4 of FM1. Does not have parameters.
If it is not on this table and your sound driver is the sonic 1 driver and you did not create any more new flags, then any others past this point do not exist and anyone who tries to add such nonexistent flags to their music is a stupid idiot and thus will not be taken seriously.
Sonic 2
These are the coordinance flags after Flamewing's research completed.
Flag Parameters Purpose
$E0 %[l][r][aa]0[ff] Alter panning. Does not work for PSG tracks or if set to not attack on the next note. The flag can be used to alter AMS and FMS, but it is not meant to; it can only set those bits if they were zero to begin with -- you can never clear them. Has one parameter byte.
$E1 $[ff] Set the channel frequency displacement to the parameter byte (signed).
$E2 $[vv] Sets z80 RAM variable at $1B86 to the parameter byte. Useless
$E3 none Return from subroutine. See also coord. flag $F8. No parameters.
$E4 none Stops the track and initiates a fade-in to previous song. Has no parameters (not that it matters...). Can be in any channel; since the DAC channel is the first to be run, this prevents note artifacts from the other channels if placed on it.
$E5 $[tt] Set dividing timing for the current track to the parameter byte.
$E6 $[vv] Add parameter byte to volume attenuation, effective immediately. This can be used on FM and PSG tracks.
$E7 none Prevent note from attacking. This is reset after every note expires; so to keep it going, you must put this coordination flag before each note you wish to effect. No parameters.
$E8 $[ff] Sets note fill to the parameter byte. The note fill is a timeout: the number of frames during which the note will be allowed to play. After that, the note will be killed and will stay dead until it is time for another note.
$E9 $[ff] Adds (signed) parameter to channel key displacement.
$EA $[tt] Set main tempo to the parameter byte. Only affects music, not SFX.
$EB $[dd] Sets dividing timing to be equal to the parameter byte for all *music* tracks -- it does not effect SFX.
$EC $[vv] Changes channel volume by adding the parameter byte (signed) to the track's volume. For FM channels, only takes effect on the next voice change.
$ED $[vv] Does nothing but eat one parameter byte.
$EE none Does nothing. No parameters.
$EF $[vv] Change FM instrument to parameter byte. Uploads the corresponding instrument to the YM2612, which means: NOT for PSG or DAC.
$F0 $[ww][mm][cc][ss] Sets modulation parameters and enables it. Takes 4 1-byte parameters, which are, in order: wait speed before modulation starts, modulation speed, change per step, number of steps. Using this flag will clear accumulated modulation, but only if 'do not attack next note' is *not* set. A wait of zero means no wait; compare with equivalent Sonic 3+ flag.
$F1 none Enables modulation. Can be safely used only after coord. flag $F0 has been used for the current track. No parameters.
$F2 none Stop track. FM voices and PSG noise tones are updated if needed.
$F3 $[nn] Sets PSG track to noise and sets PSG noise to parameter byte, which should be from $E0 to $E7 (inclusive). The transformation into a noise channel is irreversible.
$F4 none Disable modulation. No parameters.
$F5 $[tt] Change PSG tone (index into flutter table) to parameter byte.
$F6 $[dddd] Jump to target location. Parameter is a pointer to target location.
$F7 $[ll][cc][dddd] Repeat section of music. Has 4 bytes of parameters: a 1-byte loop index, a 1-byte repeat count and a 2-byte target for jump. Jump target is a pointer to target location.
$F8 $[dddd] Call subroutine. Stores current location for use with coord. flag $E3. Parameter is a pointer to target location.
$F9 none Sets D1L to maximum volume (minimum attenuation) and RR to maximum for operators 3 and 4 of FM1. Does not have parameters.
If if is not on this table and your sound driver is the sonic 2 driver (why you would even want to use it is beyond me, other than for the compressed module support) and you did not create any more new flags, then any others past this point do not exist and anyone who tries to add such nonexistant flags to their music is a stupid idiot and thus will not be taken seriously.
Sonic 3 and beyond
These are the coordinance flags after Flamewing's research completed.
Flag Parameters Purpose
$E0 %[l][r][aa]0[ff] Alter panning. Does not work for PSG tracks or if set to not attack on the next note. The flag can be used to alter AMS and FMS, but it is not meant to; it can only set those bits if they were zero to begin with -- you can never clear them. Has one parameter byte.
$E1 $[ff] Set the channel frequency displacement to the parameter byte (signed).
$E2 $[ii] Set 'fade to previous' flag to parameter byte. If this is equal to $29 (one less than 1-Up ID), nothing much will happen: the sound driver will prevent new SFX and music from being played (except for the 1-Up music and the credits music). If the parameter if $FF, it will trigger a fade to the previous song. If set to anything else, the sound driver will play all queued songs and SFX and will not fade in. Note that, unlike what happens in Sonic 1 or Sonic 2, this flag does not stop the track!
$E3 none Silences FM channel then stops track (exactly as per coord. flag $F2).
$E4 $[vv] Set track volume. For FM channels, this is stripped of bit 7 and then XOR'ed with $7F before being stored (and it takes immediate effect). For PSG channels, this is shifted right 3 bits, stripped of the upper 4 bits and XOR'ed with $0F before being stored. In either case, this means that $00 is total silence and $7F (FM) or $78 (PSG) is maximum volume.
$E5 $[ii][vv] Almost exactly like coord. flag $E6, except that it has two 1-byte parameters, the first of which is ignored and the second of which is added to the volume attenuation.
$E6 $[vv] Adds the parameter byte to the volume attenuation of an FM channel. The result is clamped to the [0-127] range. Has one parameter byte, the change in volume attenuation.
$E7 none Prevent note from attacking. This is reset after every note expires; so to keep it going, you must put this coordination flag before each note you wish to effect. No parameters.
$E8 $[ff] Sets note fill to the parameter byte multiplied by the current tempo divider. The note fill is a timeout: the number of frames after during which the note will be allowed to play. After that, the note will be killed and will stay dead until it is time for another note. Note that, while similar, this coordination flag is different from that of Sonic 1 or Sonic 2.
$E9 none Spindash rev. Increases track key displacement by a cumulative value. Due to what is likely a bug, this cumulative value increases without bound, and so does the tracks' key displacement. For all but the spindash SFX and for continuous SFX (see below), the cumulative key displacement is reset when the a new SFX is started. No parameters. See also meta coord. flag $FF,$07.
$EA $[ss] Play DAC sample. The DAC sample is queued for play after V-Int ends, as if it had been set from a DAC track. Note that this can be used from FM and PSG tracks, and it can be used from SFX tracks (which are otherwise unable to play DAC samples); in these cases, the sample set from the DAC channel will not be played.
$EB $[ll][dddd] Conditional jump. This works in tandem with coord. flag $F7; it shares the same loop counters as it does, and relies on that flag to update them. If the loop counter is exactly 1 (that is, the next encounter with coord. flag $E7 will reduce it to zero), the loop counter will be cleared and the jump will be performed; otherwise, this coord. flag does nothing. Has 3 parameter bytes: a 1-byte loop index and a pointer to target for jump.
$EC $[vv] Change volume attenuation of PSG track. The single parameter byte is added to track's current volume attenuation; anything greater than $0F (unsigned comparison) is set to $0F (silence). Also, the flutter index is reduced by 1.
$ED $[ff] Set track's key displacement. The key displacement is set to be the parameter byte minus $40.
$EE $[rr][vv] Send command to YM2612. The commands are written to $4000, and the data to $4001, so not all YM2612 registers can be set this way (in particular, FM4, FM5 and FM6 can't be changed by this in general).
$EF $[vv]{ii} Sets new FM instrument/PSG tone. If the parameter byte is positive, this coord. flag has a single parameter byte; if it is negative, then the coord. flag will have two parameter bytes. For PSG tracks, the second byte (if present) will be ignored, and the first is the index in PSG tone table. For FM channels, the first byte (stripped of sign) is the index of FM instrument on the appropriate voice table. If the first byte was positive, this voice table is the one set for the track at the music/SFX headers. If the first byte was negative, then the voice table will be that of the song whose ID +$81 is specified on the second parameter byte.
$F0 $[ww][mm][cc][ss] Sets modulation parameters and enables it. Takes 4 1-byte parameters, which are, in order: wait speed before modulation starts, modulation speed, change per step, number of steps. This is the normal ($80) modulation type. A wait of zero is equal to 256; compare with equivalent Sonic 1 and Sonic 2 flag.
$F1 $[ff][pp] Set modulation type for current track. Has two 1-byte parameters, the modulation type for FM tracks and the modulation type for PSG tracks. $80 is normal modulation, and should be used only after coord. flag $F0 is used or all hell will break loose. $00 is no modulation. For nonzero values, this is frequency flutter (jitter?) which FM and non-noise PSG tracks can use. This frequency flutter should only be used if you know what you are doing -- particularly since it is very buggy, and prone to reading data from the code section.
$F2 none Stop track.
$F3 $[nn] If parameter byte is zero, the channel is converted back into a normal PSG channel and the noise channel is silenced. Otherwise, sets the PSG track to noise and sets PSG noise to parameter byte, which should be from $E0 to $E7 (inclusive).
$F4 $[vv] Like coord. flag $F1, but has only one parameter byte which is used as the new modulation type for FM and PSG tracks alike.
$F5 $[tt] Set PSG tone to parameter byte. Does nothing for FM tracks.
$F6 $[dddd] Jump to target location. Parameter is a pointer to target location.
$F7 $[ll][cc][dddd] Repeat section of music. Has 4 bytes of parameters: a 1-byte loop index, a 1-byte repeat count and a pointer to target location. Can be used with coord. flag $EB, see it for details.
$F8 $[dddd] Call subroutine. Stores current location for use with coord. flag $F9. Parameter is a pointer to target location.
$F9 none Return from subroutine. See also coord. flag $F8. No parameters.
$FA none Disable normal ($80) modulation type, or clears bit 7 of other types. No parameters.
$FB $[ff] Adds parameter to track's key displacement. Has one parameter.
$FC $[dddd] For continuous SFX, will loop the SFX a number of times equal to its total track count (FM + PSG) then stop. If the current SFX is queued to be played again, this counter will be reset instead, and the SFX will keep looping. Does nothing for non-continuous SFX. Has a 2-byte parameter, a pointer to the jump target.
$FD $[aa] If parameter byte is 1, enables alternate SMPS mode for track; if not 1, alternate SMPS mode is disabled.
$FE $[aa][bb][cc][dd] WARNING! for experts only! Put FM3 in special mode. The code is very buggy, and will overwrite the switch table handler of the meta coord. flag $FF (see below), and it will also read frequency data from random parts of the code section when it is time to send it to the YM2612. Don't use unless you are willing to fix the bugs first. Has 4 1-byte parameters.
$FF at least one byte Meta coordination flag: unfolds into 8 coordination flags, which are selected using the first parameter. Values of $00 to $07 are valid; all others are invalid.
Metaflag Parameters Purpose
$00 $[tt] Set current main tempo to parameter byte.
$01 $[ii] Play sound by index. The parameter byte is the index of the music or SFX to play (same index as sound test).
$02 none Halts or resumes all music tracks. A halted track does not play. Any music or SFX can use this to halt music, but only SFX can then use it again to resume the music; the single parameter byte determines if the music is to be halted (nonzero) or resumed (zero).
$03 $[ssss][zz] WARNING! for experts only! Copy data. It has 3 bytes of parameters, a pointer to source of data and a 1-byte length of data to copy. The data is copied immediately after this coord. flag's parameters, and the song will continue after the last byte copied. This should only be used if the song has been stored in z80 RAM, and even then only if you know what you are doing.
$04 $[dd] Set dividing timing for music to the parameter byte. This does not effect SFX tracks.
$05 $[aa][bb][cc][dd] Set SSG-EG data for FM track. Has 4 1-byte parameters, the SSG-EG data for each operator of the current track.
$06 $[ii][mm] Start/end FM flutter. Has two 1-byte parameters: the index+1 of the PSG tone data to use and a bit mask indicating which TL operators should receive flutter (in the form %0004231). For best results, the bit mask should be (%00001000, %00001000, %00001000, %00001000, %00001010, %00001110, %00001110, %00001111) according to the current FM voice's algorithm (0-7). You can disable this flutter by having either or both parameters zero. A negative index causes all sorts of woe as it indicates custom SSG-EG data *instead*.
$07 none Reset spindash rev to zero. See also coord. flag $E9. No parameters.
Note on $F3
The $F3 flag determines whether a PSG channel--usually the last one defined in the header--is a tone channel or the noise channel. There is only one noise channel, and 3 tone channels. Also worth noting is that a tone channel can become a noise channel mid-song; however, once it becomes a noise channel, it can only switch back to a tone channel on certain drivers.
Note on $F8 and $F9/$E3
Flags $F8 and $F9/$E3 work similarly to the opcodes jsr and rts in terms of function. $F8 will branch to a location within the song, saving the previous location to the stack; once the data is parsed, the $F9/$E3 flag will pop the stack to the program counter, continuing on in the song after the initial $F8 branch. This effect is utilized by Puto frequently in the xm4smps program to structure SMPS files similarly internally to XM module files.
Notes on $E0
Only FM and DAC channels can be panned, the PSG channels will ignore this flag. In Sonic 1, if the sixth channel (either FM6 or the DAC) of your Game Over song is panned, the SEGA sound after the reset will be panned as well. In OutRun the DAC channel cannot be panned; each sample has its own panning setting, defined in the DAC table.
Game Specifics
Sonic 2
Master Playlist
Sonic 2 has a special "master playlist" that defines what music ID plays in what slot. It works by taking a base address - generally the start of a music bank - and, for each increment of the value, it reads ahead another word in the current ROM bank. So, say, $00 would be the first word in the bank ($00-$01), $01 would be the next ($02-$03), and so on. The base address for this bank, in both Sonic 2 Beta AND final, is $F0000, and the addressing range spans as far as the value can allow, which is two Z80 ROM banks ($10000 bytes).
However, as a simple guide to understanding how it works (at least, for the casual hacker), all values for the original, untouched music (for the most part, anyway) subtract $1 from the value. So, to change Track 81 to Track 82, change $80 to $81. $80 is $81, $81 is $82, etc. These values go up to slot $9F, or $1F (visually, anyway - the game still uses $80 > values internally) in the final version of the game. The only exception to this is in Sonic 2 Beta, where some songs use the upper $8000 bytes of the bank start address to store music (making the values for calling said music start with $00). The locations for the master playlist are as follows:
• Master Playlist in Sonic 2 Beta: $ECE9F
• Master Playlist in Sonic 2 Final: $ECF36
As previously mentioned, track 81 is represented by $80, 82 is reresented by $81, etc. If you see an $FF, skip it and move on to the next byte - these are compression bytes for the driver, and touching them will bork the decompressor in-game, and prevent the sound driver from booting. The "master playlist" is only in Sonic 2 (Beta/Final) as far as I know. If I find it in any other games, I will update this section.
Music Compression
In Sonic 2 Final, there is a compression applied to all music data in the game except for the credits. This format has been dubbed the saxman compression, named after the person who cracked the format. I will not note how to manually decompress this format -- Refer to saxman's hacking guide to do so. The music can be decompressed by using Magus' Sega Data Compressor. Refer to the pointer format to edit the music properly.
Sonic 3
Universal Voice Bank
In Sonic 3, some songs have the value "$D817" as their voice pointer. When a song has this in its voice pointer, that means it's being prepped to use a global set of multiple voices that any song in the game can use. This is generally used to save space for songs that use the same voices. Interestingly enough, though, the Special Stage music has the first 5 voices used in the Universal Voice Bank, and all in the same order, so it's puzzling why they didn't just have the song use the bank (as it's fully capable of doing so).
• Universal Voice Bank in Sonic 3: $E77D8
Universal Voice Bank definitions
Using the Universal Voice Bank is akin to using voices in a normal song - each voice has a value, defined by coordination flag $EF. Here are some of the voices used in the Universal Voice Bank.
Value Description
$00 Synth Bass 2
$01 Trumpet 1
$02 Slap Bass 2
$03 Synth Bass 1
$04 Bell Synth 1
$05 Bell Synth 2
$06 Synth Brass 1
$07 Synth like Bassoon
$08 Bell Horn type thing
$09 Synth Bass 3
$0A Synth Trumpet
$0B Wood Block
$0C Tubular Bell
$0D Strike Bass
$0E Elec Piano
$0F Bright Piano
$10 Church Bell
$11 Synth Brass 2
$12 Bell Piano
$13 Wet Wood Bass
$14 Silent Bass
$15 Picked Bass
$16 Xylophone
$17 Sine Flute
$18 Pipe Organ
$19 Synth Brass 2
$1A Harpischord
$1B Metallic Bass
$1C Alternate Metallic Bass
$1D Backdropped Metallic Bass
$1E Sine like Bell
$1F Synth like Metallic with Small Bell.
$20 Nice Synth like lead.
$21 Rock Organ
$22 Strike like Slap Bass
Realtime Music Editing
By editing values in savestates, you can edit music, pointers and other various values in realtime. Re-load the savestate to see your changes applied!
Sonic 3/Sonic & Knuckles
Offset Z80 RAM Location Purpose
$001A8C 1618 Music Pointers (Sonic & Knuckles)
$001A8E 161A Music Pointers (Sonic 3)
$001778 1304 Pointer for Music Pointers
$000FD9 0B65 Music Bank IDs (Sonic & Knuckles)
$000FBC 0B48 Music Bank IDs (Sonic 3)
$00177A 1306 Pointer for Sound Effect Pointers
$001AF2 167E Sound Effect Pointers
Sonic 3D
Offset Z80 RAM Location Purpose
$001AD0 165C Music Pointers
$001778 1304 Pointer for Music Pointers
$00177A 1306 Pointer for Sound Effect Pointers
$001AD0 165C Music Pointers
$001B34 16C0 Sound Effect Pointers
Sonic 2 Final
Offset Z80 RAM Location Purpose
$001669 11F5 Master Playlist
$000C16 07A2 Pointer for Master Playlist
$000DF9 0985 Pointer for Sound Effects list
Sonic Community Hacking Guide
General
Number Systems | Sonic Music Hacking Guide | Assembly Hacking Guide | Subroutine Equivalency List | 68000 Instruction Set | SonED2 Manual | 68000 ASM-to-Hex Code Reference | VDP Documentation | Official Sega 32X Documentation | Official Sega CD Documentation | Official Sega Genesis Documentation
Game-Specific
Sonic the Hedgehog (16-bit) | Sonic the Hedgehog (8-bit) | Sonic Eraser | Sonic CD (prototype 510) | Sonic CD | Sonic CD (PC) | Sonic 2 (Nick Arcade prototype) | Sonic 2 (Simon Wai prototype) | Sonic 2 (16-bit) | Sonic 2 (8-bit) | Sonic 2 & Knuckles | Dr. Robotnik's Mean Bean Machine | Sonic Triple Trouble | Sonic 3 | Sonic & Knuckles | Sonic 3 & Knuckles | Sonic & Knuckles Collection | Sonic Crackers | Sonic 3D: Flickies' Island | Knuckles' Chaotix | Sonic R PC | Sonic Jam 6 | Sonic Advance | Sonic Advance 2 | Sonic Advance 3 | Sonic Battle | Sonic Adventure | Sonic Adventure DX: Director's Cut | Sonic Adventure DX: PC | Sonic Adventure (2010) | Sonic Adventure 2 | Sonic Adventure 2: Battle | Sonic Adventure 2 (PC) | Sonic Heroes | Shadow the Hedgehog | Sonic Riders | Sonic the Hedgehog (2006) | Sonic & Sega All-Stars Racing | Sonic Unleashed (XBOX 360/PS3) | Sonic Generations
The Nemesis Hacking Guides
ROM: Sonic 1 | Sonic 2 | Sonic 2 Beta | Sonic 3
Savestate: Sonic 1 | Sonic 2 Beta/Final | Sonic 3
The Esrael Hacking Guides
Sonic 1 (English / Portuguese) | Sonic 2 Beta (English / Portuguese) | Sonic 2 and Knuckles (English / Portuguese)
|
{
"url": "http://info.sonicretro.org/index.php?title=SCHG:Music_Hacking/DAC_Samples,_Coordination_Flags,_Game_Specifics,_and_Real-Time_Music_Editing&diff=prev&oldid=178131",
"source_domain": "info.sonicretro.org",
"snapshot_id": "crawl=CC-MAIN-2014-41",
"warc_metadata": {
"Content-Length": "91107",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3NGBEVBYSVXUAWUAFN7ABTEFC3I772FJ",
"WARC-Concurrent-To": "<urn:uuid:357dc023-3294-46c5-a4b8-fbc3d500788b>",
"WARC-Date": "2014-09-23T10:19:37Z",
"WARC-IP-Address": "104.28.2.66",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:GASVRLX3GHYLPKNMSKNDUFMOBPPSEDGV",
"WARC-Record-ID": "<urn:uuid:8b836cb6-e551-4478-9be0-f72958cb9aeb>",
"WARC-Target-URI": "http://info.sonicretro.org/index.php?title=SCHG:Music_Hacking/DAC_Samples,_Coordination_Flags,_Game_Specifics,_and_Real-Time_Music_Editing&diff=prev&oldid=178131",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c4237af6-cff0-4f37-aefc-415401db6cb1>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-234-18-248.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-41\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for September 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
36,
41,
46,
53,
60,
69,
83,
131,
133,
134,
230,
231,
262,
263,
280,
281,
309,
330,
389,
409,
411,
488,
490,
567,
569,
572,
574,
577,
798,
800,
1053,
1055,
1058,
1060,
1063,
1065,
1144,
1146,
1225,
1245,
1247,
1324,
1326,
1403,
1405,
1408,
1410,
1413,
1634,
1636,
1889,
1891,
1894,
1896,
1899,
1901,
1980,
1982,
2061,
2081,
2083,
2086,
2088,
2091,
2093,
2607,
2609,
3123,
3125,
3127,
3130,
3132,
3135,
3137,
3220,
3222,
3305,
3325,
3327,
3330,
3332,
3335,
3337,
3524,
3526,
3713,
3715,
3717,
3720,
3722,
3725,
3727,
3910,
3912,
4095,
4097,
4099,
4102,
4104,
4107,
4109,
4299,
4301,
4491,
4492,
4530,
4531,
4731,
4732,
4733,
4734,
4743,
4744,
4756,
4757,
4945,
4946,
4958,
4959,
4970,
4971,
5159,
5160,
5192,
5234,
5235,
5437,
5438,
5479,
5480,
5512,
5554,
5652,
5653,
5657,
5658,
5836,
5837,
5845,
5846,
6293,
6294,
6302,
6303,
6487,
6488,
6508,
6509,
6541,
6542,
6665,
6666,
6690,
6754,
6829,
6900,
6975,
7057,
7091,
7092,
7093,
7353,
7354,
7362,
7363,
7383,
7384,
7436,
7437,
7438,
7451,
7452,
7483,
7513,
7544,
7584,
7615,
7645,
7676,
7716,
7747,
7777,
7808,
7919,
7920,
7921,
7974,
7975,
7988,
7989,
8020,
8050,
8081,
8111,
8142,
8172,
8203,
8233,
8264,
8294,
8325,
8355,
8386,
8416,
8417,
8741,
8742,
8743,
8759,
8760,
8804,
8849,
8850,
9332,
9333,
9341,
9342,
9357,
9358,
9413,
9468,
9523,
9524,
9878,
9879,
9903,
9904,
9970,
9971,
9992,
10074,
10121,
10208,
10273,
10360,
10361,
10376,
10377,
10460,
10461,
10482,
10584,
10627,
10659,
10786,
10787,
10806,
10807,
11069,
11070,
11169,
11170,
11257,
11533,
11534,
11570,
11571,
11778,
11779,
11797,
11887,
11993,
12071,
12152,
12153,
12161,
12162,
12232,
12233,
12257,
12502,
12583,
12655,
12729,
12979,
13054,
13234,
13421,
13655,
13718,
13876,
13991,
14146,
14276,
14636,
14771,
15093,
15220,
15294,
15468,
15512,
15584,
15724,
15974,
16160,
16292,
16293,
16574,
16575,
16583,
16584,
16654,
16655,
16679,
16965,
17046,
17118,
17192,
17442,
17517,
17631,
17818,
18052,
18115,
18192,
18307,
18462,
18513,
18551,
18686,
19060,
19187,
19261,
19435,
19479,
19551,
19631,
19821,
19947,
20079,
20080,
20456,
20457,
20476,
20477,
20547,
20548,
20572,
20858,
20939,
21446,
21526,
21891,
22074,
22254,
22441,
22816,
23200,
23527,
23981,
24219,
24323,
24538,
25197,
25523,
26071,
26092,
26342,
26476,
26546,
26626,
26829,
26955,
27029,
27123,
27196,
27524,
27640,
28021,
28204,
28232,
28284,
28403,
28673,
29061,
29157,
29290,
29826,
29904,
29905,
29917,
29918,
30285,
30286,
30310,
30311,
30759,
30760,
30773,
30774,
31111,
31112,
31127,
31128,
31136,
31137,
31153,
31154,
31690,
31691,
32350,
32351,
32395,
32440,
32441,
32860,
32861,
32879,
32880,
33306,
33307,
33315,
33316,
33337,
33338,
33868,
33869,
33913,
33946,
33947,
34141,
34142,
34160,
34177,
34191,
34207,
34224,
34241,
34258,
34276,
34299,
34324,
34341,
34359,
34374,
34391,
34407,
34422,
34439,
34455,
34473,
34488,
34506,
34522,
34538,
34552,
34567,
34582,
34600,
34616,
34634,
34662,
34692,
34711,
34752,
34778,
34793,
34819,
34820,
34843,
34844,
34995,
34996,
35021,
35022,
35054,
35101,
35139,
35179,
35226,
35264,
35311,
35346,
35347,
35356,
35357,
35389,
35417,
35457,
35504,
35532,
35567,
35568,
35582,
35583,
35615,
35644,
35685,
35729,
35759,
35767,
36064,
36078,
36969,
36996,
37044,
37045,
37095,
37096,
37122
],
"line_end_idx": [
36,
41,
46,
53,
60,
69,
83,
131,
133,
134,
230,
231,
262,
263,
280,
281,
309,
330,
389,
409,
411,
488,
490,
567,
569,
572,
574,
577,
798,
800,
1053,
1055,
1058,
1060,
1063,
1065,
1144,
1146,
1225,
1245,
1247,
1324,
1326,
1403,
1405,
1408,
1410,
1413,
1634,
1636,
1889,
1891,
1894,
1896,
1899,
1901,
1980,
1982,
2061,
2081,
2083,
2086,
2088,
2091,
2093,
2607,
2609,
3123,
3125,
3127,
3130,
3132,
3135,
3137,
3220,
3222,
3305,
3325,
3327,
3330,
3332,
3335,
3337,
3524,
3526,
3713,
3715,
3717,
3720,
3722,
3725,
3727,
3910,
3912,
4095,
4097,
4099,
4102,
4104,
4107,
4109,
4299,
4301,
4491,
4492,
4530,
4531,
4731,
4732,
4733,
4734,
4743,
4744,
4756,
4757,
4945,
4946,
4958,
4959,
4970,
4971,
5159,
5160,
5192,
5234,
5235,
5437,
5438,
5479,
5480,
5512,
5554,
5652,
5653,
5657,
5658,
5836,
5837,
5845,
5846,
6293,
6294,
6302,
6303,
6487,
6488,
6508,
6509,
6541,
6542,
6665,
6666,
6690,
6754,
6829,
6900,
6975,
7057,
7091,
7092,
7093,
7353,
7354,
7362,
7363,
7383,
7384,
7436,
7437,
7438,
7451,
7452,
7483,
7513,
7544,
7584,
7615,
7645,
7676,
7716,
7747,
7777,
7808,
7919,
7920,
7921,
7974,
7975,
7988,
7989,
8020,
8050,
8081,
8111,
8142,
8172,
8203,
8233,
8264,
8294,
8325,
8355,
8386,
8416,
8417,
8741,
8742,
8743,
8759,
8760,
8804,
8849,
8850,
9332,
9333,
9341,
9342,
9357,
9358,
9413,
9468,
9523,
9524,
9878,
9879,
9903,
9904,
9970,
9971,
9992,
10074,
10121,
10208,
10273,
10360,
10361,
10376,
10377,
10460,
10461,
10482,
10584,
10627,
10659,
10786,
10787,
10806,
10807,
11069,
11070,
11169,
11170,
11257,
11533,
11534,
11570,
11571,
11778,
11779,
11797,
11887,
11993,
12071,
12152,
12153,
12161,
12162,
12232,
12233,
12257,
12502,
12583,
12655,
12729,
12979,
13054,
13234,
13421,
13655,
13718,
13876,
13991,
14146,
14276,
14636,
14771,
15093,
15220,
15294,
15468,
15512,
15584,
15724,
15974,
16160,
16292,
16293,
16574,
16575,
16583,
16584,
16654,
16655,
16679,
16965,
17046,
17118,
17192,
17442,
17517,
17631,
17818,
18052,
18115,
18192,
18307,
18462,
18513,
18551,
18686,
19060,
19187,
19261,
19435,
19479,
19551,
19631,
19821,
19947,
20079,
20080,
20456,
20457,
20476,
20477,
20547,
20548,
20572,
20858,
20939,
21446,
21526,
21891,
22074,
22254,
22441,
22816,
23200,
23527,
23981,
24219,
24323,
24538,
25197,
25523,
26071,
26092,
26342,
26476,
26546,
26626,
26829,
26955,
27029,
27123,
27196,
27524,
27640,
28021,
28204,
28232,
28284,
28403,
28673,
29061,
29157,
29290,
29826,
29904,
29905,
29917,
29918,
30285,
30286,
30310,
30311,
30759,
30760,
30773,
30774,
31111,
31112,
31127,
31128,
31136,
31137,
31153,
31154,
31690,
31691,
32350,
32351,
32395,
32440,
32441,
32860,
32861,
32879,
32880,
33306,
33307,
33315,
33316,
33337,
33338,
33868,
33869,
33913,
33946,
33947,
34141,
34142,
34160,
34177,
34191,
34207,
34224,
34241,
34258,
34276,
34299,
34324,
34341,
34359,
34374,
34391,
34407,
34422,
34439,
34455,
34473,
34488,
34506,
34522,
34538,
34552,
34567,
34582,
34600,
34616,
34634,
34662,
34692,
34711,
34752,
34778,
34793,
34819,
34820,
34843,
34844,
34995,
34996,
35021,
35022,
35054,
35101,
35139,
35179,
35226,
35264,
35311,
35346,
35347,
35356,
35357,
35389,
35417,
35457,
35504,
35532,
35567,
35568,
35582,
35583,
35615,
35644,
35685,
35729,
35759,
35767,
36064,
36078,
36969,
36996,
37044,
37045,
37095,
37096,
37122,
37236
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 37236,
"ccnet_original_nlines": 500,
"rps_doc_curly_bracket": 0.00010741999722085893,
"rps_doc_ldnoobw_words": 2,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31116583943367004,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06345296651124954,
"rps_doc_frac_lines_end_with_ellipsis": 0.005988019984215498,
"rps_doc_frac_no_alph_words": 0.2601454257965088,
"rps_doc_frac_unique_words": 0.17624343931674957,
"rps_doc_mean_word_length": 4.354495048522949,
"rps_doc_num_sentences": 436,
"rps_doc_symbol_to_word_ratio": 0.0010555899934843183,
"rps_doc_unigram_entropy": 5.844181537628174,
"rps_doc_word_count": 6474,
"rps_doc_frac_chars_dupe_10grams": 0.38693198561668396,
"rps_doc_frac_chars_dupe_5grams": 0.4304565191268921,
"rps_doc_frac_chars_dupe_6grams": 0.42009860277175903,
"rps_doc_frac_chars_dupe_7grams": 0.409102201461792,
"rps_doc_frac_chars_dupe_8grams": 0.39732539653778076,
"rps_doc_frac_chars_dupe_9grams": 0.3952679932117462,
"rps_doc_frac_chars_top_2gram": 0.02536270022392273,
"rps_doc_frac_chars_top_3gram": 0.015324040316045284,
"rps_doc_frac_chars_top_4gram": 0.012131529860198498,
"rps_doc_books_importance": -4056.156005859375,
"rps_doc_books_importance_length_correction": -4056.156005859375,
"rps_doc_openwebtext_importance": -2335.99658203125,
"rps_doc_openwebtext_importance_length_correction": -2335.99658203125,
"rps_doc_wikipedia_importance": -2052.139404296875,
"rps_doc_wikipedia_importance_length_correction": -2052.139404296875
},
"fasttext": {
"dclm": 0.019643839448690414,
"english": 0.8311773538589478,
"fineweb_edu_approx": 1.686877727508545,
"eai_general_math": 0.25942254066467285,
"eai_open_web_math": 0.253490686416626,
"eai_web_code": 0.2753191590309143
}
}
|
{
"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": "781.5",
"labels": {
"level_1": "Arts",
"level_2": "Music",
"level_3": "Music theory"
}
}
},
"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": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,372,280,311,995,129,600 |
Tell me more ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
Is there a way, in Xcode, to run a bash script in a build phase, only when I "Build & Run" and not in all other occasions?
Actually, what I would like to do, is to write a script to update the build number every time I build and run a new version on the device.
share|improve this question
Only when you Build & Run, or also when you just run? – zneak Feb 20 '11 at 17:14
Please, see the edited question. – massimoksi Feb 20 '11 at 22:06
Your question is still unclear. 'Build & Run' as opposed to what, exactly? Just 'Build'? – millenomi Feb 20 '11 at 22:17
add comment
1 Answer
up vote 1 down vote accepted
Xcode does not tell your script why it's building — that is, if it's going to run the app afterwards or not —; only that it is building. Also note that selecting 'Run' as opposed to 'Build & Run' does not run scripts in Run Script phases.
If you build in other occasions, you can pass build settings to xcodebuild (if building from the command line) or by selecting a different build configuration (if building from the Xcode application), which you can refer to in your build scripts as environment variables. For example:
if [ "$CONFIGURATION" == "Debug" ]; then
# increment build number
fi
(This script uses the CONFIGURATION built-in build setting, but you can create custom build settings if needed.)
share|improve this answer
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/5058579/run-a-bash-script-in-xcode-only-when-build-run",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "50552",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WS2HQGM32IFTOPEPEF3HFIJPZ4IP5TED",
"WARC-Concurrent-To": "<urn:uuid:e2546576-0a91-4c86-a5c6-3b0b92424bd4>",
"WARC-Date": "2013-12-05T12:25:51Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:3QLRALC7MSV7FGA6QJAABUFIBFG5BRZG",
"WARC-Record-ID": "<urn:uuid:1e1676d1-f1f4-420e-945a-43b075d3922d>",
"WARC-Target-URI": "http://stackoverflow.com/questions/5058579/run-a-bash-script-in-xcode-only-when-build-run",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:13d4fe57-3950-4f3b-8b48-ee20fe0bbf43>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
15,
147,
148,
271,
272,
411,
412,
440,
442,
525,
527,
594,
596,
718,
730,
731,
740,
741,
770,
771,
1010,
1011,
1296,
1297,
1338,
1367,
1370,
1371,
1484,
1485,
1511,
1523,
1524,
1536,
1537,
1539,
1547,
1548,
1626,
1627
],
"line_end_idx": [
15,
147,
148,
271,
272,
411,
412,
440,
442,
525,
527,
594,
596,
718,
730,
731,
740,
741,
770,
771,
1010,
1011,
1296,
1297,
1338,
1367,
1370,
1371,
1484,
1485,
1511,
1523,
1524,
1536,
1537,
1539,
1547,
1548,
1626,
1627,
1717
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1717,
"ccnet_original_nlines": 40,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36968085169792175,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013297869823873043,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24202127754688263,
"rps_doc_frac_unique_words": 0.4831081032752991,
"rps_doc_mean_word_length": 4.418919086456299,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0.0026595699600875378,
"rps_doc_unigram_entropy": 4.621298789978027,
"rps_doc_word_count": 296,
"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.02446483075618744,
"rps_doc_frac_chars_top_3gram": 0.016055049374699593,
"rps_doc_frac_chars_top_4gram": 0.020642200484871864,
"rps_doc_books_importance": -173.99801635742188,
"rps_doc_books_importance_length_correction": -162.7996063232422,
"rps_doc_openwebtext_importance": -88.2084732055664,
"rps_doc_openwebtext_importance_length_correction": -88.2084732055664,
"rps_doc_wikipedia_importance": -81.17809295654297,
"rps_doc_wikipedia_importance_length_correction": -73.30937194824219
},
"fasttext": {
"dclm": 0.20817995071411133,
"english": 0.918134868144989,
"fineweb_edu_approx": 1.2613533735275269,
"eai_general_math": 0.0011989499907940626,
"eai_open_web_math": 0.1819586157798767,
"eai_web_code": 0.000002029999905062141
}
}
|
{
"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": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,181,548,427,524,107,000 |
Google Wifi
There are a lot of ways to get a radio signal from one place to another. This is as true for your home Wi-Fi setup as it is for any other radio equipment. When it comes to mesh networking, there are two distinct types of setup being offered by a growing handful of companies. Trying to sort out what's best for you and your house can be tough.
More: Do I really need a mesh network?
If you decide that a mesh network is what you need to get good Wi-Fi everywhere you need it, you have quite a few choices. They all are a little different but are designed to be placed around your house so you're always in range of a good, strong Wi-Fi signal. While the concept is the same — several small "stations" close to the places you need them — the number of stations (nodes) you need depends on how your house is laid out.
The wireless signal coming from a mesh access point is like a sphere or a bubble.
Inside this bubble, you have a strong connection to the network. This works great if you can get a network mesh node in a spot to spread that bubble around where you need it. Then you put another bubble in another spot to cover more places. It's a great way to spread the Wi-Fi around your house, but not be blasting it to the neighbor's house where it can interfere with his Wi-Fi. Anyone who lives in a crowded building with a lot of Wi-Fi networks can tell you how difficult it can be to have a good signal because all the channels we use for Wi-Fi are crowded.
More: How Wi-Fi mesh networks work
A setup like Google Wifi has a small number of network nodes. They transmit a strong signal in all directions and two or three nodes (plus the one attached to your router) will cover most houses. They are excellent products that work better than advertised and most anyone who buys into them will be happy with the results. Other products like Netgear's Orbi or eero are similar — fewer units with each having a (relatively) large range of coverage.
An alternative way of doing things is with a product like Plume's Pod system. Plume Pods are tiny. They plug directly into an outlet and have a small signal bubble. You put a Pod everywhere you need one instead of placing one in a spot that can cover multiple rooms. The result is the same — when you're in range of a network node you have a good Wi-Fi signal.
Your house will decide for you
You want Wi-Fi where you need it. Maybe you want it in the bedroom, the living room and the kitchen. You're not concerned about blanketing the garage or storage closet or anywhere else with Wi-Fi. Plume's Pods could be great for you.
Small, short-range Wi-Fi nodes are like a light bulb. One for every room.
The Pods are small, use very little power and have a completely separate channel they use to talk to each other so they aren't using the bandwidth you are for watching a movie or getting online. That means you can use as many Pods as you want. I'm sure there is a limit somewhere, but it's not going to be reached in your home.
They also have a very small range. They are designed to be dropped in the room you need Wi-Fi in. Plume compares them to a light bulb — one in every room. That's a perfect analogy. It's a good thing and a bad thing.
Google Wifi's much larger range per node can be a problem if you have to place them too close together.
Ideally, your phone or TV or whatever you're connecting to Wi-Fi will pick the strongest signal it can attach to. You tell it to connect to MYNETWORK and give it a password, and it connects to MYNETWORK when it finds it. With two powerful satellite nodes in close proximity, it might not connect to the closest one.
Google Wifi's more powerful signal means it needs more room.
This isn't a big deal for something stationary like your TV or a game console. You're not moving either end of the connection. But the phone in your pocket can move from one end of the house to another, and it can get confused about when it's time to grab the stronger signal because it's already connected to a strong signal. As you move around it can get better or worse, and you can end up scanning and hop from one node to another which can affect your network speed.
None of that happens with Plume's Pod system.When you leave the living room, a light bulb doesn't shine through the walls to the bedroom, and a Plume Pod is like a light bulb.
If you have a big house but it's laid out in a way where mesh satellite nodes are too close together (the Google Wifi app does a great job making sure you place them far enough apart, but it's not perfect by any means) you could see problems. You fix those problems by moving the nodes further apart, or by using more access points with a smaller range.
This can be tough in something like a tall, narrow townhouse or row house where a mesh point on each floor will get crowded, but one on the top floor and one on the lowest floor might not cover everywhere. Long, narrow homes can pose the same problem. Think about where a 40-foot bubble will fit without the centers of two of them being too close together.
Either method can give you awesome Wi-Fi throughout your home. If you're not in a situation where you would have two powerful mesh points close to each other, look to things like features and price to help you decide.
See at Plume
Google Hardware
Main
Google Home family
Google Wifi:
Google Amazon
Google Home:
Google Best Buy
Chromecast Ultra:
Google Best Buy
This post may contain affiliate links. See our disclosure policy for more details.
|
{
"url": "https://www.androidcentral.com/home-wi-fi-mesh-networks-are-more-access-points-always-better",
"source_domain": "www.androidcentral.com",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "86685",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UP4RAOPS24OE54BMTQKAQJ7TD3VQLYKS",
"WARC-Concurrent-To": "<urn:uuid:80a94cdd-26fa-47a0-85aa-041e64254591>",
"WARC-Date": "2018-11-14T19:49:04Z",
"WARC-IP-Address": "104.16.136.182",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:BEYLAMCVWABKQFXCCLLB6JDNWLJYEUTT",
"WARC-Record-ID": "<urn:uuid:4ca0250c-3e06-4e25-8df9-a431469d30cd>",
"WARC-Target-URI": "https://www.androidcentral.com/home-wi-fi-mesh-networks-are-more-access-points-always-better",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:aca10d83-fad5-4063-901c-fa088b038aa1>"
},
"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-71-205-234.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
12,
13,
357,
358,
397,
398,
831,
832,
914,
915,
1480,
1481,
1516,
1517,
1967,
1968,
2329,
2330,
2361,
2362,
2596,
2597,
2671,
2672,
3000,
3001,
3217,
3218,
3322,
3323,
3639,
3640,
3701,
3702,
4174,
4175,
4351,
4352,
4706,
4707,
5064,
5065,
5283,
5284,
5297,
5298,
5314,
5315,
5320,
5321,
5340,
5341,
5354,
5368,
5369,
5382,
5398,
5399,
5417,
5433,
5434
],
"line_end_idx": [
12,
13,
357,
358,
397,
398,
831,
832,
914,
915,
1480,
1481,
1516,
1517,
1967,
1968,
2329,
2330,
2361,
2362,
2596,
2597,
2671,
2672,
3000,
3001,
3217,
3218,
3322,
3323,
3639,
3640,
3701,
3702,
4174,
4175,
4351,
4352,
4706,
4707,
5064,
5065,
5283,
5284,
5297,
5298,
5314,
5315,
5320,
5321,
5340,
5341,
5354,
5368,
5369,
5382,
5398,
5399,
5417,
5433,
5434,
5516
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5516,
"ccnet_original_nlines": 61,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.49669966101646423,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005775580182671547,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11798679828643799,
"rps_doc_frac_unique_words": 0.3404461741447449,
"rps_doc_mean_word_length": 4.1901068687438965,
"rps_doc_num_sentences": 57,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.206275463104248,
"rps_doc_word_count": 1031,
"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.012962959706783295,
"rps_doc_frac_chars_top_3gram": 0.009259260259568691,
"rps_doc_frac_chars_top_4gram": 0.006944439839571714,
"rps_doc_books_importance": -557.6904907226562,
"rps_doc_books_importance_length_correction": -557.6904907226562,
"rps_doc_openwebtext_importance": -287.9440612792969,
"rps_doc_openwebtext_importance_length_correction": -287.9440612792969,
"rps_doc_wikipedia_importance": -241.6912841796875,
"rps_doc_wikipedia_importance_length_correction": -241.6912841796875
},
"fasttext": {
"dclm": 0.6038057804107666,
"english": 0.9625034928321838,
"fineweb_edu_approx": 1.8384814262390137,
"eai_general_math": 0.12217289209365845,
"eai_open_web_math": 0.2607020139694214,
"eai_web_code": 0.041596949100494385
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.38467",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,690,361,547,217,609,000 |
るりまサーチ
最速Rubyリファレンスマニュアル検索！
28件ヒット [1-28件を表示] （0.014秒）
トップページ > クラス:Float[x] > クエリ:<=[x] > クエリ:<[x]
別のキーワード
1. _builtin <=
2. bigdecimal <=
3. float <=
4. module <=
5. comparable <=
ライブラリ
キーワード
検索結果
Float#<=(other) -> bool (24213.0)
比較演算子。数値として等しいまたは小さいか判定します。
...します。
@param other 比較対象の数値
@return self よりも other の方が大きい場合か、
両者が等しい場合 true を返します。
そうでなければ false を返します。
例:
3.14 < 3.1415 #=> true
3.14 <= 3.1415 #=> true...
Float#<(other) -> bool (18113.0)
比較演算子。数値として小さいか判定します。
...lf よりも other が大きい場合 true を返します。
そうでなければ false を返します。
例:
3.14 < 3.1415 #=> true
3.14 <= 3.1415 #=> true...
Float#<=>(other) -> 1 | 0 | -1 | nil (12201.0)
self と other を比較して、self が大きい時に正、 等しい時に 0、小さい時に負の整数を返します。 比較できない場合はnilを返します
...ther を比較して、self が大きい時に正、
等しい時に 0、小さい時に負の整数を返します。
比較できない場合はnilを返します
例:
3.05 <=> 3.14 #=> -1
1.732 <=> 1.414 #=> 1
3.3 - 3.3 <=> 0.0 #=> 0
3.14 <=> "hoge" #=> nil
3.14 <=> 0.0/0.0 #=> nil...
Float#divmod(other) -> [Numeric] (31.0)
self を other で割った商 q と余り r を、 [q, r] という 2 要素の配列にして返します。 商 q は常に整数ですが、余り r は整数であるとは限りません。
...とは限りません。
ここで、商 q と余り r は、
* self == other * q + r
* other > 0 のとき: 0 <= r < other
* other < 0 のとき: other < r <= 0
* q は整数
をみたす数です。
このメソッドは、メソッド / と % によって定義されていま...
|
{
"url": "http://rurema.clear-code.com/class:Float/query:%3C%3D/query:%3C/",
"source_domain": "rurema.clear-code.com",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "17653",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6X3OWXVJ3KANEXTCS552CEISYPSA4YSA",
"WARC-Concurrent-To": "<urn:uuid:50942397-22bb-462e-96ca-86af33892fc6>",
"WARC-Date": "2018-12-10T09:27:10Z",
"WARC-IP-Address": "133.130.99.16",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:BF25PUWCA6RRO57RD47LM3KRSRDO5ZT7",
"WARC-Record-ID": "<urn:uuid:dd6a70b1-4a7a-4dd4-a7cc-d46d3eda5952>",
"WARC-Target-URI": "http://rurema.clear-code.com/class:Float/query:%3C%3D/query:%3C/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6729fd68-68b5-4011-8661-e378de4ca2af>"
},
"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-185-234-147.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
7,
8,
29,
56,
101,
102,
110,
111,
128,
147,
161,
176,
195,
196,
202,
203,
209,
210,
215,
216,
250,
251,
279,
280,
288,
289,
310,
344,
365,
386,
387,
390,
391,
414,
441,
442,
475,
476,
498,
499,
534,
555,
556,
559,
560,
583,
610,
611,
658,
659,
734,
735,
763,
787,
805,
806,
809,
810,
831,
853,
877,
901,
929,
930,
970,
971,
1061,
1062,
1074,
1075,
1092,
1093,
1117,
1118,
1150,
1182,
1190,
1199
],
"line_end_idx": [
7,
8,
29,
56,
101,
102,
110,
111,
128,
147,
161,
176,
195,
196,
202,
203,
209,
210,
215,
216,
250,
251,
279,
280,
288,
289,
310,
344,
365,
386,
387,
390,
391,
414,
441,
442,
475,
476,
498,
499,
534,
555,
556,
559,
560,
583,
610,
611,
658,
659,
734,
735,
763,
787,
805,
806,
809,
810,
831,
853,
877,
901,
929,
930,
970,
971,
1061,
1062,
1074,
1075,
1092,
1093,
1117,
1118,
1150,
1182,
1190,
1199,
1232
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1232,
"ccnet_original_nlines": 78,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10027854889631271,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0.05063290894031525,
"rps_doc_frac_no_alph_words": 0.8077994585037231,
"rps_doc_frac_unique_words": 0.5483871102333069,
"rps_doc_mean_word_length": 5.245161056518555,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0.05849581956863403,
"rps_doc_unigram_entropy": 4.153844833374023,
"rps_doc_word_count": 155,
"rps_doc_frac_chars_dupe_10grams": 0.15990160405635834,
"rps_doc_frac_chars_dupe_5grams": 0.3050430417060852,
"rps_doc_frac_chars_dupe_6grams": 0.15990160405635834,
"rps_doc_frac_chars_dupe_7grams": 0.15990160405635834,
"rps_doc_frac_chars_dupe_8grams": 0.15990160405635834,
"rps_doc_frac_chars_dupe_9grams": 0.15990160405635834,
"rps_doc_frac_chars_top_2gram": 0.03936038911342621,
"rps_doc_frac_chars_top_3gram": 0.05904059112071991,
"rps_doc_frac_chars_top_4gram": 0.05904059112071991,
"rps_doc_books_importance": -172.43394470214844,
"rps_doc_books_importance_length_correction": -172.43394470214844,
"rps_doc_openwebtext_importance": -95.55091857910156,
"rps_doc_openwebtext_importance_length_correction": -95.55091094970703,
"rps_doc_wikipedia_importance": -55.85712432861328,
"rps_doc_wikipedia_importance_length_correction": -55.85712432861328
},
"fasttext": {
"dclm": 0.9946556091308594,
"english": 0.002176850102841854,
"fineweb_edu_approx": 1.5557671785354614,
"eai_general_math": 0.25420427322387695,
"eai_open_web_math": 0.009195149876177311,
"eai_web_code": 0.854599118232727
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,130,312,367,664,858,000 |
Desktop version
Home arrow Education arrow Bitcoin for the befuddled
Why Bitcoin Needs Cryptography
So why is cryptography necessary to make Bitcoin work, even though Bit-coin does not involve sending secret messages? In Bitcoin, hash functions and digital signatures are used for the following important purposes:
• Authorizing transactions with digital signatures
• Verifying the validity of the transaction history
• Proof-of-work in Bitcoin mining
• Extra protection for Bitcoin private keys
Let's explore the functions of Bitcoin that require cryptography and then delve into the specific methods that Bitcoin uses.
Authorizing Transactions with Digital Signatures
Bitcoin uses digital signatures to authorize transactions so that you, and only you, can spend the bitcoins you own. With credit card payments and bank transfers, you authorize a transaction by providing proof of your personal identity (and these days, the amount of proof you have to show
is getting quite burdensome). With Bitcoin, no personal information is tied to any Bitcoin address; instead, you must prove that you own the private key. Showing people your private key would certainly be valid as proof, but by knowing the private key, the people you've shown could then claim they owned the bitcoins at that address. Therefore, you need to prove that you have the private key without actually sharing it. But there's more to it than that.
A Bitcoin transaction contains a fair amount of information: the number of bitcoins transferred, the address they are being transferred to, the transaction fee, and so on. You don't want any of that information to be altered without your permission, so in addition to proving you own the bit-coins you are sending, you also need to ensure that the transaction details are followed exactly a you wrote them. A Bitcoin transaction is a message with instructions, and by signing it with a digital signature, you simultaneously prove tat you have the private key and ensure that the transaction details are what you intended. If the signature is missing or doesn't match the public key, nodes on the Bitcoin network will consider the transaction invalid and will not ad it to the blockchain.
Verifying the Validity of the Transaction History
Bitcoin depends on the blockchain being widely distributed among the nodes in the network. But how can you be sure that any individual node in the network with a copy of the blockchain has not been surreptitiously altered? A malicious attacker cold try to distribute a fraudulent blockchain where just a single transaction has been modified in the attacker's favor. However, such an attack could never work for several reasons. One reason is that the slightest change in the transaction history would completely change the block hash of all the blocks after it in the chain.
Each block in the blockchain contains a list of transactions and a hash of the transactions in the previous block in the chain. Hence, it's impossible to alter just one transaction in a block in the middle without causing a mismatch between the expected block hash and the hash recorded in the next block.
This verification provides an efficient way for a single node to check whether transactions in its copy of the blockchain have been tampered with. Rather than checking every transaction in the entire transaction history, a node can simply check whether the hash of each block matches the recorded hash of subsequent blocks.
Proof-of-Work in Bitcoin Mining
Bitcoin mining is based on a lottery system that you can win only by guessing numbers repeatedly, but that makes it is easy for others to check when you're right. If this sounds similar to a one-way function, that's because it is. The one-way function used in Bitcoin mining is a cryptographic hash function. Miners are given the output criteria (the output can be any number less than some threshold), but by design, cryptographic hash functions make it difficult to reverse calculate what the corresponding input needs to be. Therefore, Bitcoin miners can only randomly choose different inputs, hoping that the output will be a number below the threshold. Once a miner determines the correct input value, it is easy to prove his or her work to others by sharing that value with others who can easily recalculate the hash.
Extra Protection for Bitcoin Private Keys
Authorizing transactions with digital signatures requires sharing your public key with others. Although it is thought to be computationally infeasible to calculate a private key from a public key, it is similarly difficult to calculate the input of a hash function given just the output, and it is doubly difficult to do both. Instead of sharing a public key, users share a Bitcoin address, which is a cryptographic hash of a public key. In fact, the public key is hashed twice using two different cryptographic hash functions to create a Bitcoin address. This extra protection ensures that no amount of analysis of a Bitcoin address can reveal the underlying private key.
Bitcoin uses cryptographic hash functions to accomplish a variety of other important tasks as well. Next, you'll explore the specific cryptographic methods Bitcoin uses.
Found a mistake? Please highlight the word and press Shift + Enter
< Prev CONTENTS Next >
Related topics
|
{
"url": "https://m.ebrary.net/7938/education/bitcoin_needs_cryptography",
"source_domain": "m.ebrary.net",
"snapshot_id": "crawl=CC-MAIN-2019-18",
"warc_metadata": {
"Content-Length": "16003",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CPUP6VZL7QSF7CKULSOKXJXPAJCELKDR",
"WARC-Concurrent-To": "<urn:uuid:f01b59eb-828e-4fa4-bce1-1dfd1dfd781c>",
"WARC-Date": "2019-04-22T15:23:18Z",
"WARC-IP-Address": "37.252.15.88",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:STJPENSGL2U7WO2LLME6CWJ3E4EDU52N",
"WARC-Record-ID": "<urn:uuid:4716183e-af92-497d-aa7f-367485d61e61>",
"WARC-Target-URI": "https://m.ebrary.net/7938/education/bitcoin_needs_cryptography",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:01aba2a9-c788-4884-82fe-400eaa500fdd>"
},
"warc_info": "isPartOf: CC-MAIN-2019-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-109-209-241.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
16,
17,
70,
71,
102,
103,
318,
319,
370,
371,
423,
424,
458,
459,
503,
504,
629,
630,
679,
680,
970,
971,
1428,
1429,
2217,
2218,
2268,
2269,
2844,
2845,
3151,
3152,
3476,
3477,
3509,
3510,
4334,
4335,
4377,
4378,
5051,
5052,
5222,
5223,
5225,
5294,
5321,
5322
],
"line_end_idx": [
16,
17,
70,
71,
102,
103,
318,
319,
370,
371,
423,
424,
458,
459,
503,
504,
629,
630,
679,
680,
970,
971,
1428,
1429,
2217,
2218,
2268,
2269,
2844,
2845,
3151,
3152,
3476,
3477,
3509,
3510,
4334,
4335,
4377,
4378,
5051,
5052,
5222,
5223,
5225,
5294,
5321,
5322,
5336
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5336,
"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.4570552110671997,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00408997992053628,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10224948823451996,
"rps_doc_frac_unique_words": 0.375,
"rps_doc_mean_word_length": 5.02430534362793,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.083795547485352,
"rps_doc_word_count": 864,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09168393909931183,
"rps_doc_frac_chars_dupe_6grams": 0.052061740309000015,
"rps_doc_frac_chars_dupe_7grams": 0.019811099395155907,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.012669890187680721,
"rps_doc_frac_chars_top_3gram": 0.011978809721767902,
"rps_doc_frac_chars_top_4gram": 0.02349689044058323,
"rps_doc_books_importance": -388.79449462890625,
"rps_doc_books_importance_length_correction": -388.79449462890625,
"rps_doc_openwebtext_importance": -174.29336547851562,
"rps_doc_openwebtext_importance_length_correction": -174.29336547851562,
"rps_doc_wikipedia_importance": -141.90823364257812,
"rps_doc_wikipedia_importance_length_correction": -141.90823364257812
},
"fasttext": {
"dclm": 0.7350336909294128,
"english": 0.9298447966575623,
"fineweb_edu_approx": 2.5105504989624023,
"eai_general_math": 0.7719981074333191,
"eai_open_web_math": 0.1282360553741455,
"eai_web_code": 0.5430083870887756
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "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": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,232,076,384,758,186,000 |
Re: Sumproduct on multiple "or" conditions
On 2 Aug, 15:38, watchtower <watchto...@xxxxxxxxxxxxxxxxxxxxxxxxx>
wrote:
Adding another column would work fine, but I am importing data and I would
rather not have to format it at all. All of this data will be on a separate
sheet for input only. My goal is to import the data and have the cells
update automatically.
"aidan.herit...@xxxxxxxxxx" wrote:
On 2 Aug, 15:16, watchtower <watchto...@xxxxxxxxxxxxxxxxxxxxxxxxx>
wrote:
I have the below date from which I want to sum the "amount" column based on
the "ID" column. (There are other criteria that I have to use as well, but
they will be in other columns.) The sumproduct function works very well if I
only want to sum the amounts of one ID, but I am not sure how to sum the
amounts of multiple IDs using one formula. If I want to sum the amounts of
both 1340 and 5450, I am currently using:
=sumproudct(--(ID=1340),amt)+sumproduct(--(ID=5450,amt)
=(118)+(98)
=216
This works fine if I am only using a couple criteria, but my formulas are
getting ridiculously long (on the edge of being too long for Excel) and are
becoming difficult to adjust.
Any thoughts?
Thanks,
Adam
ID Amount
1340 9
1340 5
1340 28
1340 15
1340 61
5450 10
5450 12
5450 12
5450 12
5452 52
5450 52
5452 12
5452 63
1340 118
5450 98
5452 127
Total 343
Why not create another column which would use a lookup to determine
wether or not to include the value - the sumproduct would then just
use this column to determine if the condition is true or not- Hide quoted text -
- Show quoted text -
Ok, but how do we know the criteria to sum - do these criteria change
over time, or are they locked in - if so, probably a COUNTIF to count
the individual ID against a list of SUMMING ID's would do it - that
would return a 1 or 0, which would work well with the SUMPRODUCT
function
.
Relevant Pages
• Re: Rounding Issues
... Mark showed you that when he showed the last SUMPRODUCT formula. ... which sums only those amounts greater than 10. ... ditch SUMIF. ... Say you only wanted to sum the ...
(microsoft.public.excel.worksheet.functions)
• Re: Counting with multiple matching criteria
... Microsoft Excel MVP ... I found it interesting that using SUMPRODUCT instead of SUM did not work ... criteria could be completely removed from the formula and stored in a ...
(microsoft.public.excel.worksheet.functions)
• Re: Stratify Data In a Range
... Bob Phillips explains =sumproduct() in much more detail here: ... "Bernard Liengme" wrote: ... sum of amounts: from 10,000 to 15,000 ...
(microsoft.public.excel.worksheet.functions)
• Re: Sumproduct on multiple "or" conditions
... only want to sum the amounts of one ID, but I am not sure how to sum the ... amounts of multiple IDs using one formula. ... This works fine if I am only using a couple criteria, ...
(microsoft.public.excel.worksheet.functions)
• Re: SumProduct
... Adjust the ranges to match--but you can't use whole columns. ... Bob Phillips explains =sumproduct() in much more detail here: ... I am trying to sum a column based on 2 sets of criteria, ...
(microsoft.public.excel.worksheet.functions)
|
{
"url": "http://www.tech-archive.net/Archive/Excel/microsoft.public.excel.worksheet.functions/2007-08/msg00173.html",
"source_domain": "www.tech-archive.net",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "13519",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HW7T2Q4HRQXIKLVSUP6LTPIHKCJO3ZKD",
"WARC-Concurrent-To": "<urn:uuid:83b2473a-6773-454d-8f42-75bc3bd0214f>",
"WARC-Date": "2013-05-20T02:49:26Z",
"WARC-IP-Address": "93.190.253.180",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:S5QPLT5XIA7ZLXGCJJXA6G3FO7L6RCOW",
"WARC-Record-ID": "<urn:uuid:140c3bdc-2eb1-4688-8b78-15af43ac438e>",
"WARC-Target-URI": "http://www.tech-archive.net/Archive/Excel/microsoft.public.excel.worksheet.functions/2007-08/msg00173.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:51fcf6f5-aad4-4a8c-a32e-bb03f02a2616>"
},
"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,
43,
44,
45,
46,
113,
120,
195,
271,
342,
364,
365,
366,
367,
402,
469,
476,
552,
627,
704,
777,
852,
894,
895,
951,
963,
968,
969,
1043,
1119,
1149,
1150,
1164,
1165,
1173,
1178,
1179,
1189,
1196,
1203,
1211,
1219,
1227,
1235,
1243,
1251,
1259,
1267,
1275,
1283,
1291,
1292,
1301,
1309,
1318,
1328,
1329,
1397,
1465,
1546,
1547,
1568,
1569,
1639,
1709,
1777,
1842,
1851,
1852,
1854,
1855,
1856,
1857,
1872,
1873,
1897,
2077,
2126,
2175,
2358,
2407,
2440,
2585,
2634,
2681,
2871,
2920,
2939,
3139
],
"line_end_idx": [
43,
44,
45,
46,
113,
120,
195,
271,
342,
364,
365,
366,
367,
402,
469,
476,
552,
627,
704,
777,
852,
894,
895,
951,
963,
968,
969,
1043,
1119,
1149,
1150,
1164,
1165,
1173,
1178,
1179,
1189,
1196,
1203,
1211,
1219,
1227,
1235,
1243,
1251,
1259,
1267,
1275,
1283,
1291,
1292,
1301,
1309,
1318,
1328,
1329,
1397,
1465,
1546,
1547,
1568,
1569,
1639,
1709,
1777,
1842,
1851,
1852,
1854,
1855,
1856,
1857,
1872,
1873,
1897,
2077,
2126,
2175,
2358,
2407,
2440,
2585,
2634,
2681,
2871,
2920,
2939,
3139,
3187
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3187,
"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.3414634168148041,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04304160922765732,
"rps_doc_frac_lines_end_with_ellipsis": 0.05617978051304817,
"rps_doc_frac_no_alph_words": 0.30129125714302063,
"rps_doc_frac_unique_words": 0.41025641560554504,
"rps_doc_mean_word_length": 4.664694309234619,
"rps_doc_num_sentences": 55,
"rps_doc_symbol_to_word_ratio": 0.03443329036235809,
"rps_doc_unigram_entropy": 4.918910026550293,
"rps_doc_word_count": 507,
"rps_doc_frac_chars_dupe_10grams": 0.11078224331140518,
"rps_doc_frac_chars_dupe_5grams": 0.19577166438102722,
"rps_doc_frac_chars_dupe_6grams": 0.1898520141839981,
"rps_doc_frac_chars_dupe_7grams": 0.15221987664699554,
"rps_doc_frac_chars_dupe_8grams": 0.15221987664699554,
"rps_doc_frac_chars_dupe_9grams": 0.15221987664699554,
"rps_doc_frac_chars_top_2gram": 0.019027480855584145,
"rps_doc_frac_chars_top_3gram": 0.023678649216890335,
"rps_doc_frac_chars_top_4gram": 0.03171246871352196,
"rps_doc_books_importance": -326.0889892578125,
"rps_doc_books_importance_length_correction": -326.0889892578125,
"rps_doc_openwebtext_importance": -177.05157470703125,
"rps_doc_openwebtext_importance_length_correction": -177.05157470703125,
"rps_doc_wikipedia_importance": -102.37580108642578,
"rps_doc_wikipedia_importance_length_correction": -102.37580108642578
},
"fasttext": {
"dclm": 0.03678512945771217,
"english": 0.8776317238807678,
"fineweb_edu_approx": 1.7798491716384888,
"eai_general_math": 0.9083585739135742,
"eai_open_web_math": 0.40208637714385986,
"eai_web_code": 0.47224366664886475
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,209,200,656,570,748,000 |
Breaking News
Loading...
November 26, 2015
Sharp MX-3111U Driver Download
11/26/2015 07:27:00 PM
Before downloading driver for Sharp MX-3111U
1. argue the printer’s name which in this case would be Sharp MX-3111U.
2. The computer's operating system that you're installing the driver on with examples being Windows 7 and XP, MAC OS, etc. In addition, you’ll need to argue if it's 32 bit or 64 bit.
3. Press the "Download” button of your choice in the following list of Sharp MX-3111U driver.
Sharp MX-3111U Driver for Windows
Sharp MX-3111U for Windows Xp 32bit
Sharp MX-3111U for Windows Xp 64bit
Sharp MX-3111U for Windows 7 32bit
Sharp MX-3111U for Windows 7 64bit
Sharp MX-3111U for Windows 8 32bit
Sharp MX-3111U for Windows 8 64bit
Sharp MX-3111U for Windows 8.1 32bit
Sharp MX-3111U for Windows 8.1 64bit
Sharp MX-3111U Driver for MAC OS
Sharp MX-3111U for MAC OS 10.9
Sharp MX-3111U for MAC OS 10.8
Sharp MX-3111U for MAC OS 10.7
Sharp MX-3111U Driver Download
Sharp MX-3111U Driver Install Printer Guide
If the file format of driver is .exe, simply install it in a similar fashion to other software options. If this isn't an option, you'll need to carry out the following steps
1. Extract the Sharp MX-3111U printer file driver.
2. Start Devices in addition to Printers or Control Panel Hardware as well as Sound Devices and Printers.
3. Click on “Add a printer”
4. Wait until the “Add a printer” windows displays "on" then choose to “Add a local printer”.
5. On the "choose a printer" port page, click on the "existing port option" button along with the recommended printer port and when selected, click "next".
6. You should end up on the “Install the printer driver” section where you will need to choose “Sharp MX-3111U” and find the applicable printer name. If you are unable to find the printer name, press “Have disk” followed by browsing to file .inf (driver printer downloaded)
7. Install the printer driver.
8. Wait until the install is complete.
Be sure to check back on the site frequently to stay updated on the latest printer drivers and other popular software.
0 comments:
Post a Comment
Toggle Footer
|
{
"url": "http://2driver.blogspot.com/2015/11/sharp-mx-3111u-driver-download.html",
"source_domain": "2driver.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "146661",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Q5ZMHJ7UC6JXWEEVUV72G7EG7US7KCQJ",
"WARC-Concurrent-To": "<urn:uuid:602f1ae4-e776-48fa-877c-5a48851be192>",
"WARC-Date": "2018-02-22T15:01:33Z",
"WARC-IP-Address": "172.217.13.225",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NNCS5VMTWDENEPCPPXRXR5PLWQDQ5QAC",
"WARC-Record-ID": "<urn:uuid:6fb2dcc6-9701-4c17-9e1c-b3d2a1f8049f>",
"WARC-Target-URI": "http://2driver.blogspot.com/2015/11/sharp-mx-3111u-driver-download.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a69ed521-8625-429e-9a38-d50c8c6a0a55>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-170-163-162.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
14,
25,
43,
44,
75,
76,
99,
100,
145,
146,
218,
401,
495,
496,
530,
531,
567,
603,
638,
673,
708,
743,
780,
817,
818,
851,
852,
883,
914,
945,
946,
978,
979,
1023,
1024,
1198,
1199,
1250,
1251,
1357,
1358,
1386,
1387,
1481,
1482,
1638,
1639,
1640,
1914,
1915,
1916,
1947,
1986,
1987,
2106,
2107,
2119,
2120,
2135,
2136,
2138
],
"line_end_idx": [
14,
25,
43,
44,
75,
76,
99,
100,
145,
146,
218,
401,
495,
496,
530,
531,
567,
603,
638,
673,
708,
743,
780,
817,
818,
851,
852,
883,
914,
945,
946,
978,
979,
1023,
1024,
1198,
1199,
1250,
1251,
1357,
1358,
1386,
1387,
1481,
1482,
1638,
1639,
1640,
1914,
1915,
1916,
1947,
1986,
1987,
2106,
2107,
2119,
2120,
2135,
2136,
2138,
2151
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2151,
"ccnet_original_nlines": 61,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2520161271095276,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.1088709682226181,
"rps_doc_frac_lines_end_with_ellipsis": 0.016129029914736748,
"rps_doc_frac_no_alph_words": 0.2681451737880707,
"rps_doc_frac_unique_words": 0.44628098607063293,
"rps_doc_mean_word_length": 4.619834899902344,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.0020161299034953117,
"rps_doc_unigram_entropy": 4.570859432220459,
"rps_doc_word_count": 363,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1687537282705307,
"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.14311270415782928,
"rps_doc_frac_chars_top_3gram": 0.09838998317718506,
"rps_doc_frac_chars_top_4gram": 0.10494931042194366,
"rps_doc_books_importance": -231.35693359375,
"rps_doc_books_importance_length_correction": -231.35693359375,
"rps_doc_openwebtext_importance": -140.04383850097656,
"rps_doc_openwebtext_importance_length_correction": -140.04383850097656,
"rps_doc_wikipedia_importance": -68.52206420898438,
"rps_doc_wikipedia_importance_length_correction": -68.52206420898438
},
"fasttext": {
"dclm": 0.027671929448843002,
"english": 0.7728310227394104,
"fineweb_edu_approx": 1.3902446031570435,
"eai_general_math": 0.01119059044867754,
"eai_open_web_math": 0.1917855143547058,
"eai_web_code": 0.00020176000543870032
}
}
|
{
"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.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": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,466,115,873,685,105,700 |
The CSV file format in Effort
This post describes the file format that is compatible with the CsvDataLoader component of the Effort library.
The component accepts files that follow the traditional CSV format:
• The first row contains the header names
• Comma ( , ) is the separator character
• Double quote ( ” ) is the delimiter character
• Double double quote ( “” ) is used to express a single double quote between delimiters
There are some additional requirements that need to be taken into consideration.
• Numbers and dates are parsed with invariant culture setting
• Binaries are encoded in base64 format
• Null values are represented with empty fields without delimiters
• Empty strings are represented with empty fields with delimiter
• Backslash serves as escape character for backslash and newline characters
These are all the rules that are need to be followed. The next example demonstrates the rules by representing a compatible CSV file.
id,name,birthdate,reportto,storages,photo
"JD","John Doe",01/23/1982,"MHS","\\\\server1\\share8\r\n\\\\server2\share3",
"MHS","Michael ""h4x0r"" Smith",05/12/1975,,"","ZzVlKyszZjQ5M2YzNA=="
The content of each database table is represented by a dedicated csv file that has to be named as {table name}.csv.
Advertisements
Data loaders in Effort
Data loaders are useful components in the Effort library that were designed to help setting up the initial state of a fake database.
Adding records to the tables by using the Entity Framework API can be inflexible and the written code might become hard to maintain. Furthermore these type of insert operations flow through the entire EF and Effort pipeline. This might have great performance impact. Data loaders solves these problem by allowing to insert data from any custom source during the initialization with extra small overload.
They are really easy to use, all the developer has to do is to create a data loader instance and pass it to the chosen Effort factory method. For example:
var dataLoader = new EntityDataLoader("name=MyEntities");
var connection = DbConnectionFactory.CreateTransient(dataLoader);
Effort provides multiple built-in data loaders:
• EntityDataLoader
• CsvDataLoader
• CacheDataLoader
EntityDataLoader is able to fetch data from an existing database by utilizing an existing Entity Framework compatible ADO.NET provider. It is initialized with an entity connection string.
var dataLoader = new EntityDataLoader("name=MyEntities");
The purpose of CsvDataLoader is to read data records from CSV files. It is initialized with a path that points to a folder containing the CSV files. Each file represents the content of a database table.
var dataLoader = new CsvDataLoader(@"C:\path\to\files");
The exact format of these CSV files are documented in a separate post. There is also a little tool that helps the developers to export the data from an existing database into appropriately formatted CSV files.
The CachingDataLoader was designed to speed up the initialization process by wrapping any kind of data loader with a cache layer. If the wrapped data loader is specified with a specific configuration the first time, the CachingDataLoader will pull the required data from the wrapped data loader. As a side effect, this data is going to be cached in the memory. If the CachingDataLoader was initialized to wrap the same kind of data loader with the same configuration again, then the data will be retrieved from the previously create cache, the wrapped data loader will not be utilized.
var wrappedDataLoader = new CsvDataLoader(@"C:\path\to\files");
var dataLoader = new CachingDataLoader(wrappedDataLoader, false);
Each data loader can be used in different scenarios. I suggest to use EntityDataLoader during interactive testing, while CachingDataLoader and CsvDataLoader combined can be really useful if they are utilized in automated tests.
|
{
"url": "https://tflamichblog.wordpress.com/2013/01/",
"source_domain": "tflamichblog.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "35324",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5B3QOUCA3SGO74YQCT4NXTC6U5X6UKTS",
"WARC-Concurrent-To": "<urn:uuid:7c493514-2f07-41e1-9035-75e90d6dec16>",
"WARC-Date": "2017-09-23T07:34:20Z",
"WARC-IP-Address": "192.0.78.12",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:V745O5KIJFERCUMWG2T4ORM36JML24XH",
"WARC-Record-ID": "<urn:uuid:d9953d41-a467-44d1-b1af-f855ce0945d1>",
"WARC-Target-URI": "https://tflamichblog.wordpress.com/2013/01/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:72b4d8fb-1e0b-4ecc-b183-655d9c1aeeeb>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-150-123-222.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,
30,
31,
142,
143,
211,
212,
256,
299,
349,
440,
441,
522,
523,
587,
629,
698,
765,
843,
844,
977,
978,
1020,
1098,
1168,
1169,
1285,
1286,
1301,
1302,
1325,
1326,
1459,
1460,
1864,
1865,
2020,
2021,
2079,
2080,
2146,
2147,
2195,
2196,
2217,
2235,
2255,
2256,
2444,
2445,
2503,
2504,
2707,
2708,
2765,
2766,
2976,
2977,
3563,
3564,
3628,
3629,
3695,
3696
],
"line_end_idx": [
30,
31,
142,
143,
211,
212,
256,
299,
349,
440,
441,
522,
523,
587,
629,
698,
765,
843,
844,
977,
978,
1020,
1098,
1168,
1169,
1285,
1286,
1301,
1302,
1325,
1326,
1459,
1460,
1864,
1865,
2020,
2021,
2079,
2080,
2146,
2147,
2195,
2196,
2217,
2235,
2255,
2256,
2444,
2445,
2503,
2504,
2707,
2708,
2765,
2766,
2976,
2977,
3563,
3564,
3628,
3629,
3695,
3696,
3923
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3923,
"ccnet_original_nlines": 63,
"rps_doc_curly_bracket": 0.000509809993673116,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3512747883796692,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024079319089651108,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16855524480342865,
"rps_doc_frac_unique_words": 0.43485915660858154,
"rps_doc_mean_word_length": 5.542253494262695,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.970224380493164,
"rps_doc_word_count": 568,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04764930158853531,
"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.02223633974790573,
"rps_doc_frac_chars_top_3gram": 0.020330369472503662,
"rps_doc_frac_chars_top_4gram": 0.019059719517827034,
"rps_doc_books_importance": -310.4656982421875,
"rps_doc_books_importance_length_correction": -310.4656982421875,
"rps_doc_openwebtext_importance": -192.05160522460938,
"rps_doc_openwebtext_importance_length_correction": -192.05160522460938,
"rps_doc_wikipedia_importance": -155.3611602783203,
"rps_doc_wikipedia_importance_length_correction": -155.3611602783203
},
"fasttext": {
"dclm": 0.06464195251464844,
"english": 0.8436784148216248,
"fineweb_edu_approx": 2.4186081886291504,
"eai_general_math": 0.5647769570350647,
"eai_open_web_math": 0.1735706925392151,
"eai_web_code": 0.8174074292182922
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,220,003,485,093,175,000 |
Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
PerlMonks
Re: use vars in a require()d file
by athomason (Curate)
on Mar 12, 2001 at 05:58 UTC ( #63715=note: print w/ replies, xml ) Need Help??
in reply to use vars in a require()d file
From perlman:lib:vars:
Unlike pragmas that affect the `$^H' hints variable, the `use vars' and `use subs' declarations are not BLOCK-scoped. They are thus effective for the entire file in which they appear. You may not rescind such declarations with `no vars' or `no subs'.
Note the phrase entire file. So, when you declare $qux, $quo, and $zip in foobarbaz.pl, perl has already forgetten that they were declared via use vars by the time you get around to reading them in program.pl. However, the symbol table is more permanent, which is why you can still access them by explicitly specifying package main.
Update
Whoops, guess you shouldn't always believe the docs... it does look like the behavior follows chromatic's explanation.
Replies are listed 'Best First'.
Re (tilly) 2: use vars in a require()d file
by tilly (Archbishop) on Mar 12, 2001 at 07:58 UTC
chromatic is right. However the documentation for vars should be updated to make it clear that a vars declaration is actually package scoped, not file scoped. In other words that global has been declared, and will be considered declared in every file you encounter from then on as long as they are all in the same package. Of course if you are following good Perl tradition and writing lots of modules with private packages, the issue won't come up...
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://63715]
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (8)
As of 2016-08-28 02:26 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
The best thing I ever won in a lottery was:
Results (390 votes). Check out past polls.
|
{
"url": "http://www.perlmonks.org/?node_id=63715",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2016-36",
"warc_metadata": {
"Content-Length": "21504",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DPB5QHSGPZQTJQJF5VRLRXQZLQAXUXTA",
"WARC-Concurrent-To": "<urn:uuid:7a373d2b-c93c-4ae0-bad1-acf36903b64c>",
"WARC-Date": "2016-08-28T02:27:05Z",
"WARC-IP-Address": "216.92.34.251",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BJEJMLSAAAPJRAE3WJTQMJEJYHORT5FI",
"WARC-Record-ID": "<urn:uuid:e5cbcdf3-4a02-4cea-a496-8781e3e592b2>",
"WARC-Target-URI": "http://www.perlmonks.org/?node_id=63715",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:de375ab3-d863-4971-b1e4-dcfe7f44be11>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-153-172-175.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-36\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 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,
63,
98,
100,
112,
113,
147,
148,
170,
250,
251,
252,
294,
295,
318,
569,
570,
903,
904,
911,
912,
1031,
1032,
1065,
1109,
1160,
1616,
1617,
1625,
1635,
1645,
1646,
1666,
1684,
1697,
1710,
1739,
1744,
1756,
1793,
1794,
1832,
1845,
1885,
1912,
1922,
1935,
1947,
1958,
1976,
2024,
2025,
2026,
2027,
2028,
2029,
2030,
2031,
2032,
2033,
2034,
2035,
2036,
2037,
2038,
2039
],
"line_end_idx": [
63,
98,
100,
112,
113,
147,
148,
170,
250,
251,
252,
294,
295,
318,
569,
570,
903,
904,
911,
912,
1031,
1032,
1065,
1109,
1160,
1616,
1617,
1625,
1635,
1645,
1646,
1666,
1684,
1697,
1710,
1739,
1744,
1756,
1793,
1794,
1832,
1845,
1885,
1912,
1922,
1935,
1947,
1958,
1976,
2024,
2025,
2026,
2027,
2028,
2029,
2030,
2031,
2032,
2033,
2034,
2035,
2036,
2037,
2038,
2039,
2085
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2085,
"ccnet_original_nlines": 65,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.339092880487442,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01943843998014927,
"rps_doc_frac_lines_end_with_ellipsis": 0.030303029343485832,
"rps_doc_frac_no_alph_words": 0.25701943039894104,
"rps_doc_frac_unique_words": 0.6374269127845764,
"rps_doc_mean_word_length": 4.602339267730713,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.010799139738082886,
"rps_doc_unigram_entropy": 5.103024482727051,
"rps_doc_word_count": 342,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.060991108417510986,
"rps_doc_frac_chars_dupe_6grams": 0.04447267949581146,
"rps_doc_frac_chars_dupe_7grams": 0.030495550483465195,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02223633974790573,
"rps_doc_frac_chars_top_3gram": 0.017153749242424965,
"rps_doc_frac_chars_top_4gram": 0.019059719517827034,
"rps_doc_books_importance": -199.96530151367188,
"rps_doc_books_importance_length_correction": -199.96530151367188,
"rps_doc_openwebtext_importance": -109.58949279785156,
"rps_doc_openwebtext_importance_length_correction": -109.58949279785156,
"rps_doc_wikipedia_importance": -99.29307556152344,
"rps_doc_wikipedia_importance_length_correction": -99.29307556152344
},
"fasttext": {
"dclm": 0.048562709242105484,
"english": 0.9354097247123718,
"fineweb_edu_approx": 1.8717821836471558,
"eai_general_math": 0.015751779079437256,
"eai_open_web_math": 0.29163986444473267,
"eai_web_code": 0.0004233699874021113
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,209,610,358,485,564,000 |
kunal-chowdhury.com
Git Basics: How to rename a Git Branch?
These days, Git is one of the most popular version control systems available for software development. Git was created by Linus Torvalds in 2005 for development of the Linux kernel and gradually used as a free software distributed under GNU General Public License version 2.
Though there are many UI tools available for Git, but sometimes working with Git command is very tricky. Today in this post, we will learn the basics on renaming a Git branch.
How to rename a Git branch (www.kunal-chowdhury.com)
It’s a general issue for the developers working in Git to rename an existing branch that they are currently working on. Let me give a simple use case to demonstrate the problem.
Suppose, you are working on a branch but later you decided to change the name of it to identify easily. As it is not like the style of Windows Explorer renaming, you need to provide few commands to rename the branch and push the changes to the remote repository.
First, you need to provide the command to rename:
git branch –m [Old_Name] [New_Name]
Then you need to delete the previous branch and commit the new one:
git push origin :[Old_Name] [New_Name]
There are few additional commands, which you can use too:
git branch –m [New_Name] # When you provide the command inside the [Old_Branch]
git branch –m [Old_Name] [New_Name] # When the command provided from root
git branch –M [Old_Name] [New_Name] # Force to rename the branch, even though it exists
git push origin :[Old_Name] # Delete the old branch from remote
git push origin [New_Name] # Push the new branch to remote
git push origin :[Old_Name] [New_Name] # Delete the old branch and push the new branch to remote
git push --set-upstream origin [New_Name] # Push the new branch, set local branch to track the remote
Was this post useful? If you came to this page by searching online about renaming git branch, please have a look into my other blog posts. Subscribe to the RSS feed or the newsletter to keep yourself updated. If you have any queries, you can either ping me on Twitter or drop a line below in the comments section.
Kunal Chowdhury
If you have come this far, it means that you liked what you are reading (Git Basics: How to rename a Git Branch?).
Why not reach little more and connect with me directly on Twitter, Facebook and LinkedIn. I would love to hear your thoughts and opinions.
Authored Books:
|
{
"url": "https://www.kunal-chowdhury.com/2016/09/git-cheatsheet-how-to-rename-git-branch.html",
"source_domain": "www.kunal-chowdhury.com",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "60206",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:C2MXKVIZDS5DIIPFJSW4FH4K6IW4QR3D",
"WARC-Concurrent-To": "<urn:uuid:d020191a-6ab7-43e9-83e8-a5041b118c16>",
"WARC-Date": "2019-06-20T15:33:04Z",
"WARC-IP-Address": "104.18.37.8",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:FEEPVMCPIJUNFODQ4UXHJKEVO7327B4G",
"WARC-Record-ID": "<urn:uuid:aafc62a1-d274-4a9c-a2aa-68ce033a283e>",
"WARC-Target-URI": "https://www.kunal-chowdhury.com/2016/09/git-cheatsheet-how-to-rename-git-branch.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:67a005bd-f431-4859-9775-4bb3545710ca>"
},
"warc_info": "isPartOf: CC-MAIN-2019-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-113-175-32.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,
20,
21,
61,
62,
63,
338,
339,
341,
342,
518,
519,
521,
522,
575,
576,
578,
579,
757,
758,
760,
761,
1024,
1025,
1027,
1028,
1078,
1079,
1118,
1119,
1121,
1122,
1190,
1191,
1230,
1231,
1233,
1234,
1236,
1237,
1295,
1296,
1404,
1405,
1486,
1487,
1582,
1583,
1585,
1586,
1678,
1679,
1765,
1766,
1868,
1869,
1871,
1872,
1975,
1976,
1978,
1979,
1981,
1982,
2296,
2297,
2299,
2300,
2302,
2303,
2304,
2320,
2435,
2436,
2575,
2576
],
"line_end_idx": [
20,
21,
61,
62,
63,
338,
339,
341,
342,
518,
519,
521,
522,
575,
576,
578,
579,
757,
758,
760,
761,
1024,
1025,
1027,
1028,
1078,
1079,
1118,
1119,
1121,
1122,
1190,
1191,
1230,
1231,
1233,
1234,
1236,
1237,
1295,
1296,
1404,
1405,
1486,
1487,
1582,
1583,
1585,
1586,
1678,
1679,
1765,
1766,
1868,
1869,
1871,
1872,
1975,
1976,
1978,
1979,
1981,
1982,
2296,
2297,
2299,
2300,
2302,
2303,
2304,
2320,
2435,
2436,
2575,
2576,
2591
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2591,
"ccnet_original_nlines": 75,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38899803161621094,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009823179803788662,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.174852654337883,
"rps_doc_frac_unique_words": 0.45783132314682007,
"rps_doc_mean_word_length": 4.566265106201172,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0.013752459548413754,
"rps_doc_unigram_entropy": 4.695796012878418,
"rps_doc_word_count": 415,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.16200527548789978,
"rps_doc_frac_chars_dupe_6grams": 0.09762533009052277,
"rps_doc_frac_chars_dupe_7grams": 0.06437995284795761,
"rps_doc_frac_chars_dupe_8grams": 0.06437995284795761,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04274405911564827,
"rps_doc_frac_chars_top_3gram": 0.021108180284500122,
"rps_doc_frac_chars_top_4gram": 0.01899736002087593,
"rps_doc_books_importance": -206.46559143066406,
"rps_doc_books_importance_length_correction": -206.46559143066406,
"rps_doc_openwebtext_importance": -103.24067687988281,
"rps_doc_openwebtext_importance_length_correction": -103.24067687988281,
"rps_doc_wikipedia_importance": -61.57434844970703,
"rps_doc_wikipedia_importance_length_correction": -61.57434844970703
},
"fasttext": {
"dclm": 0.03707766905426979,
"english": 0.913211464881897,
"fineweb_edu_approx": 2.2382090091705322,
"eai_general_math": 0.037785228341817856,
"eai_open_web_math": 0.1333659291267395,
"eai_web_code": 0.027002330869436264
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.135",
"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": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,096,430,773,254,765,000 |
oracle9i的init.ora参数文件问题
教程发布：风哥 教程分类：ITPUX技术网 更新日期：2022-02-12 浏览学习：353
ora9i的init.ora参数文件问题
我刚刚安装了Oracle9i。当我改变了init.ora的设置后,好像并没有什么效果,您可以告诉我发生了什么事情吗？
答案在于一个新的特性--Stored Parameter File（SPFILE,存储参数文件）。
在Oracle8i和以前的版本中,启动数据库后,该数据库的init.ora文件必须在客户机上。如果希望远程启动一个数据库实例,必须得有一个init.ora文件的本地拷贝,这是因为运行在客户机上的Oracle 数据库后端程序会处理init.ora文件的内容。这使得在网络中重新启动一个数据库多少有点困难。
在Oracle9i中,SPFILE文件以二进制格式存储于服务器自身。远程启动数据库不再需要建立本地拷贝（尽管如果愿意的话,你仍然可以那么做）。这也意味着,使用
ALTER SYSTEM命令做出的改变当服务器重启时可以仍然有效,所以不再对init.ora文件进行更新。
SPFILE存储于服务器中由初始化参数spfile指定的位置上,如清单1所示。
SPFILE由新命令CREATE SPFILE创建,其语法是：
CREATE SPFILE = 'filename'
FROM PFILE ='pfilename';
可以使用CREATE PFILE命令来创建这个两进制格式参数文件的文本版本：
CREATE PFILE = 'pfilename'
FROM SPFILE = 'filename';
这一命令总是在服务器上（而不是在执行这一命令的客户机上）建立文本格式的参数文件。可以利用这一命令输出所有的参数、修改它们,以及利用参数文件（PFILE）创建新的SPFILE文件。
如果希望使用一个特定的PFILE文件,可以在starup命令中使用pfile=选项。
SQL> startup pfile=filename
如果想改变系统参数,可以使用ALTER SYSTEM命令的扩展语法格式来设置参数：
ALTER SYSTEM set parameter = value
SCOPE = MEMORY | SPFILE | BOTH;
SCOPE子句使你可以设置一个系统参数：
MEMORY：只对当前的数据库产生影响,重新启动后将不再有效。
SPFILE：这一选项不会改变当前的参数设置,但它会修改SPFILE文件,所以重新启动后,参数将会生效。
BOTH：它会改变当前设置并更新SPFILE。
本文标签：
网站声明：本文由风哥整理发布,转载请保留此段声明，本站所有内容将不对其使用后果做任何承诺，请读者谨慎使用！
【上一篇】
【下一篇】
|
{
"url": "http://www.fgedu.net.cn/4860.html",
"source_domain": "www.fgedu.net.cn",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "43279",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:B3WFWWCM2AKIIWGLGBPKL7VG6AQOFWQP",
"WARC-Concurrent-To": "<urn:uuid:576ecfa9-99db-4e4f-b337-8ca47ef9698c>",
"WARC-Date": "2024-09-07T12:11:58Z",
"WARC-IP-Address": "122.114.45.237",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:D43OBL66TIVZEZUYVKKVV6EKJF3POQ74",
"WARC-Record-ID": "<urn:uuid:823f36fd-8b10-4c14-94d4-926dce79f0b9>",
"WARC-Target-URI": "http://www.fgedu.net.cn/4860.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c025787a-6722-48e6-b5f8-3ea1ba24507e>"
},
"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-248\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,
24,
25,
72,
73,
94,
95,
154,
204,
356,
436,
437,
491,
492,
532,
533,
565,
592,
617,
618,
657,
684,
710,
711,
801,
844,
845,
873,
915,
950,
982,
1003,
1035,
1088,
1112,
1113,
1119,
1173,
1179
],
"line_end_idx": [
24,
25,
72,
73,
94,
95,
154,
204,
356,
436,
437,
491,
492,
532,
533,
565,
592,
617,
618,
657,
684,
710,
711,
801,
844,
845,
873,
915,
950,
982,
1003,
1035,
1088,
1112,
1113,
1119,
1173,
1179,
1184
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1184,
"ccnet_original_nlines": 38,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.004878050182014704,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.17073170840740204,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6682927012443542,
"rps_doc_frac_unique_words": 0.8392857313156128,
"rps_doc_mean_word_length": 18.89285659790039,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.793210744857788,
"rps_doc_word_count": 56,
"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.026465030387043953,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -97.68797302246094,
"rps_doc_books_importance_length_correction": -97.68797302246094,
"rps_doc_openwebtext_importance": -41.88279342651367,
"rps_doc_openwebtext_importance_length_correction": -41.8124885559082,
"rps_doc_wikipedia_importance": -27.68194580078125,
"rps_doc_wikipedia_importance_length_correction": -27.68194580078125
},
"fasttext": {
"dclm": 0.9923347234725952,
"english": 0.0031564899254590273,
"fineweb_edu_approx": 3.447946786880493,
"eai_general_math": 0.2230483889579773,
"eai_open_web_math": 0.23446518182754517,
"eai_web_code": 0.6543720364570618
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,426,231,524,928,256,000 |
Edit in JSRUN
console 命令行工具 X clear
>
console
window.onload = function () {
var myDiv = document.getElementById('drag'),
closeDiv = firstChild(myDiv);
addEvent(myDiv, "mousedown", drag);
addEvent(myDiv, "mouseup", undrag);
addEvent(closeDiv, "click", close);
function drag (event) {
//鼠标按下时，鼠标与盒子之间的距离
var xx = event.clientX - myDiv.offsetLeft,
xy = event.clientY - myDiv.offsetTop,
maxW = (document.documentElement.clientWidth || document.body.clientWidth) - myDiv.offsetWidth - 10,
maxY = (document.documentElement.clientHeight || document.body.clientHeight) - myDiv.offsetHeight;
document.onmousemove = function (e) {
l = e.clientX - xx;
t = e.clientY - xy;
if (l <= 0) {
l = 0;
} else if (l > maxW) {
l = maxW;
}
if (t <= 10) {
t = 10;
} else if (t > maxY) {
t = maxY
}
myDiv.style.left = l + "px";
myDiv.style.top = t + "px";
}
}
function addEvent (e, type, handle) {
if (e.addEventListener) {
e.addEventListener(type, handle);
} else if (e.attchEvent) {
e.attchEvent("on" + type, handle);
} else {
e["on" + type] = handle;
}
}
function firstChild (e) {
var childList = e.childNodes,
len = childList.length;
for (var i = 0; i < len; i++) {
if (childList[i].nodeType == 1 && childList[i].tagName == 'DIV') {
return childList[i];
}
}
return null;
}
function undrag () {
document.onmousemove = 'null';
}
function close () {
this.parentNode.style.display = "none";
}
}
<body>
<div id="drag">
<div class="close"></div>
<div class="logo"></div>
<div class="scanner">
<p>账 号：<input type="text" name="username" /></p>
<p>密 码：<input type="password" name="password" /></p>
</div>
</div>
</body>
#drag {width: 500px; height: 300px; position: absolute; top: 200px; left: 200px; background-color: #F6F6F6; border: 2px solid #ddd;border-radius: 15px; }
#drag>div.close {width:28px; height:28px; cursor:pointer; background: url(http://sandbox.runjs.cn/uploads/rs/186/mf579xno/boxy_btn.png); position:absolute; top:-10px; right:-10px; }
#drag>div.logo {background: url(http://sandbox.runjs.cn/uploads/rs/186/mf579xno/login_window_logo.png) no-repeat -201px -0px; width:200px; height:44px; margin: 20px auto 0 auto; cursor: move}
#drag>div.scanner {margin: 30px auto 0 auto; width:240px; font:bold 15px 微软雅黑;}
#drag>div.scanner input {color:#888; border-radius: 8px;}
|
{
"url": "http://jsrun.net/c2KKp/embedded/all/quite",
"source_domain": "jsrun.net",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "6585",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LXQFV5WG5V76KMUNI2BFNNCFLV4UP2EY",
"WARC-Concurrent-To": "<urn:uuid:5a5907ab-4457-466b-b393-76c7e3b2b760>",
"WARC-Date": "2017-06-24T03:44:14Z",
"WARC-IP-Address": "122.114.44.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LAN2XHFCRAVHYCNU5HSECEQPZHFNUXL7",
"WARC-Record-ID": "<urn:uuid:c2fb7b97-515d-4ee7-a325-ce51d581b917>",
"WARC-Target-URI": "http://jsrun.net/c2KKp/embedded/all/quite",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:01a69c24-e97b-4d10-ae4b-1b062b09416f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-99-177-250.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,
14,
15,
37,
38,
59,
61,
69,
99,
148,
186,
226,
266,
306,
334,
361,
412,
462,
575,
686,
732,
764,
796,
822,
845,
880,
906,
920,
947,
971,
1006,
1031,
1045,
1086,
1126,
1136,
1142,
1184,
1212,
1249,
1278,
1316,
1327,
1355,
1359,
1362,
1392,
1424,
1451,
1485,
1555,
1580,
1585,
1589,
1604,
1607,
1632,
1671,
1677,
1701,
1749,
1755,
1757,
1764,
1784,
1814,
1843,
1873,
1935,
2001,
2016,
2027,
2035,
2189,
2371,
2563,
2643
],
"line_end_idx": [
14,
15,
37,
38,
59,
61,
69,
99,
148,
186,
226,
266,
306,
334,
361,
412,
462,
575,
686,
732,
764,
796,
822,
845,
880,
906,
920,
947,
971,
1006,
1031,
1045,
1086,
1126,
1136,
1142,
1184,
1212,
1249,
1278,
1316,
1327,
1355,
1359,
1362,
1392,
1424,
1451,
1485,
1555,
1580,
1585,
1589,
1604,
1607,
1632,
1671,
1677,
1701,
1749,
1755,
1757,
1764,
1784,
1814,
1843,
1873,
1935,
2001,
2016,
2027,
2035,
2189,
2371,
2563,
2643,
2700
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2700,
"ccnet_original_nlines": 76,
"rps_doc_curly_bracket": 0.015555559657514095,
"rps_doc_ldnoobw_words": 2,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08206687122583389,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0060790302231907845,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5501520037651062,
"rps_doc_frac_unique_words": 0.6398104429244995,
"rps_doc_mean_word_length": 7.345971584320068,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0.012158050201833248,
"rps_doc_unigram_entropy": 4.685425281524658,
"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.011612899601459503,
"rps_doc_frac_chars_top_3gram": 0.011612899601459503,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -278.9396057128906,
"rps_doc_books_importance_length_correction": -278.9396057128906,
"rps_doc_openwebtext_importance": -159.40716552734375,
"rps_doc_openwebtext_importance_length_correction": -159.40716552734375,
"rps_doc_wikipedia_importance": -107.33101654052734,
"rps_doc_wikipedia_importance_length_correction": -107.33101654052734
},
"fasttext": {
"dclm": 0.9996424913406372,
"english": 0.1529625803232193,
"fineweb_edu_approx": 3.5143673419952393,
"eai_general_math": 0.6635122299194336,
"eai_open_web_math": 0.19148677587509155,
"eai_web_code": 0.7848973870277405
}
}
|
{
"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": "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": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-9,203,642,787,180,080,000 |
Animation works fine in Playground but not in localhost
Hello,
I’ve made an animation for a loading screen with ellipses changing size over time. This animation works fine in the Playground and by opening the index file on his own, but running it through the localhost doesn’t play the animation.
I’ve redone it multiple times, even copy-pasted the index file from the playground into my project to see if I had missed some imports, but nothing changed. Is there something I missed?
Thank you for your time.
When you are saying - on localhost, how do you serve the files? Is there any error in the console? Are you using the file downloaded from the playground directly?
Hello, after a few more attempts, I’ve realized the issue does not come from the animation itself, and probably not from the localhost.
In this playground, I’m attempting to import a mesh asynchronously, and I have a loading screen showing the import progress. While the mesh is importing, the animation does not play. It will only play once the mesh had been imported, but since it immediately hides the UI on completion, I cannot see the animation.
Here, I have intentionally added an error in the then() method of the promise to show what the UI should look like when importing. Since I don’t have a .babylon file heavy enough to make the loading long enough for testing.
I don’t know why the animation doesn’t play on start. The UI is created before the import starts, and the animation is called in the CreateLoadingScreen() function for each ellipse in the UI.
Edit : I have found a bigger model to better illustrate my problem. You can now clearly see the loading progress and how the animation is supposed to play once the mesh has been imported
Hi @ClementSXD ! Welcome aboard!
I believe it’s because the loading/creating assets is running in the same thread as the ellipse loader animation and the loading process blocks the loader animation.
Check out this section of the docs:
https://doc.babylonjs.com/features/featuresDeepDive/scene/offscreenCanvas
or just use a regular HTML element to display a loader animation:
The reason this is happening is because the scene doesn’t render until it is considered ready. To override this you can make sure the scene is ready before starting the loading process. A simple way to do it is to add a single observable to the onBeforeRender observable:
Animation not playing while importing a model. | Babylon.js Playground (babylonjs.com)
You can also do it with a simple setTimeout
1 Like
Hi Raanan, thank you, your solution was the most straightforward and easiest to implement. I thought it was weird ImportMeshAsync would block the main thread like Roland’s answer said, but maybe I’m wrong.
Thank you both for helping me with my project.
1 Like
|
{
"url": "https://forum.babylonjs.com/t/animation-works-fine-in-playground-but-not-in-localhost/49725",
"source_domain": "forum.babylonjs.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "41391",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OAXFLWAJ34GGTE4VCTP6Z5QVDQKSKYQ3",
"WARC-Concurrent-To": "<urn:uuid:6b85bb9b-3e6b-4917-8fbe-c5ae26987835>",
"WARC-Date": "2024-05-21T13:31:42Z",
"WARC-IP-Address": "184.105.99.75",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RDTO7TQE3IMOTHRWD32MLZY6UDVLD3CU",
"WARC-Record-ID": "<urn:uuid:5088f19f-14f8-47ad-952c-5b11e4065819>",
"WARC-Target-URI": "https://forum.babylonjs.com/t/animation-works-fine-in-playground-but-not-in-localhost/49725",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d433848a-a2d5-4f05-9c47-2205a3bf1743>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-29\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
56,
57,
64,
298,
299,
485,
486,
511,
512,
675,
676,
812,
813,
1128,
1129,
1353,
1354,
1546,
1547,
1734,
1735,
1768,
1769,
1935,
1936,
1972,
2046,
2047,
2113,
2114,
2386,
2387,
2474,
2475,
2519,
2520,
2527,
2528,
2734,
2735,
2782,
2783
],
"line_end_idx": [
56,
57,
64,
298,
299,
485,
486,
511,
512,
675,
676,
812,
813,
1128,
1129,
1353,
1354,
1546,
1547,
1734,
1735,
1768,
1769,
1935,
1936,
1972,
2046,
2047,
2113,
2114,
2386,
2387,
2474,
2475,
2519,
2520,
2527,
2528,
2734,
2735,
2782,
2783,
2789
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2789,
"ccnet_original_nlines": 42,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43462899327278137,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03710246831178665,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1431095451116562,
"rps_doc_frac_unique_words": 0.4698275923728943,
"rps_doc_mean_word_length": 4.808189868927002,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.865933895111084,
"rps_doc_word_count": 464,
"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.03765128180384636,
"rps_doc_frac_chars_top_3gram": 0.016136260703206062,
"rps_doc_frac_chars_top_4gram": 0.017929179593920708,
"rps_doc_books_importance": -258.5309143066406,
"rps_doc_books_importance_length_correction": -258.5309143066406,
"rps_doc_openwebtext_importance": -105.81743621826172,
"rps_doc_openwebtext_importance_length_correction": -105.81743621826172,
"rps_doc_wikipedia_importance": -77.02542877197266,
"rps_doc_wikipedia_importance_length_correction": -77.02542877197266
},
"fasttext": {
"dclm": 0.09940469264984131,
"english": 0.9400871992111206,
"fineweb_edu_approx": 1.3358815908432007,
"eai_general_math": 0.6426407098770142,
"eai_open_web_math": 0.1660786271095276,
"eai_web_code": 0.2506706118583679
}
}
|
{
"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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
616,070,415,983,185,200 |
This is a split board - You can return to the Split List for other boards.
I don't understand why so many people try to go for "stable" overclocks
• Topic Archived
You're browsing the GameFAQs Message Boards as a guest. Sign Up for free (or Log In if you already have an account) to be able to post messages, change how messages are displayed, and view media in posts.
1. Boards
2. PC
3. I don't understand why so many people try to go for "stable" overclocks
User Info: CatholicChurch
CatholicChurch
2 years ago#1
I've had CPUs that when overclocked to 4.4 Ghz for instance, they'll fail a stress test after 30 or so minutes, but when playing a PCSX2 game that utilizes your CPU to 100% as well, won't crash at all no matter how long you play. I think people get too caught up in having a CPU that performs well on stress tests with calculations that no CPU would ever perform under any circumstance (except within the stress test of course).
To me, if I can get a lower voltage that allows me to do the tasks that I enjoy on a day to day basis rather than a higher voltage that allows me to "pass" some arbitrary stress test, I'd choose the lower voltage any day.
Thoughts?
PM me to hear more about Jesus Christ and the wonderful things that can happen to you as a result..TODAY!
User Info: shadosneko
shadosneko
2 years ago#2
I'm not sure what you're saying. You're not sure why people don't just keep their CPU's at a voltage/heat level that can damage it?
http://backloggery.com/shados http://last.fm/user/ShadosNeko
VISUALSHOCK! SPEEDSHOCK! SOUNDSHOCK! NOW IS TIME TO THE 68000 HEART ON FIRE!
User Info: HydroCannabinol
HydroCannabinol
2 years ago#3
Thoughts are if its not stable you're susceptible to BSODs and other crashes.
If it doesn't happen while you're playing a game then I guess its fine but a lot of people like the peace of mind that the PC won't crash due to instability.
It also means that technically your overclock could either be higher with proper settings or remain the same but tweaked for more stability.
Personal preference really...
Steam ID: Mind_Explosion
I thought I chose very easy, not brand new to the game. - CheesyPhil
User Info: fatali
fatali
2 years ago#4
Because not everybody uses their PC just for games, some people make important work that would create a big problem if the information was corrupted.
Mystery is the source of all true science.
User Info: Edavy89
Edavy89
2 years ago#5
fatali posted...
Because not everybody uses their PC just for games, some people make important work that would create a big problem if the information was corrupted.
If you are doing a lot of important work on your PC, why risk overclocking it to begin with?
User Info: Psythik
Psythik
2 years ago#6
fatali posted...
Because not everybody uses their PC just for games, some people make important work that would create a big problem if the information was corrupted.
This. An unstable OC could f*** up your Excel spreadsheets when it miscalculates the math. Or cause glitches & artifacts when rendering video. Or even cause strange bugs in games that you might assume were just bad programming. It might not seem like it to you, but doing the calculations properly is important.
4670K OC | 2GB PNY GTX 770 OC | 8GB 1600 | 120GB SSD | 1TB WD Blue | Gigabyte Z87MX | EVGA 600w | BitFenix Phenom M | Win8.1 Pro
http://imgur.com/KaTyP5o.jpg
User Info: Psythik
Psythik
2 years ago#7
Edavy89 posted...
fatali posted...
Because not everybody uses their PC just for games, some people make important work that would create a big problem if the information was corrupted.
If you are doing a lot of important work on your PC, why risk overclocking it to begin with?
So that you can get your important work done faster. OCing is relatively safe even for critical work so long as you do it properly.
4670K OC | 2GB PNY GTX 770 OC | 8GB 1600 | 120GB SSD | 1TB WD Blue | Gigabyte Z87MX | EVGA 600w | BitFenix Phenom M | Win8.1 Pro
http://imgur.com/KaTyP5o.jpg
User Info: CatholicChurch
CatholicChurch
2 years ago#8
to me I wouldn't even overclock a computer if I had to use it for something as important as work. A lot of people would share my sentiments. There's just too much risk involved, even after "passing" a stress test.
http://en.wikipedia.org/wiki/Overclocking#Stability_and_functional_correctness
"A large scale field 2011 study of hardware faults causing a system crash for consumer PCs and laptops showed a 4x to 20x increase (depending on CPU manufacturer) in system crashes due to CPU failure for over-clocked computers over an 8 month period."
I'd bet a lot of those hardware faults were from "stable" CPUs that passed stress tests.
PM me to hear more about Jesus Christ and the wonderful things that can happen to you as a result..TODAY!
User Info: fatali
fatali
2 years ago#9
You ask why people want a stable OC, that is one of the reasons. I guess you thought there wasn't a reason and now are upset that I give you one?
Mystery is the source of all true science.
User Info: CatholicChurch
CatholicChurch
2 years ago#10
fatali posted...
You ask why people want a stable OC, that is one of the reasons. I guess you thought there wasn't a reason and now are upset that I give you one?
My point is that there's no such thing as a stable OC. You could pass one stress test and then fail another. And over time an overclock becomes unstable, so there's no way to tell when it crosses from "stable" into "unstable" or if it even ever was stable in the first place.
Too many people get hung up on stress tests.
PM me to hear more about Jesus Christ and the wonderful things that can happen to you as a result..TODAY!
1. Boards
2. PC
3. I don't understand why so many people try to go for "stable" overclocks
Report Message
Terms of Use Violations:
Etiquette Issues:
Notes (optional; required for "Other"):
Add user to Ignore List after reporting
Topic Sticky
You are not allowed to request a sticky.
• Topic Archived
|
{
"url": "https://www.gamefaqs.com/boards/916373-pc/69815282",
"source_domain": "www.gamefaqs.com",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "53475",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MCB2C47KDET2LWBIX4JTPQAUNIELJIUB",
"WARC-Concurrent-To": "<urn:uuid:46db7334-9ea2-43d4-9e07-6c61a1f6f91f>",
"WARC-Date": "2017-03-29T10:01:56Z",
"WARC-IP-Address": "64.30.228.84",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:E4EAM6NPNRUWB7FE2JGGLHEPC5ZBF52V",
"WARC-Record-ID": "<urn:uuid:b54954a3-17f9-4d78-bd59-f68676df9c7b>",
"WARC-Target-URI": "https://www.gamefaqs.com/boards/916373-pc/69815282",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a5557eca-1988-4b69-a223-541816c7c0e1>"
},
"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,
75,
76,
148,
149,
168,
373,
385,
393,
470,
471,
497,
498,
513,
527,
956,
957,
1179,
1180,
1190,
1296,
1297,
1319,
1320,
1331,
1345,
1477,
1538,
1615,
1616,
1643,
1644,
1660,
1674,
1752,
1753,
1911,
1912,
2053,
2054,
2084,
2109,
2178,
2179,
2197,
2198,
2205,
2219,
2369,
2412,
2413,
2432,
2433,
2441,
2455,
2472,
2622,
2623,
2624,
2717,
2718,
2737,
2738,
2746,
2760,
2777,
2927,
3239,
3368,
3397,
3398,
3417,
3418,
3426,
3440,
3458,
3475,
3625,
3626,
3627,
3720,
3852,
3981,
4010,
4011,
4037,
4038,
4053,
4067,
4281,
4282,
4361,
4362,
4614,
4615,
4704,
4810,
4811,
4829,
4830,
4837,
4851,
4997,
5040,
5041,
5067,
5068,
5083,
5098,
5115,
5261,
5262,
5263,
5539,
5540,
5585,
5691,
5703,
5711,
5788,
5789,
5804,
5805,
5830,
5831,
5849,
5850,
5890,
5930,
5931,
5944,
5945,
5986,
5987
],
"line_end_idx": [
75,
76,
148,
149,
168,
373,
385,
393,
470,
471,
497,
498,
513,
527,
956,
957,
1179,
1180,
1190,
1296,
1297,
1319,
1320,
1331,
1345,
1477,
1538,
1615,
1616,
1643,
1644,
1660,
1674,
1752,
1753,
1911,
1912,
2053,
2054,
2084,
2109,
2178,
2179,
2197,
2198,
2205,
2219,
2369,
2412,
2413,
2432,
2433,
2441,
2455,
2472,
2622,
2623,
2624,
2717,
2718,
2737,
2738,
2746,
2760,
2777,
2927,
3239,
3368,
3397,
3398,
3417,
3418,
3426,
3440,
3458,
3475,
3625,
3626,
3627,
3720,
3852,
3981,
4010,
4011,
4037,
4038,
4053,
4067,
4281,
4282,
4361,
4362,
4614,
4615,
4704,
4810,
4811,
4829,
4830,
4837,
4851,
4997,
5040,
5041,
5067,
5068,
5083,
5098,
5115,
5261,
5262,
5263,
5539,
5540,
5585,
5691,
5703,
5711,
5788,
5789,
5804,
5805,
5830,
5831,
5849,
5850,
5890,
5930,
5931,
5944,
5945,
5986,
5987,
6005
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6005,
"ccnet_original_nlines": 133,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37259429693222046,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06697460263967514,
"rps_doc_frac_lines_end_with_ellipsis": 0.04477611929178238,
"rps_doc_frac_no_alph_words": 0.18783679604530334,
"rps_doc_frac_unique_words": 0.35721200704574585,
"rps_doc_mean_word_length": 4.507260322570801,
"rps_doc_num_sentences": 76,
"rps_doc_symbol_to_word_ratio": 0.01308699045330286,
"rps_doc_unigram_entropy": 5.417481899261475,
"rps_doc_word_count": 1033,
"rps_doc_frac_chars_dupe_10grams": 0.36361685395240784,
"rps_doc_frac_chars_dupe_5grams": 0.41602233052253723,
"rps_doc_frac_chars_dupe_6grams": 0.4070017337799072,
"rps_doc_frac_chars_dupe_7grams": 0.36361685395240784,
"rps_doc_frac_chars_dupe_8grams": 0.36361685395240784,
"rps_doc_frac_chars_dupe_9grams": 0.36361685395240784,
"rps_doc_frac_chars_top_2gram": 0.017182130366563797,
"rps_doc_frac_chars_top_3gram": 0.0064432998187839985,
"rps_doc_frac_chars_top_4gram": 0.01975945010781288,
"rps_doc_books_importance": -728.774658203125,
"rps_doc_books_importance_length_correction": -728.774658203125,
"rps_doc_openwebtext_importance": -331.5926208496094,
"rps_doc_openwebtext_importance_length_correction": -331.5926208496094,
"rps_doc_wikipedia_importance": -301.9502258300781,
"rps_doc_wikipedia_importance_length_correction": -301.9502258300781
},
"fasttext": {
"dclm": 0.7512992024421692,
"english": 0.9481051564216614,
"fineweb_edu_approx": 1.5370204448699951,
"eai_general_math": 0.04649227857589722,
"eai_open_web_math": 0.3095150589942932,
"eai_web_code": 0.030287329107522964
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.17",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "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": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"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": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,228,244,354,393,059,000 |
What is Y? 1. y^3 + 2y = y + 2y^2 2. y^2 = y : GMAT Data Sufficiency (DS)
Check GMAT Club Decision Tracker for the Latest School Decision Releases http://gmatclub.com/AppTrack
It is currently 18 Jan 2017, 08:28
GMAT Club Tests
Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
we will pick new questions that match your level based on your Timer History
Track
Your Progress
every week, we’ll send you an estimated GMAT score based on your performance
Practice
Pays
we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
Events & Promotions
Events & Promotions in June
Open Detailed Calendar
What is Y? 1. y^3 + 2y = y + 2y^2 2. y^2 = y
new topic post reply Question banks Downloads My Bookmarks Reviews Important topics
Author Message
TAGS:
Hide Tags
Manager
Manager
avatar
Joined: 08 Sep 2010
Posts: 166
Followers: 0
Kudos [?]: 23 [0], given: 18
What is Y? 1. y^3 + 2y = y + 2y^2 2. y^2 = y [#permalink]
Show Tags
New post 04 Jul 2011, 07:02
00:00
A
B
C
D
E
Difficulty:
(N/A)
Question Stats:
83% (01:53) correct 17% (01:34) wrong based on 6 sessions
HideShow timer Statistics
What is Y?
1. y^3 + 2y = y + 2y^2
2. y^2 = y
[Reveal] Spoiler: OA
_________________
My will shall shape the future. Whether I fail or succeed shall be no man's doing but my own.
If you like my explanations award kudos.
Manager
Manager
User avatar
Joined: 29 Jun 2011
Posts: 76
Followers: 3
Kudos [?]: 16 [0], given: 47
Re: What is y ? [#permalink]
Show Tags
New post 04 Jul 2011, 07:08
easy :
take statement 2 : y^2 = y => y = 0 or 1 => statement is not sufficient
take statement 1 : y^3 + 2y = y + 2y^2 => y = 0 or 1 => statement is not sufficient
take both together : y = 0 or y =1 => statements is not sufficient together
Ans E
any doubt? ask
_________________
It matters not how strait the gate,
How charged with punishments the scroll,
I am the master of my fate :
I am the captain of my soul.
~ William Ernest Henley
SVP
SVP
avatar
Joined: 16 Nov 2010
Posts: 1672
Location: United States (IN)
Concentration: Strategy, Technology
Followers: 33
Kudos [?]: 514 [0], given: 36
Premium Member Reviews Badge
Re: What is y ? [#permalink]
Show Tags
New post 04 Jul 2011, 07:09
(1) says :
y^3 + 2y = y + 2y^2
=> y^3 - 2y^2 + y = 0
=> y(y^2 - 2y + 1) = 0
=> y(y-1)^2 = 0
So y = 0, or y = 1
Insufficient
(2) says :
y^2 = y
=> y(y-1) = 0
=> y = 0 or y = 1
Insufficient
(1) + (2)
y = 0 or y = 1
Insufficient
Answer - E
_________________
Formula of Life -> Achievement/Potential = k * Happiness (where k is a constant)
GMAT Club Premium Membership - big benefits and savings
Intern
Intern
avatar
Joined: 11 Sep 2010
Posts: 14
Location: India
GMAT 1: 620 Q49 V25
Followers: 0
Kudos [?]: 5 [0], given: 3
Re: What is y ? [#permalink]
Show Tags
New post 04 Jul 2011, 07:14
puneetj wrote:
What is Y?
1. y^3 + 2y = y + 2y^2
2. y^2 = y
1. y^3 + 2y = y + 2y^2
y^3 + 2y - y - 2y^2 = 0
y(y^2 + 1 - 2y) = 0
y = 0 or y-1=0 => y=1
Cant conclude
2. y^2 - y = 0
y(y-1) = 0
y = 0 or y-1=0 => y=1
Cant conclude
Together also can't conclude hence E.
We cannot cancel y on both side as it not known whether it is -ve or +ve.
Manager
Manager
avatar
Joined: 08 Sep 2010
Posts: 166
Followers: 0
Kudos [?]: 23 [0], given: 18
Re: What is y ? [#permalink]
Show Tags
New post 04 Jul 2011, 07:16
Thanks...i realize my mistake. Did not pay attention to the 1st equation...:(
This is what I did..
y^3 + 2y = y + 2y^2
y(y^2 + 2) = y(1 + 2y)
Then cancelled the y on both sides ....big mistake
_________________
My will shall shape the future. Whether I fail or succeed shall be no man's doing but my own.
If you like my explanations award kudos.
Re: What is y ? [#permalink] 04 Jul 2011, 07:16
Similar topics Author Replies Last post
Similar
Topics:
Experts publish their posts in the topic What is the value of x^2 - y^2 ? redpearl 2 09 May 2012, 23:07
What is the value of x^2 + y^2 ? (1) x^2+ y^2 = 2xy + 1 (2) dreambeliever 4 05 Jun 2011, 08:16
1 Experts publish their posts in the topic What is the value of x^2 + y^2 ? krazo 6 04 Oct 2010, 17:06
What is the value of x^2 + y^2? 1) x^2 + y^2 = 2xy + 1 2) youven 6 24 Jul 2010, 07:50
5 If x^3*y = 24, what is the value of x^2*y^3 - x^2*y^2? Hussain15 14 20 Apr 2010, 06:27
Display posts from previous: Sort by
What is Y? 1. y^3 + 2y = y + 2y^2 2. y^2 = y
new topic post reply Question banks Downloads My Bookmarks Reviews Important topics
GMAT Club MBA Forum Home| About| Terms and Conditions| GMAT Club Rules| Contact| Sitemap
Powered by phpBB © phpBB Group and phpBB SEO
Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.
|
{
"url": "http://gmatclub.com/forum/what-is-y-1-y-3-2y-y-2y-2-2-y-2-y-116409.html?fl=similar",
"source_domain": "gmatclub.com",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "280688",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EVBNT7AL5G7R5K3WPOFJLG6ORDIECWVL",
"WARC-Concurrent-To": "<urn:uuid:2f63b105-80be-4d31-904e-41278eb9f488>",
"WARC-Date": "2017-01-18T16:28:30Z",
"WARC-IP-Address": "198.11.238.98",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:MMGIGAJHGH5D46UUMGTIX2ETQ6QUV3X2",
"WARC-Record-ID": "<urn:uuid:17b913c6-7073-4634-9909-7909c79dd981>",
"WARC-Target-URI": "http://gmatclub.com/forum/what-is-y-1-y-3-2y-y-2y-2-2-y-2-y-116409.html?fl=similar",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:82c9f302-8fc3-44cb-8d65-bc80bec15567>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-70.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-04\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for January 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
74,
176,
177,
212,
228,
229,
235,
236,
257,
258,
434,
435,
446,
454,
455,
532,
533,
539,
553,
554,
631,
632,
641,
646,
647,
724,
725,
847,
848,
854,
855,
876,
877,
892,
893,
913,
914,
942,
965,
966,
1011,
1012,
1100,
1115,
1121,
1122,
1132,
1133,
1141,
1149,
1156,
1176,
1187,
1200,
1201,
1230,
1231,
1289,
1290,
1300,
1301,
1329,
1335,
1337,
1339,
1341,
1343,
1345,
1346,
1358,
1359,
1365,
1366,
1382,
1383,
1441,
1442,
1468,
1469,
1480,
1481,
1504,
1505,
1516,
1537,
1538,
1556,
1557,
1651,
1652,
1693,
1694,
1702,
1710,
1722,
1742,
1752,
1765,
1766,
1795,
1796,
1825,
1826,
1836,
1837,
1865,
1872,
1944,
2028,
2104,
2110,
2111,
2126,
2144,
2145,
2181,
2222,
2251,
2280,
2304,
2305,
2309,
2313,
2320,
2340,
2352,
2381,
2417,
2431,
2432,
2462,
2463,
2492,
2521,
2522,
2532,
2533,
2561,
2572,
2573,
2593,
2594,
2616,
2617,
2640,
2641,
2657,
2658,
2677,
2678,
2691,
2692,
2703,
2704,
2712,
2713,
2727,
2728,
2746,
2747,
2760,
2761,
2771,
2772,
2787,
2788,
2801,
2802,
2803,
2814,
2832,
2833,
2914,
2915,
2971,
2972,
2979,
2986,
2993,
3013,
3023,
3039,
3059,
3072,
3073,
3100,
3101,
3130,
3131,
3141,
3142,
3170,
3185,
3196,
3197,
3220,
3221,
3232,
3233,
3234,
3257,
3281,
3301,
3323,
3324,
3338,
3339,
3354,
3365,
3387,
3388,
3402,
3403,
3441,
3442,
3516,
3524,
3532,
3539,
3559,
3570,
3583,
3584,
3613,
3614,
3643,
3644,
3654,
3655,
3683,
3761,
3762,
3783,
3784,
3804,
3827,
3828,
3879,
3897,
3898,
3992,
3993,
4034,
4035,
4085,
4129,
4137,
4145,
4249,
4344,
4447,
4533,
4622,
4659,
4660,
4705,
4706,
4794,
4795,
4796,
4885,
4886,
4931,
4932
],
"line_end_idx": [
74,
176,
177,
212,
228,
229,
235,
236,
257,
258,
434,
435,
446,
454,
455,
532,
533,
539,
553,
554,
631,
632,
641,
646,
647,
724,
725,
847,
848,
854,
855,
876,
877,
892,
893,
913,
914,
942,
965,
966,
1011,
1012,
1100,
1115,
1121,
1122,
1132,
1133,
1141,
1149,
1156,
1176,
1187,
1200,
1201,
1230,
1231,
1289,
1290,
1300,
1301,
1329,
1335,
1337,
1339,
1341,
1343,
1345,
1346,
1358,
1359,
1365,
1366,
1382,
1383,
1441,
1442,
1468,
1469,
1480,
1481,
1504,
1505,
1516,
1537,
1538,
1556,
1557,
1651,
1652,
1693,
1694,
1702,
1710,
1722,
1742,
1752,
1765,
1766,
1795,
1796,
1825,
1826,
1836,
1837,
1865,
1872,
1944,
2028,
2104,
2110,
2111,
2126,
2144,
2145,
2181,
2222,
2251,
2280,
2304,
2305,
2309,
2313,
2320,
2340,
2352,
2381,
2417,
2431,
2432,
2462,
2463,
2492,
2521,
2522,
2532,
2533,
2561,
2572,
2573,
2593,
2594,
2616,
2617,
2640,
2641,
2657,
2658,
2677,
2678,
2691,
2692,
2703,
2704,
2712,
2713,
2727,
2728,
2746,
2747,
2760,
2761,
2771,
2772,
2787,
2788,
2801,
2802,
2803,
2814,
2832,
2833,
2914,
2915,
2971,
2972,
2979,
2986,
2993,
3013,
3023,
3039,
3059,
3072,
3073,
3100,
3101,
3130,
3131,
3141,
3142,
3170,
3185,
3196,
3197,
3220,
3221,
3232,
3233,
3234,
3257,
3281,
3301,
3323,
3324,
3338,
3339,
3354,
3365,
3387,
3388,
3402,
3403,
3441,
3442,
3516,
3524,
3532,
3539,
3559,
3570,
3583,
3584,
3613,
3614,
3643,
3644,
3654,
3655,
3683,
3761,
3762,
3783,
3784,
3804,
3827,
3828,
3879,
3897,
3898,
3992,
3993,
4034,
4035,
4085,
4129,
4137,
4145,
4249,
4344,
4447,
4533,
4622,
4659,
4660,
4705,
4706,
4794,
4795,
4796,
4885,
4886,
4931,
4932,
5099
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5099,
"ccnet_original_nlines": 264,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.224175825715065,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03076923079788685,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.446153849363327,
"rps_doc_frac_unique_words": 0.3904109597206116,
"rps_doc_mean_word_length": 3.974885940551758,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0.006593409925699234,
"rps_doc_unigram_entropy": 5.265995979309082,
"rps_doc_word_count": 876,
"rps_doc_frac_chars_dupe_10grams": 0.3078690469264984,
"rps_doc_frac_chars_dupe_5grams": 0.38655945658683777,
"rps_doc_frac_chars_dupe_6grams": 0.36703044176101685,
"rps_doc_frac_chars_dupe_7grams": 0.34893739223480225,
"rps_doc_frac_chars_dupe_8grams": 0.34893739223480225,
"rps_doc_frac_chars_dupe_9grams": 0.33630096912384033,
"rps_doc_frac_chars_top_2gram": 0.027570359408855438,
"rps_doc_frac_chars_top_3gram": 0.022113729268312454,
"rps_doc_frac_chars_top_4gram": 0.025272829458117485,
"rps_doc_books_importance": -629.4849853515625,
"rps_doc_books_importance_length_correction": -629.4849853515625,
"rps_doc_openwebtext_importance": -341.0879211425781,
"rps_doc_openwebtext_importance_length_correction": -341.0879211425781,
"rps_doc_wikipedia_importance": -231.82765197753906,
"rps_doc_wikipedia_importance_length_correction": -231.82765197753906
},
"fasttext": {
"dclm": 0.5081391930580139,
"english": 0.8102065920829773,
"fineweb_edu_approx": 1.6508358716964722,
"eai_general_math": 0.4546908736228943,
"eai_open_web_math": 0.14134937524795532,
"eai_web_code": -0.000008820000402920414
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "378.166",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Higher and Universities and colleges"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,499,576,871,596,000,000 |
WordPress.org
Ideas
select only one category
1. leac3
Member
12345
hi, It would be nice if WP would can create post only under one category, like phpBB, for example: I create a post, and select only one category or subcategory.
WP would can do this and continue working with its multiple categories selection, if the admin set this setting from the admin panel.
Sorry for my bad english!!
Posted: 10 years ago #
2. A small tip for your english: would + can = could :-)
Posted: 10 years ago #
3. Jonathan Landrum
Inactive
Why not just select one category now? What's the patch?
Posted: 10 years ago #
4. leac3
Member
12345
ups!! thanks for the recomendation aercolino.
the problem is when any user create a post in various categories at the same time. it seemed this categories would be Tags.
Posted: 10 years ago #
RSS feed for this topic
Topic Closed
This topic has been closed to new replies.
• Rating
12345
44 Votes
• Status
This is plugin territory
|
{
"url": "https://wordpress.org/ideas/topic/select-only-one-category",
"source_domain": "wordpress.org",
"snapshot_id": "crawl=CC-MAIN-2017-09",
"warc_metadata": {
"Content-Length": "20113",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TUKWRDRATRQK5E7GYDW7RDFHGFBUKTFX",
"WARC-Concurrent-To": "<urn:uuid:447d813c-5073-4a5d-8ffb-f89e0f72152b>",
"WARC-Date": "2017-02-26T17:56:54Z",
"WARC-IP-Address": "66.155.40.250",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:375MYCJYQOTQFYINZABDHLGBSPE2ZF3E",
"WARC-Record-ID": "<urn:uuid:31ec1068-817f-4ab3-a669-2b5a71a375b9>",
"WARC-Target-URI": "https://wordpress.org/ideas/topic/select-only-one-category",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d7277a2d-d2d4-41f1-a16b-f62975152b8d>"
},
"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,
14,
15,
21,
22,
47,
48,
59,
70,
71,
81,
82,
247,
248,
386,
387,
418,
419,
446,
505,
506,
533,
555,
568,
569,
629,
630,
657,
668,
679,
680,
690,
691,
741,
742,
870,
871,
898,
899,
923,
924,
937,
938,
981,
982,
993,
994,
1004,
1017,
1028,
1029
],
"line_end_idx": [
14,
15,
21,
22,
47,
48,
59,
70,
71,
81,
82,
247,
248,
386,
387,
418,
419,
446,
505,
506,
533,
555,
568,
569,
629,
630,
657,
668,
679,
680,
690,
691,
741,
742,
870,
871,
898,
899,
923,
924,
937,
938,
981,
982,
993,
994,
1004,
1017,
1028,
1029,
1057
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1057,
"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.33990147709846497,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024630539119243622,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23645320534706116,
"rps_doc_frac_unique_words": 0.604790449142456,
"rps_doc_mean_word_length": 4.4371256828308105,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0.019704429432749748,
"rps_doc_unigram_entropy": 4.416409015655518,
"rps_doc_word_count": 167,
"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.0593792200088501,
"rps_doc_frac_chars_top_3gram": 0.07017543911933899,
"rps_doc_frac_chars_top_4gram": 0.08636976778507233,
"rps_doc_books_importance": -69.65201568603516,
"rps_doc_books_importance_length_correction": -69.65201568603516,
"rps_doc_openwebtext_importance": -35.765037536621094,
"rps_doc_openwebtext_importance_length_correction": -23.531185150146484,
"rps_doc_wikipedia_importance": -39.069217681884766,
"rps_doc_wikipedia_importance_length_correction": -39.069217681884766
},
"fasttext": {
"dclm": 0.028210340067744255,
"english": 0.9155604243278503,
"fineweb_edu_approx": 1.530184268951416,
"eai_general_math": 0.13168394565582275,
"eai_open_web_math": 0.15181922912597656,
"eai_web_code": 0.0000066799998421629425
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.7",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,090,582,003,210,603,500 |
+ Start a Discussion
DeepikareddyDeepikareddy
hi to check duplicated in the List and show a pop-up in salesforce
list<string> Productdetails = new list<string>();
empdetails.add('sony');
empdetails.add('samsung');
empdetails.add('Voltas');
empdetails.add('bluestar');
list<string> Itemdetails = new list<string>();
empdetails.add('LG');
empdetails.add('samsung');
empdetails.add('Butterfly');
need to check it if the duplicate is ther, need to show a pop up as already exists,with bootstrap popup model
thanks
deepika
ANUTEJANUTEJ (Salesforce Developers)
Hi Deepika,
In case if you want to stop people from entering a value already present in list then I think you can make use of a set so that the values are not duplicated.
I hope this helps in case if it does can you please choose this as the best answer so that it can be used by others in the future.
Regards,
Anutej
DeepikareddyDeepikareddy
hi anutej,thanks for your reply, my requirement is to use the List and if any duplicates present , jst need to add the pop of of default ,bootstrap, iam thinking to add a flag as true and flase and display it depending on the dupliactes checking
thanks
Deepika
ANUTEJANUTEJ (Salesforce Developers)
Hi Deepika,
If that is the case instead of appending th values directly by hardcoding, one possibility I could think of is to have a input box and have an add button to append to the list and on clicking on add you can have an alert to state your message in case if there are any duplicates present in the list.
I hope this helps.
Regards,
Anutej
|
{
"url": "https://developer.salesforce.com/forums/ForumsMain?id=9062I000000XwDWQA0",
"source_domain": "developer.salesforce.com",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "220095",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IXQLNGZVIR67QWU53ZBDBF5GH63AHYQJ",
"WARC-Concurrent-To": "<urn:uuid:87609b19-6a8a-47bf-8fca-88989246b069>",
"WARC-Date": "2021-06-13T12:13:54Z",
"WARC-IP-Address": "199.232.65.145",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:S5AXOGB26AYRRRWDV2VX2VH4SJBV7ZUA",
"WARC-Record-ID": "<urn:uuid:1096fc8b-039c-41ae-aa05-d4560744bd93>",
"WARC-Target-URI": "https://developer.salesforce.com/forums/ForumsMain?id=9062I000000XwDWQA0",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cc26bc2a-a9f3-4f61-ab58-1eb8995ce4e9>"
},
"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,
21,
47,
48,
115,
116,
166,
167,
191,
218,
244,
272,
273,
274,
321,
322,
344,
371,
400,
401,
402,
513,
514,
522,
531,
569,
582,
583,
742,
743,
874,
875,
884,
891,
916,
1163,
1164,
1165,
1172,
1181,
1219,
1231,
1232,
1532,
1533,
1552,
1553,
1562
],
"line_end_idx": [
21,
47,
48,
115,
116,
166,
167,
191,
218,
244,
272,
273,
274,
321,
322,
344,
371,
400,
401,
402,
513,
514,
522,
531,
569,
582,
583,
742,
743,
874,
875,
884,
891,
916,
1163,
1164,
1165,
1172,
1181,
1219,
1231,
1232,
1532,
1533,
1552,
1553,
1562,
1568
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1568,
"ccnet_original_nlines": 47,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41640380024909973,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022082019597291946,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16719242930412292,
"rps_doc_frac_unique_words": 0.4897119402885437,
"rps_doc_mean_word_length": 5.004115104675293,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.506005764007568,
"rps_doc_word_count": 243,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08881579339504242,
"rps_doc_frac_chars_dupe_6grams": 0.08881579339504242,
"rps_doc_frac_chars_dupe_7grams": 0.08881579339504242,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.023026319220662117,
"rps_doc_frac_chars_top_3gram": 0.024671049788594246,
"rps_doc_frac_chars_top_4gram": 0.05756578966975212,
"rps_doc_books_importance": -143.49913024902344,
"rps_doc_books_importance_length_correction": -130.6738739013672,
"rps_doc_openwebtext_importance": -95.52800750732422,
"rps_doc_openwebtext_importance_length_correction": -95.52800750732422,
"rps_doc_wikipedia_importance": -60.16032409667969,
"rps_doc_wikipedia_importance_length_correction": -46.372154235839844
},
"fasttext": {
"dclm": 0.07140933722257614,
"english": 0.7314589619636536,
"fineweb_edu_approx": 1.4312971830368042,
"eai_general_math": 0.8242764472961426,
"eai_open_web_math": 0.19101732969284058,
"eai_web_code": 0.32552921772003174
}
}
|
{
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-91,614,239,157,173,340 |
Help using Base SAS procedures
Calculate mean
Reply
New Contributor
Posts: 2
Calculate mean
Hello All,
I am trying to get adjusted GPA but SAS keeps giving me an errror. I got the student GPA = 3.18 so I put:
PROC MEANS DATA= STUDENTS MEAN;
VAR GPA;
RUN;
DATA ADJ GPA;
SET STUDENTS;
ADJ GPA = STUDENT MEAN - GPA;
RUN;
I keep getting statement is not valid, can you help??
Thanks!
Super User
Posts: 10,217
Re: Calculate mean
You need to use valid SAS names for variables and datasets. Valid SAS names contain only letters, digits and underlines, and start with either a letter or underline. No blanks.
---------------------------------------------------------------------------------------------
Maxims of Maximally Efficient SAS Programmers
How to convert datasets to data steps
How to post code
Super User
Posts: 10,217
Re: Calculate mean
In the fiuture, when you get an ERROR you have no clue about, post the log.
---------------------------------------------------------------------------------------------
Maxims of Maximally Efficient SAS Programmers
How to convert datasets to data steps
How to post code
Super User
Posts: 23,700
Re: Calculate mean
How is this different that your previous question? Which have valid answers?
https://communities.sas.com/t5/SAS-Studio/Help-on-calculations/m-p/331649
Ask a Question
Discussion stats
• 3 replies
• 203 views
• 2 likes
• 3 in conversation
|
{
"url": "https://communities.sas.com/t5/SAS-Procedures/Calculate-mean/td-p/331874?nobounce",
"source_domain": "communities.sas.com",
"snapshot_id": "crawl=CC-MAIN-2018-30",
"warc_metadata": {
"Content-Length": "173937",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DUCKPUOVNIPIICLHGPJZ2NJ7KDW36NMA",
"WARC-Concurrent-To": "<urn:uuid:f42c5032-e82c-4b21-80f1-1540b64fdfea>",
"WARC-Date": "2018-07-17T21:17:49Z",
"WARC-IP-Address": "208.74.205.167",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HE5VIB4TLQFI3BZ3KWM7LWR4V2YK5VNC",
"WARC-Record-ID": "<urn:uuid:c42f5461-2fc6-463b-870e-3186b195edcc>",
"WARC-Target-URI": "https://communities.sas.com/t5/SAS-Procedures/Calculate-mean/td-p/331874?nobounce",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:92cf3030-cbbc-4114-9067-51602f37131d>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-225-182-164.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,
31,
32,
47,
48,
54,
70,
79,
80,
95,
96,
107,
108,
110,
111,
217,
218,
220,
221,
253,
262,
267,
268,
270,
271,
285,
299,
329,
334,
335,
337,
338,
392,
393,
395,
396,
404,
405,
416,
430,
431,
450,
451,
628,
629,
723,
769,
807,
824,
835,
849,
850,
869,
870,
946,
947,
1041,
1087,
1125,
1142,
1153,
1167,
1168,
1187,
1188,
1266,
1267,
1269,
1270,
1344,
1345,
1360,
1377,
1391,
1405,
1417
],
"line_end_idx": [
31,
32,
47,
48,
54,
70,
79,
80,
95,
96,
107,
108,
110,
111,
217,
218,
220,
221,
253,
262,
267,
268,
270,
271,
285,
299,
329,
334,
335,
337,
338,
392,
393,
395,
396,
404,
405,
416,
430,
431,
450,
451,
628,
629,
723,
769,
807,
824,
835,
849,
850,
869,
870,
946,
947,
1041,
1087,
1125,
1142,
1153,
1167,
1168,
1187,
1188,
1266,
1267,
1269,
1270,
1344,
1345,
1360,
1377,
1391,
1405,
1417,
1438
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1438,
"ccnet_original_nlines": 75,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24907062947750092,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.12267658114433289,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26022306084632874,
"rps_doc_frac_unique_words": 0.5621890425682068,
"rps_doc_mean_word_length": 4.711442947387695,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.512998104095459,
"rps_doc_word_count": 201,
"rps_doc_frac_chars_dupe_10grams": 0.20696938037872314,
"rps_doc_frac_chars_dupe_5grams": 0.2639915645122528,
"rps_doc_frac_chars_dupe_6grams": 0.2639915645122528,
"rps_doc_frac_chars_dupe_7grams": 0.2639915645122528,
"rps_doc_frac_chars_dupe_8grams": 0.20696938037872314,
"rps_doc_frac_chars_dupe_9grams": 0.20696938037872314,
"rps_doc_frac_chars_top_2gram": 0.06863780319690704,
"rps_doc_frac_chars_top_3gram": 0.044350579380989075,
"rps_doc_frac_chars_top_4gram": 0.04012671858072281,
"rps_doc_books_importance": -113.5302505493164,
"rps_doc_books_importance_length_correction": -110.75201416015625,
"rps_doc_openwebtext_importance": -52.42353439331055,
"rps_doc_openwebtext_importance_length_correction": -52.42353439331055,
"rps_doc_wikipedia_importance": -22.080413818359375,
"rps_doc_wikipedia_importance_length_correction": -14.657297134399414
},
"fasttext": {
"dclm": 0.21531754732131958,
"english": 0.7231664657592773,
"fineweb_edu_approx": 1.1630445718765259,
"eai_general_math": 0.023292239755392075,
"eai_open_web_math": 0.15536385774612427,
"eai_web_code": -0.000005129999863129342
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,510,476,643,874,354,400 |
2
votes
2answers
68 views
What is PATH on a Mac OS?
What is the PATH in a Mac OS? I have used it to install global command-line tools, but the only documentation I have found are tutorials for doing just that, with no real explanation of what is ...
1
vote
0answers
71 views
Map invalid file paths to valid file paths
I am running a program on linux which access an invalid location, say: /home/area/file. I know the valid location is /home/area/something_else/file. The problem is the input file for this program is ...
1
vote
1answer
39 views
Filepath: use same filepath on unix and winodws
I am working on application which work on both unix and windows environment. I have mapped my unix drive on windows using samba. On cygwin: ls -l /remote /remote -> //samba1 when I try ...
1
vote
1answer
484 views
How to force a particular version of Java?
I am on a RHEL 5.5 64 bit box. The systems engineer installed the 64-bit Java VM under /usr/bin ; however, I needed a 32 bit VM which he installed in /opt/jdk1.6.0_35. But now, everytime I do java ...
6
votes
2answers
1k views
Why Bash unable to find command even if $PATH is specified properly?
I am specifying path to my command in the file /etc/profile: export PATH=$PATH:/usr/app/cpn/bin My command is located in: $ which ydisplay /usr/app/cpn/bin/ydisplay So, when I performing "echo ...
4
votes
1answer
571 views
Why do Mono applications only start from their own directory?
If I want to run the application monodevelop, I need to chdir to /usr/lib/monodevelop/Bin and then execute ./MonoDevelop.exe. This is the same for all other Mono applications such as banshee, tomboy, ...
|
{
"url": "http://unix.stackexchange.com/questions/tagged/path+linux",
"source_domain": "unix.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "57446",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WUEUINOZHDQIMCETVG3VUYWPNVTQSR4O",
"WARC-Concurrent-To": "<urn:uuid:d62a6ba7-d072-4391-bcd0-51911b56ea08>",
"WARC-Date": "2014-03-14T05:14:36Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:VNA4IUH74JLPAUBNDRHD2KVRIHNBAOPV",
"WARC-Record-ID": "<urn:uuid:acefeaf9-ebab-43f9-82ab-e1da5dcec750>",
"WARC-Target-URI": "http://unix.stackexchange.com/questions/tagged/path+linux",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c9507c80-4ec8-4199-b72e-647dec5efe09>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
2,
8,
17,
26,
27,
53,
54,
252,
254,
259,
268,
277,
278,
321,
322,
525,
527,
532,
540,
549,
550,
598,
599,
788,
790,
795,
803,
813,
814,
857,
858,
1059,
1061,
1067,
1076,
1085,
1086,
1155,
1156,
1353,
1355,
1361,
1369,
1379,
1380,
1442,
1443
],
"line_end_idx": [
2,
8,
17,
26,
27,
53,
54,
252,
254,
259,
268,
277,
278,
321,
322,
525,
527,
532,
540,
549,
550,
598,
599,
788,
790,
795,
803,
813,
814,
857,
858,
1059,
1061,
1067,
1076,
1085,
1086,
1155,
1156,
1353,
1355,
1361,
1369,
1379,
1380,
1442,
1443,
1646
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1646,
"ccnet_original_nlines": 47,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2902374565601349,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06332454085350037,
"rps_doc_frac_lines_end_with_ellipsis": 0.125,
"rps_doc_frac_no_alph_words": 0.24538259208202362,
"rps_doc_frac_unique_words": 0.5719424486160278,
"rps_doc_mean_word_length": 4.510791301727295,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0.015831129625439644,
"rps_doc_unigram_entropy": 4.772083759307861,
"rps_doc_word_count": 278,
"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.009569380432367325,
"rps_doc_frac_chars_top_3gram": 0.009569380432367325,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -133.56565856933594,
"rps_doc_books_importance_length_correction": -119.9073257446289,
"rps_doc_openwebtext_importance": -89.37667083740234,
"rps_doc_openwebtext_importance_length_correction": -89.37667083740234,
"rps_doc_wikipedia_importance": -65.1993408203125,
"rps_doc_wikipedia_importance_length_correction": -52.8254280090332
},
"fasttext": {
"dclm": 0.33958929777145386,
"english": 0.8994928598403931,
"fineweb_edu_approx": 1.7049692869186401,
"eai_general_math": 0.1899283528327942,
"eai_open_web_math": 0.21543389558792114,
"eai_web_code": 0.015482190065085888
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-100,068,659,172,171,630 |
source: zzuf/trunk/src/myfork.c @ 4667
Last change on this file since 4667 was 4667, checked in by Sam Hocevar, 10 years ago
Make it easier to dynamically allocate the debug filedescriptor later.
• Property svn:keywords set to Id
File size: 15.9 KB
Line
1/*
2 * zzuf - general purpose fuzzer
3 * Copyright (c) 2002-2010 Sam Hocevar <[email protected]>
4 * All Rights Reserved
5 *
6 * This program is free software. It comes without any warranty, to
7 * the extent permitted by applicable law. You can redistribute it
8 * and/or modify it under the terms of the Do What The Fuck You Want
9 * To Public License, Version 2, as published by Sam Hocevar. See
10 * http://sam.zoy.org/wtfpl/COPYING for more details.
11 */
12
13/*
14 * myfork.c: launcher
15 */
16
17#include "config.h"
18
19#define _INCLUDE_POSIX_SOURCE /* for STDERR_FILENO on HP-UX */
20
21#if defined HAVE_STDINT_H
22# include <stdint.h>
23#elif defined HAVE_INTTYPES_H
24# include <inttypes.h>
25#endif
26#include <stdio.h>
27#include <stdlib.h>
28#if defined HAVE_UNISTD_H
29# include <unistd.h>
30#endif
31#if defined HAVE_WINDOWS_H
32# include <windows.h>
33# include <imagehlp.h>
34# include <tlhelp32.h>
35#endif
36#if defined HAVE_IO_H
37# include <io.h>
38#endif
39#include <string.h>
40#include <fcntl.h> /* for O_BINARY */
41#if defined HAVE_SYS_RESOURCE_H
42# include <sys/resource.h> /* for RLIMIT_AS */
43#endif
44
45#include "common.h"
46#include "opts.h"
47#include "random.h"
48#include "fd.h"
49#include "fuzz.h"
50#include "myfork.h"
51#include "md5.h"
52#include "timer.h"
53
54/* Handle old libtool versions */
55#if !defined LT_OBJDIR
56# define LT_OBJDIR ".libs/"
57#endif
58
59#if defined RLIMIT_AS
60# define ZZUF_RLIMIT_MEM RLIMIT_AS
61#elif defined RLIMIT_VMEM
62# define ZZUF_RLIMIT_MEM RLIMIT_VMEM
63#elif defined RLIMIT_DATA
64# define ZZUF_RLIMIT_MEM RLIMIT_DATA
65#else
66# undef ZZUF_RLIMIT_MEM
67#endif
68
69#if defined RLIMIT_CPU
70# define ZZUF_RLIMIT_CPU RLIMIT_CPU
71#else
72# undef ZZUF_RLIMIT_CPU
73#endif
74
75static int run_process(struct child *child, struct opts *, int[][2]);
76
77#if defined HAVE_WINDOWS_H
78# define PARENT_FD(x) ((x) ? 0 : 1)
79# define CHILD_FD(x) ((x) ? 1 : 0)
80#else
81# define PARENT_FD(x) 0
82# define CHILD_FD(x) 1
83#endif
84
85#if defined HAVE_WINDOWS_H
86static void rep32(uint8_t *buf, void *addr);
87static int dll_inject(PROCESS_INFORMATION *, char const *);
88static intptr_t get_proc_address(void *, DWORD, char const *);
89#endif
90
91int myfork(struct child *child, struct opts *opts)
92{
93 int pipes[3][2];
94 pid_t pid;
95 int i;
96
97 /* Prepare communication pipe */
98 for(i = 0; i < 3; i++)
99 {
100 int ret;
101#if defined HAVE_PIPE
102 ret = pipe(pipes[i]);
103#elif defined HAVE__PIPE
104 int tmp;
105 /* The pipe is created with NOINHERIT otherwise both parts are
106 * inherited. We then duplicate the part we want. */
107 ret = _pipe(pipes[i], 512, _O_BINARY | O_NOINHERIT);
108 tmp = _dup(pipes[i][CHILD_FD(i)]);
109 close(pipes[i][CHILD_FD(i)]);
110 pipes[i][CHILD_FD(i)] = tmp;
111#endif
112 if(ret < 0)
113 {
114 perror("pipe");
115 return -1;
116 }
117 }
118
119 pid = run_process(child, opts, pipes);
120 if(pid < 0)
121 {
122 /* FIXME: close pipes */
123 fprintf(stderr, "error launching `%s'\n", child->newargv[0]);
124 return -1;
125 }
126
127 child->pid = pid;
128 for(i = 0; i < 3; i++)
129 {
130 close(pipes[i][CHILD_FD(i)]);
131 child->fd[i] = pipes[i][PARENT_FD(i)];
132 }
133
134 return 0;
135}
136
137#if !defined HAVE_SETENV
138static void setenv(char const *name, char const *value, int overwrite)
139{
140 char *str;
141
142 if(!overwrite && getenv(name))
143 return;
144
145 str = malloc(strlen(name) + 1 + strlen(value) + 1);
146 sprintf(str, "%s=%s", name, value);
147 putenv(str);
148}
149#endif
150
151static int run_process(struct child *child, struct opts *opts, int pipes[][2])
152{
153 char buf[64];
154#if defined HAVE_FORK
155 static int const files[] = { DEBUG_FILENO, STDERR_FILENO, STDOUT_FILENO };
156 char *libpath, *tmp;
157 int pid, j, len = strlen(opts->oldargv[0]);
158# if defined __APPLE__
159# define EXTRAINFO ""
160# define PRELOAD "DYLD_INSERT_LIBRARIES"
161 setenv("DYLD_FORCE_FLAT_NAMESPACE", "1", 1);
162# elif defined __osf__
163# define EXTRAINFO ":DEFAULT"
164# define PRELOAD "_RLD_LIST"
165# elif defined __sun && defined __i386
166# define EXTRAINFO ""
167# define PRELOAD "LD_PRELOAD_32"
168# else
169# define EXTRAINFO ""
170# define PRELOAD "LD_PRELOAD"
171# endif
172#elif HAVE_WINDOWS_H
173 PROCESS_INFORMATION pinfo;
174 STARTUPINFO sinfo;
175 HANDLE pid;
176 char *cmdline;
177 int i, ret, len;
178#endif
179
180#if defined HAVE_FORK
181 /* Fork and launch child */
182 pid = fork();
183 if(pid < 0)
184 perror("fork");
185 if(pid != 0)
186 return pid;
187
188 /* We loop in reverse order so that files[0] is done last,
189 * just in case one of the other dup2()ed fds had the value */
190 for(j = 3; j--; )
191 {
192 close(pipes[j][0]);
193 if(pipes[j][1] != files[j])
194 {
195 dup2(pipes[j][1], files[j]);
196 close(pipes[j][1]);
197 }
198 }
199#endif
200
201#if defined HAVE_SETRLIMIT && defined ZZUF_RLIMIT_MEM
202 if(opts->maxmem >= 0)
203 {
204 struct rlimit rlim;
205 rlim.rlim_cur = opts->maxmem * 1048576;
206 rlim.rlim_max = opts->maxmem * 1048576;
207 setrlimit(ZZUF_RLIMIT_MEM, &rlim);
208 }
209#endif
210
211#if defined HAVE_SETRLIMIT && defined ZZUF_RLIMIT_CPU
212 if(opts->maxcpu >= 0)
213 {
214 struct rlimit rlim;
215 rlim.rlim_cur = opts->maxcpu;
216 rlim.rlim_max = opts->maxcpu + 5;
217 setrlimit(ZZUF_RLIMIT_CPU, &rlim);
218 }
219#endif
220
221 /* Set environment variables */
222 sprintf(buf, "%i", DEBUG_FILENO);
223 setenv("ZZUF_DEBUGFD", buf, 1);
224 sprintf(buf, "%i", opts->seed);
225 setenv("ZZUF_SEED", buf, 1);
226 sprintf(buf, "%g", opts->minratio);
227 setenv("ZZUF_MINRATIO", buf, 1);
228 sprintf(buf, "%g", opts->maxratio);
229 setenv("ZZUF_MAXRATIO", buf, 1);
230
231#if defined HAVE_FORK
232 /* Make sure there is space for everything we might do. */
233 libpath = malloc(len + strlen(LIBDIR "/" LT_OBJDIR SONAME EXTRAINFO) + 1);
234 strcpy(libpath, opts->oldargv[0]);
235
236 /* If the binary name contains a '/', we look for a libzzuf in the
237 * same directory. Otherwise, we only look into the system directory
238 * to avoid shared library attacks. Write the result in libpath. */
239 tmp = strrchr(libpath, '/');
240 if(tmp)
241 {
242 strcpy(tmp + 1, LT_OBJDIR SONAME);
243 if(access(libpath, R_OK) < 0)
244 strcpy(libpath, LIBDIR "/" SONAME);
245 }
246 else
247 strcpy(libpath, LIBDIR "/" SONAME);
248
249 /* OSF1 only */
250 strcat(libpath, EXTRAINFO);
251
252 /* Do not clobber previous LD_PRELOAD values */
253 tmp = getenv(PRELOAD);
254 if(tmp && *tmp)
255 {
256 char *bigbuf = malloc(strlen(tmp) + strlen(libpath) + 2);
257 sprintf(bigbuf, "%s:%s", tmp, libpath);
258 free(libpath);
259 libpath = bigbuf;
260 }
261
262 /* Only preload the library in preload mode */
263 if (opts->opmode == OPMODE_PRELOAD)
264 setenv(PRELOAD, libpath, 1);
265 free(libpath);
266
267 if(execvp(child->newargv[0], child->newargv))
268 {
269 perror(child->newargv[0]);
270 exit(EXIT_FAILURE);
271 }
272
273 exit(EXIT_SUCCESS);
274 /* no return */
275 return 0;
276#elif HAVE_WINDOWS_H
277 pid = GetCurrentProcess();
278
279 /* Inherit standard handles */
280 memset(&sinfo, 0, sizeof(sinfo));
281 sinfo.cb = sizeof(sinfo);
282 sinfo.hStdInput = (HANDLE)_get_osfhandle(pipes[0][CHILD_FD(0)]);
283 sinfo.hStdOutput = (HANDLE)_get_osfhandle(pipes[1][CHILD_FD(1)]);
284 sinfo.hStdError = (HANDLE)_get_osfhandle(pipes[2][CHILD_FD(2)]);
285 sinfo.dwFlags = STARTF_USESTDHANDLES;
286
287 /* Build the commandline */
288 for (i = 0, len = 0; child->newargv[i]; i++)
289 len += strlen(child->newargv[i]) + 1;
290 cmdline = malloc(len);
291 for (i = 0, len = 0; child->newargv[i]; i++)
292 {
293 strcpy(cmdline + len, child->newargv[i]);
294 len += strlen(child->newargv[i]) + 1;
295 cmdline[len - 1] = ' ';
296 }
297 cmdline[len - 1] = '\0';
298
299 /* Create the process in suspended state */
300 ret = CreateProcess(child->newargv[0], cmdline, NULL, NULL, TRUE,
301 CREATE_SUSPENDED, NULL, NULL, &sinfo, &pinfo);
302 free(cmdline);
303
304 if (!ret)
305 return -1;
306
307 /* Insert the replacement code */
308 ret = dll_inject(&pinfo, SONAME);
309 if(ret < 0)
310 {
311 TerminateProcess(pinfo.hProcess, -1);
312 return -1;
313 }
314
315 ret = ResumeThread(pinfo.hThread);
316 if(ret < 0)
317 {
318 TerminateProcess(pinfo.hProcess, -1);
319 return -1;
320 }
321
322 return (long int)pinfo.hProcess;
323#endif
324}
325
326#if defined HAVE_WINDOWS_H
327static void rep32(uint8_t *buf, void *addr)
328{
329 while(buf++)
330 if (memcmp(buf, "____", 4) == 0)
331 {
332 memcpy(buf, &addr, 4);
333 return;
334 }
335}
336
337static int dll_inject(PROCESS_INFORMATION *pinfo, char const *lib)
338{
339 static uint8_t const loader[] =
340 /* Load the injected DLL into memory */
341 "\xb8____" /* mov %eax, <library_name_address> */
342 "\x50" /* push %eax */
343 "\xb8____" /* mov %eax, <LoadLibraryA> */
344 "\xff\xd0" /* call %eax */
345 /* Restore the clobbered entry point code using our backup */
346 "\xb8\0\0\0\0" /* mov %eax,0 */
347 "\x50" /* push %eax */
348 "\xb8____" /* mov %eax, <jumper_length> */
349 "\x50" /* push %eax */
350 "\xb8____" /* mov %eax, <backuped_entry_point_address> */
351 "\x50" /* push %eax */
352 "\xb8____" /* mov %eax, <original_entry_point_address> */
353 "\x50" /* push %eax */
354 "\xb8____" /* mov %eax, <GetCurrentProcess> */
355 "\xff\xd0" /* call %eax */
356 "\x50" /* push %eax */
357 "\xb8____" /* mov %eax, <WriteProcessMemory> */
358 "\xff\xd0" /* call %eax */
359 /* Jump to the original entry point */
360 "\xb8____" /* mov %eax, <original_entry_point_address> */
361 "\xff\xe0"; /* jmp %eax */
362
363 static uint8_t const waiter[] =
364 "\xeb\xfe"; /* jmp <current> */
365
366 static uint8_t const jumper[] =
367 /* Jump to the injected loader */
368 "\xb8____" /* mov eax, <loader_address> */
369 "\xff\xe0"; /* jmp eax */
370
371 CONTEXT ctx;
372 void *process = pinfo->hProcess;
373 void *thread = pinfo->hThread;
374 void *epaddr;
375 DWORD pid = pinfo->dwProcessId;
376
377 /* code:
378 * +---------------+--------------------+--------------+-------------+
379 * | loader | entry point backup | library name | jumper |
380 * | len(loader) | len(jumper) | len(lib) | len(jumper) |
381 * +---------------+--------------------+--------------+-------------+ */
382 uint8_t code[1024];
383
384 uint8_t *loaderaddr;
385 size_t liblen, loaderlen, waiterlen, jumperlen;
386 DWORD tmp;
387
388 liblen = strlen(lib) + 1;
389 loaderlen = sizeof(loader) - 1;
390 waiterlen = sizeof(waiter) - 1;
391 jumperlen = sizeof(jumper) - 1;
392 if (loaderlen + jumperlen + liblen > 1024)
393 return -1;
394
395 /* Allocate memory in the child for our injected code */
396 loaderaddr = VirtualAllocEx(process, NULL, loaderlen + jumperlen + liblen,
397 MEM_COMMIT, PAGE_EXECUTE_READWRITE);
398 if(!loaderaddr)
399 return -1;
400
401 /* Create the first shellcode (jumper).
402 *
403 * The jumper's job is simply to jump at the second shellcode's location.
404 * It is written at the original entry point's location, which will in
405 * turn be restored by the second shellcode.
406 */
407 memcpy(code + loaderlen + jumperlen + liblen, jumper, jumperlen);
408 rep32(code + loaderlen + jumperlen + liblen, loaderaddr);
409
410 /* Create the second shellcode (loader, backuped entry point, and library
411 * name).
412 *
413 * The loader's job is to load the library by calling LoadLibraryA(),
414 * restore the original entry point using the backup copy, and jump
415 * back to the original entry point as if the process had just started.
416 *
417 * The second shellcode is written at a freshly allocated memory location.
418 */
419 memcpy(code, loader, loaderlen);
420 memcpy(code + loaderlen + jumperlen, lib, liblen);
421
422 /* Find the entry point address. It's simply in EAX. */
423 ctx.ContextFlags = CONTEXT_FULL;
424 GetThreadContext(thread, &ctx);
425 epaddr = (void *)(uintptr_t)ctx.Eax;
426
427 /* Backup the old entry point code */
428 ReadProcessMemory(process, epaddr, code + loaderlen, jumperlen, &tmp);
429 if(tmp != jumperlen)
430 return -1;
431
432 /* Replace the entry point code with a short jump to self, then resume
433 * the thread. This is necessary for CreateToolhelp32Snapshot() to
434 * work. */
435 WriteProcessMemory(process, epaddr, waiter, waiterlen, &tmp);
436 if(tmp != waiterlen)
437 return -1;
438 FlushInstructionCache(process, epaddr, waiterlen);
439 ResumeThread(thread);
440
441 /* Wait until the entry point is reached */
442 for (tmp = 0; tmp < 100; tmp++)
443 {
444 CONTEXT ctx;
445 ctx.ContextFlags = CONTEXT_FULL;
446 GetThreadContext(thread, &ctx);
447 if ((uintptr_t)ctx.Eip == (uintptr_t)epaddr)
448 break;
449 Sleep(10);
450 }
451 SuspendThread(thread);
452 if (tmp == 100)
453 return -1;
454
455 /* Remotely parse the target process's module list to get the addresses
456 * of the functions we need. This can only be done because we advanced
457 * the target's execution to the entry point. */
458 rep32(code, loaderaddr + loaderlen + jumperlen);
459 rep32(code, (void *)get_proc_address(process, pid, "LoadLibraryA"));
460 rep32(code, (void *)(uintptr_t)jumperlen);
461 rep32(code, loaderaddr + loaderlen);
462 rep32(code, epaddr);
463 rep32(code, (void *)get_proc_address(process, pid, "GetCurrentProcess"));
464 rep32(code, (void *)get_proc_address(process, pid, "WriteProcessMemory"));
465 rep32(code, epaddr);
466
467 /* Write our shellcodes into the target process */
468 WriteProcessMemory(process, epaddr, code + loaderlen + jumperlen + liblen,
469 jumperlen, &tmp);
470 if(tmp != jumperlen)
471 return -1;
472 FlushInstructionCache(process, epaddr, waiterlen);
473
474 WriteProcessMemory(process, loaderaddr, code,
475 loaderlen + jumperlen + liblen, &tmp);
476 if(tmp != loaderlen + jumperlen + liblen)
477 return -1;
478
479 return 0;
480}
481
482static intptr_t get_proc_address(void *process, DWORD pid, const char *func)
483{
484 char buf[1024];
485 size_t buflen = strlen(func) + 1;
486
487 MODULEENTRY32 entry;
488 intptr_t ret = 0;
489 DWORD tmp;
490 void *list;
491 int i, k;
492
493 list = CreateToolhelp32Snapshot(TH32CS_SNAPMODULE, pid);
494 entry.dwSize = sizeof(entry);
495 for(k = Module32First(list, &entry); k; k = Module32Next(list, &entry))
496 {
497 IMAGE_DOS_HEADER dos;
498 IMAGE_NT_HEADERS nt;
499 IMAGE_EXPORT_DIRECTORY expdir;
500
501 uint32_t exportaddr;
502 uint8_t const *base = entry.modBaseAddr;
503
504 if (strcmp("kernel32.dll", entry.szModule))
505 continue;
506
507 ReadProcessMemory(process, base, &dos, sizeof(dos), &tmp);
508 ReadProcessMemory(process, base + dos.e_lfanew, &nt, sizeof(nt), &tmp);
509
510 exportaddr = nt.OptionalHeader.DataDirectory[IMAGE_DIRECTORY_ENTRY_EXPORT].VirtualAddress;
511 if (!exportaddr)
512 continue;
513
514 ReadProcessMemory(process, base + exportaddr, &expdir, sizeof(expdir), &tmp);
515
516 for (i = 0; i < (int)expdir.NumberOfNames; i++)
517 {
518 uint32_t nameaddr, funcaddr;
519 uint16_t j;
520
521 /* Look for our function name in the list of names */
522 ReadProcessMemory(process, base + expdir.AddressOfNames
523 + i * sizeof(DWORD),
524 &nameaddr, sizeof(nameaddr), &tmp);
525 ReadProcessMemory(process, base + nameaddr, buf, buflen, &tmp);
526
527 if (strcmp(buf, func))
528 continue;
529
530 /* If we found a function with this name, return its address */
531 ReadProcessMemory(process, base + expdir.AddressOfNameOrdinals
532 + i * sizeof(WORD),
533 &j, sizeof(j), &tmp);
534 ReadProcessMemory(process, base + expdir.AddressOfFunctions
535 + j * sizeof(DWORD),
536 &funcaddr, sizeof(funcaddr), &tmp);
537
538 ret = (intptr_t)base + funcaddr;
539 goto _finished;
540 }
541 }
542
543_finished:
544 CloseHandle(list);
545 return ret;
546}
547
548#endif
Note: See TracBrowser for help on using the repository browser.
|
{
"url": "http://caca.zoy.org/browser/zzuf/trunk/src/myfork.c?rev=4667",
"source_domain": "caca.zoy.org",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "61924",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LQII27KO67IU2DJTYM5VAMYWQ7BMWFIC",
"WARC-Concurrent-To": "<urn:uuid:fc5633b3-8a24-438d-9d92-0c14352f1624>",
"WARC-Date": "2021-03-02T23:04:14Z",
"WARC-IP-Address": "193.200.42.164",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:UR7MNJE3QRONP4F57UYHTTHS7VTP4KLG",
"WARC-Record-ID": "<urn:uuid:a7dabab2-64c9-45cb-87e3-3584eff0e5eb>",
"WARC-Target-URI": "http://caca.zoy.org/browser/zzuf/trunk/src/myfork.c?rev=4667",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8afd8a20-5539-439a-b00a-978bb1fb85ee>"
},
"warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-150.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
39,
40,
126,
127,
198,
199,
235,
254,
260,
264,
299,
358,
397,
401,
471,
540,
611,
679,
736,
742,
745,
750,
775,
781,
784,
806,
809,
874,
877,
905,
930,
962,
989,
998,
1019,
1041,
1069,
1094,
1103,
1132,
1158,
1185,
1212,
1221,
1245,
1266,
1275,
1297,
1337,
1371,
1422,
1431,
1434,
1456,
1476,
1498,
1516,
1536,
1558,
1577,
1598,
1601,
1637,
1662,
1694,
1703,
1706,
1730,
1769,
1797,
1838,
1866,
1907,
1915,
1943,
1952,
1955,
1980,
2020,
2028,
2056,
2065,
2068,
2140,
2143,
2172,
2212,
2251,
2259,
2287,
2314,
2323,
2326,
2355,
2402,
2464,
2529,
2538,
2541,
2594,
2598,
2621,
2638,
2651,
2654,
2693,
2722,
2730,
2750,
2775,
2808,
2836,
2856,
2930,
2994,
3058,
3104,
3145,
3185,
3195,
3218,
3231,
3262,
3288,
3301,
3310,
3314,
3360,
3379,
3388,
3424,
3497,
3519,
3528,
3532,
3557,
3587,
3596,
3637,
3687,
3696,
3700,
3717,
3722,
3726,
3754,
3828,
3833,
3851,
3855,
3893,
3912,
3916,
3975,
4018,
4038,
4043,
4053,
4057,
4139,
4144,
4165,
4190,
4272,
4300,
4351,
4379,
4410,
4460,
4512,
4540,
4579,
4617,
4661,
4692,
4734,
4746,
4777,
4816,
4829,
4853,
4887,
4913,
4932,
4954,
4978,
4988,
4992,
5017,
5052,
5073,
5092,
5119,
5139,
5162,
5166,
5232,
5302,
5327,
5336,
5367,
5406,
5419,
5463,
5498,
5511,
5520,
5530,
5534,
5591,
5620,
5629,
5660,
5711,
5762,
5808,
5817,
5827,
5831,
5888,
5917,
5926,
5957,
5998,
6043,
6089,
6098,
6108,
6112,
6151,
6192,
6231,
6270,
6306,
6349,
6389,
6432,
6472,
6476,
6501,
6567,
6649,
6691,
6695,
6769,
6845,
6920,
6956,
6971,
6980,
7026,
7067,
7118,
7127,
7139,
7186,
7190,
7213,
7248,
7252,
7307,
7337,
7360,
7369,
7438,
7489,
7515,
7544,
7553,
7557,
7611,
7654,
7694,
7716,
7720,
7773,
7782,
7820,
7851,
7860,
7864,
7891,
7914,
7931,
7955,
7989,
7993,
8031,
8072,
8105,
8177,
8250,
8322,
8367,
8371,
8406,
8458,
8507,
8537,
8589,
8598,
8651,
8700,
8735,
8744,
8776,
8780,
8831,
8904,
8978,
9000,
9004,
9021,
9043,
9047,
9088,
9129,
9148,
9157,
9206,
9228,
9237,
9241,
9283,
9302,
9311,
9360,
9382,
9391,
9395,
9435,
9445,
9450,
9454,
9484,
9531,
9536,
9556,
9600,
9613,
9651,
9674,
9687,
9692,
9696,
9766,
9771,
9810,
9861,
9928,
9972,
10031,
10075,
10148,
10193,
10237,
10297,
10341,
10416,
10460,
10535,
10579,
10643,
10687,
10731,
10796,
10840,
10890,
10965,
11008,
11012,
11051,
11099,
11103,
11142,
11187,
11247,
11289,
11293,
11313,
11353,
11391,
11412,
11451,
11455,
11471,
11549,
11627,
11705,
11786,
11813,
11817,
11845,
11900,
11918,
11922,
11955,
11994,
12033,
12072,
12122,
12144,
12148,
12212,
12294,
12366,
12389,
12411,
12415,
12462,
12472,
12553,
12631,
12683,
12694,
12767,
12832,
12836,
12917,
12934,
12944,
13021,
13096,
13175,
13185,
13267,
13278,
13318,
13376,
13380,
13443,
13483,
13522,
13566,
13570,
13615,
13693,
13721,
13743,
13747,
13825,
13899,
13918,
13987,
14015,
14037,
14095,
14124,
14128,
14179,
14218,
14227,
14251,
14295,
14338,
14394,
14416,
14438,
14447,
14477,
14500,
14522,
14526,
14605,
14683,
14739,
14795,
14871,
14921,
14965,
14993,
15074,
15156,
15184,
15188,
15246,
15328,
15372,
15400,
15422,
15480,
15484,
15537,
15602,
15651,
15673,
15677,
15694,
15699,
15703,
15783,
15788,
15811,
15852,
15856,
15884,
15909,
15927,
15946,
15963,
15967,
16031,
16068,
16147,
16156,
16189,
16221,
16263,
16267,
16299,
16351,
16355,
16410,
16435,
16439,
16509,
16592,
16596,
16698,
16726,
16751,
16755,
16844,
16848,
16907,
16920,
16964,
16991,
16995,
17064,
17135,
17203,
17272,
17351,
17355,
17393,
17422,
17426,
17505,
17583,
17650,
17707,
17782,
17850,
17921,
17925,
17973,
18004,
18017,
18026,
18030,
18044,
18070,
18089,
18094,
18098,
18108
],
"line_end_idx": [
39,
40,
126,
127,
198,
199,
235,
254,
260,
264,
299,
358,
397,
401,
471,
540,
611,
679,
736,
742,
745,
750,
775,
781,
784,
806,
809,
874,
877,
905,
930,
962,
989,
998,
1019,
1041,
1069,
1094,
1103,
1132,
1158,
1185,
1212,
1221,
1245,
1266,
1275,
1297,
1337,
1371,
1422,
1431,
1434,
1456,
1476,
1498,
1516,
1536,
1558,
1577,
1598,
1601,
1637,
1662,
1694,
1703,
1706,
1730,
1769,
1797,
1838,
1866,
1907,
1915,
1943,
1952,
1955,
1980,
2020,
2028,
2056,
2065,
2068,
2140,
2143,
2172,
2212,
2251,
2259,
2287,
2314,
2323,
2326,
2355,
2402,
2464,
2529,
2538,
2541,
2594,
2598,
2621,
2638,
2651,
2654,
2693,
2722,
2730,
2750,
2775,
2808,
2836,
2856,
2930,
2994,
3058,
3104,
3145,
3185,
3195,
3218,
3231,
3262,
3288,
3301,
3310,
3314,
3360,
3379,
3388,
3424,
3497,
3519,
3528,
3532,
3557,
3587,
3596,
3637,
3687,
3696,
3700,
3717,
3722,
3726,
3754,
3828,
3833,
3851,
3855,
3893,
3912,
3916,
3975,
4018,
4038,
4043,
4053,
4057,
4139,
4144,
4165,
4190,
4272,
4300,
4351,
4379,
4410,
4460,
4512,
4540,
4579,
4617,
4661,
4692,
4734,
4746,
4777,
4816,
4829,
4853,
4887,
4913,
4932,
4954,
4978,
4988,
4992,
5017,
5052,
5073,
5092,
5119,
5139,
5162,
5166,
5232,
5302,
5327,
5336,
5367,
5406,
5419,
5463,
5498,
5511,
5520,
5530,
5534,
5591,
5620,
5629,
5660,
5711,
5762,
5808,
5817,
5827,
5831,
5888,
5917,
5926,
5957,
5998,
6043,
6089,
6098,
6108,
6112,
6151,
6192,
6231,
6270,
6306,
6349,
6389,
6432,
6472,
6476,
6501,
6567,
6649,
6691,
6695,
6769,
6845,
6920,
6956,
6971,
6980,
7026,
7067,
7118,
7127,
7139,
7186,
7190,
7213,
7248,
7252,
7307,
7337,
7360,
7369,
7438,
7489,
7515,
7544,
7553,
7557,
7611,
7654,
7694,
7716,
7720,
7773,
7782,
7820,
7851,
7860,
7864,
7891,
7914,
7931,
7955,
7989,
7993,
8031,
8072,
8105,
8177,
8250,
8322,
8367,
8371,
8406,
8458,
8507,
8537,
8589,
8598,
8651,
8700,
8735,
8744,
8776,
8780,
8831,
8904,
8978,
9000,
9004,
9021,
9043,
9047,
9088,
9129,
9148,
9157,
9206,
9228,
9237,
9241,
9283,
9302,
9311,
9360,
9382,
9391,
9395,
9435,
9445,
9450,
9454,
9484,
9531,
9536,
9556,
9600,
9613,
9651,
9674,
9687,
9692,
9696,
9766,
9771,
9810,
9861,
9928,
9972,
10031,
10075,
10148,
10193,
10237,
10297,
10341,
10416,
10460,
10535,
10579,
10643,
10687,
10731,
10796,
10840,
10890,
10965,
11008,
11012,
11051,
11099,
11103,
11142,
11187,
11247,
11289,
11293,
11313,
11353,
11391,
11412,
11451,
11455,
11471,
11549,
11627,
11705,
11786,
11813,
11817,
11845,
11900,
11918,
11922,
11955,
11994,
12033,
12072,
12122,
12144,
12148,
12212,
12294,
12366,
12389,
12411,
12415,
12462,
12472,
12553,
12631,
12683,
12694,
12767,
12832,
12836,
12917,
12934,
12944,
13021,
13096,
13175,
13185,
13267,
13278,
13318,
13376,
13380,
13443,
13483,
13522,
13566,
13570,
13615,
13693,
13721,
13743,
13747,
13825,
13899,
13918,
13987,
14015,
14037,
14095,
14124,
14128,
14179,
14218,
14227,
14251,
14295,
14338,
14394,
14416,
14438,
14447,
14477,
14500,
14522,
14526,
14605,
14683,
14739,
14795,
14871,
14921,
14965,
14993,
15074,
15156,
15184,
15188,
15246,
15328,
15372,
15400,
15422,
15480,
15484,
15537,
15602,
15651,
15673,
15677,
15694,
15699,
15703,
15783,
15788,
15811,
15852,
15856,
15884,
15909,
15927,
15946,
15963,
15967,
16031,
16068,
16147,
16156,
16189,
16221,
16263,
16267,
16299,
16351,
16355,
16410,
16435,
16439,
16509,
16592,
16596,
16698,
16726,
16751,
16755,
16844,
16848,
16907,
16920,
16964,
16991,
16995,
17064,
17135,
17203,
17272,
17351,
17355,
17393,
17422,
17426,
17505,
17583,
17650,
17707,
17782,
17850,
17921,
17925,
17973,
18004,
18017,
18026,
18030,
18044,
18070,
18089,
18094,
18098,
18108,
18171
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 18171,
"ccnet_original_nlines": 557,
"rps_doc_curly_bracket": 0.0027516400441527367,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09415911138057709,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.036253780126571655,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5641993880271912,
"rps_doc_frac_unique_words": 0.564842939376831,
"rps_doc_mean_word_length": 5.638298034667969,
"rps_doc_num_sentences": 95,
"rps_doc_symbol_to_word_ratio": 0.02291036956012249,
"rps_doc_unigram_entropy": 6.492569923400879,
"rps_doc_word_count": 1974,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.023899370804429054,
"rps_doc_frac_chars_dupe_6grams": 0.011141059920191765,
"rps_doc_frac_chars_dupe_7grams": 0.00413296977058053,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.007547169923782349,
"rps_doc_frac_chars_top_3gram": 0.007277629803866148,
"rps_doc_frac_chars_top_4gram": 0.005390840116888285,
"rps_doc_books_importance": -1867.293701171875,
"rps_doc_books_importance_length_correction": -1867.293701171875,
"rps_doc_openwebtext_importance": -995.9998779296875,
"rps_doc_openwebtext_importance_length_correction": -995.9998779296875,
"rps_doc_wikipedia_importance": -869.2020263671875,
"rps_doc_wikipedia_importance_length_correction": -869.2020263671875
},
"fasttext": {
"dclm": 0.07227528095245361,
"english": 0.1267203539609909,
"fineweb_edu_approx": 2.3533356189727783,
"eai_general_math": -0.000009059999683813658,
"eai_open_web_math": 0.8536949753761292,
"eai_web_code": 0.9824855327606201
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,874,876,703,476,596,000 |
PHPKonf Istanbul PHP Conference 2019 - Call for Papers
gmp_prob_prime
(PHP 4 >= 4.0.4, PHP 5, PHP 7)
gmp_prob_primeПроверяет, является ли число "вероятно простым"
Описание
int gmp_prob_prime ( GMP $a [, int $reps = 10 ] )
Функция использует тест Миллера-Рабина для определения, является ли число простым.
Список параметров
a
Число, для которого проводится проверка.
Либо ресурс (resource) номера GMP в PHP 5.5 и более ранних версиях, объект GMP в PHP 5.6 и более поздних версиях, либо числовая строка при условии, что можно преобразовать последнюю в число.
reps
Допустимые значения аргумента reps лежат в диапазоне от 5 до 10 (по умолчанию 10); чем больше это число, тем меньше вероятность, что непростые числа пройдут этот тест и определятся, как "возможно простые".
Либо ресурс (resource) номера GMP в PHP 5.5 и более ранних версиях, объект GMP в PHP 5.6 и более поздних версиях, либо числовая строка при условии, что можно преобразовать последнюю в число.
Возвращаемые значения
Если функция возвращает 0, a точно не является простым. Если возвращает 1, то a "возможно" простое. Если возвращает 2, то a точно простое.
Примеры
Пример #1 Пример использования gmp_prob_prime()
<?php
// по определению не является простым
echo gmp_prob_prime("6") . "\n";
// возможно простое
echo gmp_prob_prime("1111111111111111111") . "\n";
// по определению простое
echo gmp_prob_prime("11") . "\n";
?>
Результат выполнения данного примера:
0
1
2
add a note add a note
User Contributed Notes 1 note
up
5
florin dot ciuica at yahoo dot com
4 years ago
<?php
$max
= 2147483647;
$primesFound = 0;
$probablePrimes = 0;
for (
$x = 1; $x <= $max; $x++) {
$primeStatus = gmp_prob_prime($x);
if (
$primeStatus == 1) {
$probablePrimes++;
} else if (
$primeStatus == 2) {
$primesFound++;
}
}
echo
"Total primes found: " . $primesFound . " between 1 and " . $max . ". Probable primes in this interval: " . $probablePrimes;
?>
Based on that the following results were obtained:
1 - 100000 - certain primes found: 9592, probable: 0
1 - 1000000 - certain primes found: 78498, probable: 0
1 - 10000000 - certain primes found: 78498, probable: 586081
1 - 100000000 - certain primes found: 78498, probable: 5682957
1 - 1000000000 - certain primes found: 78498, probable: 50769036
1 - 2147483647 - certain primes found: 78498, probable: 105019067
To Top
|
{
"url": "http://php.net/manual/ru/function.gmp-prob-prime.php",
"source_domain": "php.net",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "35569",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O7UOYQGX4OLXF4X7DVAU3WGOKPQ6INEX",
"WARC-Concurrent-To": "<urn:uuid:fb3893ea-6493-46d3-bfe1-d3465bb13fd2>",
"WARC-Date": "2018-12-13T00:33:02Z",
"WARC-IP-Address": "208.43.231.9",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:KYFKIO4YP2URPOTGIF6AROD6OAEFFNYH",
"WARC-Record-ID": "<urn:uuid:59d1cedf-d7b7-400f-89a6-30ae7cc47a46>",
"WARC-Target-URI": "http://php.net/manual/ru/function.gmp-prob-prime.php",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ef64b52f-a5e1-4159-9ae5-b8b2a5193b91>"
},
"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-150-98-233.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
55,
56,
71,
72,
103,
104,
166,
167,
176,
177,
227,
228,
311,
312,
330,
331,
333,
334,
375,
376,
567,
568,
573,
574,
780,
781,
972,
973,
995,
996,
1135,
1136,
1144,
1145,
1193,
1194,
1200,
1238,
1271,
1272,
1292,
1343,
1344,
1370,
1404,
1407,
1408,
1446,
1447,
1449,
1451,
1453,
1454,
1476,
1477,
1507,
1508,
1511,
1513,
1548,
1560,
1566,
1575,
1589,
1593,
1597,
1615,
1619,
1640,
1641,
1651,
1679,
1687,
1722,
1735,
1756,
1768,
1787,
1807,
1828,
1840,
1856,
1866,
1872,
1881,
2006,
2009,
2010,
2061,
2062,
2124,
2186,
2253,
2321,
2390,
2460
],
"line_end_idx": [
55,
56,
71,
72,
103,
104,
166,
167,
176,
177,
227,
228,
311,
312,
330,
331,
333,
334,
375,
376,
567,
568,
573,
574,
780,
781,
972,
973,
995,
996,
1135,
1136,
1144,
1145,
1193,
1194,
1200,
1238,
1271,
1272,
1292,
1343,
1344,
1370,
1404,
1407,
1408,
1446,
1447,
1449,
1451,
1453,
1454,
1476,
1477,
1507,
1508,
1511,
1513,
1548,
1560,
1566,
1575,
1589,
1593,
1597,
1615,
1619,
1640,
1641,
1651,
1679,
1687,
1722,
1735,
1756,
1768,
1787,
1807,
1828,
1840,
1856,
1866,
1872,
1881,
2006,
2009,
2010,
2061,
2062,
2124,
2186,
2253,
2321,
2390,
2460,
2466
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2466,
"ccnet_original_nlines": 96,
"rps_doc_curly_bracket": 0.002433090005069971,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07370518147945404,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025896409526467323,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.737051784992218,
"rps_doc_frac_unique_words": 0.48606809973716736,
"rps_doc_mean_word_length": 5.337461471557617,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0.001992030069231987,
"rps_doc_unigram_entropy": 4.777369499206543,
"rps_doc_word_count": 323,
"rps_doc_frac_chars_dupe_10grams": 0.17517401278018951,
"rps_doc_frac_chars_dupe_5grams": 0.2650811970233917,
"rps_doc_frac_chars_dupe_6grams": 0.17517401278018951,
"rps_doc_frac_chars_dupe_7grams": 0.17517401278018951,
"rps_doc_frac_chars_dupe_8grams": 0.17517401278018951,
"rps_doc_frac_chars_dupe_9grams": 0.17517401278018951,
"rps_doc_frac_chars_top_2gram": 0.04466357082128525,
"rps_doc_frac_chars_top_3gram": 0.06264501065015793,
"rps_doc_frac_chars_top_4gram": 0.06670533865690231,
"rps_doc_books_importance": -226.4237518310547,
"rps_doc_books_importance_length_correction": -226.4237518310547,
"rps_doc_openwebtext_importance": -142.62147521972656,
"rps_doc_openwebtext_importance_length_correction": -142.62147521972656,
"rps_doc_wikipedia_importance": -122.49563598632812,
"rps_doc_wikipedia_importance_length_correction": -122.49563598632812
},
"fasttext": {
"dclm": 0.3555886149406433,
"english": 0.004663680214434862,
"fineweb_edu_approx": 2.329895257949829,
"eai_general_math": -0.0000011900000345121953,
"eai_open_web_math": 0.9172374606132507,
"eai_web_code": 0.5306580066680908
}
}
|
{
"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": "512.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"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": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,652,005,217,058,471,400 |
Skip to content
Uninstalling in console mode
Uninstall HCL Connections in console mode. This method is convenient if you cannot or do not want to use the graphical mode.
Use console mode to uninstall the product in a non-graphical environment. This mode is useful when you have to uninstall HCL Connections on a system that does not have a video card.
In steps where you enter custom information, such as server details, you can type P at any time to return to the previous input choice in that step. However, you cannot type P to return to a previous step.
Uninstalling HCL Connections uses IBM® Installation Manager to manage the installation process.
To uninstall HCL Connections in console mode, complete the following steps:
1. Start the WebSphere® Application Server Deployment Manager.
2. Stop all instances of WebSphere Application Server, including node agents, in your deployment.
3. Open a command prompt and change to the IM_root/eclipse/tools directory.
4. Start the installation wizard by opening the following file:
• Linux: ./imcl -c
• Windows: imcl.exe -c
• Select the applications that you want to remove and then type N to proceed.
5. Type U to start removing applications.
6. To check the details of the procedure, open the log file named Uninstall.log in the connections_root/logs directory.
7. If you plan to reinstall HCL Connections™, remove the following files:
Notes:
• Except where noted, remove these files from the system that hosts the Deployment Manager.
• Because some of these files might be used by other programs, it is possible that you are not allowed to remove all of the following files.
• Connections installation files: connections_root
Note: If you did not install Connections in the default directory, delete the directory where you installed the product.
• Connections shared data: Delete the directories that you specified for shared data when you installed Connections.
• Connections local data: On each node, delete the directories that you specified for local data when you installed Connections.
Note: Deleting Connections data files makes the original deployment unrecoverable. If you plan to reinstall Connections and use your old data, do not delete the data files.
• Connections configuration files: Delete the profile_root/config/cells/cell_name/LotusConnections-config directory, where cell_name is the name of your WebSphere Application Server cell.
• If it is present, delete the registry.xml file from the profile_root/config/cells/cell_namedirectory.
• Delete all .py files from the /opt/IBM/WebSphere/AppServer/profiles/profile_name/bin directory on the deployment manager server as follows:
• Linux: /opt/IBM/WebSphere/AppServer/profiles/profile_name/bin
• Windows: drive:\Program Files\IBM\WebSphere\AppServer\profiles\profile_name\bin
1. Clear the WebSphere Application Server profile's temp and wstemp folders. For example:
• Linux:
/opt/IBM/WebSphere/AppServer/profiles/profile_name/temp
• /opt/IBM/WebSphere/AppServer/profiles/profile_name/wstemp
• Windows:
drive:\Program Files\IBM\WebSphere\AppServer\profiles\profile_name\temp
drive:\Program Files\IBM\WebSphere\AppServer\profiles\profile_name\wstemp
You uninstalled Connections.
Parent topic:Uninstalling
|
{
"url": "https://opensource.hcltechsw.com/connections-doc/v8-cr1/admin/install/t_uninstall_console-mode.html",
"source_domain": "opensource.hcltechsw.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "701518",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KEJESJB4GKKR3LJYIQ5N2KZAGYJXFJUQ",
"WARC-Concurrent-To": "<urn:uuid:38791458-af70-41d4-b74d-00357b539bd2>",
"WARC-Date": "2024-05-26T22:31:43Z",
"WARC-IP-Address": "185.199.108.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:P7F7HQROE3YYGWAQ4HBSEUWQDH644MZN",
"WARC-Record-ID": "<urn:uuid:1f2204ac-737b-4f27-917f-f08dd4cfcf41>",
"WARC-Target-URI": "https://opensource.hcltechsw.com/connections-doc/v8-cr1/admin/install/t_uninstall_console-mode.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5dadddd9-615b-4bdd-bf69-4fc5672f8534>"
},
"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,
46,
47,
172,
173,
355,
356,
562,
563,
659,
660,
736,
737,
802,
803,
903,
904,
982,
983,
1049,
1050,
1073,
1100,
1182,
1226,
1227,
1349,
1350,
1426,
1427,
1438,
1439,
1535,
1680,
1735,
1736,
1863,
1864,
1985,
1986,
2119,
2120,
2299,
2300,
2492,
2493,
2601,
2602,
2748,
2749,
2819,
2907,
2908,
3006,
3021,
3022,
3086,
3087,
3153,
3154,
3171,
3172,
3252,
3253,
3335,
3336,
3365,
3366
],
"line_end_idx": [
16,
17,
46,
47,
172,
173,
355,
356,
562,
563,
659,
660,
736,
737,
802,
803,
903,
904,
982,
983,
1049,
1050,
1073,
1100,
1182,
1226,
1227,
1349,
1350,
1426,
1427,
1438,
1439,
1535,
1680,
1735,
1736,
1863,
1864,
1985,
1986,
2119,
2120,
2299,
2300,
2492,
2493,
2601,
2602,
2748,
2749,
2819,
2907,
2908,
3006,
3021,
3022,
3086,
3087,
3153,
3154,
3171,
3172,
3252,
3253,
3335,
3336,
3365,
3366,
3391
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3391,
"ccnet_original_nlines": 69,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2707355320453644,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026604069396853447,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25195619463920593,
"rps_doc_frac_unique_words": 0.415909081697464,
"rps_doc_mean_word_length": 5.979545593261719,
"rps_doc_num_sentences": 38,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.718218803405762,
"rps_doc_word_count": 440,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09578107297420502,
"rps_doc_frac_chars_dupe_6grams": 0.057012539356946945,
"rps_doc_frac_chars_dupe_7grams": 0.02964651957154274,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0205245204269886,
"rps_doc_frac_chars_top_3gram": 0.01482325978577137,
"rps_doc_frac_chars_top_4gram": 0.019004179164767265,
"rps_doc_books_importance": -276.8264465332031,
"rps_doc_books_importance_length_correction": -276.8264465332031,
"rps_doc_openwebtext_importance": -166.046142578125,
"rps_doc_openwebtext_importance_length_correction": -166.046142578125,
"rps_doc_wikipedia_importance": -200.52919006347656,
"rps_doc_wikipedia_importance_length_correction": -200.52919006347656
},
"fasttext": {
"dclm": 0.06550853699445724,
"english": 0.7973989844322205,
"fineweb_edu_approx": 1.6153985261917114,
"eai_general_math": 0.7692826986312866,
"eai_open_web_math": 0.2808647155761719,
"eai_web_code": 0.46197909116744995
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,093,713,472,311,043,000 |
Go Down
Topic: [Solved] Unable to connect to web server, can't seem to find the problem (Read 884 times) previous topic - next topic
JackSac67
I want to adjust the background color of a web page by adjusting a pot, but I can't for the life of me figure out why I'm not able to connect to the web server. I just get "Unable to connect to server" in my browser. Here's the code, help point me towards anything missing or that needs revision please.
Code: [Select]
#include <SPI.h>
#include <Ethernet.h>
byte mac[] = { 0x90, 0xA2, 0xDA, 0x0D, 0x50, 0x9A };
byte ip[] = { 10, 0, 1, 8 };
EthernetServer server(8010);
void setup() {
pinMode(A3, INPUT);
Serial.begin(9600);
Ethernet.begin(mac, ip);
server.begin();
}
void loop() {
EthernetClient client = server.available();
int val = analogRead(A3); //read pot analog input
if (client) {
boolean current_line_is_blank = true;
while (client.connected()) {
if (client.available()) {
char c = client.read();
int color = map(val, 0, 1023, 0x000000, 0xFFFFFF); //map the analogRead() values to HEX values for HTML colors
Serial.println(val); //print em'
Serial.println(color);
Serial.println();
if (c == '\n' && current_line_is_blank) {
client.println("HTTP/1.1 200 OK"); //standard HTTP header, a little HTML too
client.println("Content-Type: text/html");
client.println();
client.println("<html><head><title>");
client.println("Change pot to change color!");
client.println("</title><body bgcolor=");
client.print(color);
client.println(">");
client.println("<h1>Hello, World</h1>");
client.println();
client.print("</body></html>");
}
if (c == '\n') {
current_line_is_blank = true;
} else if (c != '\r') {
current_line_is_blank = false;
}
}
}
delay(1);
client.stop();
}
}
SurferTim
#1
Feb 12, 2013, 01:09 pm Last Edit: Feb 12, 2013, 01:28 pm by SurferTim Reason: 1
Is this ip in the subnet of your localnet?
Code: [Select]
byte ip[] = { 10, 0, 1, 8 };
Are you using the port with it in your web browser?
http://10.0.1.8:8010
edit: Eye Korretd mi spelin misteak. ;)
PaulS
Quote
edit: Eye Korretd mi spelin misteak.
You misspelled "Korrectd". 8)
PaulS
These two statements:
Code: [Select]
pinMode(A3, INPUT);
and
Code: [Select]
int val = analogRead(A3); //read pot analog input
do not go together.
Analog pins are input only. They can not be set to output, nor do they have pullup resistors. So, the pinMode() command is completely unaware that they exist. You are diddling with the digital nature of that pin, which you don''t use. So, don't diddle with it.
JackSac67
Is this ip in the subnet of your localnet?
Code: [Select]
byte ip[] = { 10, 0, 1, 8 };
Are you using the port with it in your web browser?
http://10.0.1.8:8010
edit: Eye Korretd mi spelin misteak. ;)
Yes and yes
Quote
These two statements:
Code: [Select]
pinMode(A3, INPUT);
and
Code: [Select]
int val = analogRead(A3); //read pot analog input
do not go together.
Analog pins are input only. They can not be set to output, nor do they have pullup resistors. So, the pinMode() command is completely unaware that they exist. You are diddling with the digital nature of that pin, which you don''t use. So, don't diddle with it.
Right, that was my bad. But how would this have an effect on my problem?
SurferTim
Can you ping the Arduino from your computer?
Do you have a uSD card in the slot on the shield? If so, remove it and try again.
Try adding this to your setup() function. Maybe something with the SPI isn't working.
Code: [Select]
Ethernet.begin(mac, ip);
Serial.print("IP = ");
Serial.println(Ethernet.localIP());
server.begin();
Does it show "IP = 10.0.1.8"? If it shows anything else, like "IP = 0.0.0.0", it may not be working.
JackSac67
Never mind, I've fixed it. Turns out my router was reset with an ethernet connection already established on one of its ethernet ports and it screwed up the whole system. Just had to unplug and plug back in.
Go Up
Please enter a valid email to subscribe
Confirm your email address
We need to confirm your email address.
To complete the subscription, please click the link in the email we just sent you.
Thank you for subscribing!
Arduino
via Egeo 16
Torino, 10131
Italy
|
{
"url": "http://forum.arduino.cc/index.php?topic=148400.msg1117193",
"source_domain": "forum.arduino.cc",
"snapshot_id": "crawl=CC-MAIN-2016-07",
"warc_metadata": {
"Content-Length": "54909",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CFWIYORMDFZYG3QYACPHB4VPA3L3U3B4",
"WARC-Concurrent-To": "<urn:uuid:6f57eaae-a5da-4792-ad06-52de633d748f>",
"WARC-Date": "2016-02-05T22:31:57Z",
"WARC-IP-Address": "54.83.53.28",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:VZ3YGH4RH3D3ESPMZ676QUZLZYNYDBWA",
"WARC-Record-ID": "<urn:uuid:a40bfe8c-ab2d-4734-8b06-f98737408628>",
"WARC-Target-URI": "http://forum.arduino.cc/index.php?topic=148400.msg1117193",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:32157e81-45ce-46f4-bc4c-132c3f3effc8>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-182-209.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-07\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
8,
9,
134,
135,
145,
146,
450,
451,
466,
467,
468,
485,
507,
508,
561,
590,
591,
620,
621,
636,
637,
658,
660,
681,
683,
709,
726,
727,
729,
730,
744,
746,
791,
793,
847,
849,
864,
868,
909,
911,
943,
947,
978,
986,
1017,
1138,
1146,
1189,
1219,
1244,
1252,
1301,
1309,
1398,
1450,
1477,
1525,
1581,
1632,
1662,
1692,
1742,
1769,
1810,
1818,
1827,
1835,
1859,
1867,
1906,
1914,
1945,
1953,
1993,
2001,
2010,
2016,
2023,
2027,
2032,
2036,
2049,
2067,
2069,
2072,
2073,
2075,
2076,
2086,
2087,
2090,
2170,
2213,
2228,
2257,
2258,
2310,
2331,
2332,
2373,
2374,
2380,
2381,
2387,
2424,
2425,
2456,
2457,
2463,
2464,
2486,
2501,
2523,
2527,
2542,
2597,
2617,
2618,
2879,
2880,
2890,
2891,
2892,
2935,
2950,
2979,
2980,
3032,
3053,
3054,
3095,
3096,
3097,
3109,
3110,
3116,
3138,
3153,
3154,
3176,
3177,
3181,
3196,
3197,
3252,
3253,
3273,
3274,
3535,
3608,
3609,
3619,
3620,
3665,
3666,
3748,
3749,
3835,
3850,
3877,
3902,
3940,
3941,
3959,
3960,
4061,
4062,
4072,
4073,
4280,
4281,
4287,
4289,
4290,
4291,
4331,
4332,
4359,
4360,
4399,
4482,
4483,
4510,
4511,
4519,
4531,
4545
],
"line_end_idx": [
8,
9,
134,
135,
145,
146,
450,
451,
466,
467,
468,
485,
507,
508,
561,
590,
591,
620,
621,
636,
637,
658,
660,
681,
683,
709,
726,
727,
729,
730,
744,
746,
791,
793,
847,
849,
864,
868,
909,
911,
943,
947,
978,
986,
1017,
1138,
1146,
1189,
1219,
1244,
1252,
1301,
1309,
1398,
1450,
1477,
1525,
1581,
1632,
1662,
1692,
1742,
1769,
1810,
1818,
1827,
1835,
1859,
1867,
1906,
1914,
1945,
1953,
1993,
2001,
2010,
2016,
2023,
2027,
2032,
2036,
2049,
2067,
2069,
2072,
2073,
2075,
2076,
2086,
2087,
2090,
2170,
2213,
2228,
2257,
2258,
2310,
2331,
2332,
2373,
2374,
2380,
2381,
2387,
2424,
2425,
2456,
2457,
2463,
2464,
2486,
2501,
2523,
2527,
2542,
2597,
2617,
2618,
2879,
2880,
2890,
2891,
2892,
2935,
2950,
2979,
2980,
3032,
3053,
3054,
3095,
3096,
3097,
3109,
3110,
3116,
3138,
3153,
3154,
3176,
3177,
3181,
3196,
3197,
3252,
3253,
3273,
3274,
3535,
3608,
3609,
3619,
3620,
3665,
3666,
3748,
3749,
3835,
3850,
3877,
3902,
3940,
3941,
3959,
3960,
4061,
4062,
4072,
4073,
4280,
4281,
4287,
4289,
4290,
4291,
4331,
4332,
4359,
4360,
4399,
4482,
4483,
4510,
4511,
4519,
4531,
4545,
4550
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4550,
"ccnet_original_nlines": 187,
"rps_doc_curly_bracket": 0.0052747298032045364,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23135754466056824,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02390057034790516,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.37667304277420044,
"rps_doc_frac_unique_words": 0.4632952809333801,
"rps_doc_mean_word_length": 4.8711256980896,
"rps_doc_num_sentences": 83,
"rps_doc_symbol_to_word_ratio": 0.0028680700343102217,
"rps_doc_unigram_entropy": 5.314573287963867,
"rps_doc_word_count": 613,
"rps_doc_frac_chars_dupe_10grams": 0.29604822397232056,
"rps_doc_frac_chars_dupe_5grams": 0.32150033116340637,
"rps_doc_frac_chars_dupe_6grams": 0.32150033116340637,
"rps_doc_frac_chars_dupe_7grams": 0.3081044852733612,
"rps_doc_frac_chars_dupe_8grams": 0.29604822397232056,
"rps_doc_frac_chars_dupe_9grams": 0.29604822397232056,
"rps_doc_frac_chars_top_2gram": 0.026791689917445183,
"rps_doc_frac_chars_top_3gram": 0.011051570065319538,
"rps_doc_frac_chars_top_4gram": 0.009042199701070786,
"rps_doc_books_importance": -483.2986755371094,
"rps_doc_books_importance_length_correction": -483.2986755371094,
"rps_doc_openwebtext_importance": -256.61956787109375,
"rps_doc_openwebtext_importance_length_correction": -256.61956787109375,
"rps_doc_wikipedia_importance": -156.40817260742188,
"rps_doc_wikipedia_importance_length_correction": -156.40817260742188
},
"fasttext": {
"dclm": 0.282822847366333,
"english": 0.6660427451133728,
"fineweb_edu_approx": 1.7839622497558594,
"eai_general_math": 0.00010645000293152407,
"eai_open_web_math": 0.3408970236778259,
"eai_web_code": 0.9996510744094849
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,928,606,457,370,532,000 |
Elias boosted
🎙️ talked to @phosh main developer @agx:
* Getting involved with Phosh and Librem 5 as happy coincidence
* Going from N900 straight to Librem 5
* squeekboard vs. phosh-osk-stub
* Being puzzled by people using Phosh on the PinePhone
* Having a smile on the face when seeing random old phones & tablets with Phosh
* Automatic hardware testing at @purism
* How Phosh gets translated
* Upcoming @FrOSCon 2024
* Lockscreen widgets
* Cellbroadcast
cast.postmarketos.org/episode/
#froscon #linuxmobile #phosh
Elias boosted
Mycket bra artikel om hur förutsättningarna till fungerande källkritik undergrävs.
DN Debatt. "Utan tillit betyder källkritik närmast ingenting"
dn.se/debatt/utan-tillit-betyd
#svpol
Article about "AI"
In Swedish, E-identification, FOSS
Elias boosted
“Microsoft admits no guarantee of sovereignty for UK policing data”
computerweekly.com/news/366589
To be fair, there’s quite a lot of NHS-related blood test data not in the UK at the moment too, thanks to the recent unscheduled offsite backup…
Podd-tips (in Swedish)
Elias boosted
Elias boosted
Breaking news: #chatcontrol stryks från agendan till dagens COREPER II (representerar för EUs regeringar) möte! Det betyder att Belgien som ordförandeland inte känner att de har tillräckligt stöd för sitt kompromissförslag. Motståndet har effekt och det ger oss lite mer tid.
Elias boosted
Elias boosted
Elias boosted
🇬🇧 Vote on #ChatControl postponed – a triumph in our fight to defend the digital privacy of correspondence and secure encryption. 💪 Thank you!
But the next attempt will come. The critical governments need to get their act together now:
patrick-breyer.de/en/chat-cont
Elias boosted
Elias boosted
17 June 1942 | SS men shot 120 Polish prisoners at the Death Wall in #Auschwitz I. They were selected from those deported to the camp from Warsaw, Krakow, Tarnów, Radom, and Lublin.
One of them was a brickmaker from Marki Edward Rabczyński (np. 22869).
One of some 140,000 Poles incarcerated in Auschwitz.
Learn about the creation of the camp, reasons for the incarceration of Poles & their fate in the German Nazi camp from our online lesson "Poles at KL Auschwitz”: lekcja.auschwitz.org/en_2020_0
Elias boosted
📣Official statement: the new EU chat controls proposal for mass scanning is the same old surveillance with new branding.
Whether you call it a backdoor, a front door, or “upload moderation” it undermines encryption & creates significant vulnerabilities
signal.org/blog/pdfs/upload-mo
This is to help folks understand why they should use -- Be like Jules!
It occurred to me that I nowadays think about Youtube videos in about the same way that Jules Winnfield in Pulp Fiction thinks about eating filthy animals.
---
Them: "Check out this youtube video!"
Me: "I don't watch youtube videos."
Them: "But this youtube video is good!"
Me: "Hey, that video may be sweet as pumpkin pie, but I'd never know 'cause I don't touch that filthy motherfucking website. Youtube is a Google site, so it's filthy. I don't visit filthy websites."
I prefer
Elias boosted
Show more
Librem Social
Librem Social is an opt-in public network. Messages are shared under Creative Commons BY-SA 4.0 license terms. Policy.
Stay safe. Please abide by our code of conduct.
(Source code)
image/svg+xml Librem Chat image/svg+xml
|
{
"url": "https://social.librem.one/@eliasr",
"source_domain": "social.librem.one",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "111895",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:655SNZSYK5QI3GHH5OL6D7DJMVTCV22F",
"WARC-Concurrent-To": "<urn:uuid:aab3c32a-0d3e-4f08-a83a-266e90cb866d>",
"WARC-Date": "2024-06-24T09:08:18Z",
"WARC-IP-Address": "147.182.229.121",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XOQVF4NMR7PZPVCIG632ZQBXZBV7FB3X",
"WARC-Record-ID": "<urn:uuid:d0a7ee26-af8b-4cc2-8bda-f3adf53141f5>",
"WARC-Target-URI": "https://social.librem.one/@eliasr",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:44814991-6988-4316-a82d-c2140462d6bf>"
},
"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-225\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
14,
15,
56,
57,
121,
160,
193,
248,
328,
368,
396,
421,
442,
458,
459,
490,
491,
520,
521,
535,
536,
619,
620,
682,
713,
714,
721,
722,
742,
743,
779,
780,
794,
795,
863,
864,
895,
896,
1041,
1042,
1066,
1067,
1081,
1095,
1096,
1372,
1373,
1387,
1401,
1415,
1416,
1559,
1652,
1653,
1684,
1685,
1699,
1713,
1714,
1896,
1897,
1968,
1969,
2022,
2215,
2216,
2230,
2231,
2352,
2353,
2485,
2486,
2517,
2518,
2589,
2590,
2746,
2747,
2751,
2752,
2790,
2791,
2827,
2828,
2868,
2869,
3068,
3069,
3078,
3079,
3093,
3103,
3117,
3118,
3237,
3238,
3286,
3287,
3301,
3302
],
"line_end_idx": [
14,
15,
56,
57,
121,
160,
193,
248,
328,
368,
396,
421,
442,
458,
459,
490,
491,
520,
521,
535,
536,
619,
620,
682,
713,
714,
721,
722,
742,
743,
779,
780,
794,
795,
863,
864,
895,
896,
1041,
1042,
1066,
1067,
1081,
1095,
1096,
1372,
1373,
1387,
1401,
1415,
1416,
1559,
1652,
1653,
1684,
1685,
1699,
1713,
1714,
1896,
1897,
1968,
1969,
2022,
2215,
2216,
2230,
2231,
2352,
2353,
2485,
2486,
2517,
2518,
2589,
2590,
2746,
2747,
2751,
2752,
2790,
2791,
2827,
2828,
2868,
2869,
3068,
3069,
3078,
3079,
3093,
3103,
3117,
3118,
3237,
3238,
3286,
3287,
3301,
3302,
3341
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3341,
"ccnet_original_nlines": 100,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23133236169815063,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.032210830599069595,
"rps_doc_frac_lines_end_with_ellipsis": 0.009900989942252636,
"rps_doc_frac_no_alph_words": 0.23572474718093872,
"rps_doc_frac_unique_words": 0.6666666865348816,
"rps_doc_mean_word_length": 5.367676734924316,
"rps_doc_num_sentences": 38,
"rps_doc_symbol_to_word_ratio": 0.011713029816746712,
"rps_doc_unigram_entropy": 5.506331443786621,
"rps_doc_word_count": 495,
"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.05419645830988884,
"rps_doc_frac_chars_top_3gram": 0.02559277042746544,
"rps_doc_frac_chars_top_4gram": 0.03613096848130226,
"rps_doc_books_importance": -341.91070556640625,
"rps_doc_books_importance_length_correction": -341.91070556640625,
"rps_doc_openwebtext_importance": -186.86050415039062,
"rps_doc_openwebtext_importance_length_correction": -186.86050415039062,
"rps_doc_wikipedia_importance": -162.10572814941406,
"rps_doc_wikipedia_importance_length_correction": -162.10572814941406
},
"fasttext": {
"dclm": 0.045110758394002914,
"english": 0.6785150766372681,
"fineweb_edu_approx": 1.3685473203659058,
"eai_general_math": 0.007367010228335857,
"eai_open_web_math": 0.1416618824005127,
"eai_web_code": 0.008186879567801952
}
}
|
{
"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": "323.042",
"labels": {
"level_1": "Social sciences",
"level_2": "Political science",
"level_3": "Human rights, Ethnic relations, Race relations, and Minorities"
}
}
},
"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": "News/Editorial"
}
},
"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": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.