StandardPriorityMap

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +[B1 >: B](kv: (A, B1)): Map[A, B1]

def +(kv: (A, B)): StandardPriorityMap[A, B]

Adds a key/value binding to this priority map.

def +(kv1: (A, B), kv2: (A, B), kvs: (A, B)*): StandardPriorityMap[A, B]

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

def +[B1 >: B](elem1: (A, B1), elem2: (A, B1), elems: (A, B1)*): Map[A, B1]

def ++(kvs: GenTraversableOnce[(A, B)]): StandardPriorityMap[A, B]

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

def ++[B1 >: B](xs: GenTraversableOnce[(A, B1)]): Map[A, B1]

def ++[B >: (A, B), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[StandardPriorityMap[A, B], B, That]): That

def ++:[B >: (A, B), That](that: Traversable[B])(implicit bf: CanBuildFrom[StandardPriorityMap[A, B], B, That]): That

def ++:[B >: (A, B), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[StandardPriorityMap[A, B], B, That]): That

def -(key: A): StandardPriorityMap[A, B]

def -(elem1: A, elem2: A, elems: A*): StandardPriorityMap[A, B]

def --(xs: GenTraversableOnce[A]): StandardPriorityMap[A, B]

def /:[B](z: B)(op: (B, (A, B)) ⇒ B): B

def :\[B](z: B)(op: ((A, B), B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def aggregate[B](z: B)(seqop: (B, (A, B)) ⇒ B, combop: (B, B) ⇒ B): B

def andThen[C](k: (B) ⇒ C): PartialFunction[A, C]

def apply(key: A): B

def applyOrElse[A1 <: A, B1 >: B](x: A1, default: (A1) ⇒ B1): B1

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[(A, B), B])(implicit bf: CanBuildFrom[StandardPriorityMap[A, B], B, That]): That

def collectFirst[B](pf: PartialFunction[(A, B), B]): Option[B]

def companion: GenericCompanion[Iterable]

def compose[A](g: (A) ⇒ A): (A) ⇒ B

def contains(key: A): Boolean

def copyToArray[B >: (A, B)](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: (A, B)](xs: Array[B]): Unit

def copyToArray[B >: (A, B)](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: (A, B)](dest: Buffer[B]): Unit

def count(p: ((A, B)) ⇒ Boolean): Int

def default(key: A): B

def drop(n: Int): StandardPriorityMap[A, B]

def dropRight(n: Int): StandardPriorityMap[A, B]

def dropWhile(p: ((A, B)) ⇒ Boolean): StandardPriorityMap[A, B]

def empty: StandardPriorityMap[A, B]

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

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: ((A, B)) ⇒ Boolean): Boolean

def filter(p: ((A, B)) ⇒ Boolean): StandardPriorityMap[A, B]

def filterKeys(p: (A) ⇒ Boolean): PriorityMap[A, B]

def filterNot(p: ((A, B)) ⇒ Boolean): StandardPriorityMap[A, B]

def finalize(): Unit

def find(p: ((A, B)) ⇒ Boolean): Option[(A, B)]

def firstKey: Option[A]

Optionally returns the first key of this priority map.

def firstValue: Option[B]

Optionally returns the first value of this priority map.

def flatMap[B, That](f: ((A, B)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[StandardPriorityMap[A, B], B, That]): That

def flatten[B](implicit asTraversable: ((A, B)) ⇒ GenTraversableOnce[B]): Iterable[B]

def fold[A1 >: (A, B)](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, (A, B)) ⇒ B): B

def foldRight[B](z: B)(op: ((A, B), B) ⇒ B): B

def forall(p: ((A, B)) ⇒ Boolean): Boolean

def foreach[U](f: ((A, B)) ⇒ U): Unit

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.

def genericBuilder[B]: Builder[B, Iterable[B]]

def get(key: A): Option[B]

final def getClass(): Class[_]

def getOrElse[B1 >: B](key: A, default: ⇒ B1): B1

def groupBy[K](f: ((A, B)) ⇒ K): Map[K, StandardPriorityMap[A, B]]

def grouped(size: Int): Iterator[StandardPriorityMap[A, B]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: (A, B)

def headOption: Option[(A, B)]

def init: StandardPriorityMap[A, B]

def inits: Iterator[StandardPriorityMap[A, B]]

def isDefinedAt(key: A): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[(A, B)]

def keySet: Set[A]

def keys: Iterable[A]

def keysIterator: Iterator[A]

def last: (A, B)

def lastKey: Option[A]

Optionally returns the last key of this priority map.

def lastOption: Option[(A, B)]

def lastValue: Option[B]

Optionally returns the last value of this priority map.

def lift: (A) ⇒ Option[B]

def map[B, That](f: ((A, B)) ⇒ B)(implicit bf: CanBuildFrom[StandardPriorityMap[A, B], B, That]): That

def mapValues[C](f: (B) ⇒ C)(implicit ord: Ordering[C]): PriorityMap[A, C]

Transforms this map by applying a function to every retrieved value.

def mapValues[C](f: (B) ⇒ C): Map[A, C]

def max[B >: (A, B)](implicit cmp: Ordering[B]): (A, B)

def maxBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)

