HeapPriorityMap

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +[B1 >: U](elem1: (T, B1), elem2: (T, B1), elems: (T, B1)*): Map[T, B1]

def +[B1 >: U](kv: (T, B1)): Map[T, B1]

def ++[B1 >: U](xs: GenTraversableOnce[(T, B1)]): Map[T, B1]

def ++[B >: (T, U), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Map[T, U], B, That]): That

def ++:[B >: (T, U), That](that: Traversable[B])(implicit bf: CanBuildFrom[Map[T, U], B, That]): That

def ++:[B >: (T, U), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Map[T, U], B, That]): That

def ++=(xs: TraversableOnce[(T, U)]): HeapPriorityMap.this.type

def +=(pair: (T, U)): HeapPriorityMap.this.type

Add the key/value pair to the priority map.

def +=(elem1: (T, U), elem2: (T, U), elems: (T, U)*): HeapPriorityMap.this.type

def -(elem1: T, elem2: T, elems: T*): Map[T, U]

def -(key: T): Map[T, U]

def --(xs: GenTraversableOnce[T]): Map[T, U]

def --=(xs: TraversableOnce[T]): HeapPriorityMap.this.type

def -=(item: T): HeapPriorityMap.this.type

Remove the key/value pair from the priority map.

def -=(elem1: T, elem2: T, elems: T*): HeapPriorityMap.this.type

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

def :\[B](z: B)(op: ((T, U), 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, (T, U)) ⇒ B, combop: (B, B) ⇒ B): B

def andThen[C](k: (U) ⇒ C): PartialFunction[T, C]

def apply(key: T): U

def applyOrElse[A1 <: T, B1 >: U](x: A1, default: (A1) ⇒ B1): B1

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clear(): Unit

def clone(): HeapPriorityMap[T, U]

Make a copy of this HeapPriorityMap, returning a new HeapPriorityMap

def collect[B, That](pf: PartialFunction[(T, U), B])(implicit bf: CanBuildFrom[Map[T, U], B, That]): That

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

def companion: GenericCompanion[Iterable]

def compose[A](g: (A) ⇒ T): (A) ⇒ U

def contains(key: T): Boolean

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

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

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

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

def count(p: ((T, U)) ⇒ Boolean): Int

def default(key: T): U

def drop(n: Int): Map[T, U]

def dropRight(n: Int): Map[T, U]

def dropWhile(p: ((T, U)) ⇒ Boolean): Map[T, U]

def empty: Map[T, U]

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: ((T, U)) ⇒ Boolean): Boolean

def extractMin(): (T, U)

Extract and return the item with the minimum value.

def filter(p: ((T, U)) ⇒ Boolean): Map[T, U]

def filterKeys(p: (T) ⇒ Boolean): Map[T, U]

def filterNot(p: ((T, U)) ⇒ Boolean): Map[T, U]

def finalize(): Unit

def find(p: ((T, U)) ⇒ Boolean): Option[(T, U)]

def flatMap[B, That](f: ((T, U)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Map[T, U], B, That]): That

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

def fold[A1 >: (T, U)](z: A1)(op: (A1, A1) ⇒ A1): A1

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

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

def forall(p: ((T, U)) ⇒ Boolean): Boolean

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

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

def get(item: T): Option[U]

Get the value associated with the key.

final def getClass(): Class[_]

def getOrElse[B1 >: U](key: T, default: ⇒ B1): B1

def getOrElseUpdate(key: T, op: ⇒ U): U

def groupBy[K](f: ((T, U)) ⇒ K): Map[K, Map[T, U]]

