Added type family declarations forms
[ghc.git] / libraries / template-haskell / Language / Haskell / TH / Ppr.hs
1 -- TH.Ppr contains a prettyprinter for the
2 -- Template Haskell datatypes
3
4 module Language.Haskell.TH.Ppr where
5 -- All of the exports from this module should
6 -- be "public" functions. The main module TH
7 -- re-exports them all.
8
9 import Text.PrettyPrint.HughesPJ (render)
10 import Language.Haskell.TH.PprLib
11 import Language.Haskell.TH.Syntax
12 import Data.Char ( toLower )
13
14 nestDepth :: Int
15 nestDepth = 4
16
17 type Precedence = Int
18 appPrec, opPrec, noPrec :: Precedence
19 appPrec = 2 -- Argument of a function application
20 opPrec = 1 -- Argument of an infix operator
21 noPrec = 0 -- Others
22
23 parensIf :: Bool -> Doc -> Doc
24 parensIf True d = parens d
25 parensIf False d = d
26
27 ------------------------------
28
29 pprint :: Ppr a => a -> String
30 pprint x = render $ to_HPJ_Doc $ ppr x
31
32 class Ppr a where
33 ppr :: a -> Doc
34 ppr_list :: [a] -> Doc
35 ppr_list = vcat . map ppr
36
37 instance Ppr a => Ppr [a] where
38 ppr x = ppr_list x
39
40 ------------------------------
41 instance Ppr Name where
42 ppr v = pprName v
43
44 ------------------------------
45 instance Ppr Info where
46 ppr (ClassI d) = ppr d
47 ppr (TyConI d) = ppr d
48 ppr (PrimTyConI name arity is_unlifted)
49 = text "Primitive"
50 <+> (if is_unlifted then text "unlifted" else empty)
51 <+> text "type construtor" <+> quotes (ppr name)
52 <+> parens (text "arity" <+> int arity)
53 ppr (ClassOpI v ty cls fix)
54 = text "Class op from" <+> ppr cls <> colon <+>
55 vcat [ppr_sig v ty, pprFixity v fix]
56 ppr (DataConI v ty tc fix)
57 = text "Constructor from" <+> ppr tc <> colon <+>
58 vcat [ppr_sig v ty, pprFixity v fix]
59 ppr (TyVarI v ty)
60 = text "Type variable" <+> ppr v <+> equals <+> ppr ty
61 ppr (VarI v ty mb_d fix)
62 = vcat [ppr_sig v ty, pprFixity v fix,
63 case mb_d of { Nothing -> empty; Just d -> ppr d }]
64
65 ppr_sig :: Name -> Type -> Doc
66 ppr_sig v ty = ppr v <+> text "::" <+> ppr ty
67
68 pprFixity :: Name -> Fixity -> Doc
69 pprFixity _ f | f == defaultFixity = empty
70 pprFixity v (Fixity i d) = ppr_fix d <+> int i <+> ppr v
71 where ppr_fix InfixR = text "infixr"
72 ppr_fix InfixL = text "infixl"
73 ppr_fix InfixN = text "infix"
74
75
76 ------------------------------
77 instance Ppr Exp where
78 ppr = pprExp noPrec
79
80 pprInfixExp :: Exp -> Doc
81 pprInfixExp (VarE v) = pprName' Infix v
82 pprInfixExp (ConE v) = pprName' Infix v
83 pprInfixExp _ = error "Attempt to pretty-print non-variable or constructor in infix context!"
84
85 pprExp :: Precedence -> Exp -> Doc
86 pprExp _ (VarE v) = pprName' Applied v
87 pprExp _ (ConE c) = pprName' Applied c
88 pprExp i (LitE l) = pprLit i l
89 pprExp i (AppE e1 e2) = parensIf (i >= appPrec) $ pprExp opPrec e1
90 <+> pprExp appPrec e2
91 pprExp i (InfixE (Just e1) op (Just e2))
92 = parensIf (i >= opPrec) $ pprExp opPrec e1
93 <+> pprInfixExp op
94 <+> pprExp opPrec e2
95 pprExp _ (InfixE me1 op me2) = parens $ pprMaybeExp noPrec me1
96 <+> pprInfixExp op
97 <+> pprMaybeExp noPrec me2
98 pprExp i (LamE ps e) = parensIf (i > noPrec) $ char '\\' <> hsep (map (pprPat appPrec) ps)
99 <+> text "->" <+> ppr e
100 pprExp _ (TupE es) = parens $ sep $ punctuate comma $ map ppr es
101 -- Nesting in Cond is to avoid potential problems in do statments
102 pprExp i (CondE guard true false)
103 = parensIf (i > noPrec) $ sep [text "if" <+> ppr guard,
104 nest 1 $ text "then" <+> ppr true,
105 nest 1 $ text "else" <+> ppr false]
106 pprExp i (LetE ds e) = parensIf (i > noPrec) $ text "let" <+> ppr ds
107 $$ text " in" <+> ppr e
108 pprExp i (CaseE e ms)
109 = parensIf (i > noPrec) $ text "case" <+> ppr e <+> text "of"
110 $$ nest nestDepth (ppr ms)
111 pprExp i (DoE ss) = parensIf (i > noPrec) $ text "do" <+> ppr ss
112 pprExp _ (CompE []) = error "Can't happen: pprExp (CompExp [])"
113 -- This will probably break with fixity declarations - would need a ';'
114 pprExp _ (CompE ss) = text "[" <> ppr s
115 <+> text "|"
116 <+> (sep $ punctuate comma $ map ppr ss')
117 <> text "]"
118 where s = last ss
119 ss' = init ss
120 pprExp _ (ArithSeqE d) = ppr d
121 pprExp _ (ListE es) = brackets $ sep $ punctuate comma $ map ppr es
122 pprExp i (SigE e t) = parensIf (i > noPrec) $ ppr e <+> text "::" <+> ppr t
123 pprExp _ (RecConE nm fs) = ppr nm <> braces (pprFields fs)
124 pprExp _ (RecUpdE e fs) = pprExp appPrec e <> braces (pprFields fs)
125
126 pprFields :: [(Name,Exp)] -> Doc
127 pprFields = sep . punctuate comma . map (\(s,e) -> ppr s <+> equals <+> ppr e)
128
129 pprMaybeExp :: Precedence -> Maybe Exp -> Doc
130 pprMaybeExp _ Nothing = empty
131 pprMaybeExp i (Just e) = pprExp i e
132
133 ------------------------------
134 instance Ppr Stmt where
135 ppr (BindS p e) = ppr p <+> text "<-" <+> ppr e
136 ppr (LetS ds) = text "let" <+> ppr ds
137 ppr (NoBindS e) = ppr e
138 ppr (ParS sss) = sep $ punctuate (text "|")
139 $ map (sep . punctuate comma . map ppr) sss
140
141 ------------------------------
142 instance Ppr Match where
143 ppr (Match p rhs ds) = ppr p <+> pprBody False rhs
144 $$ where_clause ds
145
146 ------------------------------
147 pprBody :: Bool -> Body -> Doc
148 pprBody eq (GuardedB xs) = nest nestDepth $ vcat $ map do_guard xs
149 where eqd = if eq then text "=" else text "->"
150 do_guard (NormalG g, e) = text "|" <+> ppr g <+> eqd <+> ppr e
151 do_guard (PatG ss, e) = text "|" <+> vcat (map ppr ss)
152 $$ nest nestDepth (eqd <+> ppr e)
153 pprBody eq (NormalB e) = (if eq then text "=" else text "->") <+> ppr e
154
155 ------------------------------
156 pprLit :: Precedence -> Lit -> Doc
157 pprLit i (IntPrimL x) = parensIf (i > noPrec && x < 0)
158 (integer x <> char '#')
159 pprLit _ (WordPrimL x) = integer x <> text "##"
160 pprLit i (FloatPrimL x) = parensIf (i > noPrec && x < 0)
161 (float (fromRational x) <> char '#')
162 pprLit i (DoublePrimL x) = parensIf (i > noPrec && x < 0)
163 (double (fromRational x) <> text "##")
164 pprLit i (IntegerL x) = parensIf (i > noPrec && x < 0) (integer x)
165 pprLit _ (CharL c) = text (show c)
166 pprLit _ (StringL s) = text (show s)
167 pprLit i (RationalL rat) = parensIf (i > noPrec) $ rational rat
168
169 ------------------------------
170 instance Ppr Pat where
171 ppr = pprPat noPrec
172
173 pprPat :: Precedence -> Pat -> Doc
174 pprPat i (LitP l) = pprLit i l
175 pprPat _ (VarP v) = pprName' Applied v
176 pprPat _ (TupP ps) = parens $ sep $ punctuate comma $ map ppr ps
177 pprPat i (ConP s ps) = parensIf (i > noPrec) $ pprName' Applied s
178 <+> sep (map (pprPat appPrec) ps)
179 pprPat i (InfixP p1 n p2)
180 = parensIf (i > noPrec) (pprPat opPrec p1 <+>
181 pprName' Infix n <+>
182 pprPat opPrec p2)
183 pprPat i (TildeP p) = parensIf (i > noPrec) $ char '~' <> pprPat appPrec p
184 pprPat i (AsP v p) = parensIf (i > noPrec) $ ppr v <> text "@"
185 <> pprPat appPrec p
186 pprPat _ WildP = text "_"
187 pprPat _ (RecP nm fs)
188 = parens $ ppr nm
189 <+> braces (sep $ punctuate comma $
190 map (\(s,p) -> ppr s <+> equals <+> ppr p) fs)
191 pprPat _ (ListP ps) = brackets $ sep $ punctuate comma $ map ppr ps
192 pprPat i (SigP p t) = parensIf (i > noPrec) $ ppr p <+> text "::" <+> ppr t
193
194 ------------------------------
195 instance Ppr Dec where
196 ppr = ppr_dec True
197
198 ppr_dec :: Bool -- declaration on the toplevel?
199 -> Dec
200 -> Doc
201 ppr_dec _ (FunD f cs) = vcat $ map (\c -> ppr f <+> ppr c) cs
202 ppr_dec _ (ValD p r ds) = ppr p <+> pprBody True r
203 $$ where_clause ds
204 ppr_dec _ (TySynD t xs rhs)
205 = ppr_tySyn empty t (hsep (map ppr xs)) rhs
206 ppr_dec _ (DataD ctxt t xs cs decs)
207 = ppr_data empty ctxt t (hsep (map ppr xs)) cs decs
208 ppr_dec _ (NewtypeD ctxt t xs c decs)
209 = ppr_newtype empty ctxt t (sep (map ppr xs)) c decs
210 ppr_dec _ (ClassD ctxt c xs fds ds)
211 = text "class" <+> pprCxt ctxt <+> ppr c <+> hsep (map ppr xs) <+> ppr fds
212 $$ where_clause ds
213 ppr_dec _ (InstanceD ctxt i ds) = text "instance" <+> pprCxt ctxt <+> ppr i
214 $$ where_clause ds
215 ppr_dec _ (SigD f t) = ppr f <+> text "::" <+> ppr t
216 ppr_dec _ (ForeignD f) = ppr f
217 ppr_dec isTop (FamilyD flav tc tvs)
218 = ppr flav <+> maybeFamily <+> ppr tc <+> hsep (map ppr tvs)
219 where
220 maybeFamily | isTop = text "family"
221 | otherwise = empty
222 ppr_dec isTop (DataInstD ctxt tc tys cs decs)
223 = ppr_data maybeInst ctxt tc (sep (map pprParendType tys)) cs decs
224 where
225 maybeInst | isTop = text "instance"
226 | otherwise = empty
227 ppr_dec isTop (NewtypeInstD ctxt tc tys c decs)
228 = ppr_newtype maybeInst ctxt tc (sep (map pprParendType tys)) c decs
229 where
230 maybeInst | isTop = text "instance"
231 | otherwise = empty
232 ppr_dec isTop (TySynInstD tc tys rhs)
233 = ppr_tySyn maybeInst tc (sep (map pprParendType tys)) rhs
234 where
235 maybeInst | isTop = text "instance"
236 | otherwise = empty
237
238 ppr_data :: Doc -> Cxt -> Name -> Doc -> [Con] -> [Name] -> Doc
239 ppr_data maybeInst ctxt t argsDoc cs decs
240 = text "data" <+> maybeInst
241 <+> pprCxt ctxt
242 <+> ppr t <+> argsDoc
243 <+> sep (pref $ map ppr cs)
244 $$ if null decs
245 then empty
246 else nest nestDepth
247 $ text "deriving"
248 <+> parens (hsep $ punctuate comma $ map ppr decs)
249 where
250 pref :: [Doc] -> [Doc]
251 pref [] = [char '='] -- Can't happen in H98
252 pref (d:ds) = (char '=' <+> d):map (char '|' <+>) ds
253
254 ppr_newtype :: Doc -> Cxt -> Name -> Doc -> Con -> [Name] -> Doc
255 ppr_newtype maybeInst ctxt t argsDoc c decs
256 = text "newtype" <+> maybeInst
257 <+> pprCxt ctxt
258 <+> ppr t <+> argsDoc
259 <+> char '=' <+> ppr c
260 $$ if null decs
261 then empty
262 else nest nestDepth
263 $ text "deriving"
264 <+> parens (hsep $ punctuate comma $ map ppr decs)
265
266 ppr_tySyn :: Doc -> Name -> Doc -> Type -> Doc
267 ppr_tySyn maybeInst t argsDoc rhs
268 = text "type" <+> maybeInst <+> ppr t <+> argsDoc <+> text "=" <+> ppr rhs
269
270 ------------------------------
271 instance Ppr FunDep where
272 ppr (FunDep xs ys) = hsep (map ppr xs) <+> text "->" <+> hsep (map ppr ys)
273 ppr_list [] = empty
274 ppr_list xs = char '|' <+> sep (punctuate (text ", ") (map ppr xs))
275
276 ------------------------------
277 instance Ppr FamFlavour where
278 ppr DataFam = text "data"
279 ppr TypeFam = text "type"
280
281 ------------------------------
282 instance Ppr Foreign where
283 ppr (ImportF callconv safety impent as typ)
284 = text "foreign import"
285 <+> showtextl callconv
286 <+> showtextl safety
287 <+> text (show impent)
288 <+> ppr as
289 <+> text "::" <+> ppr typ
290 ppr (ExportF callconv expent as typ)
291 = text "foreign export"
292 <+> showtextl callconv
293 <+> text (show expent)
294 <+> ppr as
295 <+> text "::" <+> ppr typ
296
297 ------------------------------
298 instance Ppr Clause where
299 ppr (Clause ps rhs ds) = hsep (map (pprPat appPrec) ps) <+> pprBody True rhs
300 $$ where_clause ds
301
302 ------------------------------
303 instance Ppr Con where
304 ppr (NormalC c sts) = ppr c <+> sep (map pprStrictType sts)
305 ppr (RecC c vsts)
306 = ppr c <+> braces (sep (punctuate comma $ map pprVarStrictType vsts))
307 ppr (InfixC st1 c st2) = pprStrictType st1
308 <+> pprName' Infix c
309 <+> pprStrictType st2
310 ppr (ForallC ns ctxt con) = text "forall" <+> hsep (map ppr ns)
311 <+> char '.' <+> pprCxt ctxt <+> ppr con
312
313 ------------------------------
314 pprVarStrictType :: (Name, Strict, Type) -> Doc
315 -- Slight infelicity: with print non-atomic type with parens
316 pprVarStrictType (v, str, t) = ppr v <+> text "::" <+> pprStrictType (str, t)
317
318 ------------------------------
319 pprStrictType :: (Strict, Type) -> Doc
320 -- Prints with parens if not already atomic
321 pprStrictType (IsStrict, t) = char '!' <> pprParendType t
322 pprStrictType (NotStrict, t) = pprParendType t
323
324 ------------------------------
325 pprParendType :: Type -> Doc
326 pprParendType (VarT v) = ppr v
327 pprParendType (ConT c) = ppr c
328 pprParendType (TupleT 0) = text "()"
329 pprParendType (TupleT n) = parens (hcat (replicate (n-1) comma))
330 pprParendType ArrowT = parens (text "->")
331 pprParendType ListT = text "[]"
332 pprParendType other = parens (ppr other)
333
334 instance Ppr Type where
335 ppr (ForallT tvars ctxt ty) =
336 text "forall" <+> hsep (map ppr tvars) <+> text "."
337 <+> pprCxt ctxt <+> ppr ty
338 ppr ty = pprTyApp (split ty)
339
340 pprTyApp :: (Type, [Type]) -> Doc
341 pprTyApp (ArrowT, [arg1,arg2]) = sep [pprFunArgType arg1 <+> text "->", ppr arg2]
342 pprTyApp (ListT, [arg]) = brackets (ppr arg)
343 pprTyApp (TupleT n, args)
344 | length args == n = parens (sep (punctuate comma (map ppr args)))
345 pprTyApp (fun, args) = pprParendType fun <+> sep (map pprParendType args)
346
347 pprFunArgType :: Type -> Doc -- Should really use a precedence argument
348 -- Everything except forall and (->) binds more tightly than (->)
349 pprFunArgType ty@(ForallT {}) = parens (ppr ty)
350 pprFunArgType ty@((ArrowT `AppT` _) `AppT` _) = parens (ppr ty)
351 pprFunArgType ty = ppr ty
352
353 split :: Type -> (Type, [Type]) -- Split into function and args
354 split t = go t []
355 where go (AppT t1 t2) args = go t1 (t2:args)
356 go ty args = (ty, args)
357
358 ------------------------------
359 pprCxt :: Cxt -> Doc
360 pprCxt [] = empty
361 pprCxt [t] = ppr t <+> text "=>"
362 pprCxt ts = parens (hsep $ punctuate comma $ map ppr ts) <+> text "=>"
363
364 ------------------------------
365 instance Ppr Range where
366 ppr = brackets . pprRange
367 where pprRange :: Range -> Doc
368 pprRange (FromR e) = ppr e <> text ".."
369 pprRange (FromThenR e1 e2) = ppr e1 <> text ","
370 <> ppr e2 <> text ".."
371 pprRange (FromToR e1 e2) = ppr e1 <> text ".." <> ppr e2
372 pprRange (FromThenToR e1 e2 e3) = ppr e1 <> text ","
373 <> ppr e2 <> text ".."
374 <> ppr e3
375
376 ------------------------------
377 where_clause :: [Dec] -> Doc
378 where_clause [] = empty
379 where_clause ds = nest nestDepth $ text "where" <+> vcat (map (ppr_dec False) ds)
380
381 showtextl :: Show a => a -> Doc
382 showtextl = text . map toLower . show
383