Modulehw-fingertree-0.1.2.1Haskell2010

HaskellWorks.Data.IntervalMap.FingerTree

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://staff.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.

Contents

Intervals
Interval maps
Searching

Synopsis

data Interval
value point
newtype IntervalMap
value empty
value singleton
value insert
value union
value search
value intersections
value dominators

Packagehw-fingertree-0.1.2.1
Exports10
LanguageHaskell2010
LicenceBSD-3-Clause
SourceFingerTree.hs

Intervals

datadata Interval v

Source#

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

Constructors

Interval
- low :: v
- high :: v

Instances6Eq, Ord, Show, Generic, NFData, Rep

Eq v => Eq (Interval v)Defined in hw-fingertree-0.1.2.1 · HaskellWorks.Data.IntervalMap.FingerTree
Ord v => Ord (Interval v)Defined in hw-fingertree-0.1.2.1 · HaskellWorks.Data.IntervalMap.FingerTree
Show v => Show (Interval v)Defined in hw-fingertree-0.1.2.1 · HaskellWorks.Data.IntervalMap.FingerTree
Generic (Interval v)Defined in hw-fingertree-0.1.2.1 · HaskellWorks.Data.IntervalMap.FingerTree
NFData v => NFData (Interval v)Defined in hw-fingertree-0.1.2.1 · HaskellWorks.Data.IntervalMap.FingerTree
type Rep (Interval v) = D1 ('MetaData "Interval" "HaskellWorks.Data.IntervalMap.FingerTree" "hw-fingertree-0.1.2.1-4fvBLQM9cUcIiNpCd5vWq2" 'False) (C1 ('MetaCons "Interval" 'PrefixI 'True) (S1 ('MetaSel ('Just "low") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 v) :*: S1 ('MetaSel ('Just "high") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 v)))Defined in hw-fingertree-0.1.2.1 · HaskellWorks.Data.IntervalMap.FingerTree

valuepoint :: v -> Interval v

Source#

An interval in which the lower and upper bounds are equal.

Interval maps

newtypenewtype IntervalMap v a

Source#

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

Constructors

IntervalMap (FingerTree (IntInterval v) (Node v a))

Instances8Functor, Foldable, Traversable, Generic, Semigroup, Monoid, …

Functor (IntervalMap v)Defined in hw-fingertree-0.1.2.1 · HaskellWorks.Data.IntervalMap.FingerTree
Foldable (IntervalMap v)Defined in hw-fingertree-0.1.2.1 · HaskellWorks.Data.IntervalMap.FingerTree
Traversable (IntervalMap v)Defined in hw-fingertree-0.1.2.1 · HaskellWorks.Data.IntervalMap.FingerTree
Generic (IntervalMap v a)Defined in hw-fingertree-0.1.2.1 · HaskellWorks.Data.IntervalMap.FingerTree
Ord v => Semigroup (IntervalMap v a)Defined in hw-fingertree-0.1.2.1 · HaskellWorks.Data.IntervalMap.FingerTree
Ord v => Monoid (IntervalMap v a)Defined in hw-fingertree-0.1.2.1 · HaskellWorks.Data.IntervalMap.FingerTree
empty and union.
(NFData a, NFData v) => NFData (IntervalMap v a)Defined in hw-fingertree-0.1.2.1 · HaskellWorks.Data.IntervalMap.FingerTree
type Rep (IntervalMap v a) = D1 ('MetaData "IntervalMap" "HaskellWorks.Data.IntervalMap.FingerTree" "hw-fingertree-0.1.2.1-4fvBLQM9cUcIiNpCd5vWq2" 'True) (C1 ('MetaCons "IntervalMap" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (FingerTree (IntInterval v) (Node v a)))))Defined in hw-fingertree-0.1.2.1 · HaskellWorks.Data.IntervalMap.FingerTree

valueempty :: Ord v => IntervalMap v a

Source#

O(1). The empty interval map.

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

Source#

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

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

Source#

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.

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

Source#

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.

Searching

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

Source#

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

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

Source#

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

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

Source#

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