def merged(kvs: GenTraversableOnce[(A, B)])(f: (B, B) ⇒ B): StandardPriorityMap[A, B]

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

def min[B >: (A, B)](implicit cmp: Ordering[B]): (A, B)

def minBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

def newBuilder: PriorityMapBuilder[A, B, StandardPriorityMap[A, B]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def orElse[A1 <: A, B1 >: B](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

implicit val ordering: Ordering[B]

def par: ParMap[A, B]

def parCombiner: Combiner[(A, B), ParMap[A, B]]

def partition(p: ((A, B)) ⇒ Boolean): (StandardPriorityMap[A, B], StandardPriorityMap[A, B])

def product[B >: (A, B)](implicit num: Numeric[B]): B

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.

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.

def reduce[A1 >: (A, B)](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: (A, B)](op: (B, (A, B)) ⇒ B): B

def reduceLeftOption[B >: (A, B)](op: (B, (A, B)) ⇒ B): Option[B]

def reduceOption[A1 >: (A, B)](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: (A, B)](op: ((A, B), B) ⇒ B): B

def reduceRightOption[B >: (A, B)](op: ((A, B), B) ⇒ B): Option[B]

def repr: StandardPriorityMap[A, B]

def reversed: List[(A, B)]

def runWith[U](action: (B) ⇒ U): (A) ⇒ Boolean

def sameElements[B >: (A, B)](that: GenIterable[B]): Boolean

def scan[B >: (A, B), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[StandardPriorityMap[A, B], B, That]): That

def scanLeft[B, That](z: B)(op: (B, (A, B)) ⇒ B)(implicit bf: CanBuildFrom[StandardPriorityMap[A, B], B, That]): That

def scanRight[B, That](z: B)(op: ((A, B), B) ⇒ B)(implicit bf: CanBuildFrom[StandardPriorityMap[A, B], B, That]): That

def seq: PriorityMap[A, B]

def size: Int

def slice(from: Int, until: Int): StandardPriorityMap[A, B]

def sliding(size: Int, step: Int): Iterator[StandardPriorityMap[A, B]]

def sliding(size: Int): Iterator[StandardPriorityMap[A, B]]

def span(p: ((A, B)) ⇒ Boolean): (StandardPriorityMap[A, B], StandardPriorityMap[A, B])

def splitAt(n: Int): (StandardPriorityMap[A, B], StandardPriorityMap[A, B])

def stringPrefix: String

def sum[B >: (A, B)](implicit num: Numeric[B]): B

final def synchronized[T0](arg0: ⇒ T0): T0

def tail: StandardPriorityMap[A, B]

def tails: Iterator[StandardPriorityMap[A, B]]

def take(n: Int): StandardPriorityMap[A, B]

def takeRight(n: Int): StandardPriorityMap[A, B]

def takeWhile(p: ((A, B)) ⇒ Boolean): StandardPriorityMap[A, B]

def thisCollection: Iterable[(A, B)]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (A, B), Col[(A, B)]]): Col[(A, B)]

def toArray[B >: (A, B)](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[C >: (A, B)]: Buffer[C]

def toCollection(repr: StandardPriorityMap[A, B]): Iterable[(A, B)]

def toIndexedSeq: IndexedSeq[(A, B)]

def toIterable: Iterable[(A, B)]

def toIterator: Iterator[(A, B)]

def toList: List[(A, B)]

def toMap[T, U](implicit ev: <:<[(A, B), (T, U)]): Map[T, U]

def toSeq: Seq[(A, B)]

def toSet[B >: (A, B)]: Set[B]

def toStream: Stream[(A, B)]

def toString(): String

def toTraversable: Traversable[(A, B)]

def toVector: Vector[(A, B)]

def transform[C, That](f: (A, B) ⇒ C)(implicit bf: CanBuildFrom[StandardPriorityMap[A, B], (A, C), That]): That

def transpose[B](implicit asTraversable: ((A, B)) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

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.

def unzip[A1, A2](implicit asPair: ((A, B)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: ((A, B)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def updated(key: A, value: B): StandardPriorityMap[A, B]

Adds a key/value binding to this priority map.

def updated[B1 >: B](key: A, value: B1): Map[A, B1]

def valueSet: SortedSet[B]

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

def values: Iterable[B]

def valuesIterator: Iterator[B]

def view(from: Int, until: Int): IterableView[(A, B), StandardPriorityMap[A, B]]

def view: IterableView[(A, B), StandardPriorityMap[A, B]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def withDefault(d: (A) ⇒ B): PriorityMap[A, B]

The same priority map with a given default function.

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

def withDefaultValue(d: B): PriorityMap[A, B]

The same priority map with a given default value.

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

def withFilter(p: ((A, B)) ⇒ Boolean): FilterMonadic[(A, B), StandardPriorityMap[A, B]]

def zip[A1 >: (A, B), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[StandardPriorityMap[A, B], (A1, B), That]): That

def zipAll[B, A1 >: (A, B), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[StandardPriorityMap[A, B], (A1, B), That]): That

def zipWithIndex[A1 >: (A, B), That](implicit bf: CanBuildFrom[StandardPriorityMap[A, B], (A1, Int), That]): That

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