c

# HeapPriorityMap 

#### class HeapPriorityMap[T, U] extends PriorityMap[T, U]

A priority map using a heap implementation. Provides O(log n) insertion, update, and extracting the minimum element.

Linear Supertypes
PriorityMap[T, U], Map[T, U], MapLike[T, U, Map[T, U]], Cloneable[Map[T, U]], Cloneable, Cloneable, Shrinkable[T], Builder[(T, U), Map[T, U]], Growable[(T, U)], Clearable, Map[T, U], MapLike[T, U, Map[T, U]], Subtractable[T, Map[T, U]], PartialFunction[T, U], (T) ⇒ U, GenMap[T, U], GenMapLike[T, U, Map[T, U]], Iterable[(T, U)], Iterable[(T, U)], IterableLike[(T, U), Map[T, U]], Equals, GenIterable[(T, U)], GenIterableLike[(T, U), Map[T, U]], Traversable[(T, U)], Mutable, Traversable[(T, U)], GenTraversable[(T, U)], GenericTraversableTemplate[(T, U), Iterable], TraversableLike[(T, U), Map[T, U]], GenTraversableLike[(T, U), Map[T, U]], Parallelizable[(T, U), ParMap[T, U]], TraversableOnce[(T, U)], GenTraversableOnce[(T, U)], FilterMonadic[(T, U), Map[T, U]], HasNewBuilder[(T, U), Map[T, U]], AnyRef, Any
Ordering
1. Alphabetic
2. By Inheritance
Inherited
1. HeapPriorityMap
2. PriorityMap
3. Map
4. MapLike
5. Cloneable
6. Cloneable
7. Cloneable
8. Shrinkable
9. Builder
10. Growable
11. Clearable
12. Map
13. MapLike
14. Subtractable
15. PartialFunction
16. Function1
17. GenMap
18. GenMapLike
19. Iterable
20. Iterable
21. IterableLike
22. Equals
23. GenIterable
24. GenIterableLike
25. Traversable
26. Mutable
27. Traversable
28. GenTraversable
29. GenericTraversableTemplate
30. TraversableLike
31. GenTraversableLike
32. Parallelizable
33. TraversableOnce
34. GenTraversableOnce
36. HasNewBuilder
37. AnyRef
38. Any
1. Hide All
2. Show All
Visibility
1. Public
2. All

### Instance Constructors

1. new HeapPriorityMap()(implicit ord: Ordering[U])

### Type Members

1. class DefaultKeySet extends AbstractSet[K] with Set[K] with Serializable
Attributes
protected
Definition Classes
MapLike
2. class DefaultValuesIterable extends AbstractIterable[V] with Iterable[V] with Serializable
Attributes
protected
Definition Classes
MapLike
3. class FilteredKeys extends AbstractMap[K, V] with DefaultMap[K, V]
Attributes
protected
Definition Classes
MapLike
4. class MappedValues[W] extends AbstractMap[K, W] with DefaultMap[K, W]
Attributes
protected
Definition Classes
MapLike
5. type Self = Map[T, U]
Attributes
protected[this]
Definition Classes
TraversableLike
6. class WithFilter extends FilterMonadic[A, Repr]
Definition Classes
TraversableLike

### Value Members

1. final def !=(arg0: Any): Boolean
Definition Classes
AnyRef → Any
2. final def ##(): Int
Definition Classes
AnyRef → Any
3. def +[V1 >: U](elem1: (T, V1), elem2: (T, V1), elems: (T, V1)*): Map[T, V1]
Definition Classes
MapLike → MapLike
Annotations
@migration
Migration

(Changed in version 2.8.0) `+` creates a new map. Use `+=` to add an element to this map and return that map itself.

4. def +[V1 >: U](kv: (T, V1)): Map[T, V1]
Definition Classes
MapLike → MapLike → GenMapLike
Annotations
@migration
Migration

(Changed in version 2.8.0) `+` creates a new map. Use `+=` to add an element to this map and return that map itself.

5. def ++[V1 >: U](xs: GenTraversableOnce[(T, V1)]): Map[T, V1]
Definition Classes
MapLike → MapLike
Annotations
@migration
Migration

(Changed in version 2.8.0) `++` creates a new map. Use `++=` to add an element to this map and return that map itself.

6. def ++[B >: (T, U), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Map[T, U], B, That]): That
Definition Classes
TraversableLike → GenTraversableLike
7. def ++:[B >: (T, U), That](that: Traversable[B])(implicit bf: CanBuildFrom[Map[T, U], B, That]): That
Definition Classes
TraversableLike
8. def ++:[B >: (T, U), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Map[T, U], B, That]): That
Definition Classes
TraversableLike
9. def ++=(xs: TraversableOnce[(T, U)]): HeapPriorityMap.this.type
Definition Classes
Growable
10. def +=(pair: (T, U)): HeapPriorityMap.this.type

Add the key/value pair to the priority map.

Add the key/value pair to the priority map. If the key is already present, update its value, moving it in the map.

Definition Classes
HeapPriorityMap → MapLike → Builder → Growable
11. def +=(elem1: (T, U), elem2: (T, U), elems: (T, U)*): HeapPriorityMap.this.type
Definition Classes
Growable
12. def -(elem1: T, elem2: T, elems: T*): Map[T, U]
Definition Classes
MapLike → Subtractable
Annotations
@migration
Migration

(Changed in version 2.8.0) `-` creates a new map. Use `-=` to remove an element from this map and return that map itself.

13. def -(key: T): Map[T, U]
Definition Classes
MapLike → MapLike → Subtractable → GenMapLike
Annotations
@migration
Migration

(Changed in version 2.8.0) `-` creates a new map. Use `-=` to remove an element from this map and return that map itself.

14. def --(xs: GenTraversableOnce[T]): Map[T, U]
Definition Classes
MapLike → Subtractable
Annotations
@migration
Migration

(Changed in version 2.8.0) `--` creates a new map. Use `--=` to remove an element from this map and return that map itself.

15. def --=(xs: TraversableOnce[T]): HeapPriorityMap.this.type
Definition Classes
Shrinkable
16. def -=(item: T): HeapPriorityMap.this.type

Remove the key/value pair from the priority map.

Remove the key/value pair from the priority map.

Definition Classes
HeapPriorityMap → MapLike → Shrinkable
17. def -=(elem1: T, elem2: T, elems: T*): HeapPriorityMap.this.type
Definition Classes
Shrinkable
18. def /:[B](z: B)(op: (B, (T, U)) ⇒ B): B
Definition Classes
TraversableOnce → GenTraversableOnce
19. def :\[B](z: B)(op: ((T, U), B) ⇒ B): B
Definition Classes
TraversableOnce → GenTraversableOnce
20. final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
21. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
Definition Classes
MapLike → TraversableOnce
Definition Classes
TraversableOnce
23. def addString(b: StringBuilder, sep: String): StringBuilder
Definition Classes
TraversableOnce
24. def aggregate[B](z: ⇒ B)(seqop: (B, (T, U)) ⇒ B, combop: (B, B) ⇒ B): B
Definition Classes
TraversableOnce → GenTraversableOnce
25. def andThen[C](k: (U) ⇒ C): PartialFunction[T, C]
Definition Classes
PartialFunction → Function1
26. def apply(key: T): U
Definition Classes
MapLike → GenMapLike → Function1
27. def applyOrElse[K1 <: T, V1 >: U](x: K1, default: (K1) ⇒ V1): V1
Definition Classes
MapLike → PartialFunction
28. final def asInstanceOf[T0]: T0
Definition Classes
Any
29. def canEqual(that: Any): Boolean
Definition Classes
IterableLike → Equals
30. def clear(): Unit
Definition Classes
MapLike → Builder → Growable → Clearable
31. def clone(): HeapPriorityMap[T, U]

Make a copy of this HeapPriorityMap, returning a new HeapPriorityMap.

Make a copy of this HeapPriorityMap, returning a new HeapPriorityMap.

