rtheunissen

7 ms·

1.
Show HN: Factorio Machine Solver(rtheunissen.github.io)
3 points by rtheunissen 11mo ago|0 comments
2.
by rtheunissen 2y ago
I would love to add a good RRB implementation to the persistent benchmarks at [1] to get a state-of-the-art comparison between RRB and BST in a persistent context. Duration, of course, but also number of bytes copied etc. https:/&#x2F
3.
Just Another GPT Wrapper(resourcely.io)
6 points by rtheunissen 2y ago|1 comments
4.
by rtheunissen 2y ago
Practice, the more you use them the easier they become. I never studied them but knew when to use them, then just tinkered and iterated until the pattern did what I needed it to. After a while you can mostly just write and read them without
5.
by rtheunissen 2y ago
Learning a lot here, thank you.
6.
by rtheunissen 2y ago
That does not mean that b-trees are unequivocally better than binary search trees. There are some applications, like concurrency or persistence, where comparison count is not as important. For instance, fewer values per node means less info
7.
by rtheunissen 2y ago
I love the various top-down binary search tree partition/split/join algorithms. https://github.com/rtheunissen/bst/blob/main/trees%2Fbalance...
8.
by rtheunissen 3y ago
Zip trees are novel but their performance (and therefore also skip lists, since they are isomorphic) lacks behind other linked structures like Treaps and especially LBSTs. [1] I personally find skip lists to be overhyped binary search trees
9.
by rtheunissen 3y ago
Maybe it is because the simple way requires knowledge of packages, which are covered later perhaps, since many tutorials go straight to "go run helloworld.go"
10.
Show HN: Binary search tree shape animations using Go and WASM(rtheunissen.github.io)
3 points by rtheunissen 3y ago|0 comments
11.
by rtheunissen 3y ago
Might be a CMS of some kind because I doubt anyone would purposefully type out "alt text".
12.
by rtheunissen 3y ago
That was how I received your feedback. :) My inclination towards lower abstraction in this project is entirely for the sake of reading and reference, to minimize the need for the reader to re-compose from various components split across fil
13.
by rtheunissen 3y ago
Thank you for sharing this resource, I was not aware of it. I am happy to see the inclusion of LBSTs there too. Re: binary symmetry, if I'm understanding correctly, another author that makes use of the symmetry is Ben Pfaff in libavl [
14.
by rtheunissen 3y ago
I was inspired by Stick & Rudder , which is a very easy book to recommend to most people in this community. I'm sure I'll keep coming back to make adjustments, but the end result is what I hoped to achieve. The Charter font w
15.
by rtheunissen 3y ago
Haha true, that's a good point. There's also WAVL and RAVL for weak AVL and relaxed AVL, but no equivalent acronyms for the red-black variants. RRB is the same as Relaxed Radix-Balanced! In my notes I found it easier to avoid acro
16.
by rtheunissen 3y ago
Part 2 defines that "a node is logarithmically weight-balanced if the binary log of the weights of its subtrees differ by no more than 1" and references Roura directly there. Roura uses the acronym LBST, which corresponds to the f
17.
by rtheunissen 3y ago
What if some future technology or material breakthrough provides a sort of self-adjusting liquid memory that provides true constant time access to any address? I'm not being entirely serious of course, as I dream about sequences across
18.
by rtheunissen 3y ago
This has now been fixed, thank you for reminding me.
19.
by rtheunissen 3y ago
You are correct, they have not been covered yet . I've added a note in the "work in progress" section. There are also LLRB trees that would be interesting to see compared within this framework. All the red-black trees are im
20.
by rtheunissen 3y ago
This is tragic! Supporting noscript was a primary design goal but I forgot to only enable the knuth/plass justification in print media. The math expressions I'm moving to build time now. So sorry.
21.
by rtheunissen 3y ago
I believe yes, as illustrated in [1]. This idea only works in a static sense, because to insert a value suffers from the same linear movement of memory as dynamic arrays. B-trees are somewhere in-between because they support logarithmic ins
22.
by rtheunissen 3y ago
That is true, but in a persistent setting they likely also copy more data, and iterator invalidation might be a concern in some cases when moving values around within a B-tree node. The motivation was not really to come up with the best tre
23.
Exploring the design space of binary search trees(rtheunissen.github.io)
122 points by rtheunissen 3y ago|28 comments
24.
by rtheunissen 3y ago
That is the organization.
25.
by rtheunissen 3y ago
Experiment with monitor brightness. My phone is always on low brightness at night, but for some reason my monitor is always at 100% without question, which means light theme during the day (to match paper/pencil in front of me) and dar
26.
by rtheunissen 3y ago
I'll write some tests for this.
27.
by rtheunissen 3y ago
I moved to ULID because they are always lowercase and therefore case-insensitive.
28.
by rtheunissen 3y ago
You can view the source on the page, it's all there.
29.
by rtheunissen 3y ago
A very consistent codebase makes it possible to do things like this, using automatic refactoring and very smart find/replace, but such codebases are few and far between.
30.
by rtheunissen 3y ago
I can't believe they still teach red-black trees. The complexity distracts so much from learning. Both AVL and weight-balanced trees are simpler to implement and easier to understand.

More ›