mzero -package:constrained-categories
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
Day of week number, 0 (= Sunday) - 6 (= Saturday).
Week number of year, where weeks start on Sunday (as
sundayStartWeek), 00 - 53.
Day of week number,
0 (= Sunday) -
6 (= Saturday).
>>> dayOfWeekFromZeroF t
"3"
Week number of year, where weeks start on Sunday (as
sundayStartWeek),
00 -
53.
>>> weekFromZeroF t
"06"
Convert from
zero+succ to
refl+step definition.
Inverse of
toZeroSucc.
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.
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
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()
Not on Stackage, so not searched.
Securely erase memory contents by writing zeros to it.