clj-tightly-packed-trie

Commit Graph

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

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

1 Commits (e3fb9199282faed16818b657053a2bbd922eb022)