mod is:exact

mod :: Integral a => a -> a -> a
base Prelude GHC.Real, relude Relude.Numeric, ghc-internal GHC.Internal.Real, verset Verset
Integer modulus, satisfying 
(x `div` y)*y + (x `mod` y) == x
WARNING: This function is partial (because it throws when 0 is passed as the divisor) for all the integer types in base.
mod :: Integral a => a -> a -> a
hedgehog Hedgehog.Internal.Prelude, base-compat Prelude.Compat, protolude Protolude Protolude.Base, Cabal-syntax Distribution.Compat.Prelude, universum Universum.Base, ihaskell IHaskellPrelude, ghc-lib-parser GHC.Prelude.Basic, dimensional Numeric.Units.Dimensional.Prelude, rebase Rebase.Prelude, LambdaHack Game.LambdaHack.Core.Prelude, cabal-install-solver Distribution.Solver.Compat.Prelude, faktory Faktory.Prelude, hledger-web Hledger.Web.Import, termonad Termonad.Prelude
integer modulus, satisfying 
(x `div` y)*y + (x `mod` y) == x
WARNING: This function is partial (because it throws when 0 is passed as the divisor) for all the integer types in base.
mod :: Integral a => a -> a -> a
ghc GHC.Prelude.Basic, numhask NumHask NumHask.Data.Integral
mod :: Integral a => a -> a -> a
rio RIO.Prelude, base-prelude BasePrelude, classy-prelude ClassyPrelude, basic-prelude CorePrelude, clash-prelude Clash.HaskellPrelude, prelude-compat Prelude2010, constrained-categories Control.Category.Constrained.Prelude Control.Category.Hask, yesod-paginator Yesod.Paginator.Prelude, distribution-opensuse OpenSuse.Prelude
integer modulus, satisfying 
(x `div` y)*y + (x `mod` y) == x
mod :: C a => a -> a -> a
numeric-prelude Algebra.IntegralDomain Algebra.IntegralDomain NumericPrelude NumericPrelude NumericPrelude.Numeric NumericPrelude.Numeric
mod :: IntegralB a => a -> a -> a
Boolean Data.Boolean.Numbers
Integer modulus, satisfying: (x div y) * y + (x mod y) == x
mod :: IDivisible a => a -> a -> a
basement Basement.Numerical.Multiplicative, foundation Foundation Foundation.Numerical
mod :: Proxy x -> Proxy y -> Proxy (Mod x y)
tfp Type.Data.Num
mod :: Data -> Data -> ALU ()
sbv Documentation.SBV.Examples.Puzzles.AOC_2021_24
Modulus.
mod :: Term -> Term -> Term
what4 What4.Protocol.SMTLib2.Syntax
mod x1 x2 returns x1 - x2 * (x1 div [x2])@. The terms are expected to have type Int.
package mod
Uses
Fast type-safe modular arithmetic Modular arithmetic, promoting moduli to the type level, with an emphasis on performance. Originally part of the arithmoi package.
mod :: CanDivIMod t1 t2 => t1 -> t2 -> ModType t1 t2
mixed-types-num Numeric.MixedTypes.Round
mod :: (Typed a, Integral a) => Stream a -> Stream a -> Stream a
copilot-language Copilot.Language.Operators.Integral
Apply the mod operation to two streams, point-wise.
mod :: Integral a => a -> a -> Maybe a
incipit-base Incipit.Base Incipit.Integral
integer modulus, satisfying 
(x `div` y)*y + (x `mod` y) == x