Scaladoc for scala.collection.mutable.OpenHashMap

Inherited

Hide All
Show all

Map
MapLike
Cloneable
Shrinkable
Builder
Growable
Map
MapLike
Subtractable
PartialFunction
Function1
Iterable
Iterable
IterableLike
Equals
Traversable
Mutable
Traversable
GenericTraversableTemplate
TraversableLike
TraversableOnce
FilterMonadic
HasNewBuilder
AnyRef
Any

Visibility

Public
All

Instance constructors

new OpenHashMap()

A default constructor creates a hashmap with initial size 8.

A default constructor creates a hashmap with initial size 8.
new OpenHashMap(initialSize: Int)

Type Members

class DefaultKeySet extends Set[A]

The implementation class of the set returned by keySet.
class DefaultValuesIterable extends Iterable[B]

The implementation class of the iterable returned by values.
type Entry = OpenEntry[Key, Value]
type Self = OpenHashMap[Key, Value]

The type implementing this traversable

The type implementing this traversable
attributes: protected
definition classes: TraversableLike
class WithFilter extends FilterMonadic[A, Repr]

A class supporting filtered operations.

Value Members

def !=(arg0: AnyRef): Boolean

attributes: final
definition classes: AnyRef
def !=(arg0: Any): Boolean

o != arg0 is the same as !(o == (arg0)).

o != arg0 is the same as !(o == (arg0)).
arg0
the object to compare against this object for dis-equality.
returns
false if the receiver object is equivalent to the argument; true otherwise.
attributes: final
definition classes: Any
def ##(): Int

attributes: final
definition classes: AnyRef → Any
def $asInstanceOf[T0](): T0

attributes: final
definition classes: AnyRef
def $isInstanceOf[T0](): Boolean

attributes: final
definition classes: AnyRef
def +[B1 >: Value](elem1: (Key, B1), elem2: (Key, B1), elems: (Key, B1)*): Map[Key, B1]

Creates a new map containing two or more key/value mappings and all the key/value mappings of this map.

Creates a new map containing two or more key/value mappings and all the key/value mappings of this map.
Specified mappings will override existing mappings from this map with the same keys.
B1
the type of the added values
elem1
the first element to add.
elem2
the second element to add.
elems
the remaining elements to add.
returns
a new map containing mappings of this map and two or more specified mappings.
definition classes: MapLike → MapLike
def +[B1 >: Value](kv: (Key, B1)): Map[Key, B1]

Creates a new map containing a new key/value mapping and all the key/value mappings of this map.

Creates a new map containing a new key/value mapping and all the key/value mappings of this map.
Mapping kv will override existing mappings from this map with the same key.
B1
the type of the value in the key/value pair.
kv
the key/value mapping to be added
returns
a new map containing mappings of this map and the mapping kv.
definition classes: MapLike → MapLike
def ++[B1 >: Value](xs: TraversableOnce[(Key, B1)]): Map[Key, B1]

Creates a new map containing the key/value mappings provided by the specified traversable object and all the key/value mappings of this map.

Creates a new map containing the key/value mappings provided by the specified traversable object and all the key/value mappings of this map.
Note that existing mappings from this map with the same key as those in xs will be overriden.
B1
the type of the added values
xs
the traversable object.
returns
a new map containing mappings of this map and those provided by xs.
definition classes: MapLike → MapLike
def ++(that: TraversableOnce[(Key, Value)]): OpenHashMap[(Key, Value)]

[use case] Concatenates this open hash map with the elements of a traversable collection.

[use case]
Concatenates this open hash map with the elements of a traversable collection.
that
the traversable to append.
returns
a new open hash map which contains all elements of this open hash map followed by all elements of that.
attributes: abstract
def ++[B >: (Key, Value), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], B, That]): That

Concatenates this open hash map with the elements of a traversable collection.

Concatenates this open hash map with the elements of a traversable collection.
B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
that
the traversable to append.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That which contains all elements of this open hash map followed by all elements of that.
definition classes: TraversableLike
def ++=(xs: TraversableOnce[(Key, Value)]): Growable[(Key, Value)]

adds all elements produced by a TraversableOnce to this open hash map.

adds all elements produced by a TraversableOnce to this open hash map.
returns
the open hash map itself.
definition classes: Growable
def +=(kv: (Key, Value)): OpenHashMap[Key, Value]

Adds a new key/value pair to this map.

Adds a new key/value pair to this map. If the map already contains a mapping for the key, it will be overridden by the new value.
kv
the key/value pair.
returns
the map itself
definition classes: OpenHashMap → MapLike → Builder → Growable
def +=(elem1: (Key, Value), elem2: (Key, Value), elems: (Key, Value)*): Growable[(Key, Value)]

adds two or more elements to this open hash map.

adds two or more elements to this open hash map.
elem1
the first element to add.
elem2
the second element to add.
elems
the remaining elements to add.
returns
the open hash map itself
definition classes: Growable
def -(elem1: Key, elem2: Key, elems: Key*): OpenHashMap[Key, Value]

Creates a new map with all the key/value mappings of this map except mappings with keys equal to any of the two or more specified keys.

Creates a new map with all the key/value mappings of this map except mappings with keys equal to any of the two or more specified keys.
elem1
the first element to remove.
elem2
the second element to remove.
elems
the remaining elements to remove.
returns
a new map containing all the mappings of this map except mappings with a key equal to elem1, elem2 or any of elems.
definition classes: MapLike → Subtractable
def -(key: Key): OpenHashMap[Key, Value]

Creates a new map with all the key/value mappings of this map except the key/value mapping with the specified key.

Creates a new map with all the key/value mappings of this map except the key/value mapping with the specified key.
key
the key to be removed
returns
a new map with all the mappings of this map except that with a key key.
definition classes: MapLike → MapLike → Subtractable
def --(xs: TraversableOnce[Key]): OpenHashMap[Key, Value]

Creates a new map with all the key/value mappings of this map except mappings with keys equal to any of those provided by the specified traversable object.

Creates a new map with all the key/value mappings of this map except mappings with keys equal to any of those provided by the specified traversable object.
xs
the traversable object.
returns
a new map with all the key/value mappings of this map except mappings with a key equal to a key from xs.
definition classes: MapLike → Subtractable
def --=(xs: TraversableOnce[Key]): Shrinkable[Key]

Removes all elements produced by an iterator from this open hash map.

Removes all elements produced by an iterator from this open hash map.
returns
the open hash map itself
definition classes: Shrinkable
def -=(key: Key): OpenHashMap[Key, Value]

Removes a key from this map.

Removes a key from this map.
key
the key to be removed
returns
the map itself.
definition classes: OpenHashMap → MapLike → Shrinkable
def -=(elem1: Key, elem2: Key, elems: Key*): Shrinkable[Key]

Removes two or more elements from this open hash map.

Removes two or more elements from this open hash map.
elem1
the first element to remove.
elem2
the second element to remove.
elems
the remaining elements to remove.
returns
the open hash map itself
definition classes: Shrinkable
def /:[B](z: B)(op: (B, (Key, Value)) ⇒ B): B

Applies a binary operator to a start value and all elements of this open hash map, going left to right.
Applies a binary operator to a start value and all elements of this open hash map, going left to right.
Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this open hash map, going left to right with the start value z on the left: op(...op(op(z, x₁), x₂), ..., x_n) where x,,1,,, ..., x,,n,, are the elements of this open hash map.
definition classes: TraversableOnce
def :\[B](z: B)(op: ((Key, Value), B) ⇒ B): B

Applies a binary operator to all elements of this open hash map and a start value, going right to left.
Applies a binary operator to all elements of this open hash map and a start value, going right to left.
Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
B
the result type of the binary operator.
z
the start value
op
the binary operator
returns
the result of inserting op between consecutive elements of this open hash map, going right to left with the start value z on the right: op(x₁, op(x₂, ... op(x_n, z)...)) where x,,1,,, ..., x,,n,, are the elements of this open hash map.
definition classes: TraversableOnce
def ==(arg0: AnyRef): Boolean

