trie-simple: Simple Map-based Trie
A trie data structure TMap c v
, to hold a mapping from list of characters ([c]
) to
something. In other words, a data structure isomorphic to Map [c] v
.
It is more efficient to query compared to Map
. Also, it supports extra
operations like prefix matching.
This package contains TSet c
too, which is isomorphic to Set [c]
.
[Skip to Readme]
Modules
[Index] [Quick Jump]
Downloads
- trie-simple-0.4.3.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
Versions [RSS] | 0.4.1.1, 0.4.2, 0.4.3 |
---|---|
Change log | CHANGELOG.md |
Dependencies | base (>=4.14 && <4.22), containers (>=0.5.7.1 && <0.8), deepseq (>=1.4.2.0 && <1.6), hashable (>=1.3 && <1.6), indexed-traversable (>=0.1.1 && <0.2), matchable (>=0.1.2 && <0.2), mtl (>=2.2.1 && <2.4), semialign (>=1.3 && <1.4), these (>=1 && <2), witherable (>=0.4 && <0.6) [details] |
Tested with | ghc ==9.2.8, ghc ==9.4.8, ghc ==9.6.6, ghc ==9.8.2, ghc ==9.10.1 |
License | BSD-3-Clause |
Copyright | Koji Miyazato |
Author | Koji Miyazato |
Maintainer | viercc@gmail.com |
Category | Data Structures |
Source repo | head: git clone https://github.com/viercc/trie-simple -b master |
Uploaded | by viercc at 2024-12-14T06:07:38Z |
Distributions | LTSHaskell:0.4.2, NixOS:0.4.2, Stackage:0.4.2 |
Reverse Dependencies | 1 direct, 1 indirect [details] |
Downloads | 1978 total (25 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2024-12-14 [all 1 reports] |