TernaryTrees: Efficient pure ternary trees

[ bsd3, data-structures, library, program ] [ Propose Tags ]

Ternary trees are an efficient structure often used for storing strings for fast lookups. This package implements a generic tree for storing lists of Ord instances, and a specialised String implementation which is about 30% faster than the generic version. br/ An example program is provided what shows how to use the package as a dictionary program for spell checking, and how it can be used to serialise data with Don Stewart's Data.Binary package. br/ From my testing, using the usrshartdictwords file on my system (over 230,000 words), inserting all words, checking they all exist in the tree, writing them to a binary file, reading them back in and checking the read in result is the same as the original takes slightly over 3 seconds using the StringSet. The written file is also slightly smaller than the input (by about 10% for shuffled data, and 7% for in order data). br/ Future releases (coming very soon) will also have Map structures for key/value lookups. br/ New n this version: br/ ul liAdded Data.Map.TernaryMap/li /ul

Versions [RSS] [faq] 0.0.1, 0.0.2,,,,,,,,,,,,,,,
Dependencies base (>= && <, binary (>= [details]
License BSD-3-Clause
Author Alex Mason
Maintainer Alex Mason (irc: Axman6) <axman6@gmail.com>
Category Data Structures
Uploaded by AlexMason at 2009-06-28T05:49:26Z
Distributions NixOS:
Executables tdict
Downloads 13039 total (76 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]




Maintainer's Corner

For package maintainers and hackage trustees