úΩB      Safe-Inferred#A Discrete Interval Encoding Tree. *An interval with discrete values between. /An interval with the same minimum and maximum. RConstruct an interval ensuring that the minimum is less than or equal to maximum. The minimum of the interval. The maximum of the interval. 9Merge two intervals if they are overlapping or adjacent. FReturns whether or not the interval has the same minimum and maximum. ?Map a function across the minimum and maximum of the interval. *Test for membership in the interval tree. .Test for non-membership in the interval tree. *Insert an element into the interval tree. *Delete an element from the interval tree. -Construct an interval tree with no elements. 2Construct an interval tree with a single element. 3Construct an interval tree with a single interval. 4Return the number of elements in the interval tree. Fold on the interval tree. 4Return all elements of the interval tree as a list. :Construct an interval tree with the elements of the list. )Map a function across the interval tree.           diet-0.0.1 Data.Set.DietDietIntervalpointinterval intervalMin intervalMaxmergeI isPointedmapImember notMemberinsertdeleteemptysinglesingleIsizediettoListfromListmapDNodeEmptysplitMax $fShowDiet$fShowInterval