Top all-time · #10616
Jules Jacobs
Personal blog · julesjacobs.com · on HN as julesmathprogramming
Jules Jacobs's personal blog at julesjacobs.com covers math and programming. Since 2022, 7 different Hacker News readers have linked it 7 times, most often “Binary Search: A Little Simpler and More Generic (2020, PDF)”. The last post was in 2024, but the archive is still widely read.
Too few sampled comments (2) to say how often HN recommends it.?
Why HN links it
HN commenters link his 2014 post on immutable vectors in C#, which describes an implementation using 32-capacity buffers, generics and bit shifting for lookups. Neither comment judges the writing.
Summarised by Claude from a sample of 2 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.
Jules Jacobs is an Assistant Professor in Computer Science at ETH Zürich, working on programming languages and formal verification.
Most-linked posts?
- Binary Search: A Little Simpler and More Generic (2020, PDF)2 people · 2 mentions · first linked 2023-04-22
What Hacker News says?
Also will throw in to the mix, in C#: https://julesjacobs.com/2014/11/11/immutable-vectors-csharp.... His implementation uses buffers of capacity 32, generics, and bit shifting to do lookups.
Comment linking /2014/11/11/immutable-vectors-csharp.html
on “Show HN: Integer Map Data Structure”Submitted You Don't Need Matrix Calculus as a story · 17 points
HN discussionThe modifications that this article makes to the original version [1,2] are not a good idea. The modified version in this article cannot properly be used to search an array, for example (due to the extra "sanity checks", which would cause out-of-bounds errors). The API is also made more complex, returning a pair of options of indices rather than a pair of indices. You really just want the pair of indices! If you do…
Comment linking /notes/binarysearch/binarysearch.pdf
on “my-new-rust-binary-search”Submitted Levenshtein automata can be simple and fast (2015) as a story · 1 points
HN discussionYeah, in any modern language with pattern matching stuff like this is absolutely the compiler's job, and can be done pretty well[1] - of course, there are plenty of legacy languages that don't have pattern matching, but seeing as it can be compiled straight to switches and whatnot, even the lowest level languages don't have /that/ much of an excuse. refs: [1]: http://moscova.inria.fr/~maranget/papers/ml05e-maranget.…
Comment linking /notes/patternmatching/patternmatching.pdf
on “Compile-Time Checked Truth Tables”Submitted Binary Search: A Little Simpler and More Generic (2020, PDF) as a story · 1 points
HN discussionSubmitted Higher-Order Leak and Deadlock Free Locks [pdf] as a story · 1 points
HN discussion