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

4 Commits (e906a44d5a4b12cee32d625a98355d2adeef8e5e)

Author SHA1 Message Date
Eric Ihli 00ea29be44 Add children-at-depth function 5 years ago
Eric Ihli 91ca755adb Not signing releases 5 years ago
Eric Ihli 59aee308ee Bump version and sync to Clojars 5 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
 5 years ago