package - Generic Trie Haskell implementation -
i needed generic trie implementation in haskell not find any.
i implemented my own functions (only keys here, didn't need data on trie) want find trie implementation in haskell future uses (i'm rookie haskeller).
i found data.trie keys bytestring.
is data.trie correct option? (and don't know how use it)
thank you!!! :d
moved comment request...
the generic trie implementation know of off top of head the list-tries
package. struck me bit overengineered, 1 person's "overcomplicated" person's "full-featured", if suits purposes go it. also, package seems actively maintained, good.
oh, , since package didn't state explicitly anywhere see: "patricia trie" version trie compresses sequences of single-branch nodes single node stores common key prefix. keys "aabb" , "aabc" you'd node "aab" , branches "b" , "c". standard trie branches 1 element @ time.
Comments
Post a Comment