@@ -20,12 +20,12 @@ object ReuseNodesTest {
20
20
class OriginalTranformr (rules : RewriteRule * ) extends RuleTransformer (rules:_* ) {
21
21
override def transform (ns : Seq [Node ]): Seq [Node ] = {
22
22
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) }
24
24
25
25
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 ))
27
27
}
28
- override def transform (n: Node ): Seq [Node ] = super .transform(n)
28
+ override def transform (n : Node ): Seq [Node ] = super .transform(n)
29
29
}
30
30
31
31
class ModifiedTranformr (rules : RewriteRule * ) extends RuleTransformer (rules:_* ) {
@@ -35,18 +35,18 @@ object ReuseNodesTest {
35
35
if (changed.length != ns.length || changed.zip(ns).exists(p => p._1 != p._2)) changed
36
36
else ns
37
37
}
38
- override def transform (n: Node ): Seq [Node ] = super .transform(n)
38
+ override def transform (n : Node ): Seq [Node ] = super .transform(n)
39
39
}
40
40
41
41
class AlternateTranformr (rules : RewriteRule * ) extends RuleTransformer (rules:_* ) {
42
42
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) }
45
45
46
46
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 ))
48
48
}
49
- override def transform (n: Node ): Seq [Node ] = super .transform(n)
49
+ override def transform (n : Node ): Seq [Node ] = super .transform(n)
50
50
}
51
51
52
52
def rewriteRule = new RewriteRule {
@@ -68,34 +68,33 @@ object ReuseNodesTest {
68
68
class ReuseNodesTest {
69
69
70
70
@ Theory
71
- def transformReferentialEquality (rt: RuleTransformer ) = {
71
+ def transformReferentialEquality (rt : RuleTransformer ) = {
72
72
val original = <p ><lost /></p >
73
73
val tranformed = rt.transform(original)
74
74
assertSame(original, tranformed)
75
75
}
76
76
77
77
@ Theory
78
- def transformReferentialEqualityOnly (rt: RuleTransformer ) = {
78
+ def transformReferentialEqualityOnly (rt : RuleTransformer ) = {
79
79
val original = <changed ><change ><lost /><a ><b ><c /></b ></a ></change ><a ><b ><c /></b ></a ></changed >
80
80
val transformed = rt.transform(original)
81
81
recursiveAssert(original,transformed)
82
82
}
83
83
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 {
86
86
case (x, y) => recursiveAssert(x, y)
87
87
}
88
88
}
89
89
90
- def recursiveAssert (original: Node , transformed: Node ): Unit = {
90
+ def recursiveAssert (original : Node , transformed : Node ): Unit = {
91
91
transformed.label match {
92
92
case " changed" => // do nothing expect this node to be changed
93
93
recursiveAssert(original.child,transformed.child)
94
- case _ => {
94
+ case _ =>
95
95
assertSame(original, transformed)
96
- // No need to check for children, node being immuatable
96
+ // No need to check for children, node being immuatable
97
97
// children can't be different if parents are referentially equal
98
- }
99
98
}
100
99
}
101
100
}
0 commit comments