Definition Classes
HeapPriorityMap → MapLike → Cloneable → AnyRef
32. def collect[B, That](pf: PartialFunction[(T, U), B])(implicit bf: CanBuildFrom[Map[T, U], B, That]): That
Definition Classes
TraversableLike → GenTraversableLike
33. def collectFirst[B](pf: PartialFunction[(T, U), B]): Option[B]
Definition Classes
TraversableOnce
34. def companion: GenericCompanion[Iterable]
Definition Classes
Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
35. def compose[A](g: (A) ⇒ T): (A) ⇒ U
Definition Classes
Function1
Annotations
@unspecialized()
36. def contains(key: T): Boolean
Definition Classes
MapLike → GenMapLike
37. def copyToArray[B >: (T, U)](xs: Array[B], start: Int, len: Int): Unit
Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
38. def copyToArray[B >: (T, U)](xs: Array[B]): Unit
Definition Classes
TraversableOnce → GenTraversableOnce
39. def copyToArray[B >: (T, U)](xs: Array[B], start: Int): Unit
Definition Classes
TraversableOnce → GenTraversableOnce
40. def copyToBuffer[B >: (T, U)](dest: Buffer[B]): Unit
Definition Classes
TraversableOnce
41. def count(p: ((T, U)) ⇒ Boolean): Int
Definition Classes
TraversableOnce → GenTraversableOnce
42. def default(key: T): U
Definition Classes
MapLike → GenMapLike
43. def drop(n: Int): Map[T, U]
Definition Classes
IterableLike → TraversableLike → GenTraversableLike
44. def dropRight(n: Int): Map[T, U]
Definition Classes
IterableLike
45. def dropWhile(p: ((T, U)) ⇒ Boolean): Map[T, U]
Definition Classes
TraversableLike → GenTraversableLike
46. def empty: Map[T, U]
Definition Classes
Map → Map → MapLike
47. final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
48. def equals(that: Any): Boolean
Definition Classes
GenMapLike → Equals → AnyRef → Any
49. def exists(p: ((T, U)) ⇒ Boolean): Boolean
Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
50. def extractMin(): (T, U)

Extract and return the item with the minimum value.

Extract and return the item with the minimum value.

Definition Classes
HeapPriorityMapPriorityMap
51. def filter(p: ((T, U)) ⇒ Boolean): Map[T, U]
Definition Classes
TraversableLike → GenTraversableLike
52. def filterKeys(p: (T) ⇒ Boolean): Map[T, U]
Definition Classes
MapLike → GenMapLike
53. def filterNot(p: ((T, U)) ⇒ Boolean): Map[T, U]
Definition Classes
MapLike → TraversableLike → GenTraversableLike
54. def finalize(): Unit
Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
55. def find(p: ((T, U)) ⇒ Boolean): Option[(T, U)]
Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
56. def flatMap[B, That](f: ((T, U)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Map[T, U], B, That]): That
Definition Classes
57. def flatten[B](implicit asTraversable: ((T, U)) ⇒ GenTraversableOnce[B]): Iterable[B]
Definition Classes
GenericTraversableTemplate
58. def fold[A1 >: (T, U)](z: A1)(op: (A1, A1) ⇒ A1): A1
Definition Classes
TraversableOnce → GenTraversableOnce
59. def foldLeft[B](z: B)(op: (B, (T, U)) ⇒ B): B
Definition Classes
TraversableOnce → GenTraversableOnce
60. def foldRight[B](z: B)(op: ((T, U), B) ⇒ B): B
Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
61. def forall(p: ((T, U)) ⇒ Boolean): Boolean
Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
62. def foreach[U](f: ((T, U)) ⇒ U): Unit
Definition Classes
IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
63. def genericBuilder[B]: Builder[B, Iterable[B]]
Definition Classes
GenericTraversableTemplate
64. def get(item: T): Option[U]

Get the value associated with the key.

Get the value associated with the key.

Definition Classes
HeapPriorityMap → MapLike → GenMapLike
65. final def getClass(): Class[_]
Definition Classes
AnyRef → Any
66. def getOrElse[V1 >: U](key: T, default: ⇒ V1): V1
Definition Classes
MapLike → GenMapLike
67. def getOrElseUpdate(key: T, op: ⇒ U): U
Definition Classes
MapLike
68. def groupBy[K](f: ((T, U)) ⇒ K): Map[K, Map[T, U]]
Definition Classes
TraversableLike → GenTraversableLike
69. def grouped(size: Int): Iterator[Map[T, U]]
Definition Classes
IterableLike
70. def hasDefiniteSize: Boolean
Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
71. def hashCode(): Int
Definition Classes
GenMapLike → AnyRef → Any
Definition Classes
IterableLike → TraversableLike → GenTraversableLike
Definition Classes
TraversableLike → GenTraversableLike
74. def init: Map[T, U]
Definition Classes
TraversableLike → GenTraversableLike
75. def inits: Iterator[Map[T, U]]
Definition Classes
TraversableLike
76. def isDefinedAt(key: T): Boolean
Definition Classes
MapLike → GenMapLike → PartialFunction
77. def isEmpty: Boolean
Definition Classes
HeapPriorityMap → MapLike → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → GenTraversableOnce
78. final def isInstanceOf[T0]: Boolean
Definition Classes
Any
79. final def isTraversableAgain: Boolean
Definition Classes
TraversableLike → GenTraversableLike → GenTraversableOnce
80. def iterator: Iterator[(T, U)]

