forked from purescript/purescript
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTraversals.hs
707 lines (623 loc) · 30.8 KB
/
Traversals.hs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
{-# LANGUAGE Strict #-}
-- |
-- AST traversal helpers
--
module Language.PureScript.AST.Traversals where
import Prelude.Compat
import Control.Monad
import Data.Foldable (fold)
import Data.List (mapAccumL, foldl')
import Data.Maybe (mapMaybe)
import qualified Data.List.NonEmpty as NEL
import qualified Data.Map as M
import qualified Data.Set as S
import Language.PureScript.AST.Binders
import Language.PureScript.AST.Declarations
import Language.PureScript.AST.Literals
import Language.PureScript.Kinds
import Language.PureScript.Names
import Language.PureScript.Traversals
import Language.PureScript.TypeClassDictionaries (TypeClassDictionaryInScope(..))
import Language.PureScript.Types
guardedExprM :: Applicative m
=> (Guard -> m Guard)
-> (Expr -> m Expr)
-> GuardedExpr
-> m GuardedExpr
guardedExprM f g (GuardedExpr guards rhs) =
GuardedExpr <$> traverse f guards <*> g rhs
mapGuardedExpr :: (Guard -> Guard)
-> (Expr -> Expr)
-> GuardedExpr
-> GuardedExpr
mapGuardedExpr f g (GuardedExpr guards rhs) =
GuardedExpr (fmap f guards) (g rhs)
litM :: Monad m => (a -> m a) -> Literal a -> m (Literal a)
litM go (ObjectLiteral as) = ObjectLiteral <$> traverse (sndM go) as
litM go (ArrayLiteral as) = ArrayLiteral <$> traverse go as
litM _ other = pure other
everywhereOnValues
:: (Declaration -> Declaration)
-> (Expr -> Expr)
-> (Binder -> Binder)
-> ( Declaration -> Declaration
, Expr -> Expr
, Binder -> Binder
)
everywhereOnValues f g h = (f', g', h')
where
f' :: Declaration -> Declaration
f' (DataBindingGroupDeclaration ds) = f (DataBindingGroupDeclaration (fmap f' ds))
f' (ValueDecl sa name nameKind bs val) =
f (ValueDecl sa name nameKind (fmap h' bs) (fmap (mapGuardedExpr handleGuard g') val))
f' (BoundValueDeclaration sa b expr) = f (BoundValueDeclaration sa (h' b) (g' expr))
f' (BindingGroupDeclaration ds) = f (BindingGroupDeclaration (fmap (\(name, nameKind, val) -> (name, nameKind, g' val)) ds))
f' (TypeClassDeclaration sa name args implies deps ds) = f (TypeClassDeclaration sa name args implies deps (fmap f' ds))
f' (TypeInstanceDeclaration sa ch idx name cs className args ds) = f (TypeInstanceDeclaration sa ch idx name cs className args (mapTypeInstanceBody (fmap f') ds))
f' other = f other
g' :: Expr -> Expr
g' (Literal ss l) = g (Literal ss (lit g' l))
g' (UnaryMinus ss v) = g (UnaryMinus ss (g' v))
g' (BinaryNoParens op v1 v2) = g (BinaryNoParens (g' op) (g' v1) (g' v2))
g' (Parens v) = g (Parens (g' v))
g' (TypeClassDictionaryConstructorApp name v) = g (TypeClassDictionaryConstructorApp name (g' v))
g' (Accessor prop v) = g (Accessor prop (g' v))
g' (ObjectUpdate obj vs) = g (ObjectUpdate (g' obj) (fmap (fmap g') vs))
g' (ObjectUpdateNested obj vs) = g (ObjectUpdateNested (g' obj) (fmap g' vs))
g' (Abs binder v) = g (Abs (h' binder) (g' v))
g' (App v1 v2) = g (App (g' v1) (g' v2))
g' (Unused v) = g (Unused (g' v))
g' (IfThenElse v1 v2 v3) = g (IfThenElse (g' v1) (g' v2) (g' v3))
g' (Case vs alts) = g (Case (fmap g' vs) (fmap handleCaseAlternative alts))
g' (TypedValue check v ty) = g (TypedValue check (g' v) ty)
g' (Let w ds v) = g (Let w (fmap f' ds) (g' v))
g' (Do m es) = g (Do m (fmap handleDoNotationElement es))
g' (Ado m es v) = g (Ado m (fmap handleDoNotationElement es) (g' v))
g' (PositionedValue pos com v) = g (PositionedValue pos com (g' v))
g' other = g other
h' :: Binder -> Binder
h' (ConstructorBinder ss ctor bs) = h (ConstructorBinder ss ctor (fmap h' bs))
h' (BinaryNoParensBinder b1 b2 b3) = h (BinaryNoParensBinder (h' b1) (h' b2) (h' b3))
h' (ParensInBinder b) = h (ParensInBinder (h' b))
h' (LiteralBinder ss l) = h (LiteralBinder ss (lit h' l))
h' (NamedBinder ss name b) = h (NamedBinder ss name (h' b))
h' (PositionedBinder pos com b) = h (PositionedBinder pos com (h' b))
h' (TypedBinder t b) = h (TypedBinder t (h' b))
h' other = h other
lit :: (a -> a) -> Literal a -> Literal a
lit go (ArrayLiteral as) = ArrayLiteral (fmap go as)
lit go (ObjectLiteral as) = ObjectLiteral (fmap (fmap go) as)
lit _ other = other
handleCaseAlternative :: CaseAlternative -> CaseAlternative
handleCaseAlternative ca =
ca { caseAlternativeBinders = fmap h' (caseAlternativeBinders ca)
, caseAlternativeResult = fmap (mapGuardedExpr handleGuard g') (caseAlternativeResult ca)
}
handleDoNotationElement :: DoNotationElement -> DoNotationElement
handleDoNotationElement (DoNotationValue v) = DoNotationValue (g' v)
handleDoNotationElement (DoNotationBind b v) = DoNotationBind (h' b) (g' v)
handleDoNotationElement (DoNotationLet ds) = DoNotationLet (fmap f' ds)
handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com (handleDoNotationElement e)
handleGuard :: Guard -> Guard
handleGuard (ConditionGuard e) = ConditionGuard (g' e)
handleGuard (PatternGuard b e) = PatternGuard (h' b) (g' e)
everywhereOnValuesTopDownM
:: forall m
. (Monad m)
=> (Declaration -> m Declaration)
-> (Expr -> m Expr)
-> (Binder -> m Binder)
-> ( Declaration -> m Declaration
, Expr -> m Expr
, Binder -> m Binder
)
everywhereOnValuesTopDownM f g h = (f' <=< f, g' <=< g, h' <=< h)
where
f' :: Declaration -> m Declaration
f' (DataBindingGroupDeclaration ds) = DataBindingGroupDeclaration <$> traverse (f' <=< f) ds
f' (ValueDecl sa name nameKind bs val) =
ValueDecl sa name nameKind <$> traverse (h' <=< h) bs <*> traverse (guardedExprM handleGuard (g' <=< g)) val
f' (BindingGroupDeclaration ds) = BindingGroupDeclaration <$> traverse (\(name, nameKind, val) -> (,,) name nameKind <$> (g val >>= g')) ds
f' (TypeClassDeclaration sa name args implies deps ds) = TypeClassDeclaration sa name args implies deps <$> traverse (f' <=< f) ds
f' (TypeInstanceDeclaration sa ch idx name cs className args ds) = TypeInstanceDeclaration sa ch idx name cs className args <$> traverseTypeInstanceBody (traverse (f' <=< f)) ds
f' (BoundValueDeclaration sa b expr) = BoundValueDeclaration sa <$> (h' <=< h) b <*> (g' <=< g) expr
f' other = f other
g' :: Expr -> m Expr
g' (Literal ss l) = Literal ss <$> litM (g >=> g') l
g' (UnaryMinus ss v) = UnaryMinus ss <$> (g v >>= g')
g' (BinaryNoParens op v1 v2) = BinaryNoParens <$> (g op >>= g') <*> (g v1 >>= g') <*> (g v2 >>= g')
g' (Parens v) = Parens <$> (g v >>= g')
g' (TypeClassDictionaryConstructorApp name v) = TypeClassDictionaryConstructorApp name <$> (g v >>= g')
g' (Accessor prop v) = Accessor prop <$> (g v >>= g')
g' (ObjectUpdate obj vs) = ObjectUpdate <$> (g obj >>= g') <*> traverse (sndM (g' <=< g)) vs
g' (ObjectUpdateNested obj vs) = ObjectUpdateNested <$> (g obj >>= g') <*> traverse (g' <=< g) vs
g' (Abs binder v) = Abs <$> (h binder >>= h') <*> (g v >>= g')
g' (App v1 v2) = App <$> (g v1 >>= g') <*> (g v2 >>= g')
g' (Unused v) = Unused <$> (g v >>= g')
g' (IfThenElse v1 v2 v3) = IfThenElse <$> (g v1 >>= g') <*> (g v2 >>= g') <*> (g v3 >>= g')
g' (Case vs alts) = Case <$> traverse (g' <=< g) vs <*> traverse handleCaseAlternative alts
g' (TypedValue check v ty) = TypedValue check <$> (g v >>= g') <*> pure ty
g' (Let w ds v) = Let w <$> traverse (f' <=< f) ds <*> (g v >>= g')
g' (Do m es) = Do m <$> traverse handleDoNotationElement es
g' (Ado m es v) = Ado m <$> traverse handleDoNotationElement es <*> (g v >>= g')
g' (PositionedValue pos com v) = PositionedValue pos com <$> (g v >>= g')
g' other = g other
h' :: Binder -> m Binder
h' (LiteralBinder ss l) = LiteralBinder ss <$> litM (h >=> h') l
h' (ConstructorBinder ss ctor bs) = ConstructorBinder ss ctor <$> traverse (h' <=< h) bs
h' (BinaryNoParensBinder b1 b2 b3) = BinaryNoParensBinder <$> (h b1 >>= h') <*> (h b2 >>= h') <*> (h b3 >>= h')
h' (ParensInBinder b) = ParensInBinder <$> (h b >>= h')
h' (NamedBinder ss name b) = NamedBinder ss name <$> (h b >>= h')
h' (PositionedBinder pos com b) = PositionedBinder pos com <$> (h b >>= h')
h' (TypedBinder t b) = TypedBinder t <$> (h b >>= h')
h' other = h other
handleCaseAlternative :: CaseAlternative -> m CaseAlternative
handleCaseAlternative (CaseAlternative bs val) =
CaseAlternative
<$> traverse (h' <=< h) bs
<*> traverse (guardedExprM handleGuard (g' <=< g)) val
handleDoNotationElement :: DoNotationElement -> m DoNotationElement
handleDoNotationElement (DoNotationValue v) = DoNotationValue <$> (g' <=< g) v
handleDoNotationElement (DoNotationBind b v) = DoNotationBind <$> (h' <=< h) b <*> (g' <=< g) v
handleDoNotationElement (DoNotationLet ds) = DoNotationLet <$> traverse (f' <=< f) ds
handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com <$> handleDoNotationElement e
handleGuard :: Guard -> m Guard
handleGuard (ConditionGuard e) = ConditionGuard <$> (g' <=< g) e
handleGuard (PatternGuard b e) = PatternGuard <$> (h' <=< h) b <*> (g' <=< g) e
everywhereOnValuesM
:: forall m
. (Monad m)
=> (Declaration -> m Declaration)
-> (Expr -> m Expr)
-> (Binder -> m Binder)
-> ( Declaration -> m Declaration
, Expr -> m Expr
, Binder -> m Binder
)
everywhereOnValuesM f g h = (f', g', h')
where
f' :: Declaration -> m Declaration
f' (DataBindingGroupDeclaration ds) = (DataBindingGroupDeclaration <$> traverse f' ds) >>= f
f' (ValueDecl sa name nameKind bs val) =
ValueDecl sa name nameKind <$> traverse h' bs <*> traverse (guardedExprM handleGuard g') val >>= f
f' (BindingGroupDeclaration ds) = (BindingGroupDeclaration <$> traverse (\(name, nameKind, val) -> (,,) name nameKind <$> g' val) ds) >>= f
f' (BoundValueDeclaration sa b expr) = (BoundValueDeclaration sa <$> h' b <*> g' expr) >>= f
f' (TypeClassDeclaration sa name args implies deps ds) = (TypeClassDeclaration sa name args implies deps <$> traverse f' ds) >>= f
f' (TypeInstanceDeclaration sa ch idx name cs className args ds) = (TypeInstanceDeclaration sa ch idx name cs className args <$> traverseTypeInstanceBody (traverse f') ds) >>= f
f' other = f other
g' :: Expr -> m Expr
g' (Literal ss l) = (Literal ss <$> litM g' l) >>= g
g' (UnaryMinus ss v) = (UnaryMinus ss <$> g' v) >>= g
g' (BinaryNoParens op v1 v2) = (BinaryNoParens <$> g' op <*> g' v1 <*> g' v2) >>= g
g' (Parens v) = (Parens <$> g' v) >>= g
g' (TypeClassDictionaryConstructorApp name v) = (TypeClassDictionaryConstructorApp name <$> g' v) >>= g
g' (Accessor prop v) = (Accessor prop <$> g' v) >>= g
g' (ObjectUpdate obj vs) = (ObjectUpdate <$> g' obj <*> traverse (sndM g') vs) >>= g
g' (ObjectUpdateNested obj vs) = (ObjectUpdateNested <$> g' obj <*> traverse g' vs) >>= g
g' (Abs binder v) = (Abs <$> h' binder <*> g' v) >>= g
g' (App v1 v2) = (App <$> g' v1 <*> g' v2) >>= g
g' (Unused v) = (Unused <$> g' v) >>= g
g' (IfThenElse v1 v2 v3) = (IfThenElse <$> g' v1 <*> g' v2 <*> g' v3) >>= g
g' (Case vs alts) = (Case <$> traverse g' vs <*> traverse handleCaseAlternative alts) >>= g
g' (TypedValue check v ty) = (TypedValue check <$> g' v <*> pure ty) >>= g
g' (Let w ds v) = (Let w <$> traverse f' ds <*> g' v) >>= g
g' (Do m es) = (Do m <$> traverse handleDoNotationElement es) >>= g
g' (Ado m es v) = (Ado m <$> traverse handleDoNotationElement es <*> g' v) >>= g
g' (PositionedValue pos com v) = (PositionedValue pos com <$> g' v) >>= g
g' other = g other
h' :: Binder -> m Binder
h' (LiteralBinder ss l) = (LiteralBinder ss <$> litM h' l) >>= h
h' (ConstructorBinder ss ctor bs) = (ConstructorBinder ss ctor <$> traverse h' bs) >>= h
h' (BinaryNoParensBinder b1 b2 b3) = (BinaryNoParensBinder <$> h' b1 <*> h' b2 <*> h' b3) >>= h
h' (ParensInBinder b) = (ParensInBinder <$> h' b) >>= h
h' (NamedBinder ss name b) = (NamedBinder ss name <$> h' b) >>= h
h' (PositionedBinder pos com b) = (PositionedBinder pos com <$> h' b) >>= h
h' (TypedBinder t b) = (TypedBinder t <$> h' b) >>= h
h' other = h other
handleCaseAlternative :: CaseAlternative -> m CaseAlternative
handleCaseAlternative (CaseAlternative bs val) =
CaseAlternative
<$> traverse h' bs
<*> traverse (guardedExprM handleGuard g') val
handleDoNotationElement :: DoNotationElement -> m DoNotationElement
handleDoNotationElement (DoNotationValue v) = DoNotationValue <$> g' v
handleDoNotationElement (DoNotationBind b v) = DoNotationBind <$> h' b <*> g' v
handleDoNotationElement (DoNotationLet ds) = DoNotationLet <$> traverse f' ds
handleDoNotationElement (PositionedDoNotationElement pos com e) = PositionedDoNotationElement pos com <$> handleDoNotationElement e
handleGuard :: Guard -> m Guard
handleGuard (ConditionGuard e) = ConditionGuard <$> g' e
handleGuard (PatternGuard b e) = PatternGuard <$> h' b <*> g' e
everythingOnValues
:: forall r
. (r -> r -> r)
-> (Declaration -> r)
-> (Expr -> r)
-> (Binder -> r)
-> (CaseAlternative -> r)
-> (DoNotationElement -> r)
-> ( Declaration -> r
, Expr -> r
, Binder -> r
, CaseAlternative -> r
, DoNotationElement -> r
)
everythingOnValues (<>.) f g h i j = (f', g', h', i', j')
where
f' :: Declaration -> r
f' d@(DataBindingGroupDeclaration ds) = foldl' (<>.) (f d) (fmap f' ds)
f' d@(ValueDeclaration vd) = foldl' (<>.) (f d) (fmap h' (valdeclBinders vd) ++ concatMap (\(GuardedExpr grd v) -> fmap k' grd ++ [g' v]) (valdeclExpression vd))
f' d@(BindingGroupDeclaration ds) = foldl' (<>.) (f d) (fmap (\(_, _, val) -> g' val) ds)
f' d@(TypeClassDeclaration _ _ _ _ _ ds) = foldl' (<>.) (f d) (fmap f' ds)
f' d@(TypeInstanceDeclaration _ _ _ _ _ _ _ (ExplicitInstance ds)) = foldl' (<>.) (f d) (fmap f' ds)
f' d@(BoundValueDeclaration _ b expr) = f d <>. h' b <>. g' expr
f' d = f d
g' :: Expr -> r
g' v@(Literal _ l) = lit (g v) g' l
g' v@(UnaryMinus _ v1) = g v <>. g' v1
g' v@(BinaryNoParens op v1 v2) = g v <>. g' op <>. g' v1 <>. g' v2
g' v@(Parens v1) = g v <>. g' v1
g' v@(TypeClassDictionaryConstructorApp _ v1) = g v <>. g' v1
g' v@(Accessor _ v1) = g v <>. g' v1
g' v@(ObjectUpdate obj vs) = foldl' (<>.) (g v <>. g' obj) (fmap (g' . snd) vs)
g' v@(ObjectUpdateNested obj vs) = foldl' (<>.) (g v <>. g' obj) (fmap g' vs)
g' v@(Abs b v1) = g v <>. h' b <>. g' v1
g' v@(App v1 v2) = g v <>. g' v1 <>. g' v2
g' v@(Unused v1) = g v <>. g' v1
g' v@(IfThenElse v1 v2 v3) = g v <>. g' v1 <>. g' v2 <>. g' v3
g' v@(Case vs alts) = foldl' (<>.) (foldl' (<>.) (g v) (fmap g' vs)) (fmap i' alts)
g' v@(TypedValue _ v1 _) = g v <>. g' v1
g' v@(Let _ ds v1) = foldl' (<>.) (g v) (fmap f' ds) <>. g' v1
g' v@(Do _ es) = foldl' (<>.) (g v) (fmap j' es)
g' v@(Ado _ es v1) = foldl' (<>.) (g v) (fmap j' es) <>. g' v1
g' v@(PositionedValue _ _ v1) = g v <>. g' v1
g' v = g v
h' :: Binder -> r
h' b@(LiteralBinder _ l) = lit (h b) h' l
h' b@(ConstructorBinder _ _ bs) = foldl' (<>.) (h b) (fmap h' bs)
h' b@(BinaryNoParensBinder b1 b2 b3) = h b <>. h' b1 <>. h' b2 <>. h' b3
h' b@(ParensInBinder b1) = h b <>. h' b1
h' b@(NamedBinder _ _ b1) = h b <>. h' b1
h' b@(PositionedBinder _ _ b1) = h b <>. h' b1
h' b@(TypedBinder _ b1) = h b <>. h' b1
h' b = h b
lit :: r -> (a -> r) -> Literal a -> r
lit r go (ArrayLiteral as) = foldl' (<>.) r (fmap go as)
lit r go (ObjectLiteral as) = foldl' (<>.) r (fmap (go . snd) as)
lit r _ _ = r
i' :: CaseAlternative -> r
i' ca@(CaseAlternative bs gs) =
foldl' (<>.) (i ca) (fmap h' bs ++ concatMap (\(GuardedExpr grd val) -> fmap k' grd ++ [g' val]) gs)
j' :: DoNotationElement -> r
j' e@(DoNotationValue v) = j e <>. g' v
j' e@(DoNotationBind b v) = j e <>. h' b <>. g' v
j' e@(DoNotationLet ds) = foldl' (<>.) (j e) (fmap f' ds)
j' e@(PositionedDoNotationElement _ _ e1) = j e <>. j' e1
k' :: Guard -> r
k' (ConditionGuard e) = g' e
k' (PatternGuard b e) = h' b <>. g' e
everythingWithContextOnValues
:: forall s r
. s
-> r
-> (r -> r -> r)
-> (s -> Declaration -> (s, r))
-> (s -> Expr -> (s, r))
-> (s -> Binder -> (s, r))
-> (s -> CaseAlternative -> (s, r))
-> (s -> DoNotationElement -> (s, r))
-> ( Declaration -> r
, Expr -> r
, Binder -> r
, CaseAlternative -> r
, DoNotationElement -> r)
everythingWithContextOnValues s0 r0 (<>.) f g h i j = (f'' s0, g'' s0, h'' s0, i'' s0, j'' s0)
where
f'' :: s -> Declaration -> r
f'' s d = let (s', r) = f s d in r <>. f' s' d
f' :: s -> Declaration -> r
f' s (DataBindingGroupDeclaration ds) = foldl' (<>.) r0 (fmap (f'' s) ds)
f' s (ValueDeclaration vd) = foldl' (<>.) r0 (fmap (h'' s) (valdeclBinders vd) ++ concatMap (\(GuardedExpr grd v) -> fmap (k' s) grd ++ [g'' s v]) (valdeclExpression vd))
f' s (BindingGroupDeclaration ds) = foldl' (<>.) r0 (fmap (\(_, _, val) -> g'' s val) ds)
f' s (TypeClassDeclaration _ _ _ _ _ ds) = foldl' (<>.) r0 (fmap (f'' s) ds)
f' s (TypeInstanceDeclaration _ _ _ _ _ _ _ (ExplicitInstance ds)) = foldl' (<>.) r0 (fmap (f'' s) ds)
f' _ _ = r0
g'' :: s -> Expr -> r
g'' s v = let (s', r) = g s v in r <>. g' s' v
g' :: s -> Expr -> r
g' s (Literal _ l) = lit g'' s l
g' s (UnaryMinus _ v1) = g'' s v1
g' s (BinaryNoParens op v1 v2) = g'' s op <>. g'' s v1 <>. g'' s v2
g' s (Parens v1) = g'' s v1
g' s (TypeClassDictionaryConstructorApp _ v1) = g'' s v1
g' s (Accessor _ v1) = g'' s v1
g' s (ObjectUpdate obj vs) = foldl' (<>.) (g'' s obj) (fmap (g'' s . snd) vs)
g' s (ObjectUpdateNested obj vs) = foldl' (<>.) (g'' s obj) (fmap (g'' s) vs)
g' s (Abs binder v1) = h'' s binder <>. g'' s v1
g' s (App v1 v2) = g'' s v1 <>. g'' s v2
g' s (Unused v) = g'' s v
g' s (IfThenElse v1 v2 v3) = g'' s v1 <>. g'' s v2 <>. g'' s v3
g' s (Case vs alts) = foldl' (<>.) (foldl' (<>.) r0 (fmap (g'' s) vs)) (fmap (i'' s) alts)
g' s (TypedValue _ v1 _) = g'' s v1
g' s (Let _ ds v1) = foldl' (<>.) r0 (fmap (f'' s) ds) <>. g'' s v1
g' s (Do _ es) = foldl' (<>.) r0 (fmap (j'' s) es)
g' s (Ado _ es v1) = foldl' (<>.) r0 (fmap (j'' s) es) <>. g'' s v1
g' s (PositionedValue _ _ v1) = g'' s v1
g' _ _ = r0
h'' :: s -> Binder -> r
h'' s b = let (s', r) = h s b in r <>. h' s' b
h' :: s -> Binder -> r
h' s (LiteralBinder _ l) = lit h'' s l
h' s (ConstructorBinder _ _ bs) = foldl' (<>.) r0 (fmap (h'' s) bs)
h' s (BinaryNoParensBinder b1 b2 b3) = h'' s b1 <>. h'' s b2 <>. h'' s b3
h' s (ParensInBinder b) = h'' s b
h' s (NamedBinder _ _ b1) = h'' s b1
h' s (PositionedBinder _ _ b1) = h'' s b1
h' s (TypedBinder _ b1) = h'' s b1
h' _ _ = r0
lit :: (s -> a -> r) -> s -> Literal a -> r
lit go s (ArrayLiteral as) = foldl' (<>.) r0 (fmap (go s) as)
lit go s (ObjectLiteral as) = foldl' (<>.) r0 (fmap (go s . snd) as)
lit _ _ _ = r0
i'' :: s -> CaseAlternative -> r
i'' s ca = let (s', r) = i s ca in r <>. i' s' ca
i' :: s -> CaseAlternative -> r
i' s (CaseAlternative bs gs) = foldl' (<>.) r0 (fmap (h'' s) bs ++ concatMap (\(GuardedExpr grd val) -> fmap (k' s) grd ++ [g'' s val]) gs)
j'' :: s -> DoNotationElement -> r
j'' s e = let (s', r) = j s e in r <>. j' s' e
j' :: s -> DoNotationElement -> r
j' s (DoNotationValue v) = g'' s v
j' s (DoNotationBind b v) = h'' s b <>. g'' s v
j' s (DoNotationLet ds) = foldl' (<>.) r0 (fmap (f'' s) ds)
j' s (PositionedDoNotationElement _ _ e1) = j'' s e1
k' :: s -> Guard -> r
k' s (ConditionGuard e) = g'' s e
k' s (PatternGuard b e) = h'' s b <>. g'' s e
everywhereWithContextOnValuesM
:: forall m s
. (Monad m)
=> s
-> (s -> Declaration -> m (s, Declaration))
-> (s -> Expr -> m (s, Expr))
-> (s -> Binder -> m (s, Binder))
-> (s -> CaseAlternative -> m (s, CaseAlternative))
-> (s -> DoNotationElement -> m (s, DoNotationElement))
-> ( Declaration -> m Declaration
, Expr -> m Expr
, Binder -> m Binder
, CaseAlternative -> m CaseAlternative
, DoNotationElement -> m DoNotationElement
)
everywhereWithContextOnValuesM s0 f g h i j = (f'' s0, g'' s0, h'' s0, i'' s0, j'' s0)
where
f'' s = uncurry f' <=< f s
f' s (DataBindingGroupDeclaration ds) = DataBindingGroupDeclaration <$> traverse (f'' s) ds
f' s (ValueDecl sa name nameKind bs val) =
ValueDecl sa name nameKind <$> traverse (h'' s) bs <*> traverse (guardedExprM (k' s) (g'' s)) val
f' s (BindingGroupDeclaration ds) = BindingGroupDeclaration <$> traverse (thirdM (g'' s)) ds
f' s (TypeClassDeclaration sa name args implies deps ds) = TypeClassDeclaration sa name args implies deps <$> traverse (f'' s) ds
f' s (TypeInstanceDeclaration sa ch idx name cs className args ds) = TypeInstanceDeclaration sa ch idx name cs className args <$> traverseTypeInstanceBody (traverse (f'' s)) ds
f' _ other = return other
g'' s = uncurry g' <=< g s
g' s (Literal ss l) = Literal ss <$> lit g'' s l
g' s (UnaryMinus ss v) = UnaryMinus ss <$> g'' s v
g' s (BinaryNoParens op v1 v2) = BinaryNoParens <$> g'' s op <*> g'' s v1 <*> g'' s v2
g' s (Parens v) = Parens <$> g'' s v
g' s (TypeClassDictionaryConstructorApp name v) = TypeClassDictionaryConstructorApp name <$> g'' s v
g' s (Accessor prop v) = Accessor prop <$> g'' s v
g' s (ObjectUpdate obj vs) = ObjectUpdate <$> g'' s obj <*> traverse (sndM (g'' s)) vs
g' s (ObjectUpdateNested obj vs) = ObjectUpdateNested <$> g'' s obj <*> traverse (g'' s) vs
g' s (Abs binder v) = Abs <$> h' s binder <*> g'' s v
g' s (App v1 v2) = App <$> g'' s v1 <*> g'' s v2
g' s (Unused v) = Unused <$> g'' s v
g' s (IfThenElse v1 v2 v3) = IfThenElse <$> g'' s v1 <*> g'' s v2 <*> g'' s v3
g' s (Case vs alts) = Case <$> traverse (g'' s) vs <*> traverse (i'' s) alts
g' s (TypedValue check v ty) = TypedValue check <$> g'' s v <*> pure ty
g' s (Let w ds v) = Let w <$> traverse (f'' s) ds <*> g'' s v
g' s (Do m es) = Do m <$> traverse (j'' s) es
g' s (Ado m es v) = Ado m <$> traverse (j'' s) es <*> g'' s v
g' s (PositionedValue pos com v) = PositionedValue pos com <$> g'' s v
g' _ other = return other
h'' s = uncurry h' <=< h s
h' s (LiteralBinder ss l) = LiteralBinder ss <$> lit h'' s l
h' s (ConstructorBinder ss ctor bs) = ConstructorBinder ss ctor <$> traverse (h'' s) bs
h' s (BinaryNoParensBinder b1 b2 b3) = BinaryNoParensBinder <$> h'' s b1 <*> h'' s b2 <*> h'' s b3
h' s (ParensInBinder b) = ParensInBinder <$> h'' s b
h' s (NamedBinder ss name b) = NamedBinder ss name <$> h'' s b
h' s (PositionedBinder pos com b) = PositionedBinder pos com <$> h'' s b
h' s (TypedBinder t b) = TypedBinder t <$> h'' s b
h' _ other = return other
lit :: (s -> a -> m a) -> s -> Literal a -> m (Literal a)
lit go s (ArrayLiteral as) = ArrayLiteral <$> traverse (go s) as
lit go s (ObjectLiteral as) = ObjectLiteral <$> traverse (sndM (go s)) as
lit _ _ other = return other
i'' s = uncurry i' <=< i s
i' s (CaseAlternative bs val) = CaseAlternative <$> traverse (h'' s) bs <*> traverse (guardedExprM (k' s) (g'' s)) val
j'' s = uncurry j' <=< j s
j' s (DoNotationValue v) = DoNotationValue <$> g'' s v
j' s (DoNotationBind b v) = DoNotationBind <$> h'' s b <*> g'' s v
j' s (DoNotationLet ds) = DoNotationLet <$> traverse (f'' s) ds
j' s (PositionedDoNotationElement pos com e1) = PositionedDoNotationElement pos com <$> j'' s e1
k' s (ConditionGuard e) = ConditionGuard <$> g'' s e
k' s (PatternGuard b e) = PatternGuard <$> h'' s b <*> g'' s e
data ScopedIdent = LocalIdent Ident | ToplevelIdent Ident
deriving (Show, Eq, Ord)
inScope :: Ident -> S.Set ScopedIdent -> Bool
inScope i s = (LocalIdent i `S.member` s) || (ToplevelIdent i `S.member` s)
everythingWithScope
:: forall r
. (Monoid r)
=> (S.Set ScopedIdent -> Declaration -> r)
-> (S.Set ScopedIdent -> Expr -> r)
-> (S.Set ScopedIdent -> Binder -> r)
-> (S.Set ScopedIdent -> CaseAlternative -> r)
-> (S.Set ScopedIdent -> DoNotationElement -> r)
-> ( S.Set ScopedIdent -> Declaration -> r
, S.Set ScopedIdent -> Expr -> r
, S.Set ScopedIdent -> Binder -> r
, S.Set ScopedIdent -> CaseAlternative -> r
, S.Set ScopedIdent -> DoNotationElement -> r
)
everythingWithScope f g h i j = (f'', g'', h'', i'', \s -> snd . j'' s)
where
f'' :: S.Set ScopedIdent -> Declaration -> r
f'' s a = f s a <> f' s a
f' :: S.Set ScopedIdent -> Declaration -> r
f' s (DataBindingGroupDeclaration ds) =
let s' = S.union s (S.fromList (map ToplevelIdent (mapMaybe getDeclIdent (NEL.toList ds))))
in foldMap (f'' s') ds
f' s (ValueDecl _ name _ bs val) =
let s' = S.insert (ToplevelIdent name) s
s'' = S.union s' (S.fromList (concatMap localBinderNames bs))
in foldMap (h'' s') bs <> foldMap (l' s'') val
f' s (BindingGroupDeclaration ds) =
let s' = S.union s (S.fromList (NEL.toList (fmap (\((_, name), _, _) -> ToplevelIdent name) ds)))
in foldMap (\(_, _, val) -> g'' s' val) ds
f' s (TypeClassDeclaration _ _ _ _ _ ds) = foldMap (f'' s) ds
f' s (TypeInstanceDeclaration _ _ _ _ _ _ _ (ExplicitInstance ds)) = foldMap (f'' s) ds
f' _ _ = mempty
g'' :: S.Set ScopedIdent -> Expr -> r
g'' s a = g s a <> g' s a
g' :: S.Set ScopedIdent -> Expr -> r
g' s (Literal _ l) = lit g'' s l
g' s (UnaryMinus _ v1) = g'' s v1
g' s (BinaryNoParens op v1 v2) = g'' s op <> g'' s v1 <> g'' s v2
g' s (Parens v1) = g'' s v1
g' s (TypeClassDictionaryConstructorApp _ v1) = g'' s v1
g' s (Accessor _ v1) = g'' s v1
g' s (ObjectUpdate obj vs) = g'' s obj <> foldMap (g'' s . snd) vs
g' s (ObjectUpdateNested obj vs) = g'' s obj <> foldMap (g'' s) vs
g' s (Abs b v1) =
let s' = S.union (S.fromList (localBinderNames b)) s
in h'' s b <> g'' s' v1
g' s (App v1 v2) = g'' s v1 <> g'' s v2
g' s (Unused v) = g'' s v
g' s (IfThenElse v1 v2 v3) = g'' s v1 <> g'' s v2 <> g'' s v3
g' s (Case vs alts) = foldMap (g'' s) vs <> foldMap (i'' s) alts
g' s (TypedValue _ v1 _) = g'' s v1
g' s (Let _ ds v1) =
let s' = S.union s (S.fromList (map LocalIdent (mapMaybe getDeclIdent ds)))
in foldMap (f'' s') ds <> g'' s' v1
g' s (Do _ es) = fold . snd . mapAccumL j'' s $ es
g' s (Ado _ es v1) =
let s' = S.union s (foldMap (fst . j'' s) es)
in g'' s' v1
g' s (PositionedValue _ _ v1) = g'' s v1
g' _ _ = mempty
h'' :: S.Set ScopedIdent -> Binder -> r
h'' s a = h s a <> h' s a
h' :: S.Set ScopedIdent -> Binder -> r
h' s (LiteralBinder _ l) = lit h'' s l
h' s (ConstructorBinder _ _ bs) = foldMap (h'' s) bs
h' s (BinaryNoParensBinder b1 b2 b3) = foldMap (h'' s) [b1, b2, b3]
h' s (ParensInBinder b) = h'' s b
h' s (NamedBinder _ name b1) = h'' (S.insert (LocalIdent name) s) b1
h' s (PositionedBinder _ _ b1) = h'' s b1
h' s (TypedBinder _ b1) = h'' s b1
h' _ _ = mempty
lit :: (S.Set ScopedIdent -> a -> r) -> S.Set ScopedIdent -> Literal a -> r
lit go s (ArrayLiteral as) = foldMap (go s) as
lit go s (ObjectLiteral as) = foldMap (go s . snd) as
lit _ _ _ = mempty
i'' :: S.Set ScopedIdent -> CaseAlternative -> r
i'' s a = i s a <> i' s a
i' :: S.Set ScopedIdent -> CaseAlternative -> r
i' s (CaseAlternative bs gs) =
let s' = S.union s (S.fromList (concatMap localBinderNames bs))
in foldMap (h'' s) bs <> foldMap (l' s') gs
j'' :: S.Set ScopedIdent -> DoNotationElement -> (S.Set ScopedIdent, r)
j'' s a = let (s', r) = j' s a in (s', j s a <> r)
j' :: S.Set ScopedIdent -> DoNotationElement -> (S.Set ScopedIdent, r)
j' s (DoNotationValue v) = (s, g'' s v)
j' s (DoNotationBind b v) =
let s' = S.union (S.fromList (localBinderNames b)) s
in (s', h'' s b <> g'' s v)
j' s (DoNotationLet ds) =
let s' = S.union s (S.fromList (map LocalIdent (mapMaybe getDeclIdent ds)))
in (s', foldMap (f'' s') ds)
j' s (PositionedDoNotationElement _ _ e1) = j'' s e1
k' :: S.Set ScopedIdent -> Guard -> (S.Set ScopedIdent, r)
k' s (ConditionGuard e) = (s, g'' s e)
k' s (PatternGuard b e) =
let s' = S.union (S.fromList (localBinderNames b)) s
in (s', h'' s b <> g'' s' e)
l' s (GuardedExpr [] e) = g'' s e
l' s (GuardedExpr (grd:gs) e) =
let (s', r) = k' s grd
in r <> l' s' (GuardedExpr gs e)
getDeclIdent :: Declaration -> Maybe Ident
getDeclIdent (ValueDeclaration vd) = Just (valdeclIdent vd)
getDeclIdent (TypeDeclaration td) = Just (tydeclIdent td)
getDeclIdent _ = Nothing
localBinderNames = map LocalIdent . binderNames
accumTypes
:: (Monoid r)
=> (SourceType -> r)
-> ( Declaration -> r
, Expr -> r
, Binder -> r
, CaseAlternative -> r
, DoNotationElement -> r
)
accumTypes f = everythingOnValues mappend forDecls forValues (const mempty) (const mempty) (const mempty)
where
forDecls (DataDeclaration _ _ _ _ dctors) = mconcat (concatMap (fmap (f . snd) . dataCtorFields) dctors)
forDecls (ExternDeclaration _ _ ty) = f ty
forDecls (TypeClassDeclaration _ _ _ implies _ _) = mconcat (concatMap (fmap f . constraintArgs) implies)
forDecls (TypeInstanceDeclaration _ _ _ _ cs _ tys _) = mconcat (concatMap (fmap f . constraintArgs) cs) <> mconcat (fmap f tys)
forDecls (TypeSynonymDeclaration _ _ _ ty) = f ty
forDecls (TypeDeclaration td) = f (tydeclType td)
forDecls _ = mempty
forValues (TypeClassDictionary c _ _) = mconcat (fmap f (constraintArgs c))
forValues (DeferredDictionary _ tys) = mconcat (fmap f tys)
forValues (TypedValue _ _ ty) = f ty
forValues _ = mempty
accumKinds
:: (Monoid r)
=> (SourceKind -> r)
-> ( Declaration -> r
, Expr -> r
, Binder -> r
, CaseAlternative -> r
, DoNotationElement -> r
)
accumKinds f = everythingOnValues mappend forDecls forValues (const mempty) (const mempty) (const mempty)
where
forDecls (DataDeclaration _ _ _ args dctors) =
foldMap (foldMap f . snd) args <>
foldMap (foldMap (forTypes . snd) . dataCtorFields) dctors
forDecls (TypeClassDeclaration _ _ args implies _ _) =
foldMap (foldMap f . snd) args <>
foldMap (foldMap forTypes . constraintArgs) implies
forDecls (TypeInstanceDeclaration _ _ _ _ cs _ tys _) =
foldMap (foldMap forTypes . constraintArgs) cs <>
foldMap forTypes tys
forDecls (TypeSynonymDeclaration _ _ args ty) =
foldMap (foldMap f . snd) args <>
forTypes ty
forDecls (TypeDeclaration td) = forTypes (tydeclType td)
forDecls (ExternDeclaration _ _ ty) = forTypes ty
forDecls (ExternDataDeclaration _ _ kn) = f kn
forDecls _ = mempty
forValues (TypeClassDictionary c _ _) = foldMap forTypes (constraintArgs c)
forValues (DeferredDictionary _ tys) = foldMap forTypes tys
forValues (TypedValue _ _ ty) = forTypes ty
forValues _ = mempty
forTypes (KindedType _ _ k) = f k
forTypes _ = mempty
-- |
-- Map a function over type annotations appearing inside a value
--
overTypes :: (SourceType -> SourceType) -> Expr -> Expr
overTypes f = let (_, f', _) = everywhereOnValues id g id in f'
where
g :: Expr -> Expr
g (TypedValue checkTy val t) = TypedValue checkTy val (f t)
g (TypeClassDictionary c sco hints) =
TypeClassDictionary
(mapConstraintArgs (fmap f) c)
(updateCtx sco)
hints
g other = other
updateDict fn dict = dict { tcdInstanceTypes = fn (tcdInstanceTypes dict) }
updateScope = fmap . fmap . fmap . fmap $ updateDict $ fmap f
updateCtx = M.alter updateScope Nothing