Age | Commit message (Expand) | Author | Files | Lines |
---|---|---|---|---|
2005-12-04 | Use all 256 possible codepoints; prefix with uncompressed string length. | H. Peter Anvin | 1 | -12/+16 |
2005-12-04 | Correct (and better) compression | H. Peter Anvin | 1 | -6/+22 |
2005-12-04 | Add compressor; more work towards being able to actually build hash tables | H. Peter Anvin | 1 | -10/+22 |
2005-11-26 | Compression algorithm for the names array | H. Peter Anvin | 1 | -0/+141 |