IdentityMap

org.beangle.commons.collection.IdentityMap
final class IdentityMap[K <: AnyRef, V](capacity: Int)

Similar to java.util.IdentityHashMap,but using chaining bucket But do not support null key and null value(not thread safe)

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any

Members list

Type members

Classlikes

class Entry[K, V](val key: K, var value: V, var next: Entry[K, V])

Attributes

Supertypes
class Object
trait Matchable
class Any
class EntryIterator[K, V](table: Array[Entry[K, V]])

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
class KeyIterator[K]
class KeyIterator[K](table: Array[Entry[K, V]]) extends EntryIterator[K, V], Iterator[K]

Attributes

Supertypes
trait Iterator[K]
trait IterableOnceOps[K, Iterator, Iterator[K]]
trait IterableOnce[K]
class EntryIterator[K, V]
class Object
trait Matchable
class Any
Show all

Value members

Concrete methods

def clear(): Unit
def contains(key: K): Boolean
final def get(key: K): V
def keysIterator: Iterator[K]
def put(key: K, value: V): Boolean
def remove(key: K): V
def size(): Int