Produce an iterator of the (item, score) pairs in increasing order of score.

Produce an iterator of the (item, score) pairs in increasing order of score.

Definition Classes
HeapPriorityMap → MapLike → IterableLike → GenIterableLike
81. def keySet: Set[T]
Definition Classes
MapLike → GenMapLike
82. def keys: Iterable[T]
Definition Classes
MapLike → GenMapLike
Annotations
@migration
Migration

(Changed in version 2.8.0) `keys` returns `Iterable[K]` rather than `Iterator[K]`.

83. def keysIterator: Iterator[T]
Definition Classes
MapLike → GenMapLike
84. def last: (T, U)
Definition Classes
TraversableLike → GenTraversableLike
85. def lastOption: Option[(T, U)]
Definition Classes
TraversableLike → GenTraversableLike
86. def lift: (T) ⇒ Option[U]
Definition Classes
PartialFunction
87. def map[B, That](f: ((T, U)) ⇒ B)(implicit bf: CanBuildFrom[Map[T, U], B, That]): That
Definition Classes
88. def mapResult[NewTo](f: (Map[T, U]) ⇒ NewTo): Builder[(T, U), NewTo]
Definition Classes
Builder
89. def mapValues[W](f: (U) ⇒ W): Map[T, W]
Definition Classes
MapLike → GenMapLike
90. def max[B >: (T, U)](implicit cmp: Ordering[B]): (T, U)
Definition Classes
TraversableOnce → GenTraversableOnce
91. def maxBy[B](f: ((T, U)) ⇒ B)(implicit cmp: Ordering[B]): (T, U)
Definition Classes
TraversableOnce → GenTraversableOnce
92. def min[B >: (T, U)](implicit cmp: Ordering[B]): (T, U)
Definition Classes
TraversableOnce → GenTraversableOnce
93. def minBy[B](f: ((T, U)) ⇒ B)(implicit cmp: Ordering[B]): (T, U)
Definition Classes
TraversableOnce → GenTraversableOnce
94. def mkString: String
Definition Classes
TraversableOnce → GenTraversableOnce
95. def mkString(sep: String): String
Definition Classes
TraversableOnce → GenTraversableOnce
96. def mkString(start: String, sep: String, end: String): String
Definition Classes
TraversableOnce → GenTraversableOnce
97. final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
98. def newBuilder: Builder[(T, U), Map[T, U]]
Attributes
protected[this]
Definition Classes
MapLike → MapLike → TraversableLike → HasNewBuilder
99. def nonEmpty: Boolean
Definition Classes
TraversableOnce → GenTraversableOnce
100. final def notify(): Unit
Definition Classes
AnyRef
101. final def notifyAll(): Unit
Definition Classes
AnyRef
102. def orElse[A1 <: T, B1 >: U](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
Definition Classes
PartialFunction
103. def par: ParMap[T, U]
Definition Classes
Parallelizable
104. def parCombiner: Combiner[(T, U), ParMap[T, U]]
Attributes
protected[this]
Definition Classes
MapLike → MapLike → TraversableLike → Parallelizable
105. def partition(p: ((T, U)) ⇒ Boolean): (Map[T, U], Map[T, U])
Definition Classes
TraversableLike → GenTraversableLike
106. def product[B >: (T, U)](implicit num: Numeric[B]): B
Definition Classes
TraversableOnce → GenTraversableOnce
107. def put(key: T, value: U): Option[U]
Definition Classes
MapLike
108. def reduce[A1 >: (T, U)](op: (A1, A1) ⇒ A1): A1
Definition Classes
TraversableOnce → GenTraversableOnce
109. def reduceLeft[B >: (T, U)](op: (B, (T, U)) ⇒ B): B
Definition Classes
TraversableOnce
110. def reduceLeftOption[B >: (T, U)](op: (B, (T, U)) ⇒ B): Option[B]
Definition Classes
TraversableOnce → GenTraversableOnce
111. def reduceOption[A1 >: (T, U)](op: (A1, A1) ⇒ A1): Option[A1]
Definition Classes
TraversableOnce → GenTraversableOnce
112. def reduceRight[B >: (T, U)](op: ((T, U), B) ⇒ B): B
Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
113. def reduceRightOption[B >: (T, U)](op: ((T, U), B) ⇒ B): Option[B]
Definition Classes
TraversableOnce → GenTraversableOnce
114. def remove(key: T): Option[U]
Definition Classes
MapLike
115. def repr: Map[T, U]
Definition Classes
TraversableLike → GenTraversableLike
116. def result(): Map[T, U]
Definition Classes
MapLike → Builder
117. def retain(p: (T, U) ⇒ Boolean): HeapPriorityMap.this.type
Definition Classes
MapLike
118. def reversed: List[(T, U)]
Attributes
protected[this]
Definition Classes
TraversableOnce
119. def runWith[U](action: (U) ⇒ U): (T) ⇒ Boolean
Definition Classes
PartialFunction
120. def sameElements[B >: (T, U)](that: GenIterable[B]): Boolean
Definition Classes
IterableLike → GenIterableLike
121. def scan[B >: (T, U), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Map[T, U], B, That]): That
Definition Classes
TraversableLike → GenTraversableLike
122. def scanLeft[B, That](z: B)(op: (B, (T, U)) ⇒ B)(implicit bf: CanBuildFrom[Map[T, U], B, That]): That
Definition Classes
TraversableLike → GenTraversableLike
123. def scanRight[B, That](z: B)(op: ((T, U), B) ⇒ B)(implicit bf: CanBuildFrom[Map[T, U], B, That]): That
Definition Classes
TraversableLike → GenTraversableLike
Annotations
@migration
Migration

