The bitset package

[ Tags: benchmark, 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.

Properties

Versions 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 <superbobry@gmail.com>
Maintainer Sergei Lebedev <superbobry@gmail.com>
Category Data Structures
Source repository head: git clone https://github.com/superbobry/bitset
Uploaded Fri Mar 22 13:33:12 UTC 2013 by SergeiLebedev
Distributions NixOS:1.4.8
Downloads 4412 total (55 in the last 30 days)
Rating 0.0 (0 ratings) [clear rating]
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees