(Changed in version 2.8.0) +
creates a new map. Use +=
to add an element to this map and return that map itself.
(Changed in version 2.8.0) +
creates a new map. Use +=
to add an element to this map and return that map itself.
(Changed in version 2.8.0) ++
creates a new map. Use ++=
to add an element to this map and return that map itself.
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.
(Changed in version 2.8.0) -
creates a new map. Use -=
to remove an element from this map and return that map itself.
(Changed in version 2.8.0) -
creates a new map. Use -=
to remove an element from this map and return that map itself.
(Changed in version 2.8.0) --
creates a new map. Use --=
to remove an element from this map and return that map itself.
Remove the key/value pair from the priority map.
Remove the key/value pair from the priority map.
Make a copy of this HeapPriorityMap, returning a new HeapPriorityMap
Make a copy of this HeapPriorityMap, returning a new HeapPriorityMap
Extract and return the item with the minimum value.
Extract and return the item with the minimum value.
Get the value associated with the key.
Get the value associated with the key.
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.
(Changed in version 2.8.0) keys
returns Iterable[A]
rather than Iterator[A]
.
(Changed in version 2.9.0) The behavior of scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
(Changed in version 2.8.0) values
returns Iterable[B]
rather than Iterator[B]
.
A priority map using a heap implementation. Provides O(log n) insertion, update, and extracting the minimum element.