judofyr

8 ms·

1.
by judofyr 28d ago
I'm confused. How is this simpler? Is there something in (-1)^(2x) that can easily understood by staring at the complex plane? It seems mostly that you've gotten rid of "e", but one of the goals of Euler's formula I
2.
by judofyr 1mo ago
In the initial state there's 24 (12 * 2) different possibilities: The marble you're looking for is one of 12 and it's either lighter or heavier. By using a balance scale there's 3 possible outcomes (left side is heavier;
3.
by judofyr 2mo ago
I imagined that I'm 24 years old and I have a 20 years old brother. When I were his age, he would have been 16 years old. I also realized that this can be expressed in terms of a two pairs of sibling: > Mary and Ann are the same age
4.
by judofyr 2mo ago
Rephrasing it makes it easier to grasp: Mary is 24 years old. When Mary was Ann’s current age, Ann was 12 years old (half Mary’s current age). This makes it a bit easier to realize that Ann’s age has to be right in the middle of 12 and 24.
5.
by judofyr 2mo ago
Some examples just from the second paragraph: - while none of this is exaggerated - it comes down to a real design choice - the bloat, the amplified writes, the vacuum babysitting - every charge traces to a decision, not a defect -
6.
by judofyr 3mo ago
Not sure where I picked up this, but I’ve added this to my global Git ignore: attic That way you can just create an attic directory in any project where you can keep random stuff that should never be committed. I’ve yet to find a r
7.
by judofyr 5mo ago
Ignoring the misuse of epsilon, I'd also say that you'd be helping your users more by not providing a general `assert_f64_eq` macro, but rather force the user to decide the error model. Add a required "precision" param
8.
by judofyr 6mo ago
This is just wrong. See https://en.cppreference.com/w/cpp/atomic/memory_order.html . Emphasis mine: > A store operation with this memory order performs the release operation: no reads or writes in the curr
9.
by judofyr 7mo ago
It’s just an encrypted file on disk. You’d depend on whatever backup solution you already have in place.
10.
by judofyr 9mo ago
Very cool project! Always happy to see more work around static analysis. However, looking at the recent commits it doesn't quite look like the most solid foundation: https://github.com/shuaimu/rusty-cpp/commit
11.
by judofyr 9mo ago
Can you show an actual minimal C program which has this problem? I’m trying to follow along here, but it’s very hard for me to understand the exact scenario you’re talking about.
12.
by judofyr 9mo ago
Is there a specific reason to store the key + value as an `uint64_t` instead of just using a struct like this? struct slot { uint32_t key; uint32_t value; }
13.
by judofyr 9mo ago
> If a carpenter shows up to put a roof yet their hammer or nail-gun can't actually put in nails, who'd you blame; the tool, the toolmaker or the carpenter? I would be unhappy with the carpenter, yes. But if the toolmaker was c
14.
by judofyr 9mo ago
I think this is a bit unfair. The carpenters are (1) living in world where there’s an extreme focus on delivering as quicklyas possible, (2) being presented with a tool which is promised by prominent figures to be amazing, and (3) the tool
15.
by judofyr 11mo ago
I’m sorry, but this is such a terribly unscientific approach. You want to make a case for your hypothesis? Follow a structured approach with real arguments. Saying «I know that correlation doesn’t imply causation», but then only demonstrati
16.
by judofyr 11mo ago
Maybe I explained it a bit imprecise. I was trying to explain the following behavior: def foo p 1 yield p 2 end foo { break } This only prints "1" because the break stops the execution of the in
17.
by judofyr 11mo ago
Blocks are fundamentally different from functions due to the control flow: `return` inside a block will return the outer method, not the block. `break` stops the whole method that was invoked. This adds some complexity in the language, bu
18.
by judofyr 1y ago
> This has massive implications. SEC means low latency, because nodes don't need to coordinate to handle reads and writes. It means incredible fault tolerance - every single node in the system bar one could simultaneously crash, and
19.
by judofyr 1y ago
> The standardized location is Library. Except for Zsh (~/.zshrc), SSH (~/.ssh/config), Vim (~/.vimrc), Curl (~/.curlrc), Git (~/.gitconfig). Apple could have chosen to patch these and move the configuration
20.
by judofyr 1y ago
> Suggest contrary to that is wrongthink and enough to have one ostracized not only from science, but also society as a whole. There's many scientists who have published the "contrary". They were not ostracized from scie
21.
by judofyr 1y ago
Your first link (Wikipedia) directly contradicts your examples: > Although IQ differences between individuals have been shown to have a large hereditary component, it does not follow that disparities in IQ between groups have a genetic b
22.
by judofyr 1y ago
No, sorry. I was just remembering where I've typically seen sequential consistency being used. For instance, Peterson's algorithm was what I had in mind. Spinlock is indeed a good example (although a terrible algorithm which I h
23.
by judofyr 1y ago
A mutex would be the most trivial example. I don't believe that is possible to implement, in the general case, with only acquire-release. Sequential consistency mostly become relevant when you have more than two threads interacting wit
24.
by judofyr 1y ago
Acquire-release ordering provides ordering guarantees for all memory operations. If an acquire observes a releases, the thread is also guaranteed to see all the previous writes done by the other thread - regardless of the atomicity of tho
25.
by judofyr 1y ago
Here's a few workflows that I really enjoy in jj: - While I'm working on something I can do `jj desc` and start writing the commit message. Every edit is automatically being added to this change. - My work tree is dirty and I quic
26.
by judofyr 1y ago
This is one the reasons I find it so silly when people disregard Zig «because it’s just another memory unsafe language»: There’s plenty of innovation within Zig, especially related to comptime and metaprogramming. I really hope other langua
27.
by judofyr 1y ago
Lock-free data structures does not guarantee higher throughput. They guarantee lower latency which often comes at the expense of the throughput. A typical approach for implementing a lock-free data structure is to allow one thread to &quo
28.
by judofyr 1y ago
With direnv you can also run commands directly in the .envrc: export OPENAPI_API_KEY=$(op read "op://api-prod/openai/api-key") Every time you cd into the directory it will execute the command. Isn’t th
29.
by judofyr 1y ago
It’s encoded using the spec that binary data in headers should be enclosed by colons: https://www.rfc-editor.org/rfc/rfc8941.html#name-byte-sequen...
30.
by judofyr 1y ago
The opposite of probabilistic is not deterministic in this context. This is not about «drawing a random number», but rather that balancing is dependent on the input data. «With high probability» here means «majority of the possible input da

More ›