Disco.Pretty

Various pretty-printing facilities for disco.

Documentation

module Disco.Pretty.DSL

class Pretty t where

Methods

pretty :: Members '[Reader PA, LFresh] r => t -> Sem r Doc

Instances

Pretty TyOp

Defined in Disco.Pretty

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => TyOp -> Sem r Doc

Pretty BOp

Pretty-print a binary operator, by looking up its concrete syntax in the bopMap.

Defined in Disco.Pretty

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => BOp -> Sem r Doc

Pretty UOp

Pretty-print a unary operator, by looking up its concrete syntax in the uopMap.

Defined in Disco.Pretty

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => UOp -> Sem r Doc

Pretty Qualifier

Defined in Disco.Types.Qualifiers

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Qualifier -> Sem r Doc

Pretty PolyType

Pretty-print a polytype. Note that we never explicitly print forall; quantification is implicit, as in Haskell.

Defined in Disco.Types

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => PolyType -> Sem r Doc

Pretty Type

Defined in Disco.Types

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Type -> Sem r Doc

Pretty Con

Defined in Disco.Types

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Con -> Sem r Doc

Pretty UAtom

Defined in Disco.Types

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => UAtom -> Sem r Doc

Pretty Atom

Defined in Disco.Types

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Atom -> Sem r Doc

Pretty Ilk

Defined in Disco.Types

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Ilk -> Sem r Doc

Pretty BaseTy

Defined in Disco.Types

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => BaseTy -> Sem r Doc

Pretty ModuleName

Defined in Disco.Names

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => ModuleName -> Sem r Doc

Pretty Side

Defined in Disco.AST.Generic

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Side -> Sem r Doc

Pretty Pattern

Defined in Disco.AST.Surface

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Pattern -> Sem r Doc

Pretty Guard

Defined in Disco.AST.Surface

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Guard -> Sem r Doc

Pretty Branch

Pretty-print a single branch in a case expression.

Defined in Disco.AST.Surface

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Branch -> Sem r Doc

Pretty Binding

Pretty-print a binding, i.e. a pairing of a name (with optional type annotation) and term.

Defined in Disco.AST.Surface

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Binding -> Sem r Doc

Pretty Qual

Pretty-print a single qualifier in a comprehension.

Defined in Disco.AST.Surface

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Qual -> Sem r Doc

Pretty Term

Defined in Disco.AST.Surface

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Term -> Sem r Doc

Pretty Decl

Defined in Disco.AST.Surface

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Decl -> Sem r Doc

Pretty ATerm

Defined in Disco.AST.Typed

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => ATerm -> Sem r Doc

Pretty Op

Defined in Disco.AST.Core

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Op -> Sem r Doc

Pretty Core

Defined in Disco.AST.Core

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Core -> Sem r Doc

Pretty Constraint

Defined in Disco.Typecheck.Constraints

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Constraint -> Sem r Doc

Pretty TyVarInfo

Defined in Disco.Typecheck.Solve

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => TyVarInfo -> Sem r Doc

Pretty SimpleConstraint

Defined in Disco.Typecheck.Solve

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => SimpleConstraint -> Sem r Doc

Pretty TyVarInfoMap

Defined in Disco.Typecheck.Solve

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => TyVarInfoMap -> Sem r Doc

Pretty RelMap

Defined in Disco.Typecheck.Solve

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => RelMap -> Sem r Doc

Pretty Defn

Defined in Disco.Module

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Defn -> Sem r Doc

Pretty DiscoError

Defined in Disco.Error

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => DiscoError -> Sem r Doc

Pretty a => Pretty [a]

Defined in Disco.Pretty

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => [a] -> Sem r Doc

Pretty a => Pretty (Set a)

Defined in Disco.Pretty

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Set a -> Sem r Doc

Pretty (Name a)

Defined in Disco.Pretty

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Name a -> Sem r Doc

Pretty a => Pretty (Substitution a)

Defined in Disco.Subst

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Substitution a -> Sem r Doc

Pretty (QName a)

Defined in Disco.Names

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => QName a -> Sem r Doc

Pretty (Telescope Guard)

Pretty-print the guards in a single branch of a case expression.

Defined in Disco.AST.Surface

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Telescope Guard -> Sem r Doc

Pretty (Telescope Qual)

Pretty-print the qualifiers in a comprehension.

Defined in Disco.AST.Surface

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Telescope Qual -> Sem r Doc

Pretty a => Pretty (Graph a)

Defined in Disco.Typecheck.Graph

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Graph a -> Sem r Doc

Pretty (String, TyDefBody)

Pretty-print a type definition.

