constrained-generators-0.2.0.0: Framework for generating constrained random data using a subset of first order logic
Safe HaskellSafe-Inferred
LanguageHaskell2010

Constrained.PrettyUtils

Documentation

data WithPrec a Source #

Constructors

WithPrec Int a 

Instances

Instances details
(Show a, Typeable a, Show (TypeSpecD deps a)) ⇒ Pretty (WithPrec (SpecificationD deps a)) Source # 
Instance details

Defined in Constrained.AbstractSyntax

Methods

prettyWithPrec (SpecificationD deps a) → Doc ann Source #

prettyList ∷ [WithPrec (SpecificationD deps a)] → Doc ann Source #

Show a ⇒ Pretty (WithPrec (TermD deps a)) Source # 
Instance details

Defined in Constrained.AbstractSyntax

Methods

prettyWithPrec (TermD deps a) → Doc ann Source #

prettyList ∷ [WithPrec (TermD deps a)] → Doc ann Source #

(HasSpec (k, v), HasSpec k, HasSpec v, HasSpec [v]) ⇒ Pretty (WithPrec (MapSpec k v)) Source # 
Instance details

Defined in Constrained.Spec.Map

Methods

prettyWithPrec (MapSpec k v) → Doc ann Source #

prettyList ∷ [WithPrec (MapSpec k v)] → Doc ann Source #

HasSpec a ⇒ Pretty (WithPrec (FoldSpec a)) Source # 
Instance details

Defined in Constrained.TheKnot

Methods

prettyWithPrec (FoldSpec a) → Doc ann Source #

prettyList ∷ [WithPrec (FoldSpec a)] → Doc ann Source #

HasSpec a ⇒ Pretty (WithPrec (ListSpec a)) Source # 
Instance details

Defined in Constrained.TheKnot

Methods

prettyWithPrec (ListSpec a) → Doc ann Source #

prettyList ∷ [WithPrec (ListSpec a)] → Doc ann Source #

parensIf ∷ Bool → Doc ann → Doc ann Source #

prettyPrecPretty (WithPrec a) ⇒ Int → a → Doc ann Source #

ppList_ ∷ ∀ f as ann. (∀ a. f a → Doc ann) → List f as → [Doc ann] Source #

ppListShow ∷ ∀ f as ann. All Show as ⇒ (∀ a. Show a ⇒ f a → Doc ann) → List f as → [Doc ann] Source #

prettyType ∷ ∀ t x. Typeable t ⇒ Doc x Source #

vsep' ∷ [Doc ann] → Doc ann Source #

(/>)Doc ann → Doc ann → Doc ann infixl 5 Source #

showType ∷ ∀ t. Typeable t ⇒ String Source #

short ∷ ∀ a x. (Show a, Typeable a) ⇒ [a] → Doc x Source #