o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).
arg0
the object to compare against this object for equality.
returns
true if the receiver object is equivalent to the argument; false otherwise.
attributes: final
definition classes: AnyRef
def ==(arg0: Any): Boolean

o == arg0 is the same as o.equals(arg0).

o == arg0 is the same as o.equals(arg0).
arg0
the object to compare against this object for equality.
returns
true if the receiver object is equivalent to the argument; false otherwise.
attributes: final
definition classes: Any
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

Appends all bindings of this map to a string builder using start, end, and separator strings.

Appends all bindings of this map to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations of all bindings of this map in the form of key -> value are separated by the string sep.
b
the builder to which strings are appended.
start
the starting string.
sep
the separator string.
end
the ending string.
returns
the string builder b to which elements were appended.
definition classes: MapLike → TraversableOnce
def addString(b: StringBuilder): StringBuilder

Appends all elements of this open hash map to a string builder.

Appends all elements of this open hash map to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this open hash map without any separator string.
b
the string builder to which elements are appended.
returns
the string builder b to which elements were appended.
definition classes: TraversableOnce
def addString(b: StringBuilder, sep: String): StringBuilder

Appends all elements of this open hash map to a string builder using a separator string.

Appends all elements of this open hash map to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this open hash map, separated by the string sep.
b
the string builder to which elements are appended.
sep
the separator string.
returns
the string builder b to which elements were appended.
definition classes: TraversableOnce
def andThen[C](k: (Value) ⇒ C): PartialFunction[Key, C]

Composes this partial function with a transformation function that gets applied to results of this partial function.

Composes this partial function with a transformation function that gets applied to results of this partial function.
C
the result type of the transformation function.
k
the transformation function
returns
a partial function with the same domain as this partial function, which maps arguments x to k(this(x)).
definition classes: PartialFunction → Function1
def apply(key: Key): Value

Retrieves the value which is associated with the given key.

Retrieves the value which is associated with the given key. This method invokes the default method of the map if there is no mapping from the given key to a value. Unless overridden, the default method throws a NoSuchElementException.
key
the key
returns
the value associated with the given key, or the result of the map's default method, if none exists.
definition classes: MapLike → Function1
def asInstanceOf[T0]: T0

This method is used to cast the receiver object to be of type T0.

This method is used to cast the receiver object to be of type T0.
Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expressionList(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.
returns
the receiver object.
attributes: final
definition classes: Any
def canEqual(that: Any): Boolean

Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.
that
The object with which this open hash map should be compared
returns
true, if this open hash map can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.
definition classes: IterableLike → Equals
def clear(): Unit

Removes all bindings from the map.

Removes all bindings from the map. After this operation has completed, the map will be empty.
definition classes: MapLike → Builder → Growable
def clone(): OpenHashMap[Key, Value]

This method creates and returns a copy of the receiver object.

This method creates and returns a copy of the receiver object.
The default implementation of the clone method is platform dependent.
returns
a copy of the receiver object.
definition classes: OpenHashMap → MapLike → Cloneable → AnyRef
def collect[B](pf: PartialFunction[(Key, Value), B]): OpenHashMap[B]

[use case] Builds a new collection by applying a partial function to all elements of this open hash map on which the function is defined.

[use case]
Builds a new collection by applying a partial function to all elements of this open hash map on which the function is defined.
B
the element type of the returned collection.
pf
the partial function which filters and maps the open hash map.
returns
a new open hash map resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.
attributes: abstract
def collect[B, That](pf: PartialFunction[(Key, Value), B])(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], B, That]): That

Builds a new collection by applying a partial function to all elements of this open hash map on which the function is defined.

Builds a new collection by applying a partial function to all elements of this open hash map on which the function is defined.
B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
pf
the partial function which filters and maps the open hash map.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.
definition classes: TraversableLike
def companion: GenericCompanion[Iterable[A][A]]

The factory companion object that builds instances of class OpenHashMap.

The factory companion object that builds instances of class OpenHashMap.
definition classes: Iterable → Iterable → Traversable → Traversable → GenericTraversableTemplate
def compose[A](g: (A) ⇒ Key): (A) ⇒ Value

(f compose g)(x) == f(g(x))

(f compose g)(x) == f(g(x))
definition classes: Function1
def contains(key: Key): Boolean

Tests whether this map contains a binding for a key.

Tests whether this map contains a binding for a key.
key
the key
returns
true if there is a binding for key in this map, false otherwise.
definition classes: MapLike
def copyToArray(xs: Array[(Key, Value)], start: Int, len: Int): Unit

[use case] Copies elements of this open hash map to an array.

[use case]
Copies elements of this open hash map to an array. Fills the given array xs with at most len elements of this open hash map, starting at position start. Copying will stop once either the end of the current open hash map is reached, or the end of the array is reached, or len elements have been copied.
xs
the array to fill.
start
the starting index.
len
the maximal number of elements to copy.
attributes: abstract
def copyToArray[B >: (Key, Value)](xs: Array[B], start: Int, len: Int): Unit

Copies elements of this open hash map to an array.

Copies elements of this open hash map to an array. Fills the given array xs with at most len elements of this open hash map, starting at position start. Copying will stop once either the end of the current open hash map is reached, or the end of the array is reached, or len elements have been copied.
B
the type of the elements of the array.
xs
the array to fill.
start
the starting index.
len
the maximal number of elements to copy.
definition classes: IterableLike → TraversableLike → TraversableOnce
def copyToArray(xs: Array[(Key, Value)]): Unit

[use case] Copies values of this open hash map to an array.

[use case]
Copies values of this open hash map to an array. Fills the given array xs with values of this open hash map. Copying will stop once either the end of the current open hash map is reached, or the end of the array is reached.
xs
the array to fill.
attributes: abstract
def copyToArray[B >: (Key, Value)](xs: Array[B]): Unit

Copies values of this open hash map to an array.

Copies values of this open hash map to an array. Fills the given array xs with values of this open hash map. Copying will stop once either the end of the current open hash map is reached, or the end of the array is reached.
B
the type of the elements of the array.
xs
the array to fill.
definition classes: TraversableOnce
def copyToArray(xs: Array[(Key, Value)], start: Int): Unit

[use case] Copies values of this open hash map to an array.

[use case]
Copies values of this open hash map to an array. Fills the given array xs with values of this open hash map, after skipping start values. Copying will stop once either the end of the current open hash map is reached, or the end of the array is reached.
xs
the array to fill.
start
the starting index.
attributes: abstract
def copyToArray[B >: (Key, Value)](xs: Array[B], start: Int): Unit

Copies values of this open hash map to an array.

Copies values of this open hash map to an array. Fills the given array xs with values of this open hash map, after skipping start values. Copying will stop once either the end of the current open hash map is reached, or the end of the array is reached.
B
the type of the elements of the array.
xs
the array to fill.
start
the starting index.
definition classes: TraversableOnce
def copyToBuffer[B >: (Key, Value)](dest: Buffer[B]): Unit

Copies all elements of this open hash map to a buffer.

Copies all elements of this open hash map to a buffer.
dest
The buffer to which elements are copied.
definition classes: TraversableOnce
def count(p: ((Key, Value)) ⇒ Boolean): Int

Counts the number of elements in the open hash map which satisfy a predicate.

Counts the number of elements in the open hash map which satisfy a predicate.
p
the predicate used to test elements.
returns
the number of elements satisfying the predicate p.
definition classes: TraversableOnce
def default(key: Key): Value

Defines the default value computation for the map, returned when a key is not found The method implemented here throws an exception, but it might be overridden in subclasses.

Defines the default value computation for the map, returned when a key is not found The method implemented here throws an exception, but it might be overridden in subclasses.
key
the given key value for which a binding is missing.
definition classes: MapLike
def drop(n: Int): OpenHashMap[Key, Value]

Selects all elements except first n ones.

Selects all elements except first n ones.
Note: might return different results for different runs, unless the underlying collection type is ordered.
n
the number of elements to drop from this open hash map.
returns
a open hash map consisting of all elements of this open hash map except the first n ones, or else the empty open hash map, if this open hash map has less than n elements.
definition classes: TraversableLike
def dropRight(n: Int): OpenHashMap[Key, Value]