(Changed in version 2.9.0) The behavior of `scanRight` has changed. The previous behavior can be reproduced with scanRight.reverse.

124. def seq: Map[T, U]
Definition Classes
Map → Map → GenMap → GenMapLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
125. def size: Int
Definition Classes
TraversableOnce → GenTraversableOnce
126. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
Definition Classes
Builder
127. def sizeHint(coll: TraversableLike[_, _]): Unit
Definition Classes
Builder
128. def sizeHint(size: Int): Unit
Definition Classes
Builder
129. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
Definition Classes
Builder
130. def sizeHintIfCheap: Int
Attributes
protected[scala.collection]
Definition Classes
GenTraversableOnce
131. def slice(from: Int, until: Int): Map[T, U]
Definition Classes
IterableLike → TraversableLike → GenTraversableLike
132. def sliding(size: Int, step: Int): Iterator[Map[T, U]]
Definition Classes
IterableLike
133. def sliding(size: Int): Iterator[Map[T, U]]
Definition Classes
IterableLike
134. def span(p: ((T, U)) ⇒ Boolean): (Map[T, U], Map[T, U])
Definition Classes
TraversableLike → GenTraversableLike
135. def splitAt(n: Int): (Map[T, U], Map[T, U])
Definition Classes
TraversableLike → GenTraversableLike
136. def stringPrefix: String
Definition Classes
MapLike → TraversableLike → GenTraversableLike
137. def sum[B >: (T, U)](implicit num: Numeric[B]): B
Definition Classes
TraversableOnce → GenTraversableOnce
138. final def synchronized[T0](arg0: ⇒ T0): T0
Definition Classes
AnyRef
139. def tail: Map[T, U]
Definition Classes
TraversableLike → GenTraversableLike
140. def tails: Iterator[Map[T, U]]
Definition Classes
TraversableLike
141. def take(n: Int): Map[T, U]
Definition Classes
IterableLike → TraversableLike → GenTraversableLike
142. def takeRight(n: Int): Map[T, U]
Definition Classes
IterableLike
143. def takeWhile(p: ((T, U)) ⇒ Boolean): Map[T, U]
Definition Classes
IterableLike → TraversableLike → GenTraversableLike
144. def thisCollection: Iterable[(T, U)]
Attributes
protected[this]
Definition Classes
IterableLike → TraversableLike
145. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (T, U), Col[(T, U)]]): Col[(T, U)]
Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
146. def toArray[B >: (T, U)](implicit arg0: ClassTag[B]): Array[B]
Definition Classes
TraversableOnce → GenTraversableOnce
147. def toBuffer[E >: (T, U)]: Buffer[E]
Definition Classes
MapLike → TraversableOnce → GenTraversableOnce
148. def toCollection(repr: Map[T, U]): Iterable[(T, U)]
Attributes
protected[this]
Definition Classes
IterableLike → TraversableLike
149. def toIndexedSeq: IndexedSeq[(T, U)]
Definition Classes
TraversableOnce → GenTraversableOnce
150. def toIterable: Iterable[(T, U)]
Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
151. def toIterator: Iterator[(T, U)]
Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
Annotations
@deprecatedOverriding( ... , "2.11.0" )
152. def toList: List[(T, U)]
Definition Classes
TraversableOnce → GenTraversableOnce
153. def toMap[T, U](implicit ev: <:<[(T, U), (T, U)]): Map[T, U]
Definition Classes
TraversableOnce → GenTraversableOnce
154. def toSeq: Seq[(T, U)]
Definition Classes
MapLike → MapLike → TraversableOnce → GenTraversableOnce
155. def toSet[B >: (T, U)]: Set[B]
Definition Classes
TraversableOnce → GenTraversableOnce
156. def toStream: Stream[(T, U)]
Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
157. def toString(): String
Definition Classes
MapLike → TraversableLike → Function1 → AnyRef → Any
158. def toTraversable: Traversable[(T, U)]
Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
Annotations
@deprecatedOverriding( ... , "2.11.0" )
159. def toVector: Vector[(T, U)]
Definition Classes
TraversableOnce → GenTraversableOnce
160. def transform(f: (T, U) ⇒ U): HeapPriorityMap.this.type
Definition Classes
MapLike
161. def transpose[B](implicit asTraversable: ((T, U)) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]
Definition Classes
GenericTraversableTemplate
Annotations
@migration
Migration

