PriorityQueue

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

def ++=(xs: TraversableOnce[A]): PriorityQueue.this.type

def +=(elem: A): PriorityQueue.this.type

Inserts a single element into the priority queue.

def +=(elem1: A, elem2: A, elems: A*): PriorityQueue.this.type

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

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

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

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

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

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clear(): Unit

Clears the queue.

def clone(): AnyRef

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

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

def companion: GenericCompanion[Iterable]

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

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

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

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

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

def dequeue(): A

Returns the element with the lowest priority in the queue, and removes this element from the queue.

def drop(n: Int): Iterable[A]

def dropRight(n: Int): Iterable[A]

def dropWhile(p: (A) ⇒ Boolean): Iterable[A]

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

Checks if the heaps of the two priority queues are equal

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

def filter(p: (A) ⇒ Boolean): Iterable[A]

def filterNot(p: (A) ⇒ Boolean): Iterable[A]

def finalize(): Unit

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

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

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

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

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

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

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

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

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

def genericOrderedBuilder[B](implicit ord: Ordering[B]): Builder[B, PriorityQueue[B]]

def getAllByPriority(): List[A]

Returns a List containing all the elements of the queue sorted by ascending priority

final def getClass(): Class[_]

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

def grouped(size: Int): Iterator[Iterable[A]]

def hasDefiniteSize: Boolean

def hashCode(): Int

The hashCode method always yields an error, since it is not safe to use mutable queues as keys in hash tables.

def head: A

Returns the element with the lowest priority in the queue, or throws an error if there is no element contained in the queue.

def headOption: Option[A]

def init: Iterable[A]

def inits: Iterator[Iterable[A]]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[A]

def last: A

def lastOption: Option[A]

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

def mapResult[NewTo](f: (PriorityQueue[A]) ⇒ NewTo): Builder[A, NewTo]

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

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

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

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

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: PriorityQueue[A]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

implicit val ord: Ordering[A]

Ordering of data.

def orderedCompanion: GenericOrderedCompanion[PriorityQueue]

def par: ParIterable[A]

def parCombiner: Combiner[A, ParIterable[A]]

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

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

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

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

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

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

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

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

def remove(index: Int): A

Returns the element with the corresponding index, and removes this element from the queue.

def repr: Iterable[A]

def result(): PriorityQueue.this.type

def reversed: List[A]

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

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

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

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

def seq: Iterable[A]

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): Iterable[A]

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

def sliding(size: Int): Iterator[Iterable[A]]

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

def splitAt(n: Int): (Iterable[A], Iterable[A])

def stringPrefix: String

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

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

def tail: Iterable[A]

def tails: Iterator[Iterable[A]]

def take(n: Int): Iterable[A]

def takeRight(n: Int): Iterable[A]

def takeWhile(p: (A) ⇒ Boolean): Iterable[A]

def thisCollection: Iterable[A]

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

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

def toBuffer[B >: A]: Buffer[B]

def toCollection(repr: Iterable[A]): Iterable[A]

def toIndexedSeq: IndexedSeq[A]

def toIterable: Iterable[A]

def toIterator: Iterator[A]

def toList: List[A]

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

def toSeq: Seq[A]

def toSet[B >: A]: Set[B]

def toStream: Stream[A]

def toString(): String

Returns a textual representation of a queue as a string.

def toTraversable: Traversable[A]

def toVector: Vector[A]

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

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

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

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

def view: IterableView[A, Iterable[A]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

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

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

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

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