Selects all elements except last n ones.

Selects all elements except last n ones.
Note: might return different results for different runs, unless the underlying collection type is ordered.
n
The number of elements to take
returns
a open hash map consisting of all elements of this open hash map except the first n ones, or else the empty open hash map, if this open hash map has less than n elements.
definition classes: IterableLike
def dropWhile(p: ((Key, Value)) ⇒ Boolean): OpenHashMap[Key, Value]

Drops longest prefix of elements that satisfy a predicate.

Drops longest prefix of elements that satisfy a predicate.
Note: might return different results for different runs, unless the underlying collection type is ordered.
p
The predicate used to test elements.
returns
the longest suffix of this open hash map whose first element does not satisfy the predicate p.
definition classes: TraversableLike
def elements: Iterator[(Key, Value)]
definition classes: IterableLike
1. use iterator' instead
def empty: OpenHashMap[Key, Value]

The empty map of the same type as this map

The empty map of the same type as this map
returns
an empty map of type This.
definition classes: OpenHashMap → Map → Map → MapLike
def eq(arg0: AnyRef): Boolean

This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

This method is used to test whether the argument (arg0) is a reference to the receiver object (this).
The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on non-null instances of AnyRef: * It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true. * It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and only if y.eq(x) returns true. * It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true and y.eq(z) returns true, then x.eq(z) returns true.
Additionally, the eq method has three other properties. * It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false. * For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false. * null.eq(null) returns true.
When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).
arg0
the object to compare against this object for reference equality.
returns
true if the argument is a reference to the receiver object; false otherwise.
attributes: final
definition classes: AnyRef
def equals(that: Any): Boolean

Compares two maps structurally; i.

Compares two maps structurally; i.e. checks if all mappings contained in this map are also contained in the other map, and vice versa.
that
the other map
returns
true if both maps contain exactly the same mappings, false otherwise.
definition classes: MapLike → Equals → AnyRef → Any
def exists(p: ((Key, Value)) ⇒ Boolean): Boolean

Tests whether a predicate holds for some of the elements of this open hash map.

Tests whether a predicate holds for some of the elements of this open hash map.
p
the predicate used to test elements.
returns
true if the given predicate p holds for some of the elements of this open hash map, otherwise false.
definition classes: IterableLike → TraversableLike → TraversableOnce
def filter(p: ((Key, Value)) ⇒ Boolean): OpenHashMap[Key, Value]

Selects all elements of this open hash map which satisfy a predicate.

Selects all elements of this open hash map which satisfy a predicate.
p
the predicate used to test elements.
returns
a new open hash map consisting of all elements of this open hash map that satisfy the given predicate p. The order of the elements is preserved.
definition classes: TraversableLike
def filterKeys(p: (Key) ⇒ Boolean): Map[Key, Value]

Filters this map by retaining only keys satisfying a predicate.

Filters this map by retaining only keys satisfying a predicate.
p
the predicate used to test keys
returns
an immutable map consisting only of those key value pairs of this map where the key satisfies the predicate p. The resulting map wraps the original map without copying any elements.
definition classes: MapLike
def filterNot(p: ((Key, Value)) ⇒ Boolean): OpenHashMap[Key, Value]

Returns a new map with all key/value pairs for which the predicate p returns true.

Returns a new map with all key/value pairs for which the predicate p returns true.
Note: This method works by successively removing elements fro which the predicate is false from this set. If removal is slow, or you expect that most elements of the set will be removed, you might consider using filter with a negated predicate instead.
p
A predicate over key-value pairs
returns
A new map containing elements not satisfying the predicate.
definition classes: MapLike → TraversableLike
def finalize(): Unit

This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.
The details of when and if the finalize method are invoked, as well as the interaction between finalizeand non-local returns and exceptions, are all platform dependent.
attributes: protected
definition classes: AnyRef
def find(p: ((Key, Value)) ⇒ Boolean): Option[(Key, Value)]

Finds the first element of the open hash map satisfying a predicate, if any.

Finds the first element of the open hash map satisfying a predicate, if any.
Note: might return different results for different runs, unless the underlying collection type is ordered.
p
the predicate used to test elements.
returns
an option value containing the first element in the open hash map that satisfies p, or None if none exists.
definition classes: IterableLike → TraversableLike → TraversableOnce
def first: (Key, Value)
definition classes: IterableLike
1. use head' instead
def firstOption: Option[(Key, Value)]

None if iterable is empty.
None if iterable is empty.
definition classes: IterableLike
1. use headOption' instead
def flatMap[B](f: ((Key, Value)) ⇒ Traversable[B]): OpenHashMap[B]

[use case] Builds a new collection by applying a function to all elements of this open hash map and concatenating the results.

[use case]
Builds a new collection by applying a function to all elements of this open hash map and concatenating the results.
B
the element type of the returned collection.
f
the function to apply to each element.
returns
a new open hash map resulting from applying the given collection-valued function f to each element of this open hash map and concatenating the results.
attributes: abstract
def flatMap[B, That](f: ((Key, Value)) ⇒ Traversable[B])(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], B, That]): That

Builds a new collection by applying a function to all elements of this open hash map and concatenating the results.

Builds a new collection by applying a function to all elements of this open hash map and concatenating the results.
B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
f
the function to apply to each element.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That resulting from applying the given collection-valued function f to each element of this open hash map and concatenating the results.
definition classes: TraversableLike → FilterMonadic
def flatten[B]: OpenHashMap[B]

[use case] Converts this open hash map of traversable collections into a open hash map in which all element collections are concatenated.

[use case]
Converts this open hash map of traversable collections into a open hash map in which all element collections are concatenated.
B
the type of the elements of each traversable collection.
returns
a new open hash map resulting from concatenating all element open hash maps.
attributes: abstract
def flatten[B](implicit asTraversable: ((Key, Value)) ⇒ Traversable[B]): Iterable[B]

Converts this open hash map of traversable collections into a open hash map in which all element collections are concatenated.

Converts this open hash map of traversable collections into a open hash map in which all element collections are concatenated.
B
the type of the elements of each traversable collection.
asTraversable
an implicit conversion which asserts that the element type of this open hash map is a Traversable.
returns
a new open hash map resulting from concatenating all element open hash maps.
definition classes: GenericTraversableTemplate
def foldLeft[B](z: B)(op: (B, (Key, Value)) ⇒ B): B

Applies a binary operator to a start value and all elements of this open hash map, going left to right.
Applies a binary operator to a start value and all elements of this open hash map, going left to right.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this open hash map, going left to right with the start value z on the left: op(...op(z, x₁), x₂, ..., x_n) where x,,1,,, ..., x,,n,, are the elements of this open hash map.
definition classes: TraversableOnce
def foldRight[B](z: B)(op: ((Key, Value), B) ⇒ B): B

Applies a binary operator to all elements of this open hash map and a start value, going right to left.
Applies a binary operator to all elements of this open hash map and a start value, going right to left.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this open hash map, going right to left with the start value z on the right: op(x₁, op(x₂, ... op(x_n, z)...)) where x,,1,,, ..., x,,n,, are the elements of this open hash map.
definition classes: IterableLike → TraversableOnce
def forall(p: ((Key, Value)) ⇒ Boolean): Boolean

Tests whether a predicate holds for all elements of this open hash map.

Tests whether a predicate holds for all elements of this open hash map.
p
the predicate used to test elements.
returns
true if the given predicate p holds for all elements of this open hash map, otherwise false.
definition classes: IterableLike → TraversableLike → TraversableOnce
def foreach[U](f: ((Key, Value)) ⇒ U): Unit

Loop over the key, value mappings of this map.
Loop over the key, value mappings of this map.
The behaviour of modifying the map during an iteration is as follows:
- Deleting a mapping is always permitted.
- Changing the value of mapping which is already present is permitted.
- Anything else is not permitted. It will usually, but not always, throw an exception.
U
The return type of the specified function f, return result of which is ignored.
f
The function to apply to each key, value mapping.
definition classes: OpenHashMap → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → FilterMonadic
def genericBuilder[B]: Builder[B, Iterable[B]]