(Changed in version 2.9.0) `transpose` throws an `IllegalArgumentException` if collections are not uniformly sized.

162. def unzip[A1, A2](implicit asPair: ((T, U)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
Definition Classes
GenericTraversableTemplate
163. def unzip3[A1, A2, A3](implicit asTriple: ((T, U)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
Definition Classes
GenericTraversableTemplate
164. def update(key: T, value: U): Unit
Definition Classes
MapLike
165. def updated[V1 >: U](key: T, value: V1): Map[T, V1]
Definition Classes
MapLike → MapLike
166. def values: Iterable[U]
Definition Classes
MapLike → GenMapLike
Annotations
@migration
Migration

(Changed in version 2.8.0) `values` returns `Iterable[V]` rather than `Iterator[V]`.

167. def valuesIterator: Iterator[U]
Definition Classes
MapLike → GenMapLike
168. def view(from: Int, until: Int): IterableView[(T, U), Map[T, U]]
Definition Classes
IterableLike → TraversableLike
169. def view: IterableView[(T, U), Map[T, U]]
Definition Classes
IterableLike → TraversableLike
170. final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
171. final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
172. final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
173. def withDefault(d: (T) ⇒ U): Map[T, U]
Definition Classes
Map
174. def withDefaultValue(d: U): Map[T, U]
Definition Classes
Map
175. def withFilter(p: ((T, U)) ⇒ Boolean): FilterMonadic[(T, U), Map[T, U]]
Definition Classes
176. def zip[A1 >: (T, U), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Map[T, U], (A1, B), That]): That
Definition Classes
IterableLike → GenIterableLike
177. def zipAll[B, A1 >: (T, U), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Map[T, U], (A1, B), That]): That
Definition Classes
IterableLike → GenIterableLike
178. def zipWithIndex[A1 >: (T, U), That](implicit bf: CanBuildFrom[Map[T, U], (A1, Int), That]): That
Definition Classes
IterableLike → GenIterableLike