multi-trie: Trie of sets, as a model for compound names having multiple values
A multi-trie is a trie (i.e. a tree whose child nodes have distinct labels)
with each node containing a list of values.
This data structure represents a structured many-valued naming: names are
compound and form a monoid under concatenation; each name can have multiple
values.
Some operations could be defined for multi-tries in a rather natural way,
including map
, union
, intersection
, cartesian
product.
Moreover, a multi-trie can contain not only ordinary values but also
functions that makes it possible to apply a multi-trie of functions to a
multi-trie of argument values. This makes MultiTrie
an instance of
Functor
, Applicative
and Monad
.
Downloads
- multi-trie-0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 0.1 |
---|---|
Dependencies | base (>=4 && <5), composition (>=1.0.2.1), containers [details] |
License | MIT |
Copyright | Vadim Vinnik, 2016 |
Author | Vadim Vinnik <vadim.vinnik@gmail.com> |
Maintainer | Vadim Vinnik <vadim.vinnik@gmail.com> |
Category | Data |
Home page | https://github.com/vadimvinnik/multi-trie |
Source repo | head: git clone https://github.com/vadimvinnik/multi-trie |
Uploaded | by vadimvinnik at 2016-11-07T23:53:37Z |
Distributions | NixOS:0.1 |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 978 total (3 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2016-11-17 [all 1 reports] |