The generic builder that builds instances of OpenHashMap at arbitrary element types.

The generic builder that builds instances of OpenHashMap at arbitrary element types.
definition classes: GenericTraversableTemplate
def get(key: Key): Option[Value]

Optionally returns the value associated with a key.

Optionally returns the value associated with a key.
key
the key value
returns
an option value containing the value associated with key in this map, or None if none exists.
definition classes: OpenHashMap → MapLike
def getClass(): java.lang.Class[_ <: java.lang.Object]

Returns a representation that corresponds to the dynamic class of the receiver object.

Returns a representation that corresponds to the dynamic class of the receiver object.
The nature of the representation is platform dependent.
returns
a representation that corresponds to the dynamic class of the receiver object.
attributes: final
definition classes: AnyRef
def getOrElse(key: Key, default: ⇒ Value): Value

[use case] Returns the value associated with a key, or a default value if the key is not contained in the map.

[use case]
Returns the value associated with a key, or a default value if the key is not contained in the map.
key
the key.
default
a computation that yields a default value in case no binding for key is found in the map.
returns
the value associated with key if it exists, otherwise the result of the default computation.
attributes: abstract
def getOrElse[B1 >: Value](key: Key, default: ⇒ B1): B1

Returns the value associated with a key, or a default value if the key is not contained in the map.

Returns the value associated with a key, or a default value if the key is not contained in the map.
B1
the result type of the default computation.
key
the key.
default
a computation that yields a default value in case no binding for key is found in the map.
returns
the value associated with key if it exists, otherwise the result of the default computation.
definition classes: MapLike
def getOrElseUpdate(key: Key, op: ⇒ Value): Value

If given key is already in this map, returns associated value.

If given key is already in this map, returns associated value.
Otherwise, computes value from given expression op, stores with key in map and returns that value.
key
the key to test
op
the computation yielding the value to associate with key, if key is previously unbound.
returns
the value associated with key (either previously or as a result of executing the method).
definition classes: MapLike
def groupBy[K](f: ((Key, Value)) ⇒ K): Map[K, OpenHashMap[Key, Value]]

Partitions this open hash map into a map of open hash maps according to some discriminator function.
Partitions this open hash map into a map of open hash maps according to some discriminator function.
Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new open hash map.
K
the type of keys returned by the discriminator function.
f
the discriminator function.
returns
A map from keys to open hash maps such that the following invariant holds: (xs partition f)(k) = xs filter (x => f(x) == k) That is, every key k is bound to a open hash map of those elements x for which f(x) equals k.
definition classes: TraversableLike
def grouped(size: Int): Iterator[OpenHashMap[Key, Value]]

Partitions elements in fixed size open hash maps.
Partitions elements in fixed size open hash maps.
size
the number of elements per group
returns
An iterator producing open hash maps of size size, except the last will be truncated if the elements don't divide evenly.
definition classes: IterableLike
1. Iterator#grouped
def hasDefiniteSize: Boolean

Tests whether this open hash map is known to have a finite size.

Tests whether this open hash map is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.
Note: many collection methods will not work on collections of infinite sizes.
returns
true if this collection is known to have finite size, false otherwise.
definition classes: TraversableLike → TraversableOnce
def hashCode(): Int

Returns a hash code value for the object.

Returns a hash code value for the object.
The default hashing algorithm is platform dependent.
Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.
returns
the hash code value for the object.
definition classes: MapLike → AnyRef → Any
def hashOf(key: Key): Int

Returns a mangled hash code of the provided key.

Returns a mangled hash code of the provided key.
attributes: protected
def head: (Key, Value)

Selects the first element of this open hash map.

Selects the first element of this open hash map.
Note: might return different results for different runs, unless the underlying collection type is ordered.
returns
the first element of this open hash map.
definition classes: IterableLike → TraversableLike
def headOption: Option[(Key, Value)]

Optionally selects the first element.

Optionally selects the first element.
Note: might return different results for different runs, unless the underlying collection type is ordered.
returns
the first element of this open hash map if it is nonempty, None if it is empty.
definition classes: TraversableLike
def init: OpenHashMap[Key, Value]

Selects all elements except the last.

Selects all elements except the last.
Note: might return different results for different runs, unless the underlying collection type is ordered.
returns
a open hash map consisting of all elements of this open hash map except the last one.
definition classes: TraversableLike
def isDefinedAt(key: Key): Boolean

Tests whether this map contains a binding for a key.

Tests whether this map contains a binding for a key. This method, which implements an abstract method of trait PartialFunction, is equivalent to contains.
key
the key
returns
true if there is a binding for key in this map, false otherwise.
definition classes: MapLike → PartialFunction
def isEmpty: Boolean

Tests whether the map is empty.

Tests whether the map is empty.
returns
true if the map does not contain any key/value binding, false otherwise.
definition classes: MapLike → IterableLike → TraversableLike → TraversableOnce
def isInstanceOf[T0]: Boolean

This method is used to test whether the dynamic type of the receiver object is T0.

This method is used to test whether the dynamic type of the receiver object is T0.
Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.
returns
true if the receiver object is an instance of erasure of type T0; false otherwise.
attributes: final
definition classes: Any
def isTraversableAgain: Boolean

Tests whether this open hash map can be repeatedly traversed.

Tests whether this open hash map can be repeatedly traversed.
returns
true
attributes: final
definition classes: TraversableLike → TraversableOnce
def iterator: Iterator[(Key, Value)]

An iterator over the elements of this map.

An iterator over the elements of this map. Use of this iterator follows the same contract for concurrent modification as the foreach method.
returns
the iterator
definition classes: OpenHashMap → MapLike → IterableLike
def keySet: Set[Key]

Collects all keys of this map in a set.

Collects all keys of this map in a set.
returns
a set containing all keys of this map.
definition classes: MapLike
def keys: Iterable[Key]

Creates an iterator for all keys.

Creates an iterator for all keys.
returns
an iterator over all keys.
definition classes: MapLike
def keysIterator: Iterator[Key]

Creates an iterator for all keys.

Creates an iterator for all keys.
returns
an iterator over all keys.
definition classes: MapLike
def last: (Key, Value)

Selects the last element.

Selects the last element.
Note: might return different results for different runs, unless the underlying collection type is ordered.
returns
the first element of this open hash map.
definition classes: TraversableLike
def lastOption: Option[(Key, Value)]

Optionally selects the last element.

Optionally selects the last element.
Note: might return different results for different runs, unless the underlying collection type is ordered.
returns
the last element of this open hash map$ if it is nonempty, None if it is empty.
definition classes: TraversableLike
def lift: (Key) ⇒ Option[Value]

Turns this partial function into an plain function returning an Option result.

Turns this partial function into an plain function returning an Option result.
returns
a function that takes an argument x to Some(this(x)) if this is defined for x, and to None otherwise.
definition classes: PartialFunction
def map[B](f: ((Key, Value)) ⇒ B): OpenHashMap[B]

[use case] Builds a new collection by applying a function to all elements of this open hash map.

[use case]
Builds a new collection by applying a function to all elements of this open hash map.
B
the element type of the returned collection.
f
the function to apply to each element.
returns
a new open hash map resulting from applying the given function f to each element of this open hash map and collecting the results.
attributes: abstract
def map[B, That](f: ((Key, Value)) ⇒ B)(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], B, That]): That

Builds a new collection by applying a function to all elements of this open hash map.

Builds a new collection by applying a function to all elements of this open hash map.
B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
f
the function to apply to each element.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That resulting from applying the given function f to each element of this open hash map and collecting the results.
definition classes: TraversableLike → FilterMonadic
def mapElements[C](f: (Value) ⇒ C): Map[Key, C]
definition classes: MapLike
1. use mapValues' instead
def mapResult[NewTo](f: (OpenHashMap[Key, Value]) ⇒ NewTo): Builder[(Key, Value), NewTo]

