final class StandardPriorityMap[A, B] extends PriorityMap[A, B] with PriorityMapLike[A, B, StandardPriorityMap[A, B]] with Serializable

Default implementation of immutable priority maps using a pair of maps.

Source
StandardPriorityMap.scala
Linear Supertypes
Serializable, Serializable, PriorityMap[A, B], PriorityMapLike[A, B, StandardPriorityMap[A, B]], Map[A, B], MapLike[A, B, StandardPriorityMap[A, B]], Map[A, B], MapLike[A, B, StandardPriorityMap[A, B]], Subtractable[A, StandardPriorityMap[A, B]], PartialFunction[A, B], (A) ⇒ B, GenMap[A, B], GenMapLike[A, B, StandardPriorityMap[A, B]], Iterable[(A, B)], Iterable[(A, B)], IterableLike[(A, B), StandardPriorityMap[A, B]], Equals, GenIterable[(A, B)], GenIterableLike[(A, B), StandardPriorityMap[A, B]], Traversable[(A, B)], Immutable, Traversable[(A, B)], GenTraversable[(A, B)], GenericTraversableTemplate[(A, B), Iterable], TraversableLike[(A, B), StandardPriorityMap[A, B]], GenTraversableLike[(A, B), StandardPriorityMap[A, B]], Parallelizable[(A, B), ParMap[A, B]], TraversableOnce[(A, B)], GenTraversableOnce[(A, B)], FilterMonadic[(A, B), StandardPriorityMap[A, B]], HasNewBuilder[(A, B), StandardPriorityMap[A, B]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. StandardPriorityMap
  2. Serializable
  3. Serializable
  4. PriorityMap
  5. PriorityMapLike
  6. Map
  7. MapLike
  8. Map
  9. MapLike
  10. Subtractable
  11. PartialFunction
  12. Function1
  13. GenMap
  14. GenMapLike
  15. Iterable
  16. Iterable
  17. IterableLike
  18. Equals
  19. GenIterable
  20. GenIterableLike
  21. Traversable
  22. Immutable
  23. Traversable
  24. GenTraversable
  25. GenericTraversableTemplate
  26. TraversableLike
  27. GenTraversableLike
  28. Parallelizable
  29. TraversableOnce
  30. GenTraversableOnce
  31. FilterMonadic
  32. HasNewBuilder
  33. AnyRef
  34. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new StandardPriorityMap()(implicit ordering: Ordering[B])

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 = StandardPriorityMap[A, B]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  7. 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 +[B1 >: B](kv: (A, B1)): Map[A, B1]
    Definition Classes
    StandardPriorityMap → Map → MapLike → MapLike → GenMapLike
  4. def +(kv: (A, B)): StandardPriorityMap[A, B]

    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

    Definition Classes
    StandardPriorityMap → PriorityMapLike
  5. def +(kv1: (A, B), kv2: (A, B), kvs: (A, B)*): StandardPriorityMap[A, B]

    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

    Definition Classes
    PriorityMapLike
  6. def +[V1 >: B](elem1: (A, V1), elem2: (A, V1), elems: (A, V1)*): Map[A, V1]
    Definition Classes
    MapLike → MapLike
  7. def ++(kvs: GenTraversableOnce[(A, B)]): StandardPriorityMap[A, B]

    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

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

    An empty priority map of the same type as this priority map.

    An empty priority map of the same type as this priority map.

    Definition Classes
    StandardPriorityMap → PriorityMap → Map → Map → MapLike
  43. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  44. def equals(that: Any): Boolean
    Definition Classes
    GenMapLike → Equals → AnyRef → Any
  45. def exists(p: ((A, B)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  46. def filter(p: ((A, B)) ⇒ Boolean): StandardPriorityMap[A, B]
    Definition Classes
    TraversableLike → GenTraversableLike
  47. def filterKeys(p: (A) ⇒ Boolean): PriorityMap[A, B]
    Definition Classes
    PriorityMapLike → MapLike → MapLike → GenMapLike
  48. def filterNot(p: ((A, B)) ⇒ Boolean): StandardPriorityMap[A, B]
    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  49. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  50. def find(p: ((A, B)) ⇒ Boolean): Option[(A, B)]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  51. def firstKey: Option[A]

    Optionally returns the first key of this priority map.

    Optionally returns the first key of this priority map.

    Definition Classes
    PriorityMapLike
  52. def firstValue: Option[B]

    Optionally returns the first value of this priority map.

    Optionally returns the first value of this priority map.

    Definition Classes
    PriorityMapLike
  53. def flatMap[B, That](f: ((A, B)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[StandardPriorityMap[A, B], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  54. def flatten[B](implicit asTraversable: ((A, B)) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  55. def fold[A1 >: (A, B)](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  56. def foldLeft[B](z: B)(op: (B, (A, B)) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  57. def foldRight[B](z: B)(op: ((A, B), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  58. def forall(p: ((A, B)) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  59. def foreach[U](f: ((A, B)) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  60. def from(from: B): StandardPriorityMap[A, B]

    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

    Definition Classes
    PriorityMapLike
  61. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  62. def get(key: A): Option[B]
    Definition Classes
    StandardPriorityMap → MapLike → GenMapLike
  63. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  64. def getOrElse[V1 >: B](key: A, default: ⇒ V1): V1
    Definition Classes
    MapLike → GenMapLike
  65. def groupBy[K](f: ((A, B)) ⇒ K): Map[K, StandardPriorityMap[A, B]]
    Definition Classes
    TraversableLike → GenTraversableLike
  66. def grouped(size: Int): Iterator[StandardPriorityMap[A, B]]
    Definition Classes
    IterableLike
  67. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  68. def hashCode(): Int
    Definition Classes
    GenMapLike → AnyRef → Any
  69. def head: (A, B)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  70. def headOption: Option[(A, B)]
    Definition Classes
    TraversableLike → GenTraversableLike
  71. def init: StandardPriorityMap[A, B]
    Definition Classes
    StandardPriorityMap → TraversableLike → GenTraversableLike
  72. def inits: Iterator[StandardPriorityMap[A, B]]
    Definition Classes
    TraversableLike
  73. def isDefinedAt(key: A): Boolean
    Definition Classes
    MapLike → GenMapLike → PartialFunction
  74. def isEmpty: Boolean
    Definition Classes
    MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  75. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  76. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  77. def iterator: Iterator[(A, B)]
    Definition Classes
    StandardPriorityMap → MapLike → IterableLike → GenIterableLike
  78. def keySet: Set[A]
    Definition Classes
    MapLike → MapLike → GenMapLike
  79. 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].

  80. def keysIterator: Iterator[A]
    Definition Classes
    MapLike → GenMapLike
  81. def last: (A, B)
    Definition Classes
    StandardPriorityMap → TraversableLike → GenTraversableLike
  82. def lastKey: Option[A]

    Optionally returns the last key of this priority map.

    Optionally returns the last key of this priority map.

    Definition Classes
    PriorityMapLike
  83. def lastOption: Option[(A, B)]
    Definition Classes
    TraversableLike → GenTraversableLike
  84. def lastValue: Option[B]

    Optionally returns the last value of this priority map.

    Optionally returns the last value of this priority map.

    Definition Classes
    PriorityMapLike
  85. def lift: (A) ⇒ Option[B]
    Definition Classes
    PartialFunction
  86. def map[B, That](f: ((A, B)) ⇒ B)(implicit bf: CanBuildFrom[StandardPriorityMap[A, B], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  87. 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))

    Definition Classes
    PriorityMapLike
  88. def mapValues[W](f: (B) ⇒ W): Map[A, W]
    Definition Classes
    MapLike → MapLike → GenMapLike
  89. def max[B >: (A, B)](implicit cmp: Ordering[B]): (A, B)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def maxBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def merged(kvs: GenTraversableOnce[(A, B)])(f: (B, B) ⇒ B): StandardPriorityMap[A, B]

    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

    Definition Classes
    PriorityMapLike
  92. def min[B >: (A, B)](implicit cmp: Ordering[B]): (A, B)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def minBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)
    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: PriorityMapBuilder[A, B, StandardPriorityMap[A, B]]
    Attributes
    protected[this]
    Definition Classes
    PriorityMapLike → 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 <: A, B1 >: B](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  103. implicit val ordering: Ordering[B]
    Definition Classes
    StandardPriorityMap → PriorityMapLike
  104. def par: ParMap[A, B]
    Definition Classes
    StandardPriorityMap → Parallelizable
  105. def parCombiner: Combiner[(A, B), ParMap[A, B]]
    Attributes
    protected[this]
    Definition Classes
    MapLike → MapLike → TraversableLike → Parallelizable
  106. def partition(p: ((A, B)) ⇒ Boolean): (StandardPriorityMap[A, B], StandardPriorityMap[A, B])
    Definition Classes
    TraversableLike → GenTraversableLike
  107. def product[B >: (A, B)](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  108. def range(from: B, until: B): StandardPriorityMap[A, B]

    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

    Definition Classes
    PriorityMapLike
  109. def rangeImpl(from: Option[B], until: Option[B]): StandardPriorityMap[A, B]

    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

    Definition Classes
    StandardPriorityMap → PriorityMapLike
  110. def reduce[A1 >: (A, B)](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def reduceLeft[B >: (A, B)](op: (B, (A, B)) ⇒ B): B
    Definition Classes
    TraversableOnce
  112. def reduceLeftOption[B >: (A, B)](op: (B, (A, B)) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def reduceOption[A1 >: (A, B)](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def reduceRight[B >: (A, B)](op: ((A, B), B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  115. def reduceRightOption[B >: (A, B)](op: ((A, B), B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def repr: StandardPriorityMap[A, B]
    Definition Classes
    TraversableLike → GenTraversableLike
  117. def reversed: List[(A, B)]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  118. def runWith[U](action: (B) ⇒ U): (A) ⇒ Boolean
    Definition Classes
    PartialFunction
  119. def sameElements[B >: (A, B)](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  120. def scan[B >: (A, B), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[StandardPriorityMap[A, B], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  121. def scanLeft[B, That](z: B)(op: (B, (A, B)) ⇒ B)(implicit bf: CanBuildFrom[StandardPriorityMap[A, B], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  122. def scanRight[B, That](z: B)(op: ((A, B), B) ⇒ B)(implicit bf: CanBuildFrom[StandardPriorityMap[A, B], 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.

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

  157. def until(until: B): StandardPriorityMap[A, B]

    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

    Definition Classes
    PriorityMapLike
  158. def unzip[A1, A2](implicit asPair: ((A, B)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  159. def unzip3[A1, A2, A3](implicit asTriple: ((A, B)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  160. def updated(key: A, value: B): StandardPriorityMap[A, B]

    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

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

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

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

    Definition Classes
    StandardPriorityMap → PriorityMapLike
  163. 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].

  164. def valuesIterator: Iterator[B]
    Definition Classes
    MapLike → GenMapLike
  165. def view(from: Int, until: Int): IterableView[(A, B), StandardPriorityMap[A, B]]
    Definition Classes
    IterableLike → TraversableLike
  166. def view: IterableView[(A, B), StandardPriorityMap[A, B]]
    Definition Classes
    IterableLike → TraversableLike
  167. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  168. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  169. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  170. def withDefault(d: (A) ⇒ B): PriorityMap[A, B]

    The same priority map with a given default function.

    The same priority map with a given default function. Note: get, contains, iterator, keys, etc. are not affected by withDefault.

    Invoking transformer methods (e.g. map) will not preserve the default value.

    d

    the function mapping keys to values, used for non-present keys

    returns

    a wrapper of this priority map with a default function

    Definition Classes
    PriorityMap
  171. def withDefault[V1 >: B](d: (A) ⇒ V1): Map[A, V1]
    Definition Classes
    Map
  172. def withDefaultValue(d: B): PriorityMap[A, B]

    The same priority map with a given default value.

    The same priority map with a given default value. Note: get, contains, iterator, keys, etc. are not affected by withDefaultValue.

    Invoking transformer methods (e.g. map) will not preserve the default value.

    d

    default value used for non-present keys

    returns

    a wrapper of this priority map with a default value

    Definition Classes
    PriorityMap
  173. def withDefaultValue[V1 >: B](d: V1): Map[A, V1]
    Definition Classes
    Map
  174. def withFilter(p: ((A, B)) ⇒ Boolean): FilterMonadic[(A, B), StandardPriorityMap[A, B]]
    Definition Classes
    TraversableLike → FilterMonadic
  175. def zip[A1 >: (A, B), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[StandardPriorityMap[A, B], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  176. def zipAll[B, A1 >: (A, B), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[StandardPriorityMap[A, B], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  177. def zipWithIndex[A1 >: (A, B), That](implicit bf: CanBuildFrom[StandardPriorityMap[A, B], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

Inherited from Serializable

Inherited from Serializable

Inherited from PriorityMap[A, B]

Inherited from PriorityMapLike[A, B, StandardPriorityMap[A, B]]

Inherited from Map[A, B]

Inherited from MapLike[A, B, StandardPriorityMap[A, B]]

Inherited from Map[A, B]

Inherited from MapLike[A, B, StandardPriorityMap[A, B]]

Inherited from Subtractable[A, StandardPriorityMap[A, B]]

Inherited from PartialFunction[A, B]

Inherited from (A) ⇒ B

Inherited from GenMap[A, B]

Inherited from GenMapLike[A, B, StandardPriorityMap[A, B]]

Inherited from Iterable[(A, B)]

Inherited from Iterable[(A, B)]

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

Inherited from Equals

Inherited from GenIterable[(A, B)]

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

Inherited from Traversable[(A, B)]

Inherited from Immutable

Inherited from Traversable[(A, B)]

Inherited from GenTraversable[(A, B)]

Inherited from GenericTraversableTemplate[(A, B), Iterable]

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

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

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

Inherited from TraversableOnce[(A, B)]

Inherited from GenTraversableOnce[(A, B)]

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped