IdeSession.Strict.IntervalMap

Documentation

data StrictIntervalMap v a

Instances

(Ord v, Show v, Show a) => Show (StrictIntervalMap v a)

(Ord v, PrettyVal v, PrettyVal a) => PrettyVal (StrictIntervalMap v a)

dominators :: Ord v => Interval v -> StrictIntervalMap v a -> [(Interval v, a)]

fromList :: Ord v => [(Interval v, a)] -> StrictIntervalMap v a

toList :: Ord v => StrictIntervalMap v a -> [(Interval v, a)]

empty :: Ord v => StrictIntervalMap v a

insert :: Ord v => Interval v -> a -> StrictIntervalMap v a -> StrictIntervalMap v a

Re-exports

data Interval v :: * -> *

A closed interval. The lower bound should be less than or equal to the higher bound.

Constructors

Interval

Fields

low :: v

high :: v

Instances

Eq v => Eq (Interval v)

Ord v => Ord (Interval v)

Show v => Show (Interval v)