lazamar

6 ms·

1.
by lazamar 1y ago
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.
2.
by lazamar 1y ago
At Meta they are using FM indexes to power text search through the entire commit history of their monorepo.
3.
Indexing Code at Scale with Glean(engineering.fb.com)
2 points by lazamar 2y ago|0 comments
4.
by lazamar 2y ago
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 the preliminary results of his work on the Pseudoscalar the
5.
by lazamar 2y ago
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 encode and their probabilities. Then you need a coder, like H
6.
by lazamar 2y ago
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 this particular piece of code to judge a language's pe
7.
by lazamar 2y ago
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 into a coherent, well organised program. Which is impor
8.
by lazamar 2y ago
Fixed it. Well spotted!
9.
by lazamar 2y ago
I’d say unbeatable! The goal was simplicity of implementation and code clarity. For this kind of thing I say Haskell performs the best.
10.
by lazamar 2y ago
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 `100000000000000001` In this case, where to know whether the first code w
11.
by lazamar 2y ago
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 indeed get arbitrarily close to the entropy, which is not qu
12.
by lazamar 2y ago
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 edition.
13.
Building a data compression utility in Haskell using Huffman codes(lazamar.github.io)
232 points by lazamar 2y ago|88 comments
14.
by lazamar 2y ago
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 notifications this provides enough friction to discourage me f
15.
by lazamar 2y ago
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 something covered in the article or supported in the associated
16.
A virtual DOM in 200 lines of JavaScript(lazamar.github.io)
4 points by lazamar 2y ago|3 comments
17.
by lazamar 3y ago
Julia’s explanations are clear and fun, I hope she keeps doing that for a very long time.
18.
by lazamar 3y ago
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.
19.
Show HN: Browse Hackage from the Terminal(lazamar.github.io)
3 points by lazamar 5y ago|0 comments
20.
by lazamar 5y ago
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 have snappy queries. You would create entries like "this i
21.
Show HN: Find older versions of a package in the Nix Package Repository(lazamar.co.uk)
2 points by lazamar 6y ago|0 comments
22.
by lazamar 7y ago
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 knowledge needed to identify what kind of problem you have i
23.
Dict-parser: Elm package to create a fast parser to match dictionary keys(github.com)
29 points by lazamar 7y ago|0 comments
24.
Elm Architecture in Haskell with concurrent effects(github.com)
4 points by lazamar 9y ago|1 comments
25.
Zero downtime – Making Blue-Green deployments dead simple(lazamar.github.io)
2 points by lazamar 9y ago|0 comments
26.
Calling Elm functions synchronously from JavaScript(lazamar.github.io)
1 points by lazamar 9y ago|0 comments
27.
Dispatching from inside a reducer in Redux(lazamar.github.io)
2 points by lazamar 10y ago|0 comments
28.
My accidental Denial of Service attack(lazamar.github.io)
2 points by lazamar 10y ago|0 comments