Creates a new builder by applying a transformation function to the results of this builder.

Creates a new builder by applying a transformation function to the results of this builder.
NewTo
the type of collection returned by f.
f
the transformation function.
returns
a new builder which is the same as the current builder except that a transformation function is applied to this builder's result.
definition classes: Builder
def mapValues[C](f: (Value) ⇒ C): Map[Key, C]

Transforms this map by applying a function to every retrieved value.

Transforms this map by applying a function to every retrieved value.
f
the function used to transform values of this map.
returns
a map view which maps every key of this map to f(this(key)). The resulting map wraps the original map without copying any elements.
definition classes: MapLike
def max: (Key, Value)

[use case] Finds the largest element.

[use case]
Finds the largest element.
returns
the largest element of this open hash map.
attributes: abstract
def max[B >: (Key, Value)](implicit cmp: Ordering[B]): (Key, Value)

Finds the largest element.

Finds the largest element.
B
The type over which the ordering is defined.
cmp
An ordering to be used for comparing elements.
returns
the largest element of this open hash map with respect to the ordering cmp.
definition classes: TraversableOnce
def min: (Key, Value)

[use case] Finds the smallest element.

[use case]
Finds the smallest element.
returns
the smallest element of this open hash map
attributes: abstract
def min[B >: (Key, Value)](implicit cmp: Ordering[B]): (Key, Value)

Finds the smallest element.

Finds the smallest element.
B
The type over which the ordering is defined.
cmp
An ordering to be used for comparing elements.
returns
the smallest element of this open hash map with respect to the ordering cmp.
definition classes: TraversableOnce
def mkString: String

Displays all elements of this open hash map in a string.

Displays all elements of this open hash map in a string.
returns
a string representation of this open hash map. In the resulting string the string representations (w.r.t. the method toString) of all elements of this open hash map follow each other without any separator string.
definition classes: TraversableOnce
def mkString(sep: String): String

Displays all elements of this open hash map in a string using a separator string.

Displays all elements of this open hash map in a string using a separator string.
sep
the separator string.
returns
a string representation of this open hash map. In the resulting string the string representations (w.r.t. the method toString) of all elements of this open hash map are separated by the string sep.
definition classes: TraversableOnce
def mkString(start: String, sep: String, end: String): String

Displays all elements of this open hash map in a string using start, end, and separator strings.

Displays all elements of this open hash map in a string using start, end, and separator strings.
start
the starting string.
sep
the separator string.
end
the ending string.
returns
a string representation of this open hash map. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this open hash map are separated by the string sep.
definition classes: TraversableOnce
def ne(arg0: AnyRef): Boolean

o.ne(arg0) is the same as !(o.eq(arg0)).

o.ne(arg0) is the same as !(o.eq(arg0)).
arg0
the object to compare against this object for reference dis-equality.
returns
false if the argument is not a reference to the receiver object; true otherwise.
attributes: final
definition classes: AnyRef
def newBuilder: Builder[(Key, Value), OpenHashMap[Key, Value]]

A common implementation of newBuilder for all mutable maps in terms of empty.

A common implementation of newBuilder for all mutable maps in terms of empty.
Overrides MapLike implementation for better efficiency.
attributes: protected[this]
definition classes: MapLike → MapLike → TraversableLike → HasNewBuilder
def nonEmpty: Boolean

Tests whether the open hash map is not empty.

Tests whether the open hash map is not empty.
returns
true if the open hash map contains at least one element, false otherwise.
definition classes: TraversableOnce
def notify(): Unit

Wakes up a single thread that is waiting on the receiver object's monitor.

Wakes up a single thread that is waiting on the receiver object's monitor.
attributes: final
definition classes: AnyRef
def notifyAll(): Unit

Wakes up all threads that are waiting on the receiver object's monitor.

Wakes up all threads that are waiting on the receiver object's monitor.
attributes: final
definition classes: AnyRef
def orElse[A1 <: Key, B1 >: Value](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.

Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.
A1
the argument type of the fallback function
B1
the result type of the fallback function
that
the fallback function
returns
a partial function which has as domain the union of the domains of this partial function and that. The resulting partial function takes x to this(x) where this is defined, and to that(x) where it is not.
definition classes: PartialFunction
def partition(p: ((Key, Value)) ⇒ Boolean): (OpenHashMap[Key, Value], OpenHashMap[Key, Value])

Partitions this open hash map in two open hash maps according to a predicate.

Partitions this open hash map in two open hash maps according to a predicate.
p
the predicate on which to partition.
returns
a pair of open hash maps: the first open hash map consists of all elements that satisfy the predicate p and the second open hash map consists of all elements that don't. The relative order of the elements in the resulting open hash maps is the same as in the original open hash map.
definition classes: TraversableLike
def product: Int

[use case] Multiplies up the elements of this collection.

[use case]
Multiplies up the elements of this collection.
returns
the product of all elements in this open hash map of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the open hash map and as result type of product. Examples of such types are: Long, Float, Double, BigInt.
attributes: abstract
def product[B >: (Key, Value)](implicit num: Numeric[B]): B

Multiplies up the elements of this collection.

Multiplies up the elements of this collection.
B
the result type of the * operator.
num
an implicit parameter defining a set of numeric operations which includes the * operator to be used in forming the product.
returns
the product of all elements of this open hash map with respect to the * operator in num.
definition classes: TraversableOnce
def projection: IterableView[(Key, Value), OpenHashMap[Key, Value]]

returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection.
returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection.
definition classes: IterableLike
1. use view' instead
def put(key: Key, value: Value): Option[Value]

Adds a new key/value pair to this map and optionally returns previously bound value.

Adds a new key/value pair to this map and optionally returns previously bound value. If the map already contains a mapping for the key, it will be overridden by the new value.
key
the key to update
value
the new value
returns
an option value containing the value associated with the key before the put operation was executed, or None if key was not defined in the map before.
definition classes: OpenHashMap → MapLike
def reduceLeft[B >: (Key, Value)](op: (B, (Key, Value)) ⇒ B): B

Applies a binary operator to all elements of this open hash map, going left to right.
Applies a binary operator to all elements of this open hash map, going left to right.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
B
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this open hash map, going left to right: op(...(op(x₁, x₂), ... ) , x_n) where x,,1,,, ..., x,,n,, are the elements of this open hash map.
definition classes: TraversableOnce
def reduceLeftOption[B >: (Key, Value)](op: (B, (Key, Value)) ⇒ B): Option[B]

Optionally applies a binary operator to all elements of this open hash map, going left to right.

Optionally applies a binary operator to all elements of this open hash map, going left to right.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
B
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceLeft(op) is this open hash map is nonempty, None otherwise.
definition classes: TraversableOnce
def reduceRight[B >: (Key, Value)](op: ((Key, Value), B) ⇒ B): B

Applies a binary operator to all elements of this open hash map, going right to left.
Applies a binary operator to all elements of this open hash map, going right to left.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
B
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this open hash map, going right to left: op(x₁, op(x₂, ..., op(x_n-1, x_n)...)) where x,,1,,, ..., x,,n,, are the elements of this open hash map.
definition classes: IterableLike → TraversableOnce
def reduceRightOption[B >: (Key, Value)](op: ((Key, Value), B) ⇒ B): Option[B]

Optionally applies a binary operator to all elements of this open hash map, going right to left.

Optionally applies a binary operator to all elements of this open hash map, going right to left.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
B
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceRight(op) is this open hash map is nonempty, None otherwise.
definition classes: TraversableOnce
def remove(key: Key): Option[Value]

Removes a key from this map, returning the value associated previously with that key as an option.

Removes a key from this map, returning the value associated previously with that key as an option.
key
the key to be removed
returns
an option value containing the value associated previously with key, or None if key was not defined in the map before.
definition classes: OpenHashMap → MapLike
def removeKey(key: Key): Option[Value]

If given key is defined in this map, remove it and return associated value as an Option.
If given key is defined in this map, remove it and return associated value as an Option. If key is not present return None.
key
the key to be removed
definition classes: MapLike
1. Use remove' instead
def repr: OpenHashMap[Key, Value]

The collection of type open hash map underlying this TraversableLike object.

The collection of type open hash map underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.
definition classes: TraversableLike
def result(): OpenHashMap[Key, Value]

The result when this map is used as a builder

The result when this map is used as a builder
returns
the map representation itself.
definition classes: MapLike → Builder
def retain(f: (Key, Value) ⇒ Boolean): OpenHashMap[Key, Value]

Retains only those mappings for which the predicate p returns true.

Retains only those mappings for which the predicate p returns true.
definition classes: OpenHashMap → MapLike
def reversed: List[(Key, Value)]

attributes: protected[this]
definition classes: TraversableOnce
def sameElements(that: Iterable[(Key, Value)]): Boolean

[use case] Checks if the other iterable collection contains the same elements in the same order as this open hash map.

[use case]
Checks if the other iterable collection contains the same elements in the same order as this open hash map.
that
the collection to compare with.
returns
true, if both collections contain the same elements in the same order, false otherwise.
attributes: abstract
def sameElements[B >: (Key, Value)](that: Iterable[B]): Boolean

Checks if the other iterable collection contains the same elements in the same order as this open hash map.

Checks if the other iterable collection contains the same elements in the same order as this open hash map.
Note: might return different results for different runs, unless the underlying collection type is ordered.
B
the type of the elements of collection that.
that
the collection to compare with.
returns
true, if both collections contain the same elements in the same order, false otherwise.
definition classes: IterableLike
def scanLeft[B, That](z: B)(op: (B, (Key, Value)) ⇒ B)(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], B, That]): That

