1 files changed, 13 insertions, 13 deletions
diff --git a/test/files/scalacheck/parallel-collections/ParallelCtrieCheck.scala b/test/files/scalacheck/parallel-collections/ParallelCtrieCheck.scala
index e141c398fd..b952704af2 100644
--- a/test/files/scalacheck/parallel-collections/ParallelCtrieCheck.scala
+++ b/test/files/scalacheck/parallel-collections/ParallelCtrieCheck.scala
@@ -18,20 +18,20 @@ import scala.collection.parallel.ops._
 abstract class ParallelConcurrentTrieMapCheck[K, V](tp: String) extends ParallelMapCheck[K, V]("mutable.ParConcurrentTrieMap[" + tp + "]") {
   // ForkJoinTasks.defaultForkJoinPool.setMaximumPoolSize(Runtime.getRuntime.availableProcessors * 2)
   // ForkJoinTasks.defaultForkJoinPool.setParallelism(Runtime.getRuntime.availableProcessors * 2)
-  
+
   type CollType = ParTrieMap[K, V]
-  
+
   def isCheckingViews = false
-  
+
   def hasStrictOrder = false
 
-  def ofSize(vals: Seq[Gen[(K, V)]], sz: Int) = {  
+  def ofSize(vals: Seq[Gen[(K, V)]], sz: Int) = {
     val ct = new concurrent.TrieMap[K, V]
     val gen = vals(rnd.nextInt(vals.size))
     for (i <- 0 until sz) ct += sample(gen)
     ct
   }
-  
+
   def fromTraversable(t: Traversable[(K, V)]) = {
     val pct = new ParTrieMap[K, V]
     var i = 0
@@ -41,7 +41,7 @@ abstract class ParallelConcurrentTrieMapCheck[K, V](tp: String) extends Parallel
     }
     pct
   }
-  
+
 }
 
 
@@ -52,22 +52,22 @@ with PairValues[Int, Int]
   def intvalues = new IntValues {}
   def kvalues = intvalues.values
   def vvalues = intvalues.values
-  
+
   val intoperators = new IntOperators {}
   def voperators = intoperators
   def koperators = intoperators
-  
+
   override def printDataStructureDebugInfo(ds: AnyRef) = ds match {
     case pm: ParTrieMap[k, v] =>
       println("Mutable parallel ctrie")
     case _ =>
       println("could not match data structure type: " + ds.getClass)
   }
-  
+
   override def checkDataStructureInvariants(orig: Traversable[(Int, Int)], ds: AnyRef) = ds match {
     // case pm: ParHashMap[k, v] if 1 == 0 => // disabled this to make tests faster
     //   val invs = pm.brokenInvariants
-      
+
     //   val containsall = (for ((k, v) <- orig) yield {
     //     if (pm.asInstanceOf[ParHashMap[Int, Int]].get(k) == Some(v)) true
     //     else {
@@ -75,8 +75,8 @@ with PairValues[Int, Int]
     //       false
     //     }
     //   }).foldLeft(true)(_ && _)
-      
-      
+
+
     //   if (invs.isEmpty) containsall
     //   else {
     //     println("Invariants broken:\n" + invs.mkString("\n"))
@@ -84,7 +84,7 @@ with PairValues[Int, Int]
     //   }
     case _ => true
   }
-  
+
 }