divMod -package:numeric-prelude

simultaneous div and mod. WARNING: This function is partial (because it throws when 0 is passed as the divisor) for all the integer types in base.

simultaneous div and mod WARNING: This function is partial (because it throws when 0 is passed as the divisor) for all the integer types in base.

simultaneous div and mod

Simultaneous div and mod.

simultaneous div and mod

Type-level divMod

The quotient and remainder of a type-level integer and a natural number. For a negative dividend, the remainder part is positive such that x = q*y + r @since 0.1.4

Generalisation of divMod to any instance of Real

Used to implement divMod for the Integral typeclass. This gives a tuple equivalent to

(div x y, mod x y)

Example

>>> divModInt 10 2
(5,0)

>>> divMod 10 2
(5,0)

Used to implement divMod for the Integral typeclass. This gives a tuple equivalent to

(div x y, mod x y)

Example

>>> divModInteger 10 2
(5,0)

>>> divMod 10 2
(5,0)

Simultaneous divInteger and modInteger. Divisor must be non-zero otherwise the GHC runtime will terminate with a division-by-zero fault.

Used to implement divMod for the Integral typeclass. This gives a tuple equivalent to

(div x y, mod x y)

Example

>>> divModInt 10 2
(5,0)

>>> divMod 10 2
(5,0)

Perform a pointwise integer division with modulo where first array contains numerators and the second one denominators

divModA arr1 arr2 == zipWith divMod arr1 arr2

• Partial Mismatched array sizes will result in an impure exception being thrown.

Generalisation of divMod to any instance of Real

Compute the integer quotient (although returned as an Approx since it may be necessary to return Bottom if the integer quotient can't be determined) and the modulus as an approximation of two approximations.