!YTU/      !"#$%&'()*+,-. Saferange'A Range Tree is a construct that can be built and then efficiently evaluated so that you can compress an entire tree of operations on ranges into a single range quickly. The only purpose of this tree is to allow efficient construction of range operations that can be evaluated as is required.range8Combine two range trees together with a single operationrangeInvert a range tree, this is a / operation.range8A leaf with a set of ranges that are collected together.rangeMThese are the operations that can join two disjunct lists of ranges together.range#Represents the set union operation.range*Represents the set intersection operation.range(Represents the set difference operation.rangeThe Range Data structure; it is capable of representing any type of range. This is the primary data structure in this library. Everything should be possible to convert back into this datatype. All ranges in this structure are inclusively bound. range'Represents a single element as a range. range5Represents a bounded and inclusive range of elements. range6Represents a range with only an inclusive lower bound. range6Represents a range with only an inclusive upper bound. range-Represents an infinite range over all values. Safe}0123Safe 456789:;< Safe=>?@ABCDEFGHIJKLMNOPQRS Safe3< TUVWXYZ[ Safe)\ Safed]Safe;=>?&rangeRepresents the fact that there exists an algebra for the given representation of a range, so that a range expression of the same type can be evaluated, yielding that representation.range7Lifts the input value as a constant into an expression.rangeJReturns an expression that represents the inverse of the input expression.rangeMReturns an expression that represents the set union of the input expressions.rangeTReturns an expression that represents the set intersection of the input expressions.rangeRReturns an expression that represents the set difference of the input expressions.rangelMultiple ranges represented by a predicate function, indicating membership of a point in one of the ranges.rangeMultiple ranges represented by a list of disjoint ranges. Note that input ranges are allowed to overlap, but the output ranges are guaranteed to be disjoint.  Safe)rangeEvaluates a Range Tree into the final set of ranges that it compresses down to. Use this whenever you want to finally evaluate your constructed Range Tree.  SafeD range[Performs a set union between the two input ranges and returns the resultant set of ranges.rangebPerforms a set intersection between the two input ranges and returns the resultant set of ranges.range`Performs a set difference between the two input ranges and returns the resultant set of ranges.rangeRAn inversion function, given a set of ranges it returns the inverse set of ranges.rangeYA check to see if two ranges overlap. If they do then true is returned; false otherwise.range|Given a range and a value it will tell you wether or not the value is in the range. Remember that all ranges are inclusive. rangeGiven a list of ranges this function tells you if a value is in any of those ranges. This is especially useful for more complex ranges.!range.When you create a range there may be overlaps in your ranges. However, for the sake of efficiency you probably want the list of ranges with no overlaps. The mergeRanges function takes a set of ranges and returns the same set specified by the minimum number of Range objects. A useful function for cleaning up your ranges. Please note that, if you use any of the other operations on sets of ranges like invert, union and intersection then this is automatically done for you. Which means that a function like this is redundant: mergeRanges . intersection"range`A set of ranges represents a collection of real values without actually instantiating those values. This allows you to have infinite ranges. However, sometimes you wish to actually get the values that your range represents, or even get a sample set of the values. This function generates as many of the values that belong to your range as you like.  !"  !"Safe<O#rangeYThe arguments that are used, and can be modified, while parsing a standard range string.%range$A separator that represents a union.&range5A separator that separates the two halves of a range.'range,A separator that implies an unbounded range.(rangeThese are the default arguments that are used by the parser. Please feel free to use the default arguments for you own parser and modify it from the defaults at will.)rangeGiven a string this function will either return a parse error back to the user or the list of ranges that are represented by the parsed string.*range^Given the parser arguments this returns a parser that is capable of parsing a list of ranges.#$%&'()*)*#$%&'(SafeT9,rangexThe Nested Range is a structure that in a nested form of many ranges where there can be multiple ranges at every level..rangeqGiven a list of nested values and a nested range tell us wether the nested value exists inside the nested range.,-.,-.^    !"#$%&!"# '()*+,-./01234556789:;<=>?@ABCDEF G H I J K L M N O P Q R S T U V W X Y Z [ \ ]  ^ _ ` a b c d e fg$range-0.2.0.0-E5SZ3nLDwBA6R6eqyhWExcData.Range.RangeTreeData.Range.RangeData.Range.AlgebraData.Range.ParserData.Range.NestedRangeData.Range.DataData.Range.UtilData.Range.SpansData.Range.RangeInternalData.Range.Algebra.InternalData.Range.Algebra.RangeData.Range.Algebra.Predicate RangeTree RangeNodeRangeNodeInvert RangeLeafRangeOperation RangeUnionRangeIntersectionRangeDifferenceRangeSingletonRange SpanRangeLowerBoundRangeUpperBoundRange InfiniteRangeAlgebra RangeExpr RangeAlgebraevalconstinvertunion intersection difference$fRangeAlgebra(->)$fRangeAlgebra[]evaluate rangesOverlapinRangeinRanges mergeRanges fromRangesRangeParserArgsArgsunionSeparatorrangeSeparatorwildcardSymbol defaultArgs parseRangesranges$fShowRangeParserArgs NestedRange inNestedRangeghc-prim GHC.Classesnot insertionSort isBetween takeEvenlypairsinsertionSortSpansspanCmpintersectSpans insertSpan sortSpans joinSpans unionSpans invertSpans hasOverlaps RangeMergeIRMRM spanRangeslargestUpperBoundlargestLowerBoundemptyRangeMerge storeRange storeRanges loadRangesexportRangeMergeintersectSpansRM intersectWithfixLowerfixUpperintersectionRangeMergescalculateBoundOverlapunionRangeMergesfilterLowerBoundfilterUpperBoundboundCmp appendSpanRMinvertRMgetFree RangeExprF Difference IntersectionInvertUnionrangeMergeAlgebra rangeAlgebrapredicateAlgebra