@hackage ixset-typed0.5.1.0
Efficient relational queries on Haskell sets.
Categories
License
BSD-3-Clause
Maintainer
Andres Löh <andres@well-typed.com>
Links
Versions
Installation
Tested Compilers
Dependencies (6)
- base >=4.9 && <5
- containers >=0.5 && <1
- deepseq >=1.3 && <2
- safecopy >=0.8 && <0.11
- syb >=0.4 && <1
- template-haskell >=2.8 && <2.21 Show all…
Dependents (14)
@hackage/hopenpgp-tools, @hackage/hermes, @hackage/happstack-authenticate, @hackage/ixset-typed-conversions, @hackage/ixset-typed-hashable-instance, @hackage/acme-everything, Show all…
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.