1 files changed, 17 insertions, 17 deletions
diff --git a/test/files/scalacheck/parallel-collections/ParallelHashMapCheck.scala b/test/files/scalacheck/parallel-collections/ParallelHashMapCheck.scala
index 061bb08d9b..9299a201a1 100644
--- a/test/files/scalacheck/parallel-collections/ParallelHashMapCheck.scala
+++ b/test/files/scalacheck/parallel-collections/ParallelHashMapCheck.scala
@@ -64,23 +64,23 @@ with PairValues[Int, Int]
   }
 
   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 {
-          println("Does not contain original element: " + (k, v))
-          false
-        }
-      }).foldLeft(true)(_ && _)
-
-
-      if (invs.isEmpty) containsall
-      else {
-        println("Invariants broken:\n" + invs.mkString("\n"))
-        false
-      }
+    // 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 {
+    //       println("Does not contain original element: " + (k, v))
+    //       false
+    //     }
+    //   }).foldLeft(true)(_ && _)
+
+
+    //   if (invs.isEmpty) containsall
+    //   else {
+    //     println("Invariants broken:\n" + invs.mkString("\n"))
+    //     false
+    //   }
     case _ => true
   }