| CARVIEW |
Select Language
HTTP/1.1 200 OK
Connection: keep-alive
Server: nginx/1.24.0 (Ubuntu)
Content-Type: text/html; charset=utf-8
Cache-Control: public, max-age=300
Content-Encoding: gzip
Via: 1.1 varnish, 1.1 varnish
Accept-Ranges: bytes
Age: 0
Date: Sat, 17 Jan 2026 05:20:45 GMT
X-Served-By: cache-dfw-kdfw8210148-DFW, cache-bom-vanm7210076-BOM
X-Cache: MISS, MISS
X-Cache-Hits: 0, 0
X-Timer: S1768627245.109160,VS0,VE296
Vary: Accept, Accept-Encoding
transfer-encoding: chunked
pred-trie: Predicative tries
pred-trie: Predicative tries
Modules
- Data
- Trie
- Data.Trie.Pred
- Data.Trie.Pred.Base
- Data.Trie.Pred.Base.Step
- Data.Trie.Pred.Interface
- Data.Trie.Pred.Interface.Types
- Data.Trie.Pred.Base
- Data.Trie.Pred
- Trie
Downloads
- pred-trie-0.6.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.0.1, 0.0.2, 0.0.3, 0.0.4, 0.0.5, 0.0.6, 0.0.6.1, 0.0.7, 0.0.7.1, 0.0.8, 0.0.8.1, 0.0.9, 0.0.10, 0.0.10.1, 0.0.10.2, 0.0.11, 0.0.12, 0.1, 0.2.0, 0.2.1, 0.2.3, 0.2.4, 0.3.0, 0.4.0, 0.4.1, 0.5.0, 0.5.1, 0.5.1.1, 0.5.1.2, 0.6.0, 0.6.0.1, 0.6.1 (info) |
|---|---|
| Dependencies | base (>=4.11 && <5.0), containers, deepseq, hashable, hashtables, mtl, poly-arity (>=0.0.7), pred-set, QuickCheck (>=2.9.2), semigroups, strict, tries (>=0.0.6), unordered-containers [details] |
| License | BSD-3-Clause |
| Copyright | 2018 Athan Clark |
| Author | Athan Clark |
| Maintainer | athan.clark@localcooking.com |
| Uploaded | by athanclark at 2018-11-20T23:35:36Z |
| Category | Data |
| Home page | https://github.com/athanclark/pred-trie#readme |
| Bug tracker | https://github.com/athanclark/pred-trie/issues |
| Source repo | head: git clone https://github.com/athanclark/pred-trie |
| Distributions | |
| Reverse Dependencies | 2 direct, 1 indirect [details] |
| Downloads | 18771 total (175 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 2018-11-21 [all 3 reports] |
Readme for pred-trie-0.6.1
[back to package description]pred-trie
A predicative trie library - use predicates instead of literal match to capture classes of results, instead of enumerating distinguished ones.
Usage
The predicates are existentially quantified such that a predicate creates an unknown type, while it's result must have the necessary arity, matching the quantified type, to fulfill the lookup:
PredTrie s a
= PNil
| forall t. PCons
{ predicate :: s -> Maybe t
, result :: t -> a
}
...basically.
I broke the lookup phases into "steps", like the tries
package, and used the fastest-lookup HashMapStep trie implementation for the
literal lookups. For more info, read the code :D
How to run tests
stack test
Benchmarking
stack bench --benchmark-arguments="--output profile.html"