@@ -20,12 +20,12 @@ object ReuseNodesTest {
2020 class OriginalTranformr (rules : RewriteRule * ) extends RuleTransformer (rules:_* ) {
2121 override def transform (ns : Seq [Node ]): Seq [Node ] = {
2222 val xs = ns.toStream map transform
23- val (xs1, xs2) = xs zip ns span { case (x, n) => unchanged(n, x) }
23+ val (xs1, xs2) = xs. zip(ns). span { case (x, n) => unchanged(n, x) }
2424
2525 if (xs2.isEmpty) ns
26- else ( xs1 map (_._2)) ++ xs2.head._1 ++ transform(ns drop (xs1.length + 1 ))
26+ else xs1. map(_._2) ++ xs2.head._1 ++ transform(ns. drop(xs1.length + 1 ))
2727 }
28- override def transform (n: Node ): Seq [Node ] = super .transform(n)
28+ override def transform (n : Node ): Seq [Node ] = super .transform(n)
2929 }
3030
3131 class ModifiedTranformr (rules : RewriteRule * ) extends RuleTransformer (rules:_* ) {
@@ -35,18 +35,18 @@ object ReuseNodesTest {
3535 if (changed.length != ns.length || changed.zip(ns).exists(p => p._1 != p._2)) changed
3636 else ns
3737 }
38- override def transform (n: Node ): Seq [Node ] = super .transform(n)
38+ override def transform (n : Node ): Seq [Node ] = super .transform(n)
3939 }
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 = ns.toStream. map( transform)
44+ val (xs1, xs2) = xs. zip(ns). span { case (x, n) => unchanged(n, x) }
4545
4646 if (xs2.isEmpty) ns
47- else ( xs1 map (_._2)) ++ xs2.head._1 ++ transform(ns drop (xs1.length + 1 ))
47+ else xs1. map(_._2) ++ xs2.head._1 ++ transform(ns. drop(xs1.length + 1 ))
4848 }
49- override def transform (n: Node ): Seq [Node ] = super .transform(n)
49+ override def transform (n : Node ): Seq [Node ] = super .transform(n)
5050 }
5151
5252 def rewriteRule = new RewriteRule {
@@ -68,34 +68,33 @@ object ReuseNodesTest {
6868class ReuseNodesTest {
6969
7070 @ Theory
71- def transformReferentialEquality (rt: RuleTransformer ) = {
71+ def transformReferentialEquality (rt : RuleTransformer ) = {
7272 val original = <p ><lost /></p >
7373 val tranformed = rt.transform(original)
7474 assertSame(original, tranformed)
7575 }
7676
7777 @ Theory
78- def transformReferentialEqualityOnly (rt: RuleTransformer ) = {
78+ def transformReferentialEqualityOnly (rt : RuleTransformer ) = {
7979 val original = <changed ><change ><lost /><a ><b ><c /></b ></a ></change ><a ><b ><c /></b ></a ></changed >
8080 val transformed = rt.transform(original)
8181 recursiveAssert(original,transformed)
8282 }
8383
84- def recursiveAssert (original: Seq [Node ], transformed: Seq [Node ]): Unit = {
85- original zip transformed foreach {
84+ def recursiveAssert (original : Seq [Node ], transformed : Seq [Node ]): Unit = {
85+ original. zip( transformed). foreach {
8686 case (x, y) => recursiveAssert(x, y)
8787 }
8888 }
8989
90- def recursiveAssert (original: Node , transformed: Node ): Unit = {
90+ def recursiveAssert (original : Node , transformed : Node ): Unit = {
9191 transformed.label match {
9292 case " changed" => // do nothing expect this node to be changed
9393 recursiveAssert(original.child,transformed.child)
94- case _ => {
94+ case _ =>
9595 assertSame(original, transformed)
96- // No need to check for children, node being immuatable
96+ // No need to check for children, node being immuatable
9797 // children can't be different if parents are referentially equal
98- }
9998 }
10099 }
101100}
0 commit comments