Text.Trifecta.IntervalMap

Interval maps implemented using the FingerTree type, following section 4.8 of

• Ralf Hinze and Ross Paterson, "Finger trees: a simple general-purpose data structure", Journal of Functional Programming 16:2 (2006) pp 197-217. http://www.soi.city.ac.uk/~ross/papers/FingerTree.html

An amortized running time is given for each operation, with n referring to the size of the priority queue. These bounds hold even in a persistent (shared) setting.

Note: Many of these operations have the same names as similar operations on lists in the Prelude. The ambiguity may be resolved using either qualification or the hiding clause.

Unlike Data.IntervalMap.FingerTree, this version sorts things so that the largest interval from a given point comes first. This way if you have nested intervals, you get the outermost interval before the contained intervals.

Intervals

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

Functor Interval

Foldable Interval

Traversable Interval

Pointed Interval

Foldable1 Interval

Traversable1 Interval

(Ord v, Monoid v) => Reducer v (Interval v)

Eq v => Eq (Interval v)

Ord v => Ord (Interval v)

Show v => Show (Interval v)

Ord v => Semigroup (Interval v)

Interval maps

newtype IntervalMap v a

Map of closed intervals, possibly with duplicates. The Foldable and Traversable instances process the intervals in lexicographical order.

Constructors

IntervalMap

Fields

runIntervalMap :: FingerTree (IntInterval v) (Node v a)

Instances

Functor (IntervalMap v)

Foldable (IntervalMap v)

Traversable (IntervalMap v)

Keyed (IntervalMap v)

FoldableWithKey (IntervalMap v)

TraversableWithKey (IntervalMap v)

Ord v => Alt (IntervalMap v)

Ord v => Plus (IntervalMap v)

Ord v => Measured (IntInterval v) (IntervalMap v a)

Ord v => Monoid (IntervalMap v a)

Ord v => HasUnion (IntervalMap v a)

O(m log (n/m)). Merge two interval maps. The map may contain duplicate intervals; entries with equal intervals are kept in the original order.

Ord v => HasUnion0 (IntervalMap v a)

singleton :: Ord v => Interval v -> a -> IntervalMap v a

O(1). Interval map with a single entry.

insert :: Ord v => v -> v -> a -> IntervalMap v a -> IntervalMap v a

O(log n). Insert an interval into a map. The map may contain duplicate intervals; the new entry will be inserted before any existing entries for the same interval.

Searching

search :: Ord v => v -> IntervalMap v a -> [(Interval v, a)]

O(k log (n/k)). All intervals that contain the given point, in lexicographical order.

intersections :: Ord v => v -> v -> IntervalMap v a -> [(Interval v, a)]

O(k log (n/k)). All intervals that intersect with the given interval, in lexicographical order.

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

O(k log (n/k)). All intervals that contain the given interval, in lexicographical order.

Prepending an offset onto every interval in the map

offset :: (Ord v, Monoid v) => v -> IntervalMap v a -> IntervalMap v a

O(n). Add a delta to each interval in the map

The result monoid

data IntInterval v

Constructors

NoInterval

IntInterval (Interval v) v

Instances

Ord v => Monoid (IntInterval v)

Ord v => Measured (IntInterval v) (IntervalMap v a)

Ord v => Measured (IntInterval v) (Node v a)

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