de.ummels.prioritymap

PriorityMap

trait PriorityMap[A, B] extends Map[A, B] with PriorityMapLike[A, B, PriorityMap[A, B]]

A generic trait for immutable priority maps. Concrete classes have to provide functionality for the abstract methods in PriorityMap:

implicit def ordering: Ordering[B]
def get(key: A): Option[B]
def iterator: Iterator[(A, B)]
def +(kv: (A, B)): PriorityMap[A, B]
def +[B1 >: B](kv: (A, B1)): Map[A, B1]
def -(key: A): PriorityMap[A, B]
def rangeImpl(from: Option[B], until: Option[B]): PriorityMap[A, B]

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.

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

Type Members

  1. class DefaultKeySet extends AbstractSet[A] with Set[A] with Serializable

    Attributes
    protected
    Definition Classes
    MapLike
  2. class DefaultValuesIterable extends AbstractIterable[B] with Iterable[B] with Serializable

    Attributes
    protected
    Definition Classes
    MapLike
  3. class FilteredKeys extends AbstractMap[A, B] with DefaultMap[A, B]

    Attributes
    protected
    Definition Classes
    MapLike
  4. class ImmutableDefaultKeySet extends scala.collection.immutable.MapLike.DefaultKeySet with Set[A]

    Attributes
    protected
    Definition Classes
    MapLike
  5. class MappedValues[C] extends AbstractMap[A, C] with DefaultMap[A, C]

    Attributes
    protected
    Definition Classes
    MapLike
  6. type Self = PriorityMap[A, B]

    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)): PriorityMap[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
    PriorityMapLike
  2. abstract def +[B1 >: B](kv: (A, B1)): Map[A, B1]

    Definition Classes
    Map → MapLike → MapLike → GenMapLike
  3. abstract def -(key: A): PriorityMap[A, B]

    Definition Classes
    MapLike → Subtractable → GenMapLike
  4. abstract def get(key: A): Option[B]

    Definition Classes
    MapLike → GenMapLike
  5. abstract def iterator: Iterator[(A, B)]

    Definition Classes
    MapLike → IterableLike → GenIterableLike
  6. implicit abstract def ordering: Ordering[B]

    Definition Classes
    PriorityMapLike
  7. abstract def rangeImpl(from: Option[B], until: Option[B]): PriorityMap[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
    PriorityMapLike

Concrete Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. def +(kv1: (A, B), kv2: (A, B), kvs: (A, B)*): PriorityMap[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
  5. def +[B1 >: B](elem1: (A, B1), elem2: (A, B1), elems: (A, B1)*): Map[A, B1]

    Definition Classes
    MapLike → MapLike
  6. def ++(kvs: GenTraversableOnce[(A, B)]): PriorityMap[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
  7. def ++[B1 >: B](xs: GenTraversableOnce[(A, B1)]): Map[A, B1]

    Definition Classes
    MapLike → MapLike
  8. def ++[B >: (A, B), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[PriorityMap[A, B], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  9. def ++:[B >: (A, B), That](that: Traversable[B])(implicit bf: CanBuildFrom[PriorityMap[A, B], B, That]): That

    Definition Classes
    TraversableLike
  10. def ++:[B >: (A, B), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[PriorityMap[A, B], B, That]): That

    Definition Classes
    TraversableLike
  11. def -(elem1: A, elem2: A, elems: A*): PriorityMap[A, B]

    Definition Classes
    Subtractable
  12. def --(xs: GenTraversableOnce[A]): PriorityMap[A, B]

    Definition Classes
    Subtractable
  13. def /:[B](z: B)(op: (B, (A, B)) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  14. def :\[B](z: B)(op: ((A, B), B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  15. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  16. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  17. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Definition Classes
    MapLike → TraversableOnce
  18. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce
  19. def addString(b: StringBuilder, sep: String): StringBuilder

    Definition Classes
    TraversableOnce
  20. def aggregate[B](z: B)(seqop: (B, (A, B)) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  21. def andThen[C](k: (B) ⇒ C): PartialFunction[A, C]

    Definition Classes
    PartialFunction → Function1
  22. def apply(key: A): B

    Definition Classes
    MapLike → GenMapLike → Function1
  23. def applyOrElse[A1 <: A, B1 >: B](x: A1, default: (A1) ⇒ B1): B1

    Definition Classes
    PartialFunction
  24. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  25. def canEqual(that: Any): Boolean

    Definition Classes
    IterableLike → Equals
  26. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. def collect[B, That](pf: PartialFunction[(A, B), B])(implicit bf: CanBuildFrom[PriorityMap[A, B], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  28. def collectFirst[B](pf: PartialFunction[(A, B), B]): Option[B]

    Definition Classes
    TraversableOnce
  29. def companion: GenericCompanion[Iterable]

    Definition Classes
    Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  30. def compose[A](g: (A) ⇒ A): (A) ⇒ B

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  31. def contains(key: A): Boolean

    Definition Classes
    MapLike → GenMapLike
  32. def copyToArray[B >: (A, B)](xs: Array[B], start: Int, len: Int): Unit

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  33. def copyToArray[B >: (A, B)](xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce
  34. def copyToArray[B >: (A, B)](xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce
  35. def copyToBuffer[B >: (A, B)](dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce
  36. def count(p: ((A, B)) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce
  37. def default(key: A): B

    Definition Classes
    MapLike → GenMapLike
  38. def drop(n: Int): PriorityMap[A, B]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  39. def dropRight(n: Int): PriorityMap[A, B]

    Definition Classes
    IterableLike
  40. def dropWhile(p: ((A, B)) ⇒ Boolean): PriorityMap[A, B]

    Definition Classes
    TraversableLike → GenTraversableLike
  41. def empty: PriorityMap[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
    PriorityMap → Map → Map → MapLike
  42. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  43. def equals(that: Any): Boolean

    Definition Classes
    GenMapLike → Equals → AnyRef → Any
  44. def exists(p: ((A, B)) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  45. def filter(p: ((A, B)) ⇒ Boolean): PriorityMap[A, B]

    Definition Classes
    TraversableLike → GenTraversableLike
  46. def filterKeys(p: (A) ⇒ Boolean): PriorityMap[A, B]

    Definition Classes
    PriorityMapLike → MapLike → MapLike → GenMapLike
  47. def filterNot(p: ((A, B)) ⇒ Boolean): PriorityMap[A, B]

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike
  48. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  49. def find(p: ((A, B)) ⇒ Boolean): Option[(A, B)]

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  50. 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
  51. 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
  52. def flatMap[B, That](f: ((A, B)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[PriorityMap[A, B], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  53. def flatten[B](implicit asTraversable: ((A, B)) ⇒ GenTraversableOnce[B]): Iterable[B]

    Definition Classes
    GenericTraversableTemplate
  54. def fold[A1 >: (A, B)](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce
  55. def foldLeft[B](z: B)(op: (B, (A, B)) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  56. def foldRight[B](z: B)(op: ((A, B), B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  57. def forall(p: ((A, B)) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  58. def foreach[U](f: ((A, B)) ⇒ U): Unit

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  59. def from(from: B): PriorityMap[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
  60. def genericBuilder[B]: Builder[B, Iterable[B]]

    Definition Classes
    GenericTraversableTemplate
  61. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  62. def getOrElse[B1 >: B](key: A, default: ⇒ B1): B1

    Definition Classes
    MapLike → GenMapLike
  63. def groupBy[K](f: ((A, B)) ⇒ K): Map[K, PriorityMap[A, B]]

    Definition Classes
    TraversableLike → GenTraversableLike
  64. def grouped(size: Int): Iterator[PriorityMap[A, B]]

    Definition Classes
    IterableLike
  65. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  66. def hashCode(): Int

    Definition Classes
    GenMapLike → AnyRef → Any
  67. def head: (A, B)

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  68. def headOption: Option[(A, B)]

    Definition Classes
    TraversableLike → GenTraversableLike
  69. def init: PriorityMap[A, B]

    Definition Classes
    TraversableLike → GenTraversableLike
  70. def inits: Iterator[PriorityMap[A, B]]

    Definition Classes
    TraversableLike
  71. def isDefinedAt(key: A): Boolean

    Definition Classes
    MapLike → GenMapLike → PartialFunction
  72. def isEmpty: Boolean

    Definition Classes
    MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  73. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  74. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  75. def keySet: Set[A]

    Definition Classes
    MapLike → MapLike → GenMapLike
  76. def keys: Iterable[A]

    Definition Classes
    MapLike → GenMapLike
    Annotations
    @migration
    Migration

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

  77. def keysIterator: Iterator[A]

    Definition Classes
    MapLike → GenMapLike
  78. def last: (A, B)

    Definition Classes
    TraversableLike → GenTraversableLike
  79. 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
  80. def lastOption: Option[(A, B)]

    Definition Classes
    TraversableLike → GenTraversableLike
  81. 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
  82. def lift: (A) ⇒ Option[B]

    Definition Classes
    PartialFunction
  83. def map[B, That](f: ((A, B)) ⇒ B)(implicit bf: CanBuildFrom[PriorityMap[A, B], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  84. 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
  85. def mapValues[C](f: (B) ⇒ C): Map[A, C]

    Definition Classes
    MapLike → MapLike → GenMapLike
  86. def max[B >: (A, B)](implicit cmp: Ordering[B]): (A, B)

    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def maxBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)

    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def merged(kvs: GenTraversableOnce[(A, B)])(f: (B, B) ⇒ B): PriorityMap[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
  89. def min[B >: (A, B)](implicit cmp: Ordering[B]): (A, B)

    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def minBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)

    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def mkString(start: String, sep: String, end: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  95. def newBuilder: PriorityMapBuilder[A, B, PriorityMap[A, B]]

    Attributes
    protected[this]
    Definition Classes
    PriorityMapLike → MapLike → TraversableLike → HasNewBuilder
  96. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. final def notify(): Unit

    Definition Classes
    AnyRef
  98. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  99. def orElse[A1 <: A, B1 >: B](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Definition Classes
    PartialFunction
  100. def par: ParMap[A, B]

    Definition Classes
    Parallelizable
  101. def parCombiner: Combiner[(A, B), ParMap[A, B]]

    Attributes
    protected[this]
    Definition Classes
    MapLike → MapLike → TraversableLike → Parallelizable
  102. def partition(p: ((A, B)) ⇒ Boolean): (PriorityMap[A, B], PriorityMap[A, B])

    Definition Classes
    TraversableLike → GenTraversableLike
  103. def product[B >: (A, B)](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def range(from: B, until: B): PriorityMap[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
  105. def reduce[A1 >: (A, B)](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. def reduceLeft[B >: (A, B)](op: (B, (A, B)) ⇒ B): B

    Definition Classes
    TraversableOnce
  107. def reduceLeftOption[B >: (A, B)](op: (B, (A, B)) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  108. def reduceOption[A1 >: (A, B)](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def reduceRight[B >: (A, B)](op: ((A, B), B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  110. def reduceRightOption[B >: (A, B)](op: ((A, B), B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def repr: PriorityMap[A, B]

    Definition Classes
    TraversableLike → GenTraversableLike
  112. def reversed: List[(A, B)]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  113. def runWith[U](action: (B) ⇒ U): (A) ⇒ Boolean

    Definition Classes
    PartialFunction
  114. def sameElements[B >: (A, B)](that: GenIterable[B]): Boolean

    Definition Classes
    IterableLike → GenIterableLike
  115. def scan[B >: (A, B), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[PriorityMap[A, B], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  116. def scanLeft[B, That](z: B)(op: (B, (A, B)) ⇒ B)(implicit bf: CanBuildFrom[PriorityMap[A, B], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  117. def scanRight[B, That](z: B)(op: ((A, B), B) ⇒ B)(implicit bf: CanBuildFrom[PriorityMap[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.

  118. def seq: PriorityMap[A, B]

    Definition Classes
    PriorityMap → Map → Map → GenMap → GenMapLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  119. def size: Int

    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. def slice(from: Int, until: Int): PriorityMap[A, B]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  121. def sliding(size: Int, step: Int): Iterator[PriorityMap[A, B]]

    Definition Classes
    IterableLike
  122. def sliding(size: Int): Iterator[PriorityMap[A, B]]

    Definition Classes
    IterableLike
  123. def span(p: ((A, B)) ⇒ Boolean): (PriorityMap[A, B], PriorityMap[A, B])

    Definition Classes
    TraversableLike → GenTraversableLike
  124. def splitAt(n: Int): (PriorityMap[A, B], PriorityMap[A, B])

    Definition Classes
    TraversableLike → GenTraversableLike
  125. def stringPrefix: String

    Definition Classes
    PriorityMap → MapLike → TraversableLike → GenTraversableLike
  126. def sum[B >: (A, B)](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  127. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  128. def tail: PriorityMap[A, B]

    Definition Classes
    TraversableLike → GenTraversableLike
  129. def tails: Iterator[PriorityMap[A, B]]

    Definition Classes
    TraversableLike
  130. def take(n: Int): PriorityMap[A, B]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  131. def takeRight(n: Int): PriorityMap[A, B]

    Definition Classes
    IterableLike
  132. def takeWhile(p: ((A, B)) ⇒ Boolean): PriorityMap[A, B]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  133. def thisCollection: Iterable[(A, B)]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  134. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (A, B), Col[(A, B)]]): Col[(A, B)]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  135. def toArray[B >: (A, B)](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def toBuffer[C >: (A, B)]: Buffer[C]

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce
  137. def toCollection(repr: PriorityMap[A, B]): Iterable[(A, B)]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  138. def toIndexedSeq: IndexedSeq[(A, B)]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. def toIterable: Iterable[(A, B)]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  140. def toIterator: Iterator[(A, B)]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  141. def toList: List[(A, B)]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  142. def toMap[T, U](implicit ev: <:<[(A, B), (T, U)]): Map[T, U]

    Definition Classes
    Map → TraversableOnce → GenTraversableOnce
  143. def toSeq: Seq[(A, B)]

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce
  144. def toSet[B >: (A, B)]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  145. def toStream: Stream[(A, B)]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  146. def toString(): String

    Definition Classes
    MapLike → TraversableLike → Function1 → AnyRef → Any
  147. def toTraversable: Traversable[(A, B)]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  148. def toVector: Vector[(A, B)]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  149. def transform[C, That](f: (A, B) ⇒ C)(implicit bf: CanBuildFrom[PriorityMap[A, B], (A, C), That]): That

    Definition Classes
    MapLike
  150. 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.

  151. def until(until: B): PriorityMap[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
  152. def unzip[A1, A2](implicit asPair: ((A, B)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

    Definition Classes
    GenericTraversableTemplate
  153. def unzip3[A1, A2, A3](implicit asTriple: ((A, B)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

    Definition Classes
    GenericTraversableTemplate
  154. def updated(key: A, value: B): PriorityMap[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
  155. def updated[B1 >: B](key: A, value: B1): Map[A, B1]

    Definition Classes
    MapLike → MapLike
  156. 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
    PriorityMapLike
  157. def values: Iterable[B]

    Definition Classes
    MapLike → GenMapLike
    Annotations
    @migration
    Migration

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

  158. def valuesIterator: Iterator[B]

    Definition Classes
    MapLike → GenMapLike
  159. def view(from: Int, until: Int): IterableView[(A, B), PriorityMap[A, B]]

    Definition Classes
    IterableLike → TraversableLike
  160. def view: IterableView[(A, B), PriorityMap[A, B]]

    Definition Classes
    IterableLike → TraversableLike
  161. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  162. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  163. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  164. 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

  165. def withDefault[B1 >: B](d: (A) ⇒ B1): Map[A, B1]

    Definition Classes
    Map
  166. 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

  167. def withDefaultValue[B1 >: B](d: B1): Map[A, B1]

    Definition Classes
    Map
  168. def withFilter(p: ((A, B)) ⇒ Boolean): FilterMonadic[(A, B), PriorityMap[A, B]]

    Definition Classes
    TraversableLike → FilterMonadic
  169. def zip[A1 >: (A, B), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[PriorityMap[A, B], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike
  170. def zipAll[B, A1 >: (A, B), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[PriorityMap[A, B], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike
  171. def zipWithIndex[A1 >: (A, B), That](implicit bf: CanBuildFrom[PriorityMap[A, B], (A1, Int), That]): That

    Definition Classes
    IterableLike → GenIterableLike

Deprecated Value Members

  1. def /:\[A1 >: (A, B)](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

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

Inherited from Map[A, B]

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

Inherited from Map[A, B]

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

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

Inherited from PartialFunction[A, B]

Inherited from (A) ⇒ B

Inherited from GenMap[A, B]

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

Inherited from Iterable[(A, B)]

Inherited from Iterable[(A, B)]

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

Inherited from Equals

Inherited from GenIterable[(A, B)]

Inherited from GenIterableLike[(A, B), PriorityMap[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), PriorityMap[A, B]]

Inherited from GenTraversableLike[(A, B), PriorityMap[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), PriorityMap[A, B]]

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

Inherited from AnyRef

Inherited from Any

Ungrouped