TernaryTrees: Efficient pure ternary tree Sets and Maps
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.
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.
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 over 40% in some cases).
New in this version:
Made the Data.Binary instances much more efficient by using binary numbers to represent the number of *End nodes.
© 2009 by Alex Mason (http://axman6.homeip.net/blog/). BSD3 license.
|Versions [RSS] [faq]||0.0.1, 0.0.2, 0.0.2.1, 0.0.2.2, 0.0.3.0, 0.0.4.0, 0.1.0.0, 0.1.1.0, 0.1.1.1, 0.1.2.0, 0.1.3.0, 0.1.3.1, 0.1.3.2, 0.1.3.3, 0.1.3.4, 0.2.0.0, 0.2.0.2|
|Dependencies||base (>=126.96.36.199 && <188.8.131.52), binary (>=0.5.0.0) [details]|
|Maintainer||Alex Mason (irc: Axman6) <email@example.com>|
|Uploaded||by AlexMason at 2009-06-28T10:50:12Z|
|Downloads||13011 total (78 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs uploaded by user
Build status unknown [no reports yet]