t

de.ummels.prioritymap

PriorityMapLike

trait PriorityMapLike[A, B, +This <: PriorityMapLike[A, B, This] with PriorityMap[A, B]] extends MapLike[A, B, This]

A template trait for immutable priority maps. To create a concrete priority map, you need to implement the following methods in addition to those of MapLike:

implicit def ordering: Ordering[B]
def +(kv: (A, B)): This
def rangeImpl(from: Option[B], until: Option[B]): This

The iterator returned by iterator should generate key/value pairs in the order specified by the implicit ordering on values.

Concrete classes may also override other methods for efficiency.

Self Type
PriorityMapLike[A, B, This]
Source
PriorityMapLike.scala
Linear Supertypes
MapLike[A, B, This], MapLike[A, B, This], Subtractable[A, This], GenMapLike[A, B, This], IterableLike[(A, B), This], GenIterableLike[(A, B), This], TraversableLike[(A, B), This], GenTraversableLike[(A, B), This], Parallelizable[(A, B), ParMap[A, B]], TraversableOnce[(A, B)], GenTraversableOnce[(A, B)], FilterMonadic[(A, B), This], HasNewBuilder[(A, B), This], Equals, PartialFunction[A, B], (A) ⇒ B, AnyRef, Any
Known Subclasses
PriorityMap, StandardPriorityMap
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PriorityMapLike
  2. MapLike
  3. MapLike
  4. Subtractable
  5. GenMapLike
  6. IterableLike
  7. GenIterableLike
  8. TraversableLike
  9. GenTraversableLike
  10. Parallelizable
  11. TraversableOnce
  12. GenTraversableOnce
  13. FilterMonadic
  14. HasNewBuilder
  15. Equals
  16. PartialFunction
  17. Function1
  18. AnyRef
  19. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

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 ImmutableDefaultKeySet extends scala.collection.immutable.MapLike.DefaultKeySet with Set[K]
    Attributes
    protected
    Definition Classes
    MapLike
  5. class MappedValues[W] extends AbstractMap[K, W] with DefaultMap[K, W]
    Attributes
    protected
    Definition Classes
    MapLike
  6. type Self = This
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  7. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def +(kv: (A, B)): This

    Adds a key/value binding to this priority map.

    Adds a key/value binding to this priority map.

    kv

    the key/value pair

    returns

    a new priority map with the new binding added to this priority map

  2. abstract def +[V1 >: B](kv: (A, V1)): Map[A, V1]
    Definition Classes
    MapLike → MapLike → GenMapLike
  3. abstract def -(key: A): This
    Definition Classes
    MapLike → Subtractable → GenMapLike
  4. abstract def empty: This
    Definition Classes
    MapLike
  5. abstract def get(key: A): Option[B]
    Definition Classes
    MapLike → GenMapLike
  6. abstract def iterator: Iterator[(A, B)]
    Definition Classes
    MapLike → IterableLike → GenIterableLike
  7. implicit abstract def ordering: Ordering[B]
  8. abstract def rangeImpl(from: Option[B], until: Option[B]): This

    Returns a new priority map of the same type as this priority map that only contains values between the given optional bounds.

    Returns a new priority map of the same type as this priority map that only contains values between the given optional bounds.

    from

    the lower-bound (inclusive) on values or None if there is no lower bound

    until

    the upper-bound (exclusive) on values or None if there is no upper bound

  9. abstract def seq: Map[A, B]
    Definition Classes
    GenMapLike → Parallelizable → GenTraversableOnce

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(kv1: (A, B), kv2: (A, B), kvs: (A, B)*): This

    Adds two or more key/value bindings to this priority map.

    Adds two or more key/value bindings to this priority map.

    kv1

    the first key/value pair to add

    kv2

    the second key/value pair to add

    kvs

    the remaining key/value pairs to add

    returns

    a new priority map with the new bindings added to this map

  4. def +[V1 >: B](elem1: (A, V1), elem2: (A, V1), elems: (A, V1)*): Map[A, V1]
    Definition Classes
    MapLike → MapLike
  5. def ++(kvs: GenTraversableOnce[(A, B)]): This

    Adds a number of key/value bindings to this priority map.

    Adds a number of key/value bindings to this priority map.

    kvs

    a traversable object consisting of key/value pairs

    returns

    a new priority map with the new bindings added to this map

  6. def ++[V1 >: B](xs: GenTraversableOnce[(A, V1)]): Map[A, V1]
    Definition Classes
    MapLike → MapLike
  7. def ++[B >: (A, B), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[This, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  8. def ++:[B >: (A, B), That](that: Traversable[B])(implicit bf: CanBuildFrom[This, B, That]): That
    Definition Classes
    TraversableLike
  9. def ++:[B >: (A, B), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[This, B, That]): That
    Definition Classes
    TraversableLike
  10. def -(elem1: A, elem2: A, elems: A*): This
    Definition Classes
    Subtractable
  11. def --(xs: GenTraversableOnce[A]): This
    Definition Classes
    Subtractable
  12. def /:[B](z: B)(op: (B, (A, B)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  13. def :\[B](z: B)(op: ((A, B), B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  14. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  15. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    MapLike → TraversableOnce
  16. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  17. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  18. def aggregate[B](z: ⇒ B)(seqop: (B, (A, B)) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  19. def andThen[C](k: (B) ⇒ C): PartialFunction[A, C]
    Definition Classes
    PartialFunction → Function1
  20. def apply(key: A): B
    Definition Classes
    MapLike → GenMapLike → Function1
  21. def applyOrElse[K1 <: A, V1 >: B](x: K1, default: (K1) ⇒ V1): V1
    Definition Classes
    MapLike → PartialFunction
  22. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  23. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  24. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  25. def collect[B, That](pf: PartialFunction[(A, B), B])(implicit bf: CanBuildFrom[This, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  26. def collectFirst[B](pf: PartialFunction[(A, B), B]): Option[B]
    Definition Classes
    TraversableOnce
  27. def compose[A](g: (A) ⇒ A): (A) ⇒ B
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  28. def contains(key: A): Boolean
    Definition Classes
    MapLike → GenMapLike
  29. def copyToArray[B >: (A, B)](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  30. def copyToArray[B >: (A, B)](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  31. def copyToArray[B >: (A, B)](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def copyToBuffer[B >: (A, B)](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  33. def count(p: ((A, B)) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  34. def default(key: A): B
    Definition Classes
    MapLike → GenMapLike
  35. def drop(n: Int): This
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  36. def dropRight(n: Int): This
    Definition Classes
    IterableLike
  37. def dropWhile(p: ((A, B)) ⇒ Boolean): This
    Definition Classes
    TraversableLike → GenTraversableLike
  38. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  39. def equals(that: Any): Boolean
    Definition Classes
    GenMapLike → Equals → AnyRef → Any
  40. def exists(p: ((A, B)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  41. def filter(p: ((A, B)) ⇒ Boolean): This
    Definition Classes
    TraversableLike → GenTraversableLike
  42. def filterKeys(p: (A) ⇒ Boolean): PriorityMap[A, B]
    Definition Classes
    PriorityMapLike → MapLike → MapLike → GenMapLike
  43. def filterNot(p: ((A, B)) ⇒ Boolean): This
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  44. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  45. def find(p: ((A, B)) ⇒ Boolean): Option[(A, B)]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  46. def firstKey: Option[A]

    Optionally returns the first key of this priority map.

  47. def firstValue: Option[B]

    Optionally returns the first value of this priority map.

  48. def flatMap[B, That](f: ((A, B)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[This, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  49. def fold[A1 >: (A, B)](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  50. def foldLeft[B](z: B)(op: (B, (A, B)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  51. def foldRight[B](z: B)(op: ((A, B), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  52. def forall(p: ((A, B)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  53. def foreach[U](f: ((A, B)) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  54. def from(from: B): This

    Returns a new priority map of the same type as this priority map that only contains values greater than or equal to the given lower bound.

    Returns a new priority map of the same type as this priority map that only contains values greater than or equal to the given lower bound.

    from

    the lower-bound (inclusive) on values

  55. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  56. def getOrElse[V1 >: B](key: A, default: ⇒ V1): V1
    Definition Classes
    MapLike → GenMapLike
  57. def groupBy[K](f: ((A, B)) ⇒ K): Map[K, This]
    Definition Classes
    TraversableLike → GenTraversableLike
  58. def grouped(size: Int): Iterator[This]
    Definition Classes
    IterableLike
  59. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  60. def hashCode(): Int
    Definition Classes
    GenMapLike → AnyRef → Any
  61. def head: (A, B)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  62. def headOption: Option[(A, B)]
    Definition Classes
    TraversableLike → GenTraversableLike
  63. def init: This
    Definition Classes
    TraversableLike → GenTraversableLike
  64. def inits: Iterator[This]
    Definition Classes
    TraversableLike
  65. def isDefinedAt(key: A): Boolean
    Definition Classes
    MapLike → GenMapLike → PartialFunction
  66. def isEmpty: Boolean
    Definition Classes
    MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  67. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  68. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  69. def keySet: Set[A]
    Definition Classes
    MapLike → MapLike → GenMapLike
  70. def keys: Iterable[A]
    Definition Classes
    MapLike → GenMapLike
    Annotations
    @migration
    Migration

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

  71. def keysIterator: Iterator[A]
    Definition Classes
    MapLike → GenMapLike
  72. def last: (A, B)
    Definition Classes
    TraversableLike → GenTraversableLike
  73. def lastKey: Option[A]

    Optionally returns the last key of this priority map.

  74. def lastOption: Option[(A, B)]
    Definition Classes
    TraversableLike → GenTraversableLike
  75. def lastValue: Option[B]

    Optionally returns the last value of this priority map.

  76. def lift: (A) ⇒ Option[B]
    Definition Classes
    PartialFunction
  77. def map[B, That](f: ((A, B)) ⇒ B)(implicit bf: CanBuildFrom[This, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  78. def mapValues[C](f: (B) ⇒ C)(implicit ord: Ordering[C]): PriorityMap[A, 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 new priority map that maps every key of this map to f(this(key))

  79. def mapValues[W](f: (B) ⇒ W): Map[A, W]
    Definition Classes
    MapLike → MapLike → GenMapLike
  80. def max[B >: (A, B)](implicit cmp: Ordering[B]): (A, B)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  81. def maxBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  82. def merged(kvs: GenTraversableOnce[(A, B)])(f: (B, B) ⇒ B): This

    Merges a number of key/value bindings into this priority map.

    Merges a number of key/value bindings into this priority map.

    If a key is contained in both this map and the given bindings, computes the new value by applying the given merge function to the existing value and the new value.

    kvs

    a traversable object consisting of key/value pairs

    f

    the merge function

    returns

    a new priority map with the new bindings merged into this map

  83. def min[B >: (A, B)](implicit cmp: Ordering[B]): (A, B)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. def minBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  89. def newBuilder: PriorityMapBuilder[A, B, This]
    Attributes
    protected[this]
    Definition Classes
    PriorityMapLike → MapLike → TraversableLike → HasNewBuilder
  90. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. final def notify(): Unit
    Definition Classes
    AnyRef
  92. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  93. def orElse[A1 <: A, B1 >: B](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  94. def par: ParMap[A, B]
    Definition Classes
    Parallelizable
  95. def parCombiner: Combiner[(A, B), ParMap[A, B]]
    Attributes
    protected[this]
    Definition Classes
    MapLike → MapLike → TraversableLike → Parallelizable
  96. def partition(p: ((A, B)) ⇒ Boolean): (This, This)
    Definition Classes
    TraversableLike → GenTraversableLike
  97. def product[B >: (A, B)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def range(from: B, until: B): This

    Returns a new priority map of the same type as this priority map that only contains values between the given bounds.

    Returns a new priority map of the same type as this priority map that only contains values between the given bounds.

    from

    the lower-bound (inclusive) on values

    until

    the upper-bound (exclusive) on values

  99. def reduce[A1 >: (A, B)](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def reduceLeft[B >: (A, B)](op: (B, (A, B)) ⇒ B): B
    Definition Classes
    TraversableOnce
  101. def reduceLeftOption[B >: (A, B)](op: (B, (A, B)) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def reduceOption[A1 >: (A, B)](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def reduceRight[B >: (A, B)](op: ((A, B), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  104. def reduceRightOption[B >: (A, B)](op: ((A, B), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def repr: This
    Definition Classes
    TraversableLike → GenTraversableLike
  106. def reversed: List[(A, B)]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  107. def runWith[U](action: (B) ⇒ U): (A) ⇒ Boolean
    Definition Classes
    PartialFunction
  108. def sameElements[B >: (A, B)](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  109. def scan[B >: (A, B), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[This, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  110. def scanLeft[B, That](z: B)(op: (B, (A, B)) ⇒ B)(implicit bf: CanBuildFrom[This, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  111. def scanRight[B, That](z: B)(op: ((A, B), B) ⇒ B)(implicit bf: CanBuildFrom[This, 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.

  112. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  114. def slice(from: Int, until: Int): This
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  115. def sliding(size: Int, step: Int): Iterator[This]
    Definition Classes
    IterableLike
  116. def sliding(size: Int): Iterator[This]
    Definition Classes
    IterableLike
  117. def span(p: ((A, B)) ⇒ Boolean): (This, This)
    Definition Classes
    TraversableLike → GenTraversableLike
  118. def splitAt(n: Int): (This, This)
    Definition Classes
    TraversableLike → GenTraversableLike
  119. def stringPrefix: String
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  120. def sum[B >: (A, B)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  122. def tail: This
    Definition Classes
    TraversableLike → GenTraversableLike
  123. def tails: Iterator[This]
    Definition Classes
    TraversableLike
  124. def take(n: Int): This
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  125. def takeRight(n: Int): This
    Definition Classes
    IterableLike
  126. def takeWhile(p: ((A, B)) ⇒ Boolean): This
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  127. def thisCollection: Iterable[(A, B)]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  128. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (A, B), Col[(A, B)]]): Col[(A, B)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  129. def toArray[B >: (A, B)](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def toBuffer[E >: (A, B)]: Buffer[E]
    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce
  131. def toCollection(repr: This): Iterable[(A, B)]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  132. def toIndexedSeq: IndexedSeq[(A, B)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def toIterable: Iterable[(A, B)]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  134. def toIterator: Iterator[(A, B)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  135. def toList: List[(A, B)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def toMap[T, U](implicit ev: <:<[(A, B), (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. def toSeq: Seq[(A, B)]
    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce
  138. def toSet[B >: (A, B)]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. def toStream: Stream[(A, B)]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  140. def toString(): String
    Definition Classes
    MapLike → TraversableLike → Function1 → AnyRef → Any
  141. def toTraversable: Traversable[(A, B)]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  142. def toVector: Vector[(A, B)]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. def transform[W, That](f: (A, B) ⇒ W)(implicit bf: CanBuildFrom[This, (A, W), That]): That
    Definition Classes
    MapLike
  144. def until(until: B): This

    Returns a new priority map of the same type as this priority map that only contains values smaller than the given upper bound.

    Returns a new priority map of the same type as this priority map that only contains values smaller than the given upper bound.

    until

    the upper-bound (exclusive) on values

  145. def updated(key: A, value: B): This

    Adds a key/value binding to this priority map.

    Adds a key/value binding to this priority map.

    key

    the key

    value

    the value

    returns

    a new priority map with the new binding added to this map

  146. def updated[V1 >: B](key: A, value: V1): Map[A, V1]
    Definition Classes
    MapLike → MapLike
  147. def valueSet: SortedSet[B]

    Returns the values of this priority map as a sorted set.

  148. def values: Iterable[B]
    Definition Classes
    MapLike → GenMapLike
    Annotations
    @migration
    Migration

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

  149. def valuesIterator: Iterator[B]
    Definition Classes
    MapLike → GenMapLike
  150. def view(from: Int, until: Int): IterableView[(A, B), This]
    Definition Classes
    IterableLike → TraversableLike
  151. def view: IterableView[(A, B), This]
    Definition Classes
    IterableLike → TraversableLike
  152. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  153. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  154. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  155. def withFilter(p: ((A, B)) ⇒ Boolean): FilterMonadic[(A, B), This]
    Definition Classes
    TraversableLike → FilterMonadic
  156. def zip[A1 >: (A, B), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[This, (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  157. def zipAll[B, A1 >: (A, B), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[This, (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  158. def zipWithIndex[A1 >: (A, B), That](implicit bf: CanBuildFrom[This, (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

Inherited from MapLike[A, B, This]

Inherited from MapLike[A, B, This]

Inherited from Subtractable[A, This]

Inherited from GenMapLike[A, B, This]

Inherited from IterableLike[(A, B), This]

Inherited from GenIterableLike[(A, B), This]

Inherited from TraversableLike[(A, B), This]

Inherited from GenTraversableLike[(A, B), This]

Inherited from Parallelizable[(A, B), ParMap[A, B]]

Inherited from TraversableOnce[(A, B)]

Inherited from GenTraversableOnce[(A, B)]

Inherited from FilterMonadic[(A, B), This]

Inherited from HasNewBuilder[(A, B), This]

Inherited from Equals

Inherited from PartialFunction[A, B]

Inherited from (A) ⇒ B

Inherited from AnyRef

Inherited from Any

Ungrouped