maxBound -package:bech32
base Prelude Data.Bounded Data.Enum GHC.Enum,
hedgehog Hedgehog.Internal.Prelude,
ghc GHC.Prelude.Basic,
base-compat Prelude.Compat,
protolude Protolude Protolude.Base,
relude Relude.Enum,
rio RIO.Prelude,
base-prelude BasePrelude,
classy-prelude ClassyPrelude,
numeric-prelude NumericPrelude NumericPrelude.Base,
Cabal-syntax Distribution.Compat.Prelude,
basic-prelude CorePrelude,
universum Universum.Base,
ihaskell IHaskellPrelude,
basement Basement.Compat.Base Basement.Imports,
numhask NumHask.Prelude,
clash-prelude Clash.HaskellPrelude,
foundation Foundation,
ghc-lib-parser GHC.Prelude.Basic,
prelude-compat Prelude2010,
ghc-internal GHC.Internal.Enum,
dimensional Numeric.Units.Dimensional.Prelude,
rebase Rebase.Prelude,
mixed-types-num Numeric.MixedTypes.PreludeHiding,
xmonad-contrib XMonad.Config.Prime,
constrained-categories Control.Category.Constrained.Prelude Control.Category.Hask,
copilot-language Copilot.Language.Prelude,
incipit-base Incipit.Base,
LambdaHack Game.LambdaHack.Core.Prelude,
cabal-install-solver Distribution.Solver.Compat.Prelude,
faktory Faktory.Prelude,
verset Verset,
yesod-paginator Yesod.Paginator.Prelude,
distribution-opensuse OpenSuse.Prelude,
hledger-web Hledger.Web.Import,
termonad Termonad.Prelude The default upper bound (100) for the number of times a
RecTcChecker is allowed to encounter each
TyCon.
Change the upper bound for the number of times a
RecTcChecker
is allowed to encounter each
TyCon.
Generates a lambda expression which behaves like
maxBound
(without requiring a
Bounded instance).
Get Maximum bounds of different Integral / Natural types related to
Nat
If bounded, what's the min/max value for this type? If the underlying
type is bounded, we have a default below. Otherwise it's nothing.
Corner lower right of the bounding box of the considered primitives.
Get the maximum efficient bound of the integer set.
maxBound implemented by using
maxBound for all of the
components for the last constructor