ntova: > I see that in your example, ASAP drop would indeed prevent a deadlock. However, to prevent deadlocks, you are generally advised to only ever lock resources in the same order and have a hierarchy of locks ( https://en.wikipedia.org/wiki/Deadlock\_(computer_science)#Prevention ). This would have prevented the deadlock in your example as well. If you look at the code, the locks are acquired in the same order. The issue stems from a "late join", because the main thread isn't blocked immediately after spawning a new thread, it becomes very easy to trigger a deadlock due to scope based drops. Why not block the main thread right away? Because the goal is to allow the main thread to continue executing other tasks in parallel, only blocking it when it reaches the point where it needs to retrieve the result from the worker thread. ntova: > the compiler would need to somehow track that anywhere in the struct `DangerZone` there is a pointer to the locked data. This may even be in another crate. Let's assume this would work. No, Rust has auto trait propagation, for instance, if one of the child components is `!Send`, the parent automatically becomes `!Send`. The `ASAP_drop` trait would work the same way, so the compiler simply need to query whether a given `T` is `ASAP_drop` or `!ASAP_drop`. ntova: > The problem I see here is that you would somehow need to know that `holds_pointer` has a pointer to B, therefore is implicitly `!ASAP_Drop`, and you would have to manually prevent A from getting dropped before B to ensure your lock hierarchy is kept intact. In my mind this a bigger potential footgun than the performance impact of keeping locks too long. This isn't an issue, as you can simply look at the parameters. There’s no need to worry about the order of operations, unlike with scope based dropping, A and B are not interdependent; they are entirely independent and do not reference one another, so concerning yourself with the order is pointless. "ASAP dropping" ensures that the lock held by A is released the moment it is no longer in use, the same applies to B, and, unlike scope based drop, it is not vulnerable to the "hierarchy footguns". If let's say, one of the fields in B points to field A, an "ASAP drop" won't drop it, because A is still being referenced by B, in other words, it’s still in use, it will drop the value once none is using A. If it’s a pointer, as I mentioned earlier, it becomes a "scope based drop.". And the MutexGuard doesn't drop the value, it calls the `unlock` method to unlock the lock, the dropping value happens later by the T's impl Drop not the MutexGuard's impl Drop. No, there are significant performance benefits : * It is memory efficient, scaling at O(n) relative to the size of the memory being held waiting end of scope and the duration until the end of the scope is reached. This results in a low peak memory usage, exactly equal to proper manual memory management (like C, Zig), because, in manual management, memory is freed immediately when it is no longer in use, rather than waiting for the execution to reach the end of a scope (which could involve many lines of code with unpredictable execution durations). * It offers low latency and high throughput multithreaded code, scaling at O(n) relative to the total duration of unnecessary blocking. To visualize this: if a channel processes tasks at 100 ns per task, a 200 ms thread block would result in the loss of 2 million tasks. This is a dynamic "footgun", it isn't fixed, the longer the blocking duration, the greater the loss in latency and throughput.

OpenAI shares model results on the Kakeya conjecture, Exponential Time Hypothesis, and quantum chromodynamics—and how researchers can verify and build on them.

Channel specialized for advanced topics of: * Artificial intelligence, * Machine Learning, * Deep Learning, * Computer Vision, * Data Science * Python Admin: @otchebuch Memes: @memes_programming Ads: @Source_Ads, https://telega.io/c/computer_science

Channel specialized for advanced topics of: * Artificial intelligence, * Machine Learning, * Deep Learning, * Computer Vision, * Data Science * Python Admin: @otchebuch Memes: @memes_programming Ads: @Source_Ads, https://telega.io/c/computer_science

Channel specialized for advanced topics of: * Artificial intelligence, * Machine Learning, * Deep Learning, * Computer Vision, * Data Science * Python Admin: @otchebuch Memes: @memes_programming Ads: @Source_Ads, https://telega.io/c/computer_science

Channel specialized for advanced topics of: * Artificial intelligence, * Machine Learning, * Deep Learning, * Computer Vision, * Data Science * Python Admin: @otchebuch Memes: @memes_programming Ads: @Source_Ads, https://telega.io/c/computer_science

YouTube video by Mad Computer Scientist

YouTube video by Mad Computer Scientist

Channel specialized for advanced topics of: * Artificial intelligence, * Machine Learning, * Deep Learning, * Computer Vision, * Data Science * Python Admin: @otchebuch Memes: @memes_programming Ads: @Source_Ads, https://telega.io/c/computer_science

Channel specialized for advanced topics of: * Artificial intelligence, * Machine Learning, * Deep Learning, * Computer Vision, * Data Science * Python Admin: @otchebuch Memes: @memes_programming Ads: @Source_Ads, https://telega.io/c/computer_science

Channel specialized for advanced topics of: * Artificial intelligence, * Machine Learning, * Deep Learning, * Computer Vision, * Data Science * Python Admin: @otchebuch Memes: @memes_programming Ads: @Source_Ads, https://telega.io/c/computer_science

Computer science is the study of computation, information, and automation. Included broadly in the