IntervalModule

Returns the inclusive upper bound.

Returns the inclusive lower bound.

Builds the interval containing exactly one value. Total.

Builds the smallest interval containing both values, ordering them as needed. Total — this is the constructor to reach for first.

Builds an interval from a pair the caller asserts is already ordered, failing when it is not. Use this at a boundary, where an inverted pair is a caller error worth reporting rather than silently repairing; use between when either order is acceptable input.

Returns the inclusive lower bound.

Returns the inclusive upper bound.

Returns the bounds as a pair.

Returns whether the interval contains exactly one value.

Returns whether the value lies within the inclusive bounds.

Returns whether every value of the inner interval lies within the outer one.

Returns whether the two intervals share at least one value.

Returns the shared portion of two intervals, or None when they are disjoint. The option is the honest representation of an empty result.

Returns the combined interval when the two overlap, or None when a gap between them would have to be invented. Use span to close the gap instead.

Returns the smallest interval containing both inputs, gap included. Total.

Returns the smallest interval containing the input and the value. Total.

Returns the smallest interval containing every supplied value. Total.

Restricts a value to the interval's bounds. Total.

Applies a mapping to both bounds. The result is re-ordered, so a mapping that reverses the ordering still yields a well-formed interval.

Returns the portable constraint that admits exactly this interval's values.

Returns how long an interval of instants lasts. Total and non-negative.

Returns the distance between the bounds. Total, and widened to 64 bits because the width of Int32.MinValue .. Int32.MaxValue does not fit an int.

Returns the distance between the bounds. Never negative.

Returns a refinement admitting values that lie within the interval.