Produces a collection containing cummulative results of applying the operator going left to right.

Produces a collection containing cummulative results of applying the operator going left to right.
Note: might return different results for different runs, unless the underlying collection type is ordered.
B
the type of the elements in the resulting collection
That
the actual type of the resulting collection
z
the initial value
op
the binary operator applied to the intermediate result and the element
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
collection with intermediate results
definition classes: TraversableLike
def scanRight[B, That](z: B)(op: ((Key, Value), B) ⇒ B)(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], B, That]): That

Produces a collection containing cummulative results of applying the operator going right to left.

Produces a collection containing cummulative results of applying the operator going right to left.
Note: might return different results for different runs, unless the underlying collection type is ordered.
B
the type of the elements in the resulting collection
That
the actual type of the resulting collection
z
the initial value
op
the binary operator applied to the intermediate result and the element
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
collection with intermediate results
definition classes: TraversableLike
def size: Int

The size of this open hash map.

The size of this open hash map.
returns
the number of elements in this open hash map.
definition classes: OpenHashMap → TraversableOnce
def sizeHint(coll: scala.collection.TraversableLike[_, _], delta: Int = 0): Unit

Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta.

Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta. This will provide a hint only if the collection is known to have a cheap size method. Currently this is assumed ot be the case if and only if the collection is of type IndexedSeqLike. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.
coll
the collection which serves as a hint for the result's size.
delta
a correction to add to the coll.size to produce the size hint.
definition classes: Builder
def sizeHint(size: Int): Unit

Gives a hint how many elements are expected to be added when the next result is called.

Gives a hint how many elements are expected to be added when the next result is called. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.
size
the hint how many elements will be added.
definition classes: Builder
def sizeHintBounded(size: Int, boundingColl: scala.collection.TraversableLike[_, _]): Unit

Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection.

Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.
size
the hint how many elements will be added.
boundingColl
the bounding collection. If it is an IndexedSeqLike, then sizes larger than collection's size are reduced.
definition classes: Builder
def slice(from: Int, until: Int): OpenHashMap[Key, Value]

Selects an interval of elements.

Selects an interval of elements.
Note: c.slice(from, to) is equivalent to (but possibly more efficient than) c.drop(from).take(to - from)
Note: might return different results for different runs, unless the underlying collection type is ordered.
from
the index of the first returned element in this open hash map.
until
the index one past the last returned element in this open hash map.
returns
a open hash map containing the elements starting at index from and extending up to (but not including) index until of this open hash map.
definition classes: IterableLike → TraversableLike
def sliding[B >: (Key, Value)](size: Int, step: Int): Iterator[OpenHashMap[Key, Value]]

definition classes: IterableLike
def sliding[B >: (Key, Value)](size: Int): Iterator[OpenHashMap[Key, Value]]

Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)
size
the number of elements per group
returns
An iterator producing open hash maps of size size, except the last will be truncated if the elements don't divide evenly.
definition classes: IterableLike
1. Iterator#sliding
def span(p: ((Key, Value)) ⇒ Boolean): (OpenHashMap[Key, Value], OpenHashMap[Key, Value])

Splits this open hash map into a prefix/suffix pair according to a predicate.

Splits this open hash map into a prefix/suffix pair according to a predicate.
Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects.
Note: might return different results for different runs, unless the underlying collection type is ordered.
p
the test predicate
returns
a pair consisting of the longest prefix of this open hash map whose elements all satisfy p, and the rest of this open hash map.
definition classes: TraversableLike
def splitAt(n: Int): (OpenHashMap[Key, Value], OpenHashMap[Key, Value])

Splits this open hash map into two at a given position.

Splits this open hash map into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).
Note: might return different results for different runs, unless the underlying collection type is ordered.
n
the position at which to split.
returns
a pair of open hash maps consisting of the first n elements of this open hash map, and the other elements.
definition classes: TraversableLike
def stringPrefix: String

Defines the prefix of this object's toString representation.

Defines the prefix of this object's toString representation.
returns
a string representation which starts the result of toString applied to this open hash map. Unless overridden in subclasses, the string prefix of every map is "Map".
definition classes: OpenHashMap → MapLike → TraversableLike
def sum: Int

[use case] Sums up the elements of this collection.

[use case]
Sums up the elements of this collection.
returns
the sum of all elements in this open hash map of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the open hash map and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.
attributes: abstract
def sum[B >: (Key, Value)](implicit num: Numeric[B]): B

Sums up the elements of this collection.

Sums up the elements of this collection.
B
the result type of the + operator.
num
an implicit parameter defining a set of numeric operations which includes the + operator to be used in forming the sum.
returns
the sum of all elements of this open hash map with respect to the + operator in num.
definition classes: TraversableOnce
def synchronized[T0](arg0: T0): T0

attributes: final
definition classes: AnyRef
def tail: OpenHashMap[Key, Value]

Selects all elements except the first.

Selects all elements except the first.
Note: might return different results for different runs, unless the underlying collection type is ordered.
returns
a open hash map consisting of all elements of this open hash map except the first one.
definition classes: TraversableLike
def take(n: Int): OpenHashMap[Key, Value]

Selects first n elements.

Selects first n elements.
Note: might return different results for different runs, unless the underlying collection type is ordered.
n
Tt number of elements to take from this open hash map.
returns
a open hash map consisting only of the first n elements of this open hash map, or else the whole open hash map, if it has less than n elements.
definition classes: IterableLike → TraversableLike
def takeRight(n: Int): OpenHashMap[Key, Value]

Selects last n elements.

Selects last n elements.
Note: might return different results for different runs, unless the underlying collection type is ordered.
n
the number of elements to take
returns
a open hash map consisting only of the last n elements of this open hash map, or else the whole open hash map, if it has less than n elements.
definition classes: IterableLike
def takeWhile(p: ((Key, Value)) ⇒ Boolean): OpenHashMap[Key, Value]

Takes longest prefix of elements that satisfy a predicate.

Takes longest prefix of elements that satisfy a predicate.
Note: might return different results for different runs, unless the underlying collection type is ordered.
p
The predicate used to test elements.
returns
the longest prefix of this open hash map whose elements all satisfy the predicate p.
definition classes: IterableLike → TraversableLike
def thisCollection: Iterable[(Key, Value)]

The underlying collection seen as an instance of OpenHashMap.

The underlying collection seen as an instance of OpenHashMap. By default this is implemented as the current collection object itself, but this can be overridden.
attributes: protected[this]
definition classes: IterableLike → TraversableLike
def toArray: Array[(Key, Value)]

