Data.RangeSet

RangeSet type

data RangeSet a

A set of elements, represented as a (possibly empty) list of disjoint ranges.

Instances

Eq a => Eq (RangeSet a)

Show a => Show (RangeSet a)

(Ord a, Enum a, Bounded a) => Monoid (RangeSet a)

(Ord a, Enum a, Bounded a) => Semigroup (RangeSet a)

Construction

empty :: RangeSet a

Create an empty set.

singleton :: Enum a => a -> RangeSet a

Create a singleton set.

rangeSet :: (Ord a, Enum a) => a -> a -> RangeSet a

Create a set from (min a b) to (max a b), inclusive.

insert :: (Enum a, Ord a, Bounded a) => a -> RangeSet a -> RangeSet a

Insert an elemen in the set.

Query

member :: Ord a => a -> RangeSet a -> Bool

Is the element in the set?

notMember :: Ord a => a -> RangeSet a -> Bool

Is the element not in the set?

size :: Num a => RangeSet a -> a

The number of element in the set.

isEmpty :: RangeSet a -> Bool

Is the set empty?

isSingleton :: Eq a => RangeSet a -> Bool

Does the set contain exactly one element?

ranges :: RangeSet a -> [Range a]

The sub-ranges of the set.

Combine

union :: (Ord a, Enum a, Bounded a) => RangeSet a -> RangeSet a -> RangeSet a

The union of two sets.

unions :: (Ord a, Enum a, Bounded a, Foldable t) => t (RangeSet a) -> RangeSet a

The union of a list of sets: (union == foldl union empty)

Conversion

toList :: Enum a => RangeSet a -> [a]

All of the elements of the set.

toAscList :: Enum a => RangeSet a -> [a]

All of the elements of the set, in ascending order.

toDescList :: Enum a => RangeSet a -> [a]

All of the elements of the set, in descending order.