PrimitiveArray-0.10.1.0: Efficient multidimensional arrays

Data.PrimitiveArray.Index.BitSet0

Description

The most basic bitset structure. Alone, not particularly useful, because two sets {u,v},{v',w} have no way of annotating the connection between the sets. Together with boundaries this yields sets for useful DP algorithms.

Synopsis

# Documentation

newtype BitSet t Source #

Newtype for a bitset.

Int integrates better with the rest of the framework. But we should consider moving to Word-based indexing, if possible.

Constructors

 BitSet Fields_bitSet :: Int

#### Instances

Instances details