Viewing profile — lazamar
lazamar
HN member- Joined
- Fri, Sep 16, 2016, 11:37 AM UTC
- HN karma
- 177
- Public activity
- 31 items
- HN profile
- View on Hacker News ↗
About lazamar
No profile information was provided.
Recent public activity
-
comment
Comment #44700873
Why not search the FM-indexes directly? It is faster than the n-gram search and you can use the exact full text of the needle.
-
comment
Comment #44697206
At Meta they are using FM indexes to power text search through the entire commit history of their monorepo.
- story
-
comment
Comment #40961744
Lol. Loved it. This was a lovely passage from Dyson’s Web of Stories interview, and it struck a chord with me, like it clearly did with the authors too. It happened when Dyson took…
-
comment
Comment #40875165
Indeed, but worth noting that LZ is a modelling scheme, whilst Huffman is a coding technique. That is, LZ determines, dynamically as it goes, what are all the elements we want to e…
-
comment
Comment #40873959
The goal of this implementation is not to be fast, but to be clear. I am doing some inefficient things (like two pass encoding) on purpose to keep things simple and clear. So using…
-
comment
Comment #40873943
Haskell's speed can be competitive with systems languages but keep in mind that its killer feature is ease of abstraction. The idea is that it is simple to assemble multiple parts …
-
comment
Comment #40873856
Fixed it. Well spotted!
-
comment
Comment #40873762
I’d say unbeatable! The goal was simplicity of implementation and code clarity. For this kind of thing I say Haskell performs the best.
-
comment
Comment #40873413
That’s interesting. I guess this is not usually used because you may have a long string of bits that is ambiguous till you get to a disambiguating bit. Something like `100000000000…
-
comment
Comment #40873342
There is one way in which Huffman codes are better: they are easier to explain and simpler to implement. I went for simplicity of exposition in the post, but arithmetic coders can …
-
comment
Comment #40873294
Thanks for the link. I was motivated to write the post after reading Moffat’s book ‘Managing Gigabytes’. A pearl from the 90’s. The authors mention this technique in the second edi…
- story
- story
- comment
- story
-
comment
Comment #40486306
The most effective solution I found was keeping my phone in my backpack instead of my pocket. When working I keep it somewhere I’d need to get up to get it. Together with taming no…
-
comment
Comment #40445930
Do you mean whether nodes could be rearranged without recreating them? This would require identifying them with IDs, like React can do. That's definitely possible, but not somethin…
- story
-
comment
Comment #38828597
Julia’s explanations are clear and fun, I hope she keeps doing that for a very long time.
-
comment
Comment #35748998
Thanks. I’ve just wasted 2 hours. Loved the game. To make it generate winnable games just start from a solution and keep expanding it until you get to the initial game state.
- story
-
comment
Comment #28366448
Glean is focused on storing and querying data about the code. The idea is that you have your own program to collect that data, then you use Glean to store that compactly and to hav…
- story
-
comment
Comment #22287309
I followed that curriculum and it sorted me out with regards to algorithms and networking. I recommend it very highly. The idea is that once you have read these books you have the …