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

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain] [Publish]

Warnings:

Packages relying on Cabal 1.12 or later should specify a version range of the form 'cabal-version: x.y'. Use 'cabal-version: 2.0'.

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.

[Skip to Readme]

Properties

Versions	0.7
Change log	CHANGELOG.md
Dependencies	base (>=4.3 && <4.13), binary (>=0.5 && <0.11), containers (>=0.4 && <0.7), dlist (>=0.4 && <0.9), semigroups (>=0.18 && <0.19), vector (>=0.12.0.1 && <0.13) [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/
Source repo	head: git clone https://github.com/Deewiant/list-tries
Uploaded	by davean at 2018-12-15T09:07:57Z

Modules

Data
- ListTrie
  - Data.ListTrie.Base
    - Data.ListTrie.Base.Classes
    - Data.ListTrie.Base.Map
      - Data.ListTrie.Base.Map.Internal
  - Data.ListTrie.Map
    - Data.ListTrie.Map.Enum
    - Data.ListTrie.Map.Eq
    - Data.ListTrie.Map.Ord
  - Patricia
    - Data.ListTrie.Patricia.Base
    - 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
    - Vector
      - Data.ListTrie.Patricia.Vector.Base
      - Data.ListTrie.Patricia.Vector.Map
        Data.ListTrie.Patricia.Vector.Map.Enum
        Data.ListTrie.Patricia.Vector.Map.Eq
        Data.ListTrie.Patricia.Vector.Map.Ord
      - Data.ListTrie.Patricia.Vector.Set
        Data.ListTrie.Patricia.Vector.Set.Enum
        Data.ListTrie.Patricia.Vector.Set.Eq
        Data.ListTrie.Patricia.Vector.Set.Ord
  - Data.ListTrie.Set
    - Data.ListTrie.Set.Enum
    - Data.ListTrie.Set.Eq
    - Data.ListTrie.Set.Ord
  - Data.ListTrie.Util

Downloads

trie-0.7.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

davean

For package maintainers and hackage trustees

edit package information

Readme for trie-0.7

[back to package description]

list-tries

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