1 files changed, 13 insertions, 13 deletions
diff --git a/test/files/scalacheck/parallel-collections/ParallelHashMapCheck.scala b/test/files/scalacheck/parallel-collections/ParallelHashMapCheck.scala
index 9299a201a1..0152b1b435 100644
--- a/test/files/scalacheck/parallel-collections/ParallelHashMapCheck.scala
+++ b/test/files/scalacheck/parallel-collections/ParallelHashMapCheck.scala
@@ -17,20 +17,20 @@ import scala.collection.parallel.ops._
 abstract class ParallelHashMapCheck[K, V](tp: String) extends ParallelMapCheck[K, V]("mutable.ParHashMap[" + tp + "]") {
   // ForkJoinTasks.defaultForkJoinPool.setMaximumPoolSize(Runtime.getRuntime.availableProcessors * 2)
   // ForkJoinTasks.defaultForkJoinPool.setParallelism(Runtime.getRuntime.availableProcessors * 2)
-
+  
   type CollType = ParHashMap[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 hm = new mutable.HashMap[K, V]
     val gen = vals(rnd.nextInt(vals.size))
     for (i <- 0 until sz) hm += sample(gen)
     hm
   }
-
+  
   def fromTraversable(t: Traversable[(K, V)]) = {
     val phm = new ParHashMap[K, V]
     var i = 0
@@ -40,7 +40,7 @@ abstract class ParallelHashMapCheck[K, V](tp: String) extends ParallelMapCheck[K
     }
     phm
   }
-
+  
 }
 
 
@@ -51,22 +51,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: ParHashMap[k, v] =>
       println("Mutable parallel hash map\n" + pm.hashTableContents.debugInformation)
     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 {
@@ -74,8 +74,8 @@ with PairValues[Int, Int]
     //       false
     //     }
     //   }).foldLeft(true)(_ && _)
-
-
+      
+      
     //   if (invs.isEmpty) containsall
     //   else {
     //     println("Invariants broken:\n" + invs.mkString("\n"))
@@ -83,7 +83,7 @@ with PairValues[Int, Int]
     //   }
     case _ => true
   }
-
+  
 }