Îõ³h$ $e     None ?Ñàlint-interval-map Empty vectorint-interval-map*Insert an element at the end of the vectorint-interval-mapÅThis operation is unsafe as original vector should not be used again!int-interval-map,Return the current number of stored elementsNone ?ÑàìÍint-interval-mapTurn a  into an  !"#$None ?ÑàG int-interval-mapÁThe typical interval map structure models a function of the type  f :: Int - -> Maybe a°. That is, each position in the domain is either annotated by an - interval or it is not. When you attempt to insert an interval that overlaps - with an existing one, the new value may either (1) replace or (2) by - combined with the older one. - - This is **not** the model here. The model here is f :: Int -> [a]Á! An - interval map is a bag of intervals which may overlap. When they do overlap - and you query at a position where multiple ones could be active, you get all - of them (in some reliable, but unspecified, order; currently insertion - order, but this is not an API guarantee). - - The API uses two objects: - - Ï: allows insertion. This is a Mutable object and - insertions should be in a % - - -: allows querying and operations are pure. -int-interval-map Create an  from a list of (key, value)int-interval-mapNew (empty) accumulatorint-interval-map"Insert a value into an accumulatorint-interval-map Transform an  into an Ý. This is unsafe as the accumulator should **not** be used after this operation is performed. int-interval-map9Lookup all values whose keys intersect the given position int-interval-mapèMap: note that both the input and output types must be instances of Storable, so this is not a functor. int-interval-map3Lookup all values that overlap with the given input int-interval-map3Lookup all values that overlap with the given input   &         !"#/int-interval-map-0.0.1.0-8k4s1WdyNx98MUhtCJv9srData.IntervalIntMap+Data.IntervalIntMap.Internal.GrowableVector.Data.IntervalIntMap.Internal.IntervalIntIntMapIntervalIntervalIntMapAccumulatorIntervalIntMapfromListelemsnewinsert unsafeFreezelookupmapoverlapsoverlapsWithKeys$fNFDataIntervalIntMappushBacklengthGrowableVectorDataGrowableVectorfreezeNaiveIntervalInt IntervalValueivStartivPastivValueintervalContains partitionnaiveIntervalMapLookup naiveOverlapsnaiveOverlapsWithKeys(primitive-0.7.4.0-Jn1nYXToEHPK8exID3XEUlControl.Monad.Primitive PrimMonad