mod package:numhask

mod :: Integral a => a -> a -> a

numhask NumHask NumHask.Data.Integral

modF :: (Eq a, Field a, FromIntegral a (Whole a), QuotientField a) => a -> a -> a

numhask NumHask NumHask.Algebra.Field

Approximate modulo for fields

>>> modF 1.5 1.2
0.30000000000000004

type Module m = (Distributive Scalar m, MultiplicativeAction m)

numhask NumHask NumHask.Algebra.Action

a *| one == a
(a + b) *| c == (a *| c) + (b *| c)
c |* (a + b) == (c |* a) + (c |* b)
a *| zero == zero
a *| b == b |* a

divMod :: Integral a => a -> a -> (a, a)

numhask NumHask NumHask.Data.Integral

divModF :: (Eq a, Field a, FromIntegral a (Whole a), QuotientField a) => a -> a -> (a, a)

numhask NumHask NumHask.Algebra.Field

Approximate divMod for fields.

>>> divModF 1.5 1.2
(1.0,0.30000000000000004)