rangeset-0.1.0.0: Efficient sets for semi-contiguous data
Safe HaskellSafe
LanguageHaskell2010

Data.RangeSet.Primitives

Synopsis

Documentation

empty :: RangeSet a Source #

The empty RangeSet.

Since: 0.0.1.0

member :: Enum a => a -> RangeSet a -> Bool Source #

Test whether or not a given value is found within the set.

Since: 0.0.1.0

insert :: Enum a => a -> RangeSet a -> RangeSet a Source #

Insert a new element into the set.

Since: 0.0.1.0

delete :: Enum a => a -> RangeSet a -> RangeSet a Source #

Remove an element from the set, if it appears.

Since: 0.0.1.0

fold Source #

Arguments

:: Enum a 
=> (a -> a -> b -> b -> b)

Function that combines the lower and upper values (inclusive) for a range with the folded left- and right-subtrees.

-> b

Value to be substituted at the leaves.

-> RangeSet a 
-> b 

Folds a range set.

Since: 0.0.1.0