Îõ³h$"Á ËÖ      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTU*Implementation of Allen's interval algebra(c) NoviSci, Inc 2020BSD3bsaul@novisci.com experimentalNoneÁÂÄÙì@8interval-algebraThe ( class provides functions for filtering Vs of 7 s based on  relations.interval-algebra#Creates a function for filtering a V of  Interval as based on a predicateinterval-algebra Filter a V of  Interval as to those that $ the  Interval a in the first argument.interval-algebra Filter a V of  Interval a s to those % the  Interval a in the first argument.interval-algebra Filter a V of Interval as to those " the  Interval a in the first argument.interval-algebra Filter a V of Interval as to those # the  Interval a in the first argument.interval-algebra Filter a V of Interval as to those that   the  Interval a in the first argument.interval-algebra Filter a V of Interval as to those ! the  Interval a in the first argument.interval-algebra Filter a V of Interval as to those * the  Interval a in the first argument. interval-algebra Filter a V of Interval as to those that + the  Interval a in the first argument. interval-algebra Filter a V" of Interval as to those that are - from the  Interval a in the first argument. interval-algebra Filter a V" of Interval as to those that are . from the  Interval a in the first argument. interval-algebra Filter a V" of Interval as to those that are / the  Interval a in the first argument. interval-algebraThe  9 typeclass provides methods for (possibly) combining two 7s.interval-algebraMaybe form a new 7 by the union of two 7s that  .interval-algebraCreates a new Interval spanning the extent x and yinterval-algebraIf x is " y, then form a new Just Interval a, from the interval in the "gap" between x and y from the 4 of x to the 3 of y . Otherwise, W.interval-algebraIf x is " y , return f x appended to f y. Otherwise, return  of x and y (wrapped in fÁ). This is useful for folding over an *ordered* container of Interval#s and combining intervals when x is *not* " y.interval-algebraThe Õ typeclass provides functions to determine the size of and to resize an 'Interval a'.interval-algebra*Determine the duration of an 'Interval a'.interval-algebra Shifts an a. Most often, the b will be the same type as a. But for example, if a is X then b could be Y.interval-algebra!Takes the difference between two a to return a b.interval-algebra4Resize an 'Interval a' to by expanding to "left" by  max l moment and to the "right" by  min r moment. interval-algebra%Expands an 'Interval a' to left by i.interval-algebra&Expands an 'Interval a' to right by i.interval-algebra%Safely creates an 'Interval a' using x as the 3 and adding max moment dur to x as the 4.interval-algebra%Safely creates an 'Interval a' using x as the 4 and adding negate max moment dur to x as the 3.interval-algebraThe 9 class fixes the smallest duration of an 'Intervallic a'.interval-algebraThe Ä typeclass specifies the functions and relational operators for interval-based temporal logic. The typeclass defines the relational operators for intervals, plus other useful utilities such as -, /, and ,.interval-algebra)Compare two intervals to determine their 6.interval-algebraDoes x equal y? interval-algebraDoes x meet y? Is y metBy x?!interval-algebraDoes x meet y? Is y metBy x?"interval-algebraIs x before y? Is x after y?#interval-algebraIs x before y? Is x after y?$interval-algebra'Does x overlap y? Is x overlapped by y?%interval-algebra'Does x overlap y? Is x overlapped by y?&interval-algebra"Does x start y? Is x started by y?'interval-algebra"Does x start y? Is x started by y?(interval-algebra$Does x finish y? Is x finished by y?)interval-algebra$Does x finish y? Is x finished by y?*interval-algebra Is x during y? Does x contain y?+interval-algebra Is x during y? Does x contain y?,interval-algebraÀCompose a list of interval relations with _or_ to create a new 5 7 a. For example,  composeRelations [before, meets]æ creates a predicate function determining if one interval is either before or meets another interval.-interval-algebraAre x and y disjoint (", #,  , or !)?.interval-algebra9Are x and y not disjoint; i.e. do they share any support?/interval-algebra"Is x contained in y in any sense (*, &, ( or ?0interval-algebraThe 0 typeclass specifies how an 7 a=s is constructed. It also includes functions for getting the 3 and 4 of an 7 a.1interval-algebraSafely parse a pair of as to create an 7 a.2interval-algebra Create a new 7 a. This function is not* safe as it does not enforce that x < yŸ. Use with caution. It is meant to be helper function in early prototyping of this package. This function may be deprecated in future releases.3interval-algebraAccess the ends of an 7 a .4interval-algebraAccess the ends of an 7 a .5interval-algebra+Defines a predicate of two objects of type a.6interval-algebraThe 66 type enumerates the thirteen possible ways that two 7 a6 objects can relate according to the interval algebra. Meets, Metby x `meets` y y `metBy` x x: |-----| y: |-----|  Before, After x `before` y y `after` x !x: |-----| y: |-----| Overlaps, OverlappedBy !x `overlaps` y y `overlappedBy` x x: |-----| y: |-----| Starts, StartedBy x `starts` y y `startedBy` x x: |---| y: |-----| Finishes, FinishedBy x `finishes` y y `finishedBy` x x: |---| y: |-----| During, Contains x `during` y y `contains` x x: |-| y: |-----| Equal x `equal` y y `equal` x x: |-----| y: |-----| 7interval-algebraAn 7 a is a pair of as  (x, y) \text{ where } x < y. The 0 class provides a safe 1 function that returns a Z error if y < x and 2À as constructor for creating an interval that may not be valid. <interval-algebraImposes a total ordering on 7 a! based on first ordering the 3 s then the 4s.8 -$"# !%&'()*+,./01234567801234-$"# !%&'()*+,./  765,Functions for generating arbitrary intervals(c) NoviSci, Inc 2020BSD3bsaul@novisci.com experimentalNone>À83Functions for operating on containers of Intervals.(c) NoviSci, Inc 2020BSD3bsaul@novisci.com experimentalNone>À ‘Rinterval-algebra§Returns a list of intervals where any intervals that meet or share support are combined into one interval. *To work properly, the input list should be sorted*. Sinterval-algebra Returns a (possibly empty) list of intervals consisting of the gaps between intervals in the input list. *To work properly, the input list should be sorted*.Tinterval-algebra Returns the  of each 7 in the [ f.RSTRST Safe-Inferred ¾\]^_`abcä      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdef^gh^ijklmnopqró-interval-algebra-0.3.1-94sZ2VmoltjFTjAm6h99QPIntervalAlgebraIntervalAlgebra.Arbitrary!IntervalAlgebra.IntervalUtilitiesPaths_interval_algebraIntervalFilterable filterMakerfilterOverlapsfilterOverlappedBy filterBefore filterAfter filterMeets filterMetBy filterDuringfilterContainsfilterDisjointfilterNotDisjoint filterIn'IntervalCombinable.+. extenterval><<+>IntervalSizeabledurationadddiffexpandexpandlexpandr beginervalendervalMomentmomentIntervalAlgebraicrelateequalsmeetsmetBybeforeafteroverlaps overlappedBystarts startedByfinishes finishedByduringcontainscomposeRelationsdisjoint notDisjointin' Intervallic parseIntervalunsafeIntervalbeginendComparativePredicateOfIntervalRelationInterval$fIntervallicDay$fIntervallicInteger$fIntervallicInt$fShowInterval $fOrdInterval$fIntervalAlgebraicDay$fIntervalAlgebraicInteger$fIntervalAlgebraicInt$fMomentDayInteger$fMomentIntegerInteger$fMomentIntInt$fIntervalSizeableDayInteger $fIntervalSizeableIntegerInteger$fIntervalSizeableIntInt$fIntervalCombinableDay$fIntervalCombinableInteger$fIntervalCombinableInt$fIntervalFilterable[]Day$fIntervalFilterable[]Integer$fIntervalFilterable[]Int$fShowIntervalRelation$fReadIntervalRelation $fEqInterval$fArbitraryInterval$fArbitraryDay$fArbitraryInterval0combineIntervalsgaps durations$fSemigroupBox'witherable-0.4.1-8uH4Z4eydB8I1J1GFp0Bu3 Witherable Filterablebase GHC.MaybeNothing time-1.9.3Data.Time.Calendar.DaysDayghc-prim GHC.TypesInt Data.EitherLeftGHC.BaseFunctorversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName