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

Data.RangeSet.SetCrossSet

Synopsis

Documentation

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

Unions two sets together such that if and only if an element appears in either one of the sets, it will appear in the result set.

Since: 0.0.1.0

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

Intersects two sets such that an element appears in the result if and only if it is present in both of the provided sets.

Since: 0.0.1.0

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

Removes all elements from the first set that are found in the second set.

Since: 0.0.1.0

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

Do two sets have no elements in common?

Since: 0.0.1.0