def grouped(size: Int): Iterator[Map[T, U]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: (T, U)

def headOption: Option[(T, U)]

def init: Map[T, U]

def inits: Iterator[Map[T, U]]

def isDefinedAt(key: T): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[(T, U)]

Produce an iterator of the (item, score) pairs in increasing order of score.

def keySet: Set[T]

def keys: Iterable[T]

def keysIterator: Iterator[T]

def last: (T, U)

def lastOption: Option[(T, U)]

def lift: (T) ⇒ Option[U]

def map[B, That](f: ((T, U)) ⇒ B)(implicit bf: CanBuildFrom[Map[T, U], B, That]): That

def mapResult[NewTo](f: (Map[T, U]) ⇒ NewTo): Builder[(T, U), NewTo]

def mapValues[C](f: (U) ⇒ C): Map[T, C]

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

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

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

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

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: Builder[(T, U), Map[T, U]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def orElse[A1 <: T, B1 >: U](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

def par: ParMap[T, U]

def parCombiner: Combiner[(T, U), ParMap[T, U]]

def partition(p: ((T, U)) ⇒ Boolean): (Map[T, U], Map[T, U])

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

def put(key: T, value: U): Option[U]

def reduce[A1 >: (T, U)](op: (A1, A1) ⇒ A1): A1

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

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

def reduceOption[A1 >: (T, U)](op: (A1, A1) ⇒ A1): Option[A1]

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

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

def remove(key: T): Option[U]

def repr: Map[T, U]

def result(): Map[T, U]

def retain(p: (T, U) ⇒ Boolean): HeapPriorityMap.this.type

def reversed: List[(T, U)]

def runWith[U](action: (U) ⇒ U): (T) ⇒ Boolean

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

def scan[B >: (T, U), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Map[T, U], B, That]): That

def scanLeft[B, That](z: B)(op: (B, (T, U)) ⇒ B)(implicit bf: CanBuildFrom[Map[T, U], B, That]): That

def scanRight[B, That](z: B)(op: ((T, U), B) ⇒ B)(implicit bf: CanBuildFrom[Map[T, U], B, That]): That

def seq: Map[T, U]

def size: Int

def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

def sizeHint(coll: TraversableLike[_, _]): Unit

def sizeHint(size: Int): Unit

def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit

def slice(from: Int, until: Int): Map[T, U]

def sliding(size: Int, step: Int): Iterator[Map[T, U]]

def sliding(size: Int): Iterator[Map[T, U]]

def span(p: ((T, U)) ⇒ Boolean): (Map[T, U], Map[T, U])

def splitAt(n: Int): (Map[T, U], Map[T, U])

def stringPrefix: String

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

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

def tail: Map[T, U]

def tails: Iterator[Map[T, U]]

def take(n: Int): Map[T, U]

def takeRight(n: Int): Map[T, U]

def takeWhile(p: ((T, U)) ⇒ Boolean): Map[T, U]

def thisCollection: Iterable[(T, U)]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (T, U), Col[(T, U)]]): Col[(T, U)]

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

def toBuffer[C >: (T, U)]: Buffer[C]

def toCollection(repr: Map[T, U]): Iterable[(T, U)]

def toIndexedSeq: IndexedSeq[(T, U)]

def toIterable: Iterable[(T, U)]

def toIterator: Iterator[(T, U)]

def toList: List[(T, U)]

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

def toSeq: Seq[(T, U)]

def toSet[B >: (T, U)]: Set[B]

def toStream: Stream[(T, U)]

def toString(): String

def toTraversable: Traversable[(T, U)]

def toVector: Vector[(T, U)]

def transform(f: (T, U) ⇒ U): HeapPriorityMap.this.type

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

def unzip[A1, A2](implicit asPair: ((T, U)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: ((T, U)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def update(key: T, value: U): Unit

def updated[B1 >: U](key: T, value: B1): Map[T, B1]

def values: Iterable[U]

def valuesIterator: Iterator[U]

def view(from: Int, until: Int): IterableView[(T, U), Map[T, U]]

def view: IterableView[(T, U), Map[T, U]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withDefault(d: (T) ⇒ U): Map[T, U]

def withDefaultValue(d: U): Map[T, U]

def withFilter(p: ((T, U)) ⇒ Boolean): FilterMonadic[(T, U), Map[T, U]]

def zip[A1 >: (T, U), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Map[T, U], (A1, B), That]): That

def zipAll[B, A1 >: (T, U), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Map[T, U], (A1, B), That]): That

def zipWithIndex[A1 >: (T, U), That](implicit bf: CanBuildFrom[Map[T, U], (A1, Int), That]): That

def /:\[A1 >: (T, U)](z: A1)(op: (A1, A1) ⇒ A1): A1