úÎ?8İv      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuSafe09;<=L-_| (v) or |_- (w) -| (v) or |- (w) -+| (v) or |+- (w) +| (v) or +- (w) -+ (v) or |+ (w) -+- (v) or |+| (w)+ (x) Compare two   s. Compare two  s. Return given  with its  set to the opposite one.!Return  with given  then   s, if they form a valid ."Like y, but may return z , if mapped  is not valid.#Like y', but only safe if given map preserves {.$Return  s of given  as a tuple.% Return an  spanning over a single .& Return given  with  applied to its s.'Return { comparing given s according to their s.(Return:v4: if given value is lower than all values in given .x#: if given value is into the given .w4: if given value is higher than all values in given .)Return |$ iif. given value is into the given .*Return | iif. every value of the first  is into the second .+Return | iif. every value of the second  is into the first .1Return | iif.  of given s is (, v).2Return | iif.  of given s is (, w).3Return | iif.  of given s is (, v) or ( , v).4Return | iif.  of given s is (, w) or ( , w).5Return | iif.  of given s is (, v), ( , v), ( , v), ( , v), ( , v), ( , w), or (, _).6Return | iif.  of given s is (, w), ( , w), ( , w), ( , w), ( , w), ( , v), or (, _).E Lexicographical order, handling  correctly.K  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJ@   !"#$%&'()*+,-./0123456789:;<=>?KJIHGF !"#E$%&'()*+,-./ 0123456789DCB:;<=>?A@5  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJ ,5-5.5/5142434445464Safe 9:;<=DLR] of each leaf or node of the a }.^ Measure of ~  Fingertree.`An  with the max   Limit amongst those having the max  Limit (which is the  ) because of lexicographical ordering).a1-ordered union of s. Ressources:_Ralf Hinze and Ross Paterson, "Finger trees: a simple general-purpose data structure", !Journal of Functional Programming 16:2 (2006) pp 197-217. 4http://staff.city.ac.uk/~ross/papers/FingerTree.html Thttps://hackage.haskell.org/package/fingertree/docs/Data-IntervalMap-FingerTree.htmldLike  but working on s.eLike  but working on s, and safe only if ] is preserved.fLike  but working on s.gLike  but working on s, and safe only if ] is preserved.i Return the | iif. the given a is h.k Return an  with:the   of the € ,the    of the  .lAll the  s of the a in 1 order.m Return a a merging the given as with 7.n Return a a merging the s in the given  with 7.o Return a a merging the given as with 8.pAll s having a non-z 8 with the given , in 1 order.q Return the a3 spanning over all the values not within the given a.r Return the a3 spanning over all the values not within the given a, but within the given  which MUST be + every  inside the a.]^_`abcdefghijklmnopqrstu]_^`abcdefghijklmnopqrabcudefg]^_`tshijklmnopqr]^_`abcdefghijklmnopqrstu‚       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abbcdefghij%k:l;mnopqCrstrsursvwxwxyrszrs{|}~|}hr€rw‚ƒ„*interval-1.20160821-4h0qxT4gG6vC9DsSJmtNqa Data.IntervalData.Interval.SieveFTMeasure Data.FunctorfmapData.TraversabletraversePretty Unlimitable Unlimited_lowLimitedUnlimited_highlimitedPositionAwayAdjacentOverlapPrefixSuffixedIncludeEqualIntervalHHunHHLLunLL AdherenceOutInLimit adherencelimit flip_limitlowhighinterval fmap_unsafelimitspoint flip_limitscompare_without_adherencelocatewithinintoonto<=..<=<..<=<=..<<..<position..<<....>>....<....>....<=....>=..union intersectionspan unlimitedunlimit<..<=....<..<= $fShowPretty $fShowPretty0$fBoundedLimit$fBoundedUnlimitable$fFunctorUnlimitable $fOrdInterval$fNFDataInterval$fOrdHH$fOrdLL $fNFDataLimit$fFunctorLimit $fEqAdherence$fDataAdherence$fShowAdherence $fEqLimit $fDataLimit $fShowLimit$fEqLL$fEqHH $fEqInterval$fShowInterval$fDataInterval $fEqPosition$fShowPosition$fEqUnlimitable$fOrdUnlimitable$fShowUnlimitable $fEqPretty $fOrdPretty Measure_Emptymax_high_of_max_lowSieveunSieve fmap_intervalfmap_interval_unsafetraverse_intervaltraverse_interval_unsafeemptynull singleton intervals from_Foldable intersecting complementcomplement_with$fMeasuredMeasureInterval$fMonoidMeasureghc-prim GHC.TypesLTGTEQbaseGHC.BaseNothingOrderingTrue)fingertree-0.1.1.0-C6YFXKIQXOA6HvmvFT5gT9Data.FingerTree FingerTree GHC.Classesmaxmin Data.FoldableFoldable