In fact, there are lots of arena/bump allocator crates! It's not a negative point for Rust, but it solves a problem this author doesn't have.
1,327 karma · joined March 3, 2013
In fact, there are lots of arena/bump allocator crates! It's not a negative point for Rust, but it solves a problem this author doesn't have.
Another great pattern for batch writes is to use a system like Nagle's algorithm - push stuff into a queue, and insert from the queue in batches.
People who still use C rather than C++, which has this exact feature?
https://open.substack.com/pub/ryanfleury/p/untangling-lifeti...
I am struggling to understand who the overlap between people who can accurately assess the risk of each of these implementations and correctly find them ok (graduate level cryptography?) and people who cannot get pyca or openssl to compile is.
For offline operation maybe a case could be made that timing side channels aren't an issue in practice, but this is explicitly network software.
If you were going to do formal verification from the graphical representation, it would be on the algorithm; namely does it always converge, does it ever deadlock, does it ever fail mutual exclusion. If the goal is for a computer to analyze it, it can be precisely as complex as the source code, so yes. But at that point it's not useful visually for a human to read.
https://probablydance.com/2020/10/31/using-tla-in-the-real-w...
https://probablydance.com/2022/09/17/finding-the-second-bug-...
So I decided that the diagram was most useful for someone looking to understand the algorithm in the abstract, and only once they had been convinced of its correctness should they proceed to review the implementation code. The code was a terrible way to understand the algorithm, and the visualization was a terrible way to understand the implementation.
This is a false explanation though - the problem is that memory is returned before you're done with it.
https://doc.rust-lang.org/book/ch15-06-reference-cycles.html
This is extra-wrong as python has a garbage collector to break reference cycles. If giving a simplified explanation to a layman, it's important that if they repeat the explanation to another expert they don't hear "well that's wrong".
I would encourage you to read the books "Antifragile" and "The Black Swan" by Nassim Taleb. The risk you're running may have low probability, but also has massive effects when it does occur, and such events are responsible for a major part of both gains and losses in financial markets.
>"because there have been others before you who thought they were smarter than the rest..."
Short term trading without a latency advantage is a zero sum or negative sum game. Every opportunity your bot considers is also being considered by competing bots, with way more capital than you. Maybe you are smarter than the other market participants, but it sounds like maybe you haven't done your research on how sophisticated other bots are. It's a bit like betting on yourself in a sports competition before finding out how your skills compare to the people who regularly win those competitions. However, unlike sports where you'll be immediately trounced by a professional, you might make some good returns on small trades to start, which will make you feel comfortable putting your capital at risk, and then you'll lose it all.
Cronet is still around, now open source and as far as I know is still the best all-around network stack for Android apps - fast, secure, supports modern protocols.
https://issues.chromium.org/issues/41088357#comment32
Years ago I bought some Korean phone with a foot long antenna and TV tuner on eBay because it was crashing at a disproportionate rate. It was just the nature of Android development at the time.
https://godbolt.org/#g:!((g:!((g:!((h:codeEditor,i:(filename...
https://docs.oracle.com/javase/specs/jls/se21/html/jls-17.ht...
>An object is considered to be completely initialized when its constructor finishes. A thread that can only see a reference to an object after that object has been completely initialized is guaranteed to see the correctly initialized values for that object's final fields.
If you don't publish a reference to the object from within the constructor, you will not see a null value of the final field, even if the object itself was unsafely published across threads via a non-volatile field.
Don't the STL tree and map data structures have notoriously poor performance?
What he did with GE's reported earnings could be considered fraud, and those cooked books are what made him famous among executives.
If you haven't read "Lights Out", I encourage you to check it out.
As it relates to the parent comment, the issue isn't Jack Welch specifically, but people trying to attain his success. The same thing could be said about Steve Jobs - his results are undeniable, but there's a group who see his success and think that it comes from what many would consider flaws rather than strengths, and emulate those. The people subjected to this type of leadership get all the negatives but without creating world changing products or enjoying unparalleled business success, and are reasonably resentful.
https://old.reddit.com/r/peakdesign/comments/nkb6t2/laptop_w...
So test a million links - your probability of finding a real one is (1-1/2^984)^1000000. That's around 1/10^291 chance of hitting a valid URL with a million tries. Even if you avoid ever checking the same URL twice it will still take you an impractical amount of time.
So if you had 1 BTC on ftx, your claim is for $16,871.63. The team responsible to managing the FTX bankruptcy sold at some higher price, and today BTC is trading at $61,766.40.
Understandably people are not thrilled about "being made whole" under these circumstances.
Generating fake pictures also seems like it would be more ordinary false advertising.