Documentation

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*.

>>> combineIntervals [intInt 0 10, intInt 2 7, intInt 10 12, intInt 13 15]
[(0, 12),(13, 15)]

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*.

Returns the duration of each Interval in the Functor f.

>>> durations [intInt 1 10, intInt 2 12, intInt 5 6]
[9,10,1]

In the case that x y are not disjoint, clips y to the extent of x.

>>> clip (intInt 0 5) (intInt 3 6)
Just (3, 5)

>>> clip (intInt 0 3) (intInt 4 6)
Nothing

Finds the IntervalRelation between each consecutive pair of intervals.

>>> relations [intInt 0 1, intInt 1 2]
[Meets]

Applies gaps to all the non-disjoint intervals in x that are *not* disjoint from i. Intervals that overlaps or are overlappedBy i are clipped to i.

>>> gapsWithin (intInt 1 10) [intInt 0 5, intInt 7 9, intInt 12 15]
[(5, 7),(9, 10)]

Given a predicate combinator, a predicate, and list of intervals, returns the input unchanged if the predicate combinator is True. Otherwise, returns an empty list. See emptyIfAny and emptyIfNone for examples.

Returns the empty monoid structure if *none* of the element of input satisfy the predicate condition.

For example, the following returns the empty list because none of the intervals in the input list starts (3, 5).

>>> emptyIfNone (starts (intInt 3 5)) [intInt 3 4, intInt 5 6]
[]

In the following, (3, 5) starts (3, 6), so the input is returned.

>>> emptyIfNone (starts (intInt 3 5)) [intInt 3 6, intInt 5 6]
[(3, 6),(5, 6)]

Returns the empty monoid structure if *any* of the element of input satisfy the predicate condition

Returns the empty monoid structure if *all* of the element of input satisfy the predicate condition