adaptit

5 ms·

1.
by adaptit 5mo ago
I've solved most of my problems by following these guidelines: one worktree for each code domain, using git sparse-checkout to limit the context (e.g. one worktree for the Rust core, one for Swift macOS, one for Swift iOS, etc.), and p
2.
by adaptit 5mo ago
Maybe it's just conservation of angular momentum: if you look closely, you can see that the spin axis and the way she applies the force aren't perfectly tangential to the object's axis, so the lower point of the T-shape is &q
3.
by adaptit 5mo ago
Ah ok, the lazy construction part is what I was missing, if you basically never build the full key, there's nothing to cache. Makes sense now why the LRU didn't help. I'll think about it over the nextdays.
4.
by adaptit 5mo ago
Probably a naive question, but: couldn't you precompute some vector representation of the string once, and reduce collation to a vector comparison? Basically move the cost upfront and get back to the "fast" byte-comparison ca
5.
by adaptit 5mo ago
Is this an astronomical math calculation done in real time, or do you pre-compute all possible paths? I'm interested in the math behind it.
6.
by adaptit 5mo ago
Emacs is powerful, but the complexity overhead of managing a custom trust layer could easily become a major maintenance bottleneck for average users. Worth considering, but the friction point is significant.
7.
by adaptit 5mo ago
This interval calculator is surprisingly robust. The way it handles boundary conditions and asymmetric intervals is clean and efficient.
8.
by adaptit 5mo ago
Always cool to see these kinds of retro computing resources pop up.
9.
by adaptit 5mo ago
This resource is a really clear breakdown of order relations; visualizing the structure like this makes the abstract concepts much more digestible