number

Produces a modulo while dealing nicely with negative values. myInt1 %% myInt2 is the remainder of the division myInt1 / myInt2 such that the division floors negative results away from zero rather than truncating them towards it. This has the effect that if myInt2 is positive, the result is always positive or zero.

A typical use for this is when values (e.g., indices) need to be wrapped around to a zero-based range. For example, supposing size is positive, (myIndex + offset) %% size produces a valid index between 0 and size - 1, even if the sum is negative.

num atLeast limit is equivalent to num.max(limit).

num atMost limit is equivalent to num.min(limit).

num.clamp(low, high) is equivalent to num.max(low).min(high).

myInt1 ddiv myInt2 is equivalent tomyInt1 / myInt2.toDouble`.

Determines if the at least as large as low and less than high. Note that the lower bound is inclusive and the upper bound exclusive.

Determines if the integer is divisible by two.

Determines if the integer isn’t divisible by two.

num atLeast limit is equivalent to num.max(limit).

num atMost limit is equivalent to num.min(limit).

num.clamp(low, high) is equivalent to num.max(low).min(high).

Determines if the at least as large as low and less than high. The lower bound is inclusive and the upper bound exclusive.

num atLeast limit is equivalent to num.max(limit).

num atMost limit is equivalent to num.min(limit).

num.clamp(low, high) is equivalent to num.max(low).min(high).

Determines if the at least as large as low and less than high. The lower bound is inclusive and the upper bound exclusive.

num atLeast limit is equivalent to num.max(limit).

num atMost limit is equivalent to num.min(limit).

num.clamp(low, high) is equivalent to num.max(low).min(high).

Determines if the at least as large as low and less than high. The lower bound is inclusive and the upper bound exclusive.

Determines if the integer is divisible by two.

Determines if the integer isn’t divisible by two.