TernaryTrees-0.1.0.0: TernaryTrees.cabal
Name: TernaryTrees
Version: 0.1.0.0
Category: Data Structures
Synopsis: Efficient pure ternary tree Sets and Maps
Description: 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 \/usr\/share\/dict\/words 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:
.
* First major interface change since the first release... (less than
24 hours ago).
.
* Changed many function names to match those in Data.[Map,Set] to
provide a more familiar interface.
.
* Added a Functor instance for TernaryMap.
.
* Added `empty` and `null` functions to all types, and `elems`
to TernaryMap.
.
© 2009 by Alex Mason (<http://axman6.homeip.net/blog/>). BSD3 license.
License: BSD3
License-file: LICENSE.txt
Author: Alex Mason
Maintainer: Alex Mason (irc: Axman6) <axman6@gmail.com>
build-type: Simple
Cabal-Version: >= 1.2
Extra-Source-Files:
Data/Map/TernaryMap.hs
Data/Set/TernarySet.hs
Data/Set/StringSet.hs
Library
Build-Depends:
base >= 4.0.0.0, base < 5.0.0.0, binary >= 0.5.0.0
Exposed-modules:
Data.Set.TernarySet, Data.Set.StringSet, Data.Map.TernaryMap
Executable tdict
Main-Is: Main.hs
Build-Depends: base