-
Notifications
You must be signed in to change notification settings - Fork 2
/
MonadicFactory.scala
738 lines (657 loc) · 28.9 KB
/
MonadicFactory.scala
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
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
package com.thoughtworks.sde.core
import scala.annotation.{compileTimeOnly, tailrec}
import scala.language.higherKinds
import scala.language.experimental.macros
import scala.reflect.macros.{blackbox, whitebox}
import scalaz.{Bind, Foldable, MonadPlus, Traverse}
import macrocompat.bundle
trait MonadicFactory[M0[_[_]], F0[_]] {
type M[F[_]] = M0[F]
type F[A] = F0[A]
def apply[A](body: => A)(implicit typeClass: M[F]): F[A] = macro MonadicFactory.MacroBundle.apply
@deprecated(message = "Use MonadicFactory.WithTypeClass instead", since = "3.1.0")
type WithTypeClass = MonadicFactory.WithTypeClass[M, F]
@deprecated(message = "Use MonadicFactory.WithTypeClass.apply instead", since = "3.1.0")
final def withTypeClass(implicit typeClass0: M[F]) = new MonadicFactory.WithTypeClass[M, F] {
override val typeClass = typeClass0
}
}
/**
* @author 杨博 (Yang Bo) <pop.atry@gmail.com>
*/
object MonadicFactory {
def apply[M[_[_]], F[_]] = new MonadicFactory[M, F] {}
object WithTypeClass {
def apply[M[_[_]], F[_]](implicit typeClass0: M[F]) = new WithTypeClass[M, F] {
override val typeClass = typeClass0
}
}
trait WithTypeClass[M0[_[_]], F0[_]] {
type M[F[_]] = M0[F]
type F[A] = F0[A]
val typeClass: M0[F0]
def apply[A](body: => A): F[A] = macro MacroBundle.withTypeClassApply
}
object Whitebox {
def apply[M[_[_]], F[_]] = new Whitebox[M, F] {}
object WithTypeClass {
def apply[M[_[_]], F[_]](implicit typeClass0: M[F]) = new Whitebox.WithTypeClass[M, F] {
override val typeClass = typeClass0
}
}
trait WithTypeClass[M0[_[_]], F0[_]] {
type M[F[_]] = M0[F]
type F[A] = F0[A]
val typeClass: M0[F0]
def apply[A](body: => A): F[A] = macro WhiteboxMacroBundle.withTypeClassApply
}
}
trait Whitebox[M0[_[_]], F0[_]] {
type M[F[_]] = M0[F]
type F[A] = F0[A]
def apply[A](body: => A)(implicit typeClass: M[F]): F[A] = macro WhiteboxMacroBundle.apply
}
private[MonadicFactory] sealed trait ExceptionHandlingMode
private[MonadicFactory] case object MonadThrowableMode extends ExceptionHandlingMode
private[MonadicFactory] case object UnsupportedExceptionHandlingMode extends ExceptionHandlingMode
private[MonadicFactory] case object MonadCatchIoMode extends ExceptionHandlingMode
// TODO: CatchableMode
@bundle
private[thoughtworks] final class WhiteboxMacroBundle(private[MonadicFactory] val c: whitebox.Context) {
val blackboxBundle = new MacroBundle(c)
import c.universe._
def apply(body: Tree)(typeClass: Tree): Tree = {
blackboxBundle
.apply(body.asInstanceOf[blackboxBundle.c.Tree])(typeClass.asInstanceOf[blackboxBundle.c.Tree])
.asInstanceOf[Tree]
}
def withTypeClassApply(body: Tree): Tree = {
blackboxBundle.withTypeClassApply(body.asInstanceOf[blackboxBundle.c.Tree]).asInstanceOf[Tree]
}
}
@bundle
private[thoughtworks] final class MacroBundle(private[MonadicFactory] val c: blackbox.Context) {
import c.universe._
import Flag._
private val monadErrorClassSymbol = symbolOf[_root_.scalaz.MonadError[_root_.scala.List, _]]
private val monadCatchIoClassSymbol = symbolOf[_root_.scalaz.effect.MonadCatchIO[_root_.scala.List]]
/**
* @param fTree See https://issues.scala-lang.org/browse/SI-5712
*/
private[MacroBundle] final class MonadicContext(exceptionHandlingMode: ExceptionHandlingMode,
fTree: Tree,
monadTree: Tree) {
sealed abstract class CpsTree {
def toReflectTree: Tree
final def toUntypedTree = c.untypecheck(toReflectTree)
def tpe: Type
def flatMap(f: Tree => CpsTree): CpsTree
}
final case class OpenTree(prefix: CpsTree, parameter: ValDef, inner: CpsTree) extends CpsTree {
override def toReflectTree: Tree = {
inner match {
case PlainTree(plain, _) => {
Apply(Apply(Select(monadTree, TermName("map")), List(prefix.toReflectTree)),
List(Function(List(parameter), plain)))
}
case _ => {
val innerTree = inner.toReflectTree
Apply(Apply(Select(monadTree, TermName("bind")), List(prefix.toReflectTree)),
List(Function(List(parameter), innerTree)))
}
}
}
override def tpe = inner.tpe
override def flatMap(f: Tree => CpsTree): CpsTree = {
new OpenTree(prefix, parameter, inner.flatMap(f))
}
}
final case class BlockTree(prefix: List[Tree], tail: CpsTree) extends CpsTree {
override def tpe = tail.tpe
override def toReflectTree: Tree = {
Block(prefix, tail.toReflectTree)
}
override def flatMap(f: Tree => CpsTree): CpsTree = {
BlockTree(prefix, tail.flatMap(f))
}
}
final case class MonadTree(reflectTree: Tree, override val tpe: Type) extends CpsTree {
override def toReflectTree = reflectTree
override def flatMap(f: Tree => CpsTree): CpsTree = {
val newId = TermName(c.freshName("element"))
OpenTree(MonadTree.this, ValDef(Modifiers(PARAM), newId, TypeTree(tpe), EmptyTree), f(Ident(newId)))
}
}
final case class PlainTree(tree: Tree, tpe: Type) extends CpsTree {
override def toReflectTree: Tree = {
Apply(Select(monadTree, TermName("point")), List(tree))
}
override def flatMap(f: Tree => CpsTree): CpsTree = {
f(tree)
}
}
private val eachMethodSymbol =
typeOf[_root_.com.thoughtworks.sde.core.MonadicFactory.Instructions.type].member(TermName("each"))
private val foreachMethodSymbol =
typeOf[_root_.com.thoughtworks.sde.core.MonadicFactory.Instructions.type].member(TermName("foreach"))
private val mapMethodSymbol =
typeOf[_root_.com.thoughtworks.sde.core.MonadicFactory.Instructions.type].member(TermName("map"))
private val flatMapMethodSymbol =
typeOf[_root_.com.thoughtworks.sde.core.MonadicFactory.Instructions.type].member(TermName("flatMap"))
private val filterMethodSymbol =
typeOf[_root_.com.thoughtworks.sde.core.MonadicFactory.Instructions.type].member(TermName("filter"))
// Avoid warning: a pure expression does nothing in statement position
@tailrec
private def isDiscardable(transformedTree: CpsTree): Boolean = {
transformedTree match {
case OpenTree(_, _, inner) => isDiscardable(inner)
case BlockTree(_, tail) => isDiscardable(tail)
case _: MonadTree => true
case _: PlainTree => false
}
}
def buildCpsTree(origin: Tree)(implicit forceAwait: Set[Name]): CpsTree = {
origin match {
case q"""$method[$f, $a]($fa)""" if method.symbol == eachMethodSymbol =>
buildCpsTree(fa).flatMap { x =>
new MonadTree(x, origin.tpe)
}
case q"""$method[$fType, $a, $u]($fa, $foldable, $f)""" if method.symbol == foreachMethodSymbol =>
buildCpsTree(fa).flatMap { faValue =>
f match {
case Function(List(valDef), body) =>
MonadTree(
atPos(origin.pos) {
q"""
$foldable.traverse_[$fTree, $a, $u]($faValue)(${treeCopy
.Function(f, List(valDef), buildCpsTree(body).toUntypedTree)})($monadTree)
"""
},
origin.tpe
)
case _ =>
buildCpsTree(f).flatMap { fValue =>
PlainTree(
atPos(origin.pos) {
q"""
$foldable.traverse_[_root_.scalaz.Id.Id, $a, $u]($faValue)($fValue)(_root_.scalaz.Id.id)
"""
},
origin.tpe
)
}
}
}
case q"""$method[$fType, $a, $b]($fa, $traverse, $f)""" if method.symbol == mapMethodSymbol =>
buildCpsTree(fa).flatMap { faValue =>
f match {
case Function(List(valDef), body) =>
MonadTree(
atPos(origin.pos) {
q"""
_root_.scalaz.syntax.traverse.ToTraverseOps[$fType, $a]($faValue)($traverse).traverse[$fTree, $b](${treeCopy
.Function(f, List(valDef), buildCpsTree(body).toUntypedTree)})($monadTree)
"""
},
origin.tpe
)
case _ =>
buildCpsTree(f).flatMap { fValue =>
PlainTree(atPos(origin.pos)(q"$traverse.map[$a, $b]($faValue)($fValue)"), origin.tpe)
}
}
}
case q"""$method[$fType, $a, $b]($fa, $traverse, $bind, $f)""" if method.symbol == flatMapMethodSymbol =>
buildCpsTree(fa).flatMap { faValue =>
f match {
case Function(List(valDef), body) =>
MonadTree(
atPos(origin.pos) {
q"""
$traverse.traverseM[$a, $fTree, $b]($faValue)(${treeCopy
.Function(f, List(valDef), buildCpsTree(body).toUntypedTree)})($monadTree, $bind)
"""
},
origin.tpe
)
case _ =>
buildCpsTree(f).flatMap { fValue =>
PlainTree(atPos(origin.pos)(q"$bind.bind[$a, $b]($faValue)($fValue)"), origin.tpe)
}
}
}
case q"""$method[$fType, $a]($fa, $traverse, $monadPlus, $f)""" if method.symbol == filterMethodSymbol =>
buildCpsTree(fa).flatMap { faValue =>
f match {
case Function(List(valDef), body) =>
MonadTree(
atPos(origin.pos) {
q"""
$traverse.traverseM[$a, $fTree, $a]($faValue)(
${treeCopy.Function(
f,
List(valDef),
(buildCpsTree(body).flatMap { condition =>
PlainTree(
q"""
if ($condition) $monadPlus.point[$a](${valDef.name}) else $monadPlus.empty
""",
valDef.tpt.tpe
)
}).toUntypedTree
)}
)($monadTree, $monadPlus)
"""
},
origin.tpe
)
case _ =>
buildCpsTree(f).flatMap { fValue =>
PlainTree(atPos(origin.pos)(q"$monadPlus.filter[$a]($faValue)($fValue)"), origin.tpe)
}
}
}
case Apply(method @ Ident(name), parameters) if forceAwait(name) => {
def transformParameters(untransformed: List[Tree], transformed: List[Tree]): CpsTree = {
untransformed match {
case Nil => {
buildCpsTree(method).flatMap { transformedMethod =>
new MonadTree(treeCopy.Apply(origin, transformedMethod, transformed.reverse), origin.tpe)
}
}
case head :: tail => {
buildCpsTree(head).flatMap { transformedHead =>
transformParameters(tail, transformedHead :: transformed)
}
}
}
}
transformParameters(parameters, Nil)
}
case Try(block, catches, finalizer) => {
exceptionHandlingMode match {
case UnsupportedExceptionHandlingMode => {
new PlainTree(origin, origin.tpe)
}
case MonadThrowableMode => {
val blockTree = buildCpsTree(block).toReflectTree
val exceptionName = TermName(c.freshName("exception"))
val tryCatch = Apply(
Apply(
TypeApply(Select(monadTree, TermName("handleError")), List(TypeTree(origin.tpe))),
List(blockTree)
),
List(
Function(
List(
ValDef(Modifiers(PARAM),
exceptionName,
TypeTree(typeOf[_root_.java.lang.Throwable]),
EmptyTree)),
Match(
Ident(exceptionName),
(for (caseTree @ CaseDef(pat, guard, body) <- catches) yield {
treeCopy.CaseDef(caseTree, pat, guard, buildCpsTree(body).toReflectTree)
}) :+ CaseDef(
Ident(termNames.WILDCARD),
EmptyTree,
Apply(TypeApply(Select(monadTree, TermName("raiseError")), List(TypeTree(origin.tpe))),
List(Ident(exceptionName)))
)
)
)
)
)
if (finalizer.isEmpty) {
MonadTree(tryCatch, origin.tpe)
} else {
val finalizerCpsTree = buildCpsTree(finalizer)
MonadTree(
Apply(
Apply(
TypeApply(Select(monadTree, TermName("handleError")), List(TypeTree(origin.tpe))),
List(tryCatch)
),
List(
Function(
List(
ValDef(Modifiers(PARAM),
exceptionName,
TypeTree(typeOf[_root_.java.lang.Throwable]),
EmptyTree)),
finalizerCpsTree.flatMap { transformedFinalizer =>
if (isDiscardable(finalizerCpsTree)) {
MonadTree(Apply(TypeApply(Select(monadTree, TermName("raiseError")),
List(TypeTree(origin.tpe))),
List(Ident(exceptionName))),
origin.tpe)
} else {
MonadTree(
Block(List(transformedFinalizer),
Apply(TypeApply(Select(monadTree, TermName("raiseError")),
List(TypeTree(origin.tpe))),
List(Ident(exceptionName)))),
origin.tpe
)
}
}.toReflectTree
)
)
),
origin.tpe
).flatMap { transformedTryCatch =>
finalizerCpsTree.flatMap { transformedFinalizer =>
if (isDiscardable(finalizerCpsTree)) {
PlainTree(transformedTryCatch, origin.tpe)
} else {
PlainTree(Block(List(transformedFinalizer), transformedTryCatch), origin.tpe)
}
}
}
}
}
case MonadCatchIoMode => {
val tryCatch = catches.foldLeft(buildCpsTree(block).toReflectTree) { (tryF, cd) =>
val CaseDef(pat, guard, body) = cd
val exceptionName = TermName(c.freshName("exception"))
val catcherResultName = TermName(c.freshName("catcherResult"))
Apply(
Apply(
Apply(
TypeApply(
Select(reify(_root_.scalaz.effect.MonadCatchIO).tree, TermName("catchSome")),
List(fTree, TypeTree(origin.tpe), AppliedTypeTree(fTree, List(TypeTree(origin.tpe))))
),
List(tryF)
),
List(
Function(
List(
ValDef(Modifiers(PARAM),
exceptionName,
TypeTree(typeOf[_root_.java.lang.Throwable]),
EmptyTree)),
Match(
Ident(exceptionName),
List(
treeCopy.CaseDef(cd,
pat,
guard,
Apply(reify(_root_.scala.Some).tree,
List(buildCpsTree(body).toReflectTree))),
CaseDef(Ident(termNames.WILDCARD), EmptyTree, reify(_root_.scala.None).tree)
)
)
),
Function(List(
ValDef(Modifiers(PARAM),
catcherResultName,
AppliedTypeTree(fTree, List(TypeTree(origin.tpe))),
EmptyTree)),
Ident(catcherResultName))
)
),
List(monadTree)
)
}
if (finalizer.isEmpty) {
MonadTree(tryCatch, origin.tpe)
} else {
MonadTree(
Apply(
Apply(Select(reify(_root_.scalaz.effect.MonadCatchIO).tree, TermName("ensuring")),
List(tryCatch, buildCpsTree(finalizer).toReflectTree)),
List(monadTree)
),
origin.tpe
)
}
}
}
}
case Select(instance, field) => {
buildCpsTree(instance).flatMap { x =>
new PlainTree(treeCopy.Select(origin, x, field), origin.tpe)
}
}
case TypeApply(method, parameters) => {
buildCpsTree(method).flatMap { x =>
new PlainTree(TypeApply(x, parameters), origin.tpe)
}
}
case Apply(method, parameters) => {
buildCpsTree(method).flatMap { transformedMethod =>
def transformParameters(untransformed: List[Tree], transformed: List[Tree]): CpsTree = {
untransformed match {
case Nil => {
new PlainTree(treeCopy.Apply(origin, transformedMethod, transformed.reverse), origin.tpe)
}
case head :: tail => {
buildCpsTree(head).flatMap { transformedHead =>
transformParameters(tail, transformedHead :: transformed)
}
}
}
}
transformParameters(parameters, Nil)
}
}
case Block(stats, expr) => {
def transformStats(untransformed: List[Tree]): CpsTree = {
untransformed match {
case Nil => {
buildCpsTree(expr)
}
case head :: tail => {
val transformedTree = buildCpsTree(head)
transformedTree.flatMap { transformedHead =>
if (isDiscardable(transformedTree)) {
transformStats(tail)
} else {
transformStats(tail) match {
case BlockTree(prefix, tail) => {
BlockTree(transformedHead :: prefix, tail)
}
case transformedTail @ (_: MonadTree | _: OpenTree | _: PlainTree) => {
BlockTree(transformedHead :: Nil, transformedTail)
}
}
}
}
}
}
}
new MonadTree(transformStats(stats).toReflectTree, origin.tpe)
}
case ValDef(mods, name, tpt, rhs) => {
buildCpsTree(rhs).flatMap { x =>
new PlainTree(treeCopy.ValDef(origin, mods, name, tpt, x), origin.tpe)
}
}
case Assign(left, right) => {
buildCpsTree(right).flatMap { x =>
new PlainTree(treeCopy.Assign(origin, left, x), origin.tpe)
}
}
case Match(selector, cases) => {
val selectorName = TermName(c.freshName("selector"))
new MonadTree(
Apply(
Apply(TypeApply(Select(monadTree, TermName("bind")),
List(TypeTree(selector.tpe), TypeTree(origin.tpe))),
List(buildCpsTree(selector).toReflectTree)),
List(
Function(
List(ValDef(Modifiers(PARAM), selectorName, TypeTree(selector.tpe), EmptyTree)),
treeCopy.Match(origin, Ident(selectorName), for {
cd @ CaseDef(pat, guard, body) <- cases
} yield treeCopy.CaseDef(cd, pat, guard, buildCpsTree(body).toReflectTree))
))
),
origin.tpe
)
}
case If(cond, thenp, elsep) => {
new MonadTree(
treeCopy.Apply(
origin,
TypeApply(Select(monadTree, TermName("ifM")), List(TypeTree(origin.tpe))),
List(buildCpsTree(cond).toReflectTree,
buildCpsTree(thenp).toReflectTree,
buildCpsTree(elsep).toReflectTree)
),
origin.tpe
)
}
case Typed(expr, tpt @ Ident(typeNames.WILDCARD_STAR)) => {
buildCpsTree(expr).flatMap { x =>
new PlainTree(atPos(origin.pos)(Typed(x, tpt)), origin.tpe)
}
}
case Typed(expr, tpt) => {
buildCpsTree(expr).flatMap { x =>
new PlainTree(atPos(origin.pos)(Typed(x, TypeTree(tpt.tpe))), origin.tpe)
}
}
case Annotated(annot, arg) => {
buildCpsTree(arg).flatMap { x =>
new PlainTree(Annotated(annot, x), origin.tpe)
}
}
case LabelDef(name1,
List(),
If(condition, block @ Block(body, Apply(Ident(name2), List())), Literal(Constant(()))))
if name1 == name2 => {
new MonadTree(
Apply(
TypeApply(Select(monadTree, TermName("whileM_")), List(TypeTree(origin.tpe))),
List(buildCpsTree(condition).toReflectTree,
buildCpsTree(treeCopy.Block(block, body, Literal(Constant(())))).toReflectTree)
),
origin.tpe
)
}
case LabelDef(name1,
List(),
block @ Block(body, If(condition, Apply(Ident(name2), List()), Literal(Constant(())))))
if name1 == name2 => {
new MonadTree(
Block(
List(
ValDef(Modifiers(),
name1,
TypeTree(),
buildCpsTree(treeCopy.Block(block, body, Literal(Constant(())))).toReflectTree)),
Apply(
Apply(TypeApply(Select(monadTree, TermName("bind")),
List(TypeTree(definitions.UnitTpe), TypeTree(origin.tpe))),
List(Ident(name1))),
List(
Function(
List(
ValDef(Modifiers(PARAM),
TermName(c.freshName("ignoredParameter")),
TypeTree(definitions.UnitTpe),
EmptyTree)),
Apply(
TypeApply(
Select(monadTree, TermName("whileM_")),
List(TypeTree(origin.tpe))
),
List(
buildCpsTree(condition).toReflectTree,
Ident(name1)
)
)
)
)
)
),
origin.tpe
)
}
case Throw(throwable) => {
exceptionHandlingMode match {
case MonadThrowableMode => {
buildCpsTree(throwable).flatMap { x =>
new MonadTree(
Apply(TypeApply(Select(monadTree, TermName("raiseError")), List(TypeTree(origin.tpe))), List(x)),
origin.tpe)
}
}
case UnsupportedExceptionHandlingMode | MonadCatchIoMode => {
buildCpsTree(throwable).flatMap { x =>
new PlainTree(treeCopy.Throw(origin, x), origin.tpe)
}
}
}
}
case EmptyTree | _: Return | _: New | _: Ident | _: Literal | _: Super | _: This | _: TypTree | _: TypeDef |
_: Function | _: DefDef | _: ClassDef | _: ModuleDef | _: Import | _: ImportSelector => {
new PlainTree(origin, origin.tpe)
}
}
}
}
def apply(body: Tree)(typeClass: Tree): Tree = {
val q"$partialAppliedMonadic.apply[$a]($body)($typeClass)" = c.macroApplication
val mode = if (typeClass.tpe.baseType(monadErrorClassSymbol) != NoType) {
MonadThrowableMode
} else if (typeClass.tpe.baseType(monadCatchIoClassSymbol) != NoType) {
MonadCatchIoMode
} else {
UnsupportedExceptionHandlingMode
}
val partialAppliedMonadicName = TermName(c.freshName("partialAppliedMonadic"))
val monadName = TermName(c.freshName("monad"))
val monadTree = q"$monadName"
val cpsTreeBuilder = new MonadicContext(mode, tq"$partialAppliedMonadicName.F", monadTree)
// c.info(c.enclosingPosition, showCode(body), true)
val result =
q"""{
val $partialAppliedMonadicName = $partialAppliedMonadic
val $monadName = $typeClass
${cpsTreeBuilder.buildCpsTree(body)(Set.empty).toUntypedTree}
}"""
// c.info(c.enclosingPosition, showCode(result), true)
result
}
def withTypeClassApply(body: Tree): Tree = {
val q"$withTypeClass.apply[$a]($body)" = c.macroApplication
val typeClassType = internal.singleType(withTypeClass.tpe, withTypeClass.tpe.member(TermName("typeClass")))
val mode = if (typeClassType.baseType(monadErrorClassSymbol) != NoType) {
MonadThrowableMode
} else if (typeClassType.baseType(monadCatchIoClassSymbol) != NoType) {
MonadCatchIoMode
} else {
UnsupportedExceptionHandlingMode
}
val withTypeClassName = TermName(c.freshName("partialAppliedMonadic"))
val monadTree = q"$withTypeClassName.typeClass"
val cpsTreeBuilder = new MonadicContext(mode, tq"$withTypeClassName.F", monadTree)
// c.info(c.enclosingPosition, showCode(body), true)
val result =
q"""{
val $withTypeClassName = $withTypeClass
${cpsTreeBuilder.buildCpsTree(body)(Set.empty).toUntypedTree}
}"""
// c.info(c.enclosingPosition, showCode(result), true)
result
}
}
object Instructions {
@compileTimeOnly(
"""`each` instructions must not appear outside monadic blocks.
Note that the `each` instructions may be renamed for different domains.
The renamed instruction name may be `bind`, `!`, `await`, `gen`, etc.)""")
def each[F[_], A](fa: F[A]): A = ???
@compileTimeOnly("`foreach` instructions must not appear outside monadic blocks")
def foreach[F[_], A, U](fa: F[A], foldable: Foldable[F], body: A => U): Unit = ???
@compileTimeOnly("`map` instructions must not appear outside monadic blocks")
def map[F[_], A, B](fa: F[A], traverse: Traverse[F], body: A => B): F[B] = ???
@compileTimeOnly("`flatMap` instructions must not appear outside monadic blocks")
def flatMap[F[_], A, B](fa: F[A], traverse: Traverse[F], bind: Bind[F], body: A => F[B]): F[B] = ???
@compileTimeOnly("`filter` instructions must not appear outside monadic blocks")
def filter[F[_], A](fa: F[A], traverse: Traverse[F], monadPlus: MonadPlus[F], body: A => Boolean): F[A] = ???
}
}