@@ -19,8 +19,8 @@ object ReuseNodesTest {
1919
2020 class OriginalTranformr (rules : RewriteRule * ) extends RuleTransformer (rules:_* ) {
2121 override def transform (ns : Seq [Node ]): Seq [Node ] = {
22- val xs = ns.toStream map transform
23- val (xs1, xs2) = xs.zip(ns).span { case (x, n) => unchanged(n, x) }
22+ val xs : Seq [ Seq [ Node ]] = ns.toStream map transform
23+ val (xs1 : Seq [( Seq [ Node ], Node )], xs2 : Seq [( Seq [ Node ], Node )] ) = xs.zip(ns).span { case (x, n) => unchanged(n, x) }
2424
2525 if (xs2.isEmpty) ns
2626 else xs1.map(_._2) ++ xs2.head._1 ++ transform(ns.drop(xs1.length + 1 ))
@@ -30,7 +30,7 @@ object ReuseNodesTest {
3030
3131 class ModifiedTranformr (rules : RewriteRule * ) extends RuleTransformer (rules:_* ) {
3232 override def transform (ns : Seq [Node ]): Seq [Node ] = {
33- val changed = ns flatMap transform
33+ val changed : Seq [ Node ] = ns flatMap transform
3434
3535 if (changed.length != ns.length || changed.zip(ns).exists(p => p._1 != p._2)) changed
3636 else ns
@@ -40,16 +40,16 @@ object ReuseNodesTest {
4040
4141 class AlternateTranformr (rules : RewriteRule * ) extends RuleTransformer (rules:_* ) {
4242 override def transform (ns : Seq [Node ]): Seq [Node ] = {
43- val xs = ns.toStream.map(transform)
44- val (xs1, xs2) = xs.zip(ns).span { case (x, n) => unchanged(n, x) }
43+ val xs : Seq [ Seq [ Node ]] = ns.toStream.map(transform)
44+ val (xs1 : Seq [( Seq [ Node ], Node )], xs2 : Seq [( Seq [ Node ], Node )] ) = xs.zip(ns).span { case (x, n) => unchanged(n, x) }
4545
4646 if (xs2.isEmpty) ns
4747 else xs1.map(_._2) ++ xs2.head._1 ++ transform(ns.drop(xs1.length + 1 ))
4848 }
4949 override def transform (n : Node ): Seq [Node ] = super .transform(n)
5050 }
5151
52- def rewriteRule = new RewriteRule {
52+ def rewriteRule : RewriteRule = new RewriteRule {
5353 override def transform (n : Node ): NodeSeq = n match {
5454 case n if n.label == " change" => Elem (
5555 n.prefix, " changed" , n.attributes, n.scope, n.child.isEmpty, n.child : _* )
@@ -58,7 +58,7 @@ object ReuseNodesTest {
5858 }
5959
6060 @ DataPoints
61- def tranformers () = Array (
61+ def tranformers (): Array [ RuleTransformer ] = Array (
6262 new OriginalTranformr (rewriteRule),
6363 new ModifiedTranformr (rewriteRule),
6464 new AlternateTranformr (rewriteRule))
@@ -68,16 +68,16 @@ object ReuseNodesTest {
6868class ReuseNodesTest {
6969
7070 @ Theory
71- def transformReferentialEquality (rt : RuleTransformer ) = {
72- val original = <p ><lost /></p >
73- val tranformed = rt.transform(original)
71+ def transformReferentialEquality (rt : RuleTransformer ): Unit = {
72+ val original : Elem = <p ><lost /></p >
73+ val tranformed : Seq [ Node ] = rt.transform(original)
7474 assertSame(original, tranformed)
7575 }
7676
7777 @ Theory
78- def transformReferentialEqualityOnly (rt : RuleTransformer ) = {
79- val original = <changed ><change ><lost /><a ><b ><c /></b ></a ></change ><a ><b ><c /></b ></a ></changed >
80- val transformed = rt.transform(original)
78+ def transformReferentialEqualityOnly (rt : RuleTransformer ): Unit = {
79+ val original : Elem = <changed ><change ><lost /><a ><b ><c /></b ></a ></change ><a ><b ><c /></b ></a ></changed >
80+ val transformed : Seq [ Node ] = rt.transform(original)
8181 recursiveAssert(original,transformed)
8282 }
8383
0 commit comments