MultiMapSortedLike

intervalidus.collection.MultiMapSortedLike
trait MultiMapSortedLike[K, V](dict: Map[K, SortedSet[V]])(implicit evidence$1: Ordering[V])

A multimap where multiple values can be associated with the same key. Similar to SortedMultiDict in scala-collection-contrib, but this returns values in order (values are stored in a sorted set), not keys. Also, this only implements a small subset of methods needed in this project.

Type parameters

K

key type

V

value type (uses Ordering[V])

Attributes

Source
MultiMapSortedLike.scala
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class MultiMapSorted[K, V]
class MultiMapSorted[K, V]

Members list

Value members

Concrete methods

def get(key: K): Iterable[V]

Retrieves in order all the values associated with the given key.

Retrieves in order all the values associated with the given key.

Value parameters

key

the key.

Attributes

Returns

the values associated with the given key.

Source
MultiMapSortedLike.scala
def keySet: Set[K]

Collects all keys of this map in a set.

Collects all keys of this map in a set.

Attributes

Returns

a set containing all keys of this multimap.

Source
MultiMapSortedLike.scala