Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
sujayakar
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
10 ms
·
61.
▲
by
sujayakar
12y ago
In the opposite direction of pragmatically avoiding "fancy" data-structures, you can find a description of a persistent min-heap via Brodal queues in Chris Okasaki's wonderful book _Purely Functional Data Structures_. Otherw
62.
▲
by
sujayakar
13y ago
ah yeah step 3 seems pretty bad -- cool that you found that bug!