mod<E extends num> method

double mod<E extends num>(
  1. E other
)

Euclidean modulo of this number by other.

This does not set the value for this ActiveDouble.

Returns the remainder of the Euclidean division. The Euclidean division of two integers a and b yields two integers q and r such that a == b * q + r and 0 <= r < b.abs().

The Euclidean division is only defined for integers, but can be easily extended to work with doubles. In that case, q is still an integer, but r may have a non-integer value that still satisfies 0 <= r < |b|.

The sign of the returned value r is always positive.

The result is an double, as described by double.%

Example:

final number = ActiveDouble(5.0);
print(number % 3); // 2.0

Implementation

double mod<E extends num>(E other) {
  return _value % other;
}