Show -package:rebase -package:dimensional -package:leancheck -package:shake
base Prelude Text.Show GHC.Show,
hedgehog Hedgehog.Internal.Prelude,
base-compat Prelude.Compat,
protolude Protolude Protolude.Base,
relude Relude.Base,
rio RIO.Prelude.Types,
base-prelude BasePrelude,
classy-prelude ClassyPrelude ClassyPrelude,
numeric-prelude NumericPrelude NumericPrelude.Base,
basic-prelude BasicPrelude CorePrelude,
universum Universum.Base,
Cabal-syntax Distribution.Compat.Prelude,
github GitHub.Internal.Prelude,
numhask NumHask.Prelude,
basement Basement.Compat.Base Basement.Imports,
foundation Foundation,
ghc-lib-parser GHC.Prelude.Basic,
prelude-compat Prelude2010,
quaalude Essentials,
mixed-types-num Numeric.MixedTypes.PreludeHiding,
xmonad-contrib XMonad.Config.Prime,
stack Stack.Prelude,
linear-base Prelude.Linear,
incipit-base Incipit.Base,
LambdaHack Game.LambdaHack.Core.Prelude,
cabal-install-solver Distribution.Solver.Compat.Prelude,
loc Data.Loc.Internal.Prelude Conversion of values to readable
Strings.
Derived instances of
Show have the following properties, which
are compatible with derived instances of
Read:
- The result of show is a syntactically correct Haskell
expression containing only constants, given the fixity declarations in
force at the point where the type is declared. It contains only the
constructor names defined in the data type, parentheses, and spaces.
When labelled constructor fields are used, braces, commas, field
names, and equal signs are also used.
- If the constructor is defined to be an infix operator, then
showsPrec will produce infix applications of the
constructor.
- the representation will be enclosed in parentheses if the
precedence of the top-level constructor in x is less than
d (associativity is ignored). Thus, if d is
0 then the result is never surrounded in parentheses; if
d is 11 it is always surrounded in parentheses,
unless it is an atomic expression.
- If the constructor is defined using record syntax, then
show will produce the record-syntax form, with the fields given
in the same order as the original declaration.
For example, given the declarations
infixr 5 :^:
data Tree a = Leaf a | Tree a :^: Tree a
the derived instance of
Show is equivalent to
instance (Show a) => Show (Tree a) where
showsPrec d (Leaf m) = showParen (d > app_prec) $
showString "Leaf " . showsPrec (app_prec+1) m
where app_prec = 10
showsPrec d (u :^: v) = showParen (d > up_prec) $
showsPrec (up_prec+1) u .
showString " :^: " .
showsPrec (up_prec+1) v
where up_prec = 5
Note that right-associativity of
:^: is ignored. For example,
- show (Leaf 1 :^: Leaf 2 :^: Leaf 3) produces the
string "Leaf 1 :^: (Leaf 2 :^: Leaf 3)".
Converting values to readable strings: the
Show class and
associated functions.
The
Show class, and related operations.
Conversion of values to readable
Strings.
Derived instances of
Show have the following properties, which
are compatible with derived instances of
Read:
- The result of show is a syntactically correct Haskell
expression containing only constants, given the fixity declarations in
force at the point where the type is declared. It contains only the
constructor names defined in the data type, parentheses, and spaces.
When labelled constructor fields are used, braces, commas, field
names, and equal signs are also used.
- If the constructor is defined to be an infix operator, then
showsPrec will produce infix applications of the
constructor.
- the representation will be enclosed in parentheses if the
precedence of the top-level constructor in x is less than
d (associativity is ignored). Thus, if d is
0 then the result is never surrounded in parentheses; if
d is 11 it is always surrounded in parentheses,
unless it is an atomic expression.
- If the constructor is defined using record syntax, then
show will produce the record-syntax form, with the fields given
in the same order as the original declaration.
For example, given the declarations
infixr 5 :^:
data Tree a = Leaf a | Tree a :^: Tree a
the derived instance of
Show is equivalent to
instance (Show a) => Show (Tree a) where
showsPrec d (Leaf m) = showParen (d > app_prec) $
showString "Leaf " . showsPrec (app_prec+1) m
where app_prec = 10
showsPrec d (u :^: v) = showParen (d > up_prec) $
showsPrec (up_prec+1) u .
showString " :^: " .
showsPrec (up_prec+1) v
where up_prec = 5
Note that right-associativity of
:^: is ignored. For example,
- show (Leaf 1 :^: Leaf 2 :^: Leaf 3) produces the
string "Leaf 1 :^: (Leaf 2 :^: Leaf 3)".
Support for creating Show instances using the accessors.
Convert a physical value to a human readable string.
Generic implementation of Show
Warning
This is an internal module: it is not subject to any versioning
policy, breaking changes can happen at any time.
If something here seems useful, please report it or create a pull
request to export it from an external module.
This module defines showing of (higher-order) signatures, which lifts
to showing of (higher-order) terms and contexts. All definitions are
generalised versions of those in
Data.Comp.Show.
This module defines showing of signatures, which lifts to showing of
terms and contexts.