ixset-typed: Efficient relational queries on Haskell sets.
This Haskell package provides a data structure of sets that are indexed by potentially multiple indices.
Sets can be created, modified, and queried in various ways.
The package is a variant of the ixset package. The ixset package makes use of run-time type information to find a suitable index on a query, resulting in possible run-time errors when no suitable index exists. In ixset-typed, the types of all indices available or tracked in the type system. Thus, ixset-typed should be safer to use than ixset, but in turn requires more GHC extensions.
At the moment, the two packages are relatively compatible. As a consequence of the more precise types, a few manual tweaks are necessary when switching from one to the other, but the interface is mostly the same.
|Versions [faq]||0.1.0.0, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.2, 0.3, 0.3.1, 0.3.1.1, 0.4, 0.4.0.1|
|Dependencies||base (>=4.9 && <5), containers (>=0.5 && <1), deepseq (>=1.3 && <2), safecopy (>=0.8 && <0.10), syb (>=0.4 && <1), template-haskell (>=2.8 && <2.15) [details]|
|Author||Andres Löh, Happstack team, HAppS LLC|
|Maintainer||Andres Löh <email@example.com>|
|Revised||Revision 1 made by AndresLoeh at Sun Sep 15 08:31:29 UTC 2019|
|Source repo||head: git clone https://github.com/well-typed/ixset-typed.git|
|Uploaded||by AndresLoeh at Mon Oct 1 06:03:29 UTC 2018|
|Distributions||Arch:0.4.0.1, Debian:0.4, LTSHaskell:0.4.0.1, NixOS:0.4.0.1, Stackage:0.4.0.1|
|Downloads||7265 total (354 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs available [build log]
Last success reported on 2018-10-01 [all 1 reports]
- ixset-typed-0.4.0.1.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
For package maintainers and hackage trustees