eihli
/
clj-tightly-packed-trie
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
main
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'f57ea59c22'
${ noResults }
clj-tightly-packed-trie/.gitignore

8 lines
49 B
Plaintext
Raw Normal View History Unescape Escape

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
.DS_Store
.idea
*.log
tmp/
.nrepl-port
.cpcache