Extract and return the item with the minimum value.
(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.
(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.
(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 is like a priority queue except that keys in the clue are mapped to values that determine their place in the queue. The value associated with a key can be updated, resulting in the key being moved to a different place in the queue.