Hackage :: [Package]

list-tries: Tries and Patricia tries: finite sets and maps for list keys

[ bsd3, data, data-structures, library ] [ Propose Tags ] [ Report a vulnerability ]

This library provides implementations of finite sets and maps for list keys using tries, both simple and of the Patricia kind. In most (or all? sorry, haven't benchmarked yet) cases, the Patricia tries will have better performance, so use them unless you have reasons not to.

The data types are parametrized over the map type they use internally to store the child nodes: this allows extending them to support different kinds of key types or increasing efficiency. Child maps are required to be instances of the Map class in Data.ListTrie.Base.Map. Some operations additionally require an OrdMap instance.

The Eq, Ord, and Enum modules contain ready structures for key types which are instances of those classes, using lists of pairs, Data.Map, and Data.IntMap respectively.

Modules

[Last Documentation]

  • Data
    • ListTrie
      • Base
        • Data.ListTrie.Base.Map
      • Data.ListTrie.Map
        • Data.ListTrie.Map.Enum
        • Data.ListTrie.Map.Eq
        • Data.ListTrie.Map.Ord
      • Patricia
        • Data.ListTrie.Patricia.Map
          • Data.ListTrie.Patricia.Map.Enum
          • Data.ListTrie.Patricia.Map.Eq
          • Data.ListTrie.Patricia.Map.Ord
        • Data.ListTrie.Patricia.Set
          • Data.ListTrie.Patricia.Set.Enum
          • Data.ListTrie.Patricia.Set.Eq
          • Data.ListTrie.Patricia.Set.Ord
      • Data.ListTrie.Set
        • Data.ListTrie.Set.Enum
        • Data.ListTrie.Set.Eq
        • Data.ListTrie.Set.Ord

Flags

Automatic Flags
NameDescriptionDefault
testing

Enable building a test executable

Disabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.0, 0.1, 0.2, 0.3, 0.4, 0.4.1, 0.4.2, 0.4.3, 0.5, 0.5.1, 0.5.2, 0.6.0, 0.6.1, 0.6.2, 0.6.3, 0.6.4, 0.6.5, 0.6.6, 0.6.7, 0.6.7.1
Change log CHANGELOG.txt
Dependencies base (>=3 && <4.7), binary (>=0.5 && <0.7), ChasingBottoms (>=1.2 && <1.4), containers (>=0.3 && <0.6), dlist (>=0.4 && <0.6), HUnit (>=1.2 && <1.3), QuickCheck (>=2.1 && <2.6), template-haskell (>=2.3 && <2.9), test-framework (>=0.2 && <0.9), test-framework-hunit (>=0.2 && <0.4), test-framework-quickcheck2 (>=0.2 && <0.4) [details]
License BSD-3-Clause
Author Matti Niemenmaa
Maintainer Matti Niemenmaa <matti.niemenmaa+list-tries@iki.fi>
Category Data, Data Structures
Home page http://iki.fi/matti.niemenmaa/list-tries/
Uploaded by MattiNiemenmaa at 2013-05-09T08:02:03Z
Distributions
Reverse Dependencies 10 direct, 3 indirect [details]
Executables list-tries-tests
Downloads 15804 total (2 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-12-21 [all 7 reports]