Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
mkirchner
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
4 ms
·
1.
▲
Cohere to Acquire Aleph Alpha
(ft.com)
3 points
by
mkirchner
6mo ago
|
0 comments
2.
▲
Spatial intelligence is AI’s next frontier
(drfeifei.substack.com)
243 points
by
mkirchner
11mo ago
|
127 comments
3.
▲
The history of Unix's confusing ways to allocate memory (2018)
(utcc.utoronto.ca)
1 points
by
mkirchner
3y ago
|
0 comments
4.
▲
by
mkirchner
3y ago
Ha! This was probably the first serious problem I ever tackled with an open source contribution! The year was 2002, the 2.4 Linux kernel had just been released and I was making money on the side building monitoring software for a few thousa
5.
▲
Hash Based Trees and Tries
(nrk.neocities.org)
3 points
by
mkirchner
3y ago
|
0 comments
6.
▲
by
mkirchner
3y ago
Beautiful, thanks!
7.
▲
by
mkirchner
3y ago
#1 doing it in many 20-30min batches with little kids #2 see #1 Jokes aside, IMHO there was not a single challenge standing out in terms of implementation; getting the pieces to work together and finding residual bugs was hard. LLDB was my
8.
▲
by
mkirchner
3y ago
Agree. I was trying to mostly mimick the libavl API, hence the design decision.
9.
▲
by
mkirchner
3y ago
Thanks! Yes, basically log_64(n) vs. log_32(n) and it would also require to switch to a 64 bit hash function and adjust hash exhaustion and bit fiddling arithmetic accordingly. Re the impact of the recursion, that's actually zero for t
10.
▲
by
mkirchner
3y ago
Thank you, happy to share. These are excellent pointers. Regarding the batch construction, it's not immediately clear to me how to implement sorting since the order is implicit through the hash function (it seems one would need to cons
11.
▲
Show HN: A hash array-mapped trie implementation in C
(github.com)
171 points
by
mkirchner
3y ago
|
56 comments
12.
▲
by
mkirchner
4y ago
This. Roughly a year ago I got interested in efficient immutability for my write-from-scratch-in-C Lisp [0] and started to write a HAMT implementation in C [1], along with a (somewhat hacky, you have been warned) benchmarking suite [2]. The
13.
▲
by
mkirchner
6y ago
Author here. To add context that seems lost on some: this is a cleaned-up version of my own notes from when I tried to understand the technical detail behind what Linus called "good taste" in the TED talk. The main contributions o
14.
▲
by
mkirchner
6y ago
Author here. Thanks for fixing the title, I should have seen that!
15.
▲
Linus Torvalds' good taste argument for linked lists, explained
(github.com)
717 points
by
mkirchner
6y ago
|
326 comments
16.
▲
Code and data for The Economist's Big Mac index
(github.com)
138 points
by
mkirchner
7y ago
|
27 comments
17.
▲
Show HN: A simple garbage collector for C
(github.com)
192 points
by
mkirchner
7y ago
|
60 comments
18.
▲
Must reads for tech managers
(linuxco.de)
3 points
by
mkirchner
9y ago
|
0 comments