Defined in Disco.Types

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => (String, TyDefBody) -> Sem r Doc

Pretty (Name a, Bind [Pattern] Term)

Pretty-print a single clause in a definition.

Defined in Disco.AST.Surface

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => (Name a, Bind [Pattern] Term) -> Sem r Doc

(Pretty k, Pretty v) => Pretty (Map k v)

Defined in Disco.Pretty

Methods

pretty :: forall (r :: EffectRow). Members '[Reader PA, LFresh] r => Map k v -> Sem r Doc

withPA :: Member (Reader PA) r => PA -> Sem r Doc -> Sem r Doc

Convenience function combining setPA and mparens, since we often want to simultaneously indicate what the precedence and associativity of a term is, and optionally surround it with parentheses depending on the precedence and associativity of its parent.

setPA :: Member (Reader PA) r => PA -> Sem r a -> Sem r a

Locally set the precedence and associativity within a subcomputation.

lt :: Member (Reader PA) r => Sem r Doc -> Sem r Doc

Mark a subcomputation as pretty-printing a term on the left of an operator (so parentheses can be inserted appropriately, depending on the associativity).

rt :: Member (Reader PA) r => Sem r Doc -> Sem r Doc

Mark a subcomputation as pretty-printing a term on the right of an operator (so parentheses can be inserted appropriately, depending on the associativity).

mparens :: Member (Reader PA) r => PA -> Sem r Doc -> Sem r Doc

Optionally surround a pretty-printed term with parentheses, depending on its precedence and associativity (given as the PA argument) and that of its context (given by the ambient 'Reader PA' effect).

prettyStr :: Pretty t => t -> Sem r String

pretty' :: Pretty t => t -> Sem r Doc

prettyDecimal :: Rational -> String

Pretty-print a rational number using its decimal expansion, in the format nnn.prefix[rep]..., with any repeating digits enclosed in square brackets.

findRep :: Ord a => [a] -> ([a], Int)

findRep' :: Ord a => Map a Int -> Int -> [a] -> ([a], Int)

digitalExpansion :: Integer -> Integer -> Integer -> ([Integer], Int)

digitalExpansion b n d takes the numerator and denominator of a fraction n/d between 0 and 1, and returns a pair of (1) a list of digits ds, and (2) a nonnegative integer k such that splitAt k ds = (prefix, rep), where the infinite base-b expansion of n/d is 0.(prefix ++ cycle rep). For example,

digitalExpansion 10 1 4  = ([2,5,0], 2)
digitalExpansion 10 1 7  = ([1,4,2,8,5,7], 0)
digitalExpansion 10 3 28 = ([1,0,7,1,4,2,8,5], 2)
digitalExpansion 2  1 5  = ([0,0,1,1], 0)

It works by performing the standard long division algorithm, and looking for the first time that the remainder repeats.

module Disco.Pretty.Prec

data Doc

The abstract type of documents. A Doc represents a set of layouts. A Doc with no occurrences of Union or NoDoc represents just one layout.

Instances

Eq Doc

Defined in Text.PrettyPrint.HughesPJ

Methods

(==) :: Doc -> Doc -> Bool

(/=) :: Doc -> Doc -> Bool

Show Doc

Defined in Text.PrettyPrint.HughesPJ

Methods

showsPrec :: Int -> Doc -> ShowS

show :: Doc -> String

showList :: [Doc] -> ShowS

IsString Doc

Defined in Text.PrettyPrint.HughesPJ

Methods

fromString :: String -> Doc

Generic Doc

Defined in Text.PrettyPrint.HughesPJ

Associated Types

type Rep Doc :: Type -> Type

Methods

from :: Doc -> Rep Doc x

to :: Rep Doc x -> Doc

Semigroup Doc

Defined in Text.PrettyPrint.HughesPJ

Methods

(<>) :: Doc -> Doc -> Doc

sconcat :: NonEmpty Doc -> Doc

stimes :: Integral b => b -> Doc -> Doc

Monoid Doc

Defined in Text.PrettyPrint.HughesPJ

Methods

mempty :: Doc

mappend :: Doc -> Doc -> Doc

mconcat :: [Doc] -> Doc

NFData Doc

Defined in Text.PrettyPrint.HughesPJ

Methods

rnf :: Doc -> ()

IsString (Sem r Doc)

Defined in Disco.Pretty.DSL

Methods

fromString :: String -> Sem r Doc

type Rep Doc

Defined in Text.PrettyPrint.HughesPJ

type Rep Doc = D1 ('MetaData "Doc" "Text.PrettyPrint.HughesPJ" "pretty-1.1.3.6" 'True) (C1 ('MetaCons "Doc" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Doc ()))))