Hoogle Search

Within LTS Haskell 24.7 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. class Show a

    tfp Type.Base.Proxy

    No documentation available.

  2. class Show a

    foundation Foundation

    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)".

  3. module Generic.Data.Internal.Show

    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.

  4. module OM.Show

    Utilities for showing string-like things.

  5. class Show a

    prelude-compat Prelude2010

    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)".

  6. module Rebase.GHC.Show

    No documentation available.

  7. class Show a

    rebase Rebase.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)".

  8. module Rebase.Text.Show

    No documentation available.

  9. class Show a

    base-prelude BasePrelude

    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)".

  10. class Show a

    mixed-types-num Numeric.MixedTypes.PreludeHiding

    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)".

Page 5 of many | Previous | Next