11import sbt ._
22
3+ import scala .annotation .tailrec
4+
35/**
46 * Copied, with some modifications, from https://github.com/milessabin/shapeless/blob/master/project/Boilerplate.scala
57 *
@@ -28,8 +30,13 @@ object Boilerplate {
2830 GenTupleSemigroupalSyntax ,
2931 GenParallelArityFunctions ,
3032 GenParallelArityFunctions2 ,
33+ GenFoldableArityFunctions ,
3134 GenTupleParallelSyntax ,
32- GenFoldableArityFunctions
35+ GenTupleShowInstances ,
36+ GenTupleMonadInstances ,
37+ GenTupleBifunctorInstances ,
38+ GenTupleBitraverseInstances ,
39+ GenTupleUnorderedFoldableInstances
3340 )
3441
3542 val header = " // auto-generated boilerplate by /project/Boilerplate.scala" // TODO: put something meaningful here?
@@ -49,21 +56,58 @@ object Boilerplate {
4956 final class TemplateVals (val arity : Int ) {
5057 val synTypes = (0 until arity).map(n => s " A $n" )
5158 val synVals = (0 until arity).map(n => s " a $n" )
52- val synTypedVals = ( synVals.zip(synTypes) ).map { case (v, t) => v + " :" + t }
59+ val synTypedVals = synVals.zip(synTypes).map { case (v, t) => v + " :" + t }
5360 val `A..N` = synTypes.mkString(" , "
5461 val `a..n` = synVals.mkString(" , "
5562 val `_.._` = Seq .fill(arity)(" _" " , "
56- val `(A..N)` = if (arity == 1 ) " Tuple1[A ]" else synTypes.mkString(" (" " , " " )"
63+ val `(A..N)` = if (arity == 1 ) " Tuple1[A0 ]" else synTypes.mkString(" (" " , " " )"
5764 val `(_.._)` = if (arity == 1 ) " Tuple1[_]" else Seq .fill(arity)(" _" " (" " , " " )"
5865 val `(a..n)` = if (arity == 1 ) " Tuple1(a)" else synVals.mkString(" (" " , " " )"
5966 val `a:A..n:N` = synTypedVals.mkString(" , "
67+
68+ val `A..(N - 1)` = (0 until (arity - 1 )).map(n => s " A $n" )
69+ val `A..(N - 2)` = (0 until (arity - 2 )).map(n => s " A $n" )
70+ val `A0, A(N - 1)` = if (arity <= 1 ) " " else `A..(N - 1)`.mkString(" , "
71+ val `A0, A(N - 2)` = if (arity <= 2 ) " " else `A..(N - 2)`.mkString(" " " , " " , "
72+ val `[A0, A(N - 2)]` = if (arity <= 2 ) " " else `A..(N - 2)`.mkString(" [" " , " " ]"
73+ val `(A..N - 2, *, *)` =
74+ if (arity <= 2 ) " (*, *)"
75+ else `A..(N - 2)`.mkString(" (" " , " " , *, *)"
76+ val `a..(n - 1)` = (0 until (arity - 1 )).map(n => s " a $n" )
77+ val `fa._1..fa._(n - 2)` =
78+ if (arity <= 2 ) " " else (0 until (arity - 2 )).map(n => s " fa._ ${n + 1 }" ).mkString(" " " , " " , "
79+ val `pure(fa._1..(n - 2))` =
80+ if (arity <= 2 ) " " else (0 until (arity - 2 )).map(n => s " G.pure(fa._ ${n + 1 }) " ).mkString(" " " , " " , "
81+ val `a0, a(n - 1)` = if (arity <= 1 ) " " else `a..(n - 1)`.mkString(" , "
82+ val `[A0, A(N - 1)]` = if (arity <= 1 ) " " else `A..(N - 1)`.mkString(" [" " , " " ]"
83+ val `(A0, A(N - 1))` =
84+ if (arity == 1 ) " Tuple1[A0]"
85+ else if (arity == 2 ) " A0"
86+ else `A..(N - 1)`.mkString(" (" " , " " )"
87+ val `(A..N - 1, *)` =
88+ if (arity == 1 ) " Tuple1"
89+ else `A..(N - 1)`.mkString(" (" " , " " , *)"
90+ val `(fa._1..(n - 1))` =
91+ if (arity <= 1 ) " Tuple1.apply" else (0 until (arity - 1 )).map(n => s " fa._ ${n + 1 }" ).mkString(" (" " , " " , _)"
92+
93+ def `A0, A(N - 1)&` (a : String ): String =
94+ if (arity <= 1 ) s " Tuple1[ $a] " else `A..(N - 1)`.mkString(" (" " , " s " , $a) " )
95+
96+ def `fa._1..(n - 1) & ` (a : String ): String =
97+ if (arity <= 1 ) s " Tuple1( $a) " else (0 until (arity - 1 )).map(n => s " fa._ ${n + 1 }" ).mkString(" (" " , " s " , $a) " )
98+
99+ def `constraints A..N` (c : String ): String = synTypes.map(tpe => s " $tpe: $c[ $tpe] " ).mkString(" (implicit " " , " " )"
100+ def `constraints A..(N-1)` (c : String ): String =
101+ if (arity <= 1 ) " " else `A..(N - 1)`.map(tpe => s " $tpe: $c[ $tpe] " ).mkString(" (implicit " " , " " )"
102+ def `parameters A..(N-1)` (c : String ): String = `A..(N - 1)`.map(tpe => s " $tpe: $c[ $tpe] " ).mkString(" , "
60103 }
61104
62105 trait Template {
63106 def filename (root : File ): File
64107 def content (tv : TemplateVals ): String
65108 def range = 1 to maxArity
66109 def body : String = {
110+ @ tailrec
67111 def expandInstances (contents : IndexedSeq [Array [String ]], acc : Array [String ] = Array .empty): Array [String ] =
68112 if (! contents.exists(_.exists(_.startsWith(" -"
69113 acc.map(_.tail)
@@ -108,8 +152,7 @@ object Boilerplate {
108152 val tpes = synTypes.map { tpe =>
109153 s " F[ $tpe] "
110154 }
111- val tpesString = synTypes.mkString(" , "
112- val params = (synVals.zip(tpes)).map { case (v, t) => s " $v: $t" }.mkString(" , "
155+ val params = synVals.zip(tpes).map { case (v, t) => s " $v: $t" }.mkString(" , "
113156 val next = if (arity + 1 <= maxArity) {
114157 s " def |@|[Z](z: F[Z]) = new SemigroupalBuilder ${arity + 1 }( ${`a..n`}, z) "
115158 } else {
@@ -179,7 +222,7 @@ object Boilerplate {
179222 s " F[ $tpe] "
180223 }
181224 val fargs = (0 until arity).map(" f" + _)
182- val fparams = ( fargs.zip(tpes) ).map { case (v, t) => s " $v: $t" }.mkString(" , "
225+ val fparams = fargs.zip(tpes).map { case (v, t) => s " $v: $t" }.mkString(" , "
183226
184227 val a = arity / 2
185228 val b = arity - a
@@ -258,8 +301,7 @@ object Boilerplate {
258301 s " M[ $tpe] "
259302 }
260303 val fargs = (0 until arity).map(" m" + _)
261- val fparams = (fargs.zip(tpes)).map { case (v, t) => s " $v: $t" }.mkString(" , "
262- val fargsS = fargs.mkString(" , "
304+ val fparams = fargs.zip(tpes).map { case (v, t) => s " $v: $t" }.mkString(" , "
263305 val nestedExpansion = ParallelNestedExpansions (arity)
264306
265307 block """
@@ -291,8 +333,7 @@ object Boilerplate {
291333 s " M[ $tpe] "
292334 }
293335 val fargs = (0 until arity).map(" m" + _)
294- val fparams = (fargs.zip(tpes)).map { case (v, t) => s " $v: $t" }.mkString(" , "
295- val fargsS = fargs.mkString(" , "
336+ val fparams = fargs.zip(tpes).map { case (v, t) => s " $v: $t" }.mkString(" , "
296337 val nestedExpansion = ParallelNestedExpansions (arity)
297338
298339 block """
@@ -324,7 +365,7 @@ object Boilerplate {
324365 s " F[ $tpe] "
325366 }
326367 val fargs = (0 until arity).map(" f" + _)
327- val fparams = ( fargs.zip(tpes) ).map { case (v, t) => s " $v: $t" }.mkString(" , "
368+ val fparams = fargs.zip(tpes).map { case (v, t) => s " $v: $t" }.mkString(" , "
328369 val fargsS = fargs.mkString(" , "
329370
330371 val nestedProducts = (0 until (arity - 2 ))
@@ -392,7 +433,7 @@ object Boilerplate {
392433
393434 val tuple = s " Tuple $arity[ $tpesString] "
394435 val tupleTpe = s " t $arity: $tuple"
395- val tupleArgs = (1 to arity).map { case n => s " t $arity._ $n" } .mkString(" , "
436+ val tupleArgs = (1 to arity).map( n => s " t $arity._ $n" ) .mkString(" , "
396437
397438 val n = if (arity == 1 ) {
398439 " "
@@ -443,7 +484,7 @@ object Boilerplate {
443484
444485 val tuple = s " Tuple $arity[ $tpesString] "
445486 val tupleTpe = s " t $arity: $tuple"
446- val tupleArgs = (1 to arity).map { case n => s " t $arity._ $n" } .mkString(" , "
487+ val tupleArgs = (1 to arity).map( n => s " t $arity._ $n" ) .mkString(" , "
447488
448489 val n = if (arity == 1 ) {
449490 " "
@@ -485,8 +526,6 @@ object Boilerplate {
485526 |package cats
486527 |package syntax
487528 |
488- |
489- |
490529 |trait TupleSemigroupalSyntax {
491530 - implicit def catsSyntaxTuple ${arity}Semigroupal[F[_], ${`A..N`}]( $tupleTpe): Tuple ${arity}SemigroupalOps[F, ${`A..N`}] = new Tuple ${arity}SemigroupalOps(t $arity)
492531 |}
@@ -512,7 +551,6 @@ object Boilerplate {
512551
513552 val tupleTpe = (1 to arity).map(_ => " A" " (" " , " " )"
514553 def listXN (range : Range ) = range.map(" x" + _).mkString(" :: "
515- val reverseXN = listXN(1 to arity - 1 )
516554 val tupleXN = (1 to arity).map(" x" + _).mkString(" (" " , " " )"
517555
518556 block """
@@ -550,7 +588,7 @@ object Boilerplate {
550588 - val (acc, l) = eval.value
551589 - l match {
552590 - case ${listXN(2 to arity)} :: Nil =>
553- - Now(( $tupleXN :: acc, ${listXN(1 to arity - 1 )} :: Nil))
591+ - Now(( $tupleXN :: acc, ${listXN(1 until arity)} :: Nil))
554592 - case l =>
555593 - Now((acc, x1 :: l))
556594 - }
0 commit comments