ixset-typed: Efficient relational queries on Haskell sets.

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.


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.


Versions0.1.0.0, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.2, 0.3, 0.3.1,, 0.4,,
Change logCHANGELOG.md
Dependenciesbase (>=4.9 && <5), containers (>=0.5 && <1), deepseq (>=1.3 && <2), safecopy (>=0.8 && <1), syb (>=0.4 && <1), template-haskell (>=2.8 && <2.15) [details]
AuthorAndres Löh, Happstack team, HAppS LLC
MaintainerAndres Löh <andres@well-typed.com>
CategoryData Structures
Source repositoryhead: git clone https://github.com/well-typed/ixset-typed.git
UploadedMon Oct 1 06:02:57 UTC 2018 by AndresLoeh




Maintainers' corner

For package maintainers and hackage trustees