J ∧ K is the largest ClosedInterval contained in both. See also *.

J ∨ K is the smalles ClosedInterval containing both. See also +.

For ClosedIntervals J and K, J*K is their intersection. Also available as J ∧ K.

For ClosedIntervals J and K, J+K is the smallest ClosedInterval containing them both. This is also available as J ∨ K.

For ClosedIntervals I and J, I<<J tests if I is completely to the left of J.

For ClosedIntervals I and J, I>>J tests if I is completely to the right of J.

For a number x and a ClosedInterval I (of the same type) in(x,I) tests if x is contained in the interval I.

For a ClosedInterval I, isempty(I) tests if I is an empty interval.

Lexicographic ordering of ClosedIntervals.

length(I) is the length of the ClosedInterval I.

EmptyInterval(T::DataType = Float64) creates an empty ClosedInterval of a given type.

For a ClosedInterval I, left(I) returns its left end point.

For a ClosedInterval I, right(I) returns its right end point.