Data.RangeSet.Internal

Documentation

insertE :: E -> RangeSet a -> RangeSet a

deleteE :: E -> RangeSet a -> RangeSet a

uncheckedSubsetOf :: RangeSet a -> RangeSet a -> Bool

fromDistinctAscRangesSz :: SRangeList -> Int -> RangeSet a

insertRangeE :: E -> E -> RangeSet a -> RangeSet a

data RangeSet a

A Set type designed for types that are Enum as well as Ord. This allows the RangeSet to compress the data when it is contiguous, reducing memory-footprint and enabling otherwise impractical operations like complement for Bounded types.

Since: 0.0.1.0

Constructors

Fork !Int !Size !E !E !(RangeSet a) !(RangeSet a)

Tip

Instances

Eq (RangeSet a)

Defined in Data.RangeSet.Internal.Types

Methods

(==) :: RangeSet a -> RangeSet a -> Bool

(/=) :: RangeSet a -> RangeSet a -> Bool

Show (RangeSet a)

Defined in Data.RangeSet.Internal.Types

Methods

showsPrec :: Int -> RangeSet a -> ShowS

show :: RangeSet a -> String

showList :: [RangeSet a] -> ShowS

type E = Int

data SRangeList

Constructors

SRangeCons !E !E !SRangeList

SNil

data StrictMaybeE

Constructors

SJust !E

SNothing

size :: RangeSet a -> Int

Return the number of elements in the set.

Since: 0.0.1.0

height :: RangeSet a -> Int

foldE

Arguments

:: (E -> E -> 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

module Data.RangeSet.Internal.Enum

module Data.RangeSet.Internal.SmartConstructors

module Data.RangeSet.Internal.Inserters

module Data.RangeSet.Internal.Extractors

module Data.RangeSet.Internal.Lumpers

module Data.RangeSet.Internal.Splitters

module Data.RangeSet.Internal.Heuristics