[use case] Converts this open hash map to an array.

[use case]
Converts this open hash map to an array.
returns
an array containing all elements of this open hash map. A ClassManifest must be available for the element type of this open hash map.
attributes: abstract
def toArray[B >: (Key, Value)](implicit arg0: ClassManifest[B]): Array[B]

Converts this open hash map to an array.

Converts this open hash map to an array.
B
the type of the elements of the array. A ClassManifest for this type must be available.
returns
an array containing all elements of this open hash map.
definition classes: TraversableOnce
def toBuffer[B >: (Key, Value)]: Buffer[B]

Converts this open hash map to a mutable buffer.

Converts this open hash map to a mutable buffer.
returns
a buffer containing all elements of this open hash map.
definition classes: TraversableOnce
def toCollection(repr: OpenHashMap[Key, Value]): Iterable[(Key, Value)]

A conversion from collections of type Repr to OpenHashMap objects.

A conversion from collections of type Repr to OpenHashMap objects. By default this is implemented as just a cast, but this can be overridden.
attributes: protected[this]
definition classes: IterableLike → TraversableLike
def toIndexedSeq[B >: (Key, Value)]: IndexedSeq[B]

Converts this open hash map to an indexed sequence.

Converts this open hash map to an indexed sequence.
returns
an indexed sequence containing all elements of this open hash map.
definition classes: TraversableOnce
def toIterable: Iterable[(Key, Value)]

Converts this open hash map to an iterable collection.

Converts this open hash map to an iterable collection. Note that the choice of target Iterable must be lazy as this TraversableOnce may be lazy and unevaluated.
returns
an Iterable containing all elements of this open hash map.
definition classes: IterableLike → TraversableOnce
def toIterator: Iterator[(Key, Value)]

Returns an Iterator over the elements in this open hash map.

Returns an Iterator over the elements in this open hash map. Will return the same Iterator if this instance is already an Iterator.
returns
an Iterator containing all elements of this open hash map.
definition classes: TraversableLike → TraversableOnce
def toList: List[(Key, Value)]

Converts this open hash map to a list.

Converts this open hash map to a list.
returns
a list containing all elements of this open hash map.
definition classes: TraversableOnce
def toMap[T, U](implicit ev: <:<[(Key, Value), (T, U)]): Map[T, U]

Converts this open hash map to a map.

Converts this open hash map to a map. This method is unavailable unless the elements are members of Tuple2, each ((K, V)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.
returns
a map containing all elements of this open hash map.
definition classes: TraversableOnce
def toSeq: Seq[(Key, Value)]

Converts this open hash map to a sequence.

Converts this open hash map to a sequence. As with toIterable, it must be lazy.
returns
a sequence containing all elements of this open hash map.
definition classes: TraversableOnce
def toSet[B >: (Key, Value)]: Set[B]

Converts this open hash map to a set.

Converts this open hash map to a set.
returns
a set containing all elements of this open hash map.
definition classes: TraversableOnce
def toStream: Stream[(Key, Value)]

Converts this open hash map to a stream.

Converts this open hash map to a stream.
returns
a stream containing all elements of this open hash map.
definition classes: IterableLike → TraversableLike → TraversableOnce
def toString(): String

Converts this open hash map to a string.

Converts this open hash map to a string.
returns
a string representation of this collection. By default this string consists of the stringPrefix of this open hash map, followed by all elements separated by commas and enclosed in parentheses.
definition classes: MapLike → TraversableLike → Function1 → AnyRef → Any
def toTraversable: Traversable[(Key, Value)]

Converts this open hash map to an unspecified Traversable.

Converts this open hash map to an unspecified Traversable. Will return the same collection if this instance is already Traversable.
returns
a Traversable containing all elements of this open hash map.
definition classes: TraversableLike → TraversableOnce
def transform(f: (Key, Value) ⇒ Value): OpenHashMap[Key, Value]

Applies a transformation function to all values contained in this map.

Applies a transformation function to all values contained in this map. The transformation function produces new values from existing keys associated values.
f
the transformation to apply
returns
the map itself.
definition classes: OpenHashMap → MapLike
def transpose[B](implicit asTraversable: ((Key, Value)) ⇒ Traversable[B]): Iterable[Iterable[B]]

Transposes this open hash map of traversable collections into a open hash map of open hash maps.

Transposes this open hash map of traversable collections into a open hash map of open hash maps.
B
the type of the elements of each traversable collection.
asTraversable
an implicit conversion which asserts that the element type of this open hash map is a Traversable.
returns
a two-dimensional open hash map of open hash maps which has as nth row the nth column of this open hash map.
definition classes: GenericTraversableTemplate
def unzip[A1, A2](implicit asPair: ((Key, Value)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

Converts this open hash map of pairs into two collections of the first and second halfs of each pair.

Converts this open hash map of pairs into two collections of the first and second halfs of each pair.
asPair
an implicit conversion which asserts that the element type of this open hash map is a pair.
returns
a pair open hash maps, containing the first, respectively second half of each element pair of this open hash map.
definition classes: GenericTraversableTemplate
def update(key: Key, value: Value): Unit

Adds a new key/value pair to this map.

Adds a new key/value pair to this map. If the map already contains a mapping for the key, it will be overridden by the new value.
key
The key to update
value
The new value
definition classes: OpenHashMap → MapLike
def updated[B1 >: Value](key: Key, value: B1): Map[Key, B1]

Creates a new map consisting of all key/value pairs of the current map plus a new pair of a given key and value.

Creates a new map consisting of all key/value pairs of the current map plus a new pair of a given key and value.
B1
the type of the added value
key
The key to add
value
The new value
returns
A fresh immutable map with the binding from key to value added to this map.
definition classes: MapLike → MapLike
def values: Iterable[Value]

Collects all values of this map in an iterable collection.

Collects all values of this map in an iterable collection.
returns
the values of this map as an iterable.
definition classes: MapLike
def valuesIterator: Iterator[Value]

Creates an iterator for all values in this map.

Creates an iterator for all values in this map.
returns
an iterator over all values that are associated with some key in this map.
definition classes: MapLike
def view(from: Int, until: Int): IterableView[(Key, Value), OpenHashMap[Key, Value]]

Creates a non-strict view of a slice of this open hash map.

Creates a non-strict view of a slice of this open hash map.
Note: the difference between view and slice is that view produces a view of the current open hash map, whereas slice produces a new open hash map.
Note: view(from, to) is equivalent to view.slice(from, to)
Note: might return different results for different runs, unless the underlying collection type is ordered.
from
the index of the first element of the view
until
the index of the element following the view
returns
a non-strict view of a slice of this open hash map, starting at index from and extending up to (but not including) index until.
definition classes: IterableLike → TraversableLike
def view: IterableView[(Key, Value), OpenHashMap[Key, Value]]

Creates a non-strict view of this open hash map.

Creates a non-strict view of this open hash map.
returns
a non-strict view of this open hash map.
definition classes: IterableLike → TraversableLike
def wait(): Unit

attributes: final
definition classes: AnyRef
def wait(arg0: Long, arg1: Int): Unit

attributes: final
definition classes: AnyRef
def wait(arg0: Long): Unit

attributes: final
definition classes: AnyRef
def withFilter(p: ((Key, Value)) ⇒ Boolean): FilterMonadic[(Key, Value), OpenHashMap[Key, Value]]

Creates a non-strict filter of this open hash map.

Creates a non-strict filter of this open hash map.
Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.
Note: might return different results for different runs, unless the underlying collection type is ordered.
p
the predicate used to test elements.
returns
an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this open hash map which satisfy the predicate p.
definition classes: TraversableLike → FilterMonadic
def zip[B](that: Iterable[B]): OpenHashMap[((Key, Value), B)]

[use case] Returns a open hash map formed from this open hash map and another iterable collection by combining corresponding elements in pairs.

[use case]
Returns a open hash map formed from this open hash map and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.
B
the type of the second half of the returned pairs
that
The iterable providing the second half of each result pair
returns
a new open hash map containing pairs consisting of corresponding elements of this open hash map and that. The length of the returned collection is the minimum of the lengths of this open hash map and that.
attributes: abstract
def zip[A1 >: (Key, Value), B, That](that: Iterable[B])(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], (A1, B), That]): That

Returns a open hash map formed from this open hash map and another iterable collection by combining corresponding elements in pairs.

Returns a open hash map formed from this open hash map and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.
Note: might return different results for different runs, unless the underlying collection type is ordered.
A1
the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).
B
the type of the second half of the returned pairs
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.
that
The iterable providing the second half of each result pair
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type (A1, B).
returns
a new collection of type That containing pairs consisting of corresponding elements of this open hash map and that. The length of the returned collection is the minimum of the lengths of this open hash map and that.
definition classes: IterableLike
def zipAll[B](that: Iterable[B], thisElem: (Key, Value), thatElem: B): OpenHashMap[((Key, Value), B)]

