CollisionProofHashMap

scala.collection.mutable.CollisionProofHashMap
See theCollisionProofHashMap companion class

This object provides a set of operations to create Iterable values.

Attributes

Companion
class
Source
CollisionProofHashMap.scala
Graph
Supertypes
Self type

Members list

Type members

Classlikes

sealed abstract class Node

Attributes

Source
CollisionProofHashMap.scala
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class RBNode[K, V]
final class RBNode[K, V](var key: K, var hash: Int, var value: V, var red: Boolean, var left: RBNode[K, V], var right: RBNode[K, V], var parent: RBNode[K, V]) extends Node

Attributes

Source
CollisionProofHashMap.scala
Supertypes
class Node
class Object
trait Matchable
class Any

Value members

Concrete methods

The default initial capacity for the hash table

The default initial capacity for the hash table

Attributes

Source
CollisionProofHashMap.scala

The default load factor for the hash table

The default load factor for the hash table

Attributes

Source
CollisionProofHashMap.scala
def empty[K : Ordering, V]: CollisionProofHashMap[K, V]

Attributes

Source
CollisionProofHashMap.scala
def from[K : Ordering, V](it: IterableOnce[(K, V)]): CollisionProofHashMap[K, V]

Attributes

Source
CollisionProofHashMap.scala
def newBuilder[K : Ordering, V]: Builder[(K, V), CollisionProofHashMap[K, V]]

Attributes

Source
CollisionProofHashMap.scala
def newBuilder[K : Ordering, V](initialCapacity: Int, loadFactor: Double): Builder[(K, V), CollisionProofHashMap[K, V]]

Attributes

Source
CollisionProofHashMap.scala

Inherited methods

def apply[K : Ordering, V](elems: (K, V)*): CollisionProofHashMap[K, V]

Attributes

Inherited from:
SortedMapFactory
Source
Factory.scala

Implicits

Inherited implicits

implicit def sortedMapFactory[K : Ordering, V]: Factory[(K, V), CollisionProofHashMap[K, V]]

Attributes

Inherited from:
SortedMapFactory
Source
Factory.scala