bitset: A compact functional set data structure.

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

A bit set is a compact data structure, which maintains a set of members from a type that can be enumerated (i. e. has an Enum instance). Current implementations uses Integer for as bit storage and provides most of the expected set operations: insertion, deletion, intersection, membership testing etc.

Versions [RSS] [faq] 0.5, 0.6, 1.0, 1.1, 1.2, 1.3.0, 1.4.0, 1.4.1, 1.4.2, 1.4.3, 1.4.4, 1.4.5, 1.4.6, 1.4.7, 1.4.8
Change log CHANGES
Dependencies base (>=4.5.1 && <4.7), deepseq (==1.3.*) [details]
License MIT
Author Sergei Lebedev <>
Maintainer Sergei Lebedev <>
Category Data Structures
Source repo head: git clone
Uploaded by SergeiLebedev at 2013-03-22T13:33:12Z
Distributions NixOS:1.4.8
Downloads 11868 total (53 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]




Maintainer's Corner

For package maintainers and hackage trustees