summaryrefslogtreecommitdiff
path: root/src/library/scala/collection/jcl/IdentityHashMap.scala
diff options
context:
space:
mode:
Diffstat (limited to 'src/library/scala/collection/jcl/IdentityHashMap.scala')
-rw-r--r--src/library/scala/collection/jcl/IdentityHashMap.scala24
1 files changed, 0 insertions, 24 deletions
diff --git a/src/library/scala/collection/jcl/IdentityHashMap.scala b/src/library/scala/collection/jcl/IdentityHashMap.scala
deleted file mode 100644
index d8ee237777..0000000000
--- a/src/library/scala/collection/jcl/IdentityHashMap.scala
+++ /dev/null
@@ -1,24 +0,0 @@
-/* __ *\
-** ________ ___ / / ___ Scala API **
-** / __/ __// _ | / / / _ | (c) 2006-2009, LAMP/EPFL **
-** __\ \/ /__/ __ |/ /__/ __ | http://www.scala-lang.org/ **
-** /____/\___/_/ |_/____/_/ | | **
-** |/ **
-\* */
-
-// $Id$
-
-package scala.collection.jcl
-
-/** A map that is backed by a Java identity hash map, which compares keys
- * by their reference-based identity as opposed to using equals and hashCode.
- * An identity hash map will often perform better than traditional hash map
- * because it can utilize linear probing.
- *
- * @author Sean McDirmid
- */
-class IdentityHashMap[K, E](override val underlying : java.util.IdentityHashMap[K, E]) extends MapWrapper[K, E] {
- def this() = this(new java.util.IdentityHashMap[K, E])
- override def clone: IdentityHashMap[K, E] =
- new IdentityHashMap[K, E](underlying.clone().asInstanceOf[java.util.IdentityHashMap[K, E]])
-}