CollisionProofHashMap

This object provides a set of operations to create mutable.CollisionProofHashMap values.

trait SortedMapFactory[[K, V] =>> CollisionProofHashMap[K, V]]
class Object
trait Matchable
class Any

Type members

Classlikes

sealed abstract class Node
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

Value members

Concrete methods

The default initial capacity for the hash table

The default load factor for the hash table

def empty[K, V](`evidence$2`: Ordering[K]): CollisionProofHashMap[K, V]
def from[K, V](it: IterableOnce[(K, V)])(`evidence$1`: Ordering[K]): CollisionProofHashMap[K, V]
def newBuilder[K, V](`evidence$3`: Ordering[K]): Builder[(K, V), CollisionProofHashMap[K, V]]
def newBuilder[K, V](initialCapacity: Int, loadFactor: Double)(`evidence$4`: Ordering[K]): Builder[(K, V), CollisionProofHashMap[K, V]]

Inherited methods

def apply[K, V](elems: (K, V)*)(`evidence$28`: Ordering[K]): CollisionProofHashMap[K, V]
Inherited from
SortedMapFactory
Source
Factory.scala

Implicits

Inherited implicits

implicit def sortedMapFactory[K, V](`evidence$30`: Ordering[K]): Factory[(K, V), CollisionProofHashMap[K, V]]
Inherited from
SortedMapFactory
Source
Factory.scala