mzero -package:fin

mzero :: MonadPlus m => m a
base Control.Monad GHC.Base, pipes Pipes, base-compat Control.Monad.Compat Control.Monad.Compat, protolude Protolude.Monad, relude Relude.Monad.Reexport, rio RIO.Prelude, base-prelude BasePrelude, turtle Turtle, classy-prelude ClassyPrelude, Cabal-syntax Distribution.Compat.Prelude, fused-effects Control.Effect.NonDet, universum Universum.Monad.Reexport, ihaskell IHaskellPrelude, base-compat-batteries Control.Monad.Compat, Agda Agda.Utils.Monad, ghc-internal GHC.Internal.Base GHC.Internal.Control.Monad, rebase Rebase.Prelude, massiv-test Test.Massiv.Utils, incipit-base Incipit.Base, LambdaHack Game.LambdaHack.Core.Prelude, cabal-install-solver Distribution.Solver.Compat.Prelude, faktory Faktory.Prelude, can-i-haz Control.Monad.Except.CoHas Control.Monad.Reader.Has, yesod-paginator Yesod.Paginator.Prelude, control-monad-free Control.Monad.Free, distribution-opensuse OpenSuse.Prelude
The identity of mplus. It should also satisfy the equations 
mzero >>= f  =  mzero
v >> mzero   =  mzero
The default definition is 
mzero = empty
mzero :: MonadZero m (->) => m a
constrained-categories Control.Category.Constrained.Prelude Control.Monad.Constrained
MZero :: NonDet a
freer-simple Control.Monad.Freer.Internal Control.Monad.Freer.NonDet
type family MzeroSym0 :: m a
singletons-base Control.Monad.Singletons
elimZerosInt# :: Int# -> Int# -> (# Integer, Int# #)
base GHC.Float.ConversionUtils, ghc-internal GHC.Internal.Float.ConversionUtils
elimZerosInteger :: Integer -> Int# -> (# Integer, Int# #)
base GHC.Float.ConversionUtils, ghc-internal GHC.Internal.Float.ConversionUtils
lcmZero :: forall a . Dict (Lcm 0 a ~ 0)
constraints Data.Constraint.Nat
dayOfWeekFromZero :: FormatTime a => Format r (a -> r)
formatting Formatting.Time
Day of week number, 0 (= Sunday) - 6 (= Saturday).
weekFromZero :: FormatTime a => Format r (a -> r)
formatting Formatting.Time
Week number of year, where weeks start on Sunday (as sundayStartWeek), 00 - 53.
dayOfWeekFromZeroF :: FormatTime a => a -> Builder
fmt Fmt.Time
Day of week number, 0 (= Sunday) - 6 (= Saturday). 
>>> dayOfWeekFromZeroF t
"3"
weekFromZeroF :: FormatTime a => a -> Builder
fmt Fmt.Time
Week number of year, where weeks start on Sunday (as sundayStartWeek), 00 - 53. 
>>> weekFromZeroF t
"06"
mwaTrimZeroes# :: MutableByteArray# s -> State# s -> State# s
ghc-bignum GHC.Num.WordArray
Trim ending zeroes
sMzero :: SMonadPlus m => Sing (Mzero :: m a)
singletons-base Control.Monad.Singletons
fromZeroing :: Zeroing a -> a
clash-prelude Clash.Num.Zeroing
imzero :: IxMonadZero m => m i j a
indexed Control.Monad.Indexed
primZero :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term
Agda Agda.Compiler.Backend Agda.TypeChecking.Monad.Builtin
customZero :: Custom
alsa-seq Sound.ALSA.Sequencer.Event
HalfAwayFromZero :: Approximation
safe-money Money
Approximate x to the nearest integer, or to the nearest integer away from zero if x is equidistant between to integers. This is known as “kaufmännisches Runden” in German speaking countries.
NormZero :: NormLog
aern2-mp AERN2.Norm
ie NormBits (-infinity)
fmzero :: (MonadZero m k, Object k a, Object k (m a)) => UnitObject k `k` m a
constrained-categories Control.Monad.Constrained
mrgMzero :: (MonadTryMerge m, Mergeable a, MonadPlus m) => m a
grisette Grisette.Lib.Control.Monad Grisette.Unified.Lib.Control.Monad
mzero with MergingStrategy knowledge propagation.
data RoundHalfFromZero
safe-decimal Numeric.Decimal
Round half away from zero rounding strategy. If the fraction of x is exactly 0.5, then y = x + 0.5 if x is positive, and y = x − 0.5 if x is negative. 
>>> :set -XDataKinds

>>> :set -XTypeApplications

>>> arithRoundD @1 @RoundHalfFromZero @3 @Int 3.650
Arith 3.7

>>> arithRoundD @1 @RoundHalfFromZero @3 @Int 3.740
Arith 3.7

>>> arithRoundD @1 @RoundHalfFromZero @3 @Int 3.751
Arith 3.8

>>> arithRoundD @1 @RoundHalfFromZero @3 @Int (-3.650)
Arith -3.7

>>> arithRoundD @1 @RoundHalfFromZero @3 @Int (-3.740)
Arith -3.7

>>> arithRoundD @1 @RoundHalfFromZero @3 @Int (-3.751)
Arith -3.8

>>> arithRoundD @1 @RoundHalfFromZero @3 @Int (-3.760)
Arith -3.8
roundHalfFromZero :: forall r n k p . (Integral p, KnownNat k) => Decimal r (n + k) p -> Decimal r n p
safe-decimal Numeric.Decimal
NormZero :: NormType
hstatistics Numeric.Statistics.ICA
sodiumMemZero :: Ptr Word8 -> CSize -> IO ()
libsodium-bindings LibSodium.Bindings.SecureMemory
Overwrite the memory region starting at the pointer address with zeros. memset() and hand-written code can be silently stripped out by an optimizing compiler or the linker. This function tries to effectively zero the amount of bytes starting at the provided pointer, even if optimizations are being applied to the code. See: sodium_memzero()