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

1 Commits (56be9e98987c9c1532efb46d6db20e595c7fff78)
 

Author SHA1 Message Date
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