You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
An Interval represents a continuous range of numbers between two bounds. Both endpoints are contained in the interval. Moreover, the interval can be unbounded; but this iteration won't allow to construct open intervals.
Implements the method intervalToArray(interval, step), which constructs an array containing all values in the interval separated by step. This argument can be negative, constructing the values from the end. This returns null and displays an error for an opened interval. [interval] Implement intervalToArray #17
Implements the arithmetic operators (+, -, *, /) for interval: [1..2] + 5 === [6..7] (the operation is applied on both endpoints).
1*: The in operator can be extended to arrays and maps. For maps, the value is checked against keys.
2*: An open interval returns +/-infinity as lower/upper bounds. Infinities can also be used in the constructor.
3*: Union is a term more often used, but it's not defined for disconnected intervals. intervalCombine will be a generalization to all pairs of intervals. If a user wants the strict union, they can verify first that the intersection is non-empty.
The text was updated successfully, but these errors were encountered:
An
Interval
represents a continuous range of numbers between two bounds. Both endpoints are contained in the interval. Moreover, the interval can be unbounded; but this iteration won't allow to construct open intervals.[expr .. expr]
to construct a closed interval Implements Interval and Separate Array/Map #13in
asvalue in the interval
which verifies that the value is in the interval (1*) [interval] Implements 'in' operator #14intervalUpperBound
,intervalLowerBound
, andintervalIsEmpty
(2*) [interval] Add getters #20bool(interval)
asnot intervalIsEmpty(interval)
[interval] Add getters #20intervalToArray(interval, step)
, which constructs an array containing all values in the interval separated bystep
. This argument can be negative, constructing the values from the end. This returns null and displays an error for an opened interval. [interval] Implement intervalToArray #17intervalIsBounded
[interval] Implements unbounded intervals #23Interval(real from, real to)
(2*) [interval] Implements unbounded intervals #23[.. expr]
,[expr..]
, and[..]
for unbounded interval. Infinities can also be used. [interval] Implements unbounded intervals #23intervalMidpoint
. For empty or unbounded intervals, it returns null. [interval] Implements various helper functions #26intervalIntersection
which returns the interval to which all values lie in both intervals. [interval] Implements various helper functions #26intervalCombine
which returns the minimum interval containing both intervals. (3*) [interval] Implements various helper functions #26intervalIsLeftBounded
andintervalIsRightBounded
[interval] Implements various helper functions #26interval[start:end:stride]
which is equivalent tointervalToArray(interval, stride)[start:end]
[interval] Implements various helper functions #26Implements the arithmetic operators (+
,-
,*
,/
) for interval:[1..2] + 5 === [6..7]
(the operation is applied on both endpoints).1*: The
in
operator can be extended to arrays and maps. For maps, the value is checked against keys.2*: An open interval returns
+/-infinity
as lower/upper bounds. Infinities can also be used in the constructor.3*:
Union
is a term more often used, but it's not defined for disconnected intervals.intervalCombine
will be a generalization to all pairs of intervals. If a user wants the strict union, they can verify first that the intersection is non-empty.The text was updated successfully, but these errors were encountered: