ixset-typed: Efficient relational queries on Haskell sets.

[ bsd3, data-structures, library ] [ Propose Tags ]
Versions, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.2, 0.3, 0.3.1,, 0.4
Change log CHANGELOG.md
Dependencies base (>=4.9 && <5), containers (>=0.5 && <1), deepseq (>=1.3 && <2), safecopy (>=0.8 && <1), syb (>=0.4 && <1), template‑haskell (>=2.8 && <2.14) [details]
License BSD-3-Clause
Author Andres Löh, Happstack team, HAppS LLC
Maintainer Andres Löh <andres@well-typed.com>
Category Data Structures
Source repo head: git clone https://github.com/well-typed/ixset-typed.git
Uploaded by AndresLoeh at Sun Mar 18 11:54:07 UTC 2018
Distributions Arch:, Debian:0.3, LTSHaskell:, NixOS:, openSUSE:
Downloads 3428 total (70 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-03-18 [all 1 reports]
Hackage Matrix CI

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.




Maintainer's Corner

For package maintainers and hackage trustees