eihli
/
clj-tightly-packed-trie
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
14 Commits
1 Branch
0 Tags
92 KiB
main
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '846eee5e92'
${ noResults }
Commit Graph

6 Commits (846eee5e92f3af2bc971d8ab5b2f70870f59107b)

Author SHA1 Message Date
Eric Ihli 2356df1095 Performance gains with type hints 4 years ago
Eric Ihli f57ea59c22 Lazier, faster, more memory-efficient seq 
Custom print methods, remove unused zip code
 4 years ago
Eric Ihli 100bd5e1c2 Bump version 4 years ago
Eric Ihli fb46bc5a27 Add SCM data to pom.xml 4 years ago
Eric Ihli 59aee308ee Bump version and sync to Clojars 4 years ago
Eric Ihli 56be9e9898 Implement hash-map and byte-array tries 
The hash-map trie is convenient to work with at the REPL since the
key/values are human readable and the backing data is traversible in a
fashion familiar to Clojure.

The byte-array backed trie has a slightly different API but is far more
memory efficient.

The paper that the tightly backed trie is based on can be viewed at
https://www.aclweb.org/anthology/W09-1505.pdf
 4 years ago