ixset-typed: Efficient relational queries on Haskell sets.

[ bsd3, data-structures, library ] [ Propose Tags ]

Create and query sets that are indexed by multiple indices.

This is a variant of the ixset package that tracks the index information via the type system. It should be safer to use than ixset, but also requires more GHC extensions.

The two packages are currently relatively compatible. Switching from one to the other requires a little bit of manual work, but not very much.

Downloads

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'.

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 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, 0.5, 0.5.1.0
Dependencies base (>=4.6 && <4.9), containers (>=0.5 && <1), safecopy (>=0.8 && <1), syb (>=0.4 && <1), template-haskell (>=2.8 && <3) [details]
License BSD-3-Clause
Author Andres Löh, Happstack team, HAppS LLC
Maintainer Andres Löh <andres@well-typed.com>
Revised Revision 1 made by phadej at 2018-09-24T15:34:10Z
Category Data Structures
Source repo head: git clone https://github.com/kosmikus/ixset-typed.git
Uploaded by AndresLoeh at 2014-04-02T12:22:48Z
Distributions Arch:0.5.1.0, Debian:0.5, LTSHaskell:0.5.1.0, NixOS:0.5.1.0
Reverse Dependencies 12 direct, 14 indirect [details]
Downloads 16465 total (48 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Successful builds reported [all 1 reports]