monoids-0.1.28: Monoids, specialized containers and a general map/reduce framework Source code Contents Index

Data.Ring.Semi.BitSet

Synopsis

module Data.Monoid.Reducer data BitSet a empty :: BitSet a singleton :: Enum a => a -> BitSet a null :: BitSet a -> Bool full :: (Enum a, Bounded a) => BitSet a complement :: (Enum a, Bounded a) => BitSet a -> BitSet a insert :: Enum a => a -> BitSet a -> BitSet a delete :: Enum a => a -> BitSet a -> BitSet a fromList :: Enum a => [a] -> BitSet a fromDistinctAscList :: Enum a => [a] -> BitSet a toInteger :: BitSet a -> Integer (\\) :: (Enum a, Bounded a) => BitSet a -> BitSet a -> BitSet a member :: Enum a => a -> BitSet a -> Bool size :: BitSet a -> Int

Documentation

module Data.Monoid.Reducer

data BitSet a Source

Instances Typeable1 BitSet Enum a => Reducer a (BitSet a) Enum a => Module Natural (BitSet a) Enum a => RightModule Natural (BitSet a) Enum a => LeftModule Natural (BitSet a) (Bounded a, Enum a) => Algebra Natural (BitSet a) (Enum a, Bounded a) => Bounded (BitSet a) (Enum a, Bounded a) => Enum (BitSet a) Eq (BitSet a) Typeable a => Data (BitSet a) Ord (BitSet a) Show (BitSet a) Enum a => Monoid (BitSet a) Enum a => Generator (BitSet a) (Bounded a, Enum a) => Multiplicative (BitSet a) (Bounded a, Enum a) => RightSemiNearRing (BitSet a) (Bounded a, Enum a) => LeftSemiNearRing (BitSet a) (Bounded a, Enum a) => SemiRing (BitSet a) (Bounded a, Enum a) => Module (BitSet a) (BitSet a) (Bounded a, Enum a) => RightModule (BitSet a) (BitSet a) (Bounded a, Enum a) => LeftModule (BitSet a) (BitSet a)

empty :: BitSet a Source

The empty bit set.

singleton :: Enum a => a -> BitSet a Source

null :: BitSet a -> Bool Source

Is the bit set empty? Asymptotically faster than checking if size == 0 in some cases.

full :: (Enum a, Bounded a) => BitSet a Source

complement :: (Enum a, Bounded a) => BitSet a -> BitSet a Source

insert :: Enum a => a -> BitSet a -> BitSet a Source

O(d) Insert an item into the bit set.

delete :: Enum a => a -> BitSet a -> BitSet a Source

O(d) Delete an item from the bit set.

fromList :: Enum a => [a] -> BitSet a Source

O(d * n) Make a BitSet from a list of items.

fromDistinctAscList :: Enum a => [a] -> BitSet a Source

toInteger :: BitSet a -> Integer Source

O(d) convert to an Integer representation. Discards negative elements

(\\) :: (Enum a, Bounded a) => BitSet a -> BitSet a -> BitSet a Source

member :: Enum a => a -> BitSet a -> Bool Source

O(testBit on Integer) Ask whether the item is in the bit set.

size :: BitSet a -> Int Source

O(1) or O(d) The number of elements in the bit set.

Produced by Haddock version 2.4.2