[use case] Returns a open hash map formed from this open hash map and another iterable collection by combining corresponding elements in pairs.

[use case]
Returns a open hash map formed from this open hash map and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.
B
the type of the second half of the returned pairs
that
The iterable providing the second half of each result pair
thisElem
the element to be used to fill up the result if this open hash map is shorter than that.
thatElem
the element to be used to fill up the result if that is shorter than this open hash map.
returns
a new open hash map containing pairs consisting of corresponding elements of this open hash map and that. The length of the returned collection is the maximum of the lengths of this open hash map and that. If this open hash map is shorter than that, thisElem values are used to pad the result. If that is shorter than this open hash map, thatElem values are used to pad the result.
attributes: abstract
def zipAll[B, A1 >: (Key, Value), That](that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], (A1, B), That]): That

Returns a open hash map formed from this open hash map and another iterable collection by combining corresponding elements in pairs.

Returns a open hash map formed from this open hash map and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.
Note: might return different results for different runs, unless the underlying collection type is ordered.
that
the iterable providing the second half of each result pair
thisElem
the element to be used to fill up the result if this open hash map is shorter than that.
thatElem
the element to be used to fill up the result if that is shorter than this open hash map.
returns
a new collection of type That containing pairs consisting of corresponding elements of this open hash map and that. The length of the returned collection is the maximum of the lengths of this open hash map and that. If this open hash map is shorter than that, thisElem values are used to pad the result. If that is shorter than this open hash map, thatElem values are used to pad the result.
definition classes: IterableLike
def zipWithIndex: OpenHashMap[((Key, Value), Int)]

[use case] Zips this open hash map with its indices.

[use case]
Zips this open hash map with its indices.
returns
A new open hash map containing pairs consisting of all elements of this open hash map paired with their index. Indices start at 0. @example List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))
attributes: abstract
def zipWithIndex[A1 >: (Key, Value), That](implicit bf: CanBuildFrom[OpenHashMap[Key, Value], (A1, Int), That]): That

Zips this open hash map with its indices.

Zips this open hash map with its indices.
Note: might return different results for different runs, unless the underlying collection type is ordered.
A1
the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.
returns
A new collection of type That containing pairs consisting of all elements of this open hash map paired with their index. Indices start at 0.
definition classes: IterableLike

OpenHashMap

class OpenHashMap[Key, Value] extends Map[Key, Value] with MapLike[Key, Value, OpenHashMap[Key, Value]]

Instance constructors

new OpenHashMap()

new OpenHashMap(initialSize: Int)

Type Members

class DefaultKeySet extends Set[A]

class DefaultValuesIterable extends Iterable[B]

type Entry = OpenEntry[Key, Value]

type Self = OpenHashMap[Key, Value]

class WithFilter extends FilterMonadic[A, Repr]

Value Members

def !=(arg0: AnyRef): Boolean

def !=(arg0: Any): Boolean

def ##(): Int

def $asInstanceOf[T0](): T0

def $isInstanceOf[T0](): Boolean

def +[B1 >: Value](elem1: (Key, B1), elem2: (Key, B1), elems: (Key, B1)*): Map[Key, B1]

def +[B1 >: Value](kv: (Key, B1)): Map[Key, B1]

def ++[B1 >: Value](xs: TraversableOnce[(Key, B1)]): Map[Key, B1]

def ++(that: TraversableOnce[(Key, Value)]): OpenHashMap[(Key, Value)]

def ++[B >: (Key, Value), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], B, That]): That

def ++=(xs: TraversableOnce[(Key, Value)]): Growable[(Key, Value)]

def +=(kv: (Key, Value)): OpenHashMap[Key, Value]

def +=(elem1: (Key, Value), elem2: (Key, Value), elems: (Key, Value)*): Growable[(Key, Value)]

def -(elem1: Key, elem2: Key, elems: Key*): OpenHashMap[Key, Value]

def -(key: Key): OpenHashMap[Key, Value]

def --(xs: TraversableOnce[Key]): OpenHashMap[Key, Value]

def --=(xs: TraversableOnce[Key]): Shrinkable[Key]

def -=(key: Key): OpenHashMap[Key, Value]

def -=(elem1: Key, elem2: Key, elems: Key*): Shrinkable[Key]

def /:[B](z: B)(op: (B, (Key, Value)) ⇒ B): B

def :\[B](z: B)(op: ((Key, Value), B) ⇒ B): B

def ==(arg0: AnyRef): Boolean

def ==(arg0: Any): Boolean

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def andThen[C](k: (Value) ⇒ C): PartialFunction[Key, C]

def apply(key: Key): Value

def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clear(): Unit

def clone(): OpenHashMap[Key, Value]

def collect[B](pf: PartialFunction[(Key, Value), B]): OpenHashMap[B]

def collect[B, That](pf: PartialFunction[(Key, Value), B])(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], B, That]): That

def companion: GenericCompanion[Iterable[A][A]]

def compose[A](g: (A) ⇒ Key): (A) ⇒ Value

def contains(key: Key): Boolean

def copyToArray(xs: Array[(Key, Value)], start: Int, len: Int): Unit

def copyToArray[B >: (Key, Value)](xs: Array[B], start: Int, len: Int): Unit

def copyToArray(xs: Array[(Key, Value)]): Unit

def copyToArray[B >: (Key, Value)](xs: Array[B]): Unit

def copyToArray(xs: Array[(Key, Value)], start: Int): Unit

def copyToArray[B >: (Key, Value)](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: (Key, Value)](dest: Buffer[B]): Unit

def count(p: ((Key, Value)) ⇒ Boolean): Int

def default(key: Key): Value

def drop(n: Int): OpenHashMap[Key, Value]

def dropRight(n: Int): OpenHashMap[Key, Value]

def dropWhile(p: ((Key, Value)) ⇒ Boolean): OpenHashMap[Key, Value]

def elements: Iterator[(Key, Value)]

def empty: OpenHashMap[Key, Value]

def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: ((Key, Value)) ⇒ Boolean): Boolean

def filter(p: ((Key, Value)) ⇒ Boolean): OpenHashMap[Key, Value]

def filterKeys(p: (Key) ⇒ Boolean): Map[Key, Value]

def filterNot(p: ((Key, Value)) ⇒ Boolean): OpenHashMap[Key, Value]

def finalize(): Unit

def find(p: ((Key, Value)) ⇒ Boolean): Option[(Key, Value)]

def first: (Key, Value)

def firstOption: Option[(Key, Value)]

def flatMap[B](f: ((Key, Value)) ⇒ Traversable[B]): OpenHashMap[B]

def flatMap[B, That](f: ((Key, Value)) ⇒ Traversable[B])(implicit bf: CanBuildFrom[OpenHashMap[Key, Value], B, That]): That

def flatten[B]: OpenHashMap[B]

def flatten[B](implicit asTraversable: ((Key, Value)) ⇒ Traversable[B]): Iterable[B]

def foldLeft[B](z: B)(op: (B, (Key, Value)) ⇒ B): B

def foldRight[B](z: B)(op: ((Key, Value), B) ⇒ B): B

def forall(p: ((Key, Value)) ⇒ Boolean): Boolean