úÎ!9˜7ú     Safe6çshow-combinatorsaStrings representing a set of record fields separated by commas. They can be constructed using ( ) and ( ), or using   and .show-combinators]Type of strings representing expressions, parameterized by the surrounding precedence level.This is the return type of  .show-combinatorsShow a constructor.Possible constructor names are:regular constructors (e.g., "Left");(parenthesized infix constructors (e.g., "(:)");.smart constructors, for abstract types (e.g., "Map.fromList").Example with smart constructor @instance (Show k, Show v) => Show (Map k v) where showsPrec = # precShows where precShows m =  "Map.fromList" N Map.toList m -- Example output: -- > Map.fromList [(33, True), (55, False)] show-combinatorsShow a function application.show-combinatorsShow a function application.This is an infix shorthand for + when the argument type is an instance of . -showF @| x = showApp showF (flip showsPrec x)show-combinators7Show an applied infix operator with a given precedence.show-combinators7Show an applied infix operator with a given precedence.This is a shorthand for , when the arguments types are instances of . RshowInfix' op prec x y = showInfix op prec (flip showsPrec x) (flip showsPrec y)show-combinators:Show an applied infix operator which is left associative (infixl). Use with care.ÿThis combinator assumes that, if there is another infix operator to the left, it is either left associative with the same precedence, or it has a different precedence. An expression containing two operators at the same level with different associativities is ambiguous.By default, prefer  and .show-combinators:Show an applied infix operator which is left associative (infixl). Use with care, see .This is a shorthand for , when the arguments types are instances of .By default, prefer  and . show-combinators;Show an applied infix operator which is right associative (infixr). Use with care.ÿThis combinator assumes that, if there is another infix operator to the right, it is either right associative with the same precedence, or it has a different precedence. An expression containing two operators at the same level with different associativities is ambiguous.By default, prefer  and . Example usage ´showList :: Show a => [a] -> PrecShowS showList [] = showCon "[]" showList (x : xs) = showInfixr ":" 5 (flip showsPrec x) (showList xs) -- Example output: -- > 0 : 1 : 2 : 3 : [] show-combinators;Show an applied infix operator which is right associative (infixr). Use with care, see  .This is a shorthand for  , when the arguments types are instances of .By default, prefer  and .show-combinatorseAn internal combinator for infix operators, to explicitly update the precedence levels on each side. show-combinatorskShow a record. The first argument is the constructor name. The second represents the set of record fields. show-combinatorsBShow a single record field: a field name and a value separated by '='. show-combinatorsBShow a single record field: a field name and a value separated by '='.This is an infix shorthand for  ( when the value type is an instance of . 4field .=. x = showField field (flip showsPrec x)show-combinatorsEmpty set of record fields.show-combinators7Separate two nonempty sets of record fields by a comma.show-combinatorsAn infix synonym of .  22 811      !"#/show-combinators-0.1.1.0-GuZ05K1sUn0HzdqhbVKaoeText.Show.Combinators ShowFields PrecShowSshowConshowApp@| showInfix showInfix' showInfixl showInfixl' showInfixr showInfixr' showRecord showField.=.noFields appendFields&|baseGHC.BaseflipGHC.Show showsPrecShow showInfix_showshowList Text.Show showListWith showParen showStringshowCharshowsShowS