removed debug code (revert r17767 and r17780)

2 files changed, 1 insertions, 51 deletions

diff --git a/src/library/scala/collection/mutable/HashTable.scala b/src/library/scala/collection/mutable/HashTable.scala
index 56843013ad..77211f41b4 100644
--- a/src/library/scala/collection/mutable/HashTable.scala
+++ b/src/library/scala/collection/mutable/HashTable.scala
@@ -146,7 +146,7 @@ trait HashTable[A] extends AnyRef {
   private def newThreshold(size: Int) =
     ((size.toLong * loadFactor)/loadFactorDenum).toInt
 
-  /* debug NoSuchElementException private*/ protected def resize(newSize: Int) = {
+  private def resize(newSize: Int) = {
     val oldTable = table
     table = new Array(newSize)
     var i = oldTable.length - 1
diff --git a/src/library/scala/collection/mutable/LinkedHashMap.scala b/src/library/scala/collection/mutable/LinkedHashMap.scala
index c43a3ee2f4..fb19a7e84e 100644
--- a/src/library/scala/collection/mutable/LinkedHashMap.scala
+++ b/src/library/scala/collection/mutable/LinkedHashMap.scala
@@ -111,54 +111,4 @@ class LinkedHashMap[A, B] extends Map[A, B]
     super[HashTable].clear()
     firstEntry = null
   }
-
-  // debug NoSuchElementException in Pickler
-  var previousTables: List[(String, Int)] = Nil
-
-  override protected def resize(newSize: Int) {
-    previousTables = (tableString(table), table.length) :: previousTables
-    super.resize(newSize)
-    // check consistency
-    for (i <- 0 until table.length) {
-      var e = table(i)
-      while (e != null) {
-        if (index(e.key.hashCode()) != i) {
-          println("INCONSISTENT entry at "+ i +" after resize. before:")
-          println("index before: "+ indx(e.key.hashCode(), previousTables.head._2))
-          println(previousTables.head._1)
-          println("AFTER:")
-          println("index after: "+ index(e.key.hashCode()))
-          println(tableString(table))
-        }
-        e = e.next
-      }
-    }
-  }
-
-  def tableString(table: Array[HashEntry[A, Entry]]): String = {
-    val sb = new StringBuilder
-    for (i <- 0 until table.length) {
-      sb.append(""+ i +": ")
-      var e = table(i).asInstanceOf[Entry]
-      while (e != null) {
-        sb.append("("+ (try { e.key.toString } catch { case _ => "<..>"}) +" -> "+ e.value +"), ")
-        e = e.next
-      }
-      sb.append("\n")
-    }
-    sb.toString
-  }
-
-  def indx(hash: Int, length: Int) = improve(hash) & (length - 1)
-  def printHashTable(notFoundHash: Int) {
-    println("Hash not found: "+ notFoundHash)
-    println("hashtables")
-    for (tb <- previousTables.reverse) {
-      println("with index: "+ indx(notFoundHash, tb._2))
-      println(tb._1)
-      println(" ==> RESIZE, then:")
-    }
-    println("with index: "+ index(notFoundHash))
-    println(tableString(table))
-  }
 }