PQueue

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

def +:[B >: T, That](elem: B)(implicit bf: CanBuildFrom[ResizableArray[T], B, That]): That

def +=(item: T): Unit

Add an item to the priority queue ordered by actTime.

def -=(item: T): Boolean

Remove the specific item from the priority queue.

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

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

def :+[B >: T, That](elem: B)(implicit bf: CanBuildFrom[ResizableArray[T], B, That]): That

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

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

def apply(idx: Int): T

var array: Array[AnyRef]

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): Seq[T]

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

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

def combinations(n: Int): Iterator[ResizableArray[T]]

def companion: GenericCompanion[ResizableArray]

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

def contains(elem: Any): Boolean

def containsSlice[B](that: GenSeq[B]): Boolean

def copy(m: Int, n: Int, len: Int): Unit

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

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

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

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

def corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean

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

def dequeue(): T

Remove and return the first item (least actTime) from the priority queue.

def diff[B >: T](that: GenSeq[B]): ResizableArray[T]

def distinct: ResizableArray[T]

def drop(n: Int): ResizableArray[T]

def dropRight(n: Int): ResizableArray[T]

def dropWhile(p: (T) ⇒ Boolean): ResizableArray[T]

def endsWith[B](that: GenSeq[B]): Boolean

def ensureSize(n: Int): Unit

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

def filter(p: (T) ⇒ Boolean): ResizableArray[T]

def filterNot(p: (T) ⇒ Boolean): ResizableArray[T]

def finalize(): Unit

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

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

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

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

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

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

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

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

final def getClass(): java.lang.Class[_]

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

def grouped(size: Int): Iterator[ResizableArray[T]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: T

def headOption: Option[T]

def indexOf[B >: T](elem: B, from: Int): Int

def indexOf[B >: T](elem: B): Int

def indexOfSlice[B >: T](that: GenSeq[B], from: Int): Int

def indexOfSlice[B >: T](that: GenSeq[B]): Int

def indexWhere(p: (T) ⇒ Boolean, from: Int): Int

def indexWhere(p: (T) ⇒ Boolean): Int

def indices: Range

def init: ResizableArray[T]

def initialSize: Int

def inits: Iterator[ResizableArray[T]]

def intersect[B >: T](that: GenSeq[B]): ResizableArray[T]

def isDefinedAt(idx: Int): Boolean

def isEmpty: Boolean

Indicate whether the priority queue is empty.

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[T]

def last: T

def lastIndexOf[B >: T](elem: B, end: Int): Int

def lastIndexOf[B >: T](elem: B): Int

def lastIndexOfSlice[B >: T](that: GenSeq[B], end: Int): Int

def lastIndexOfSlice[B >: T](that: GenSeq[B]): Int

def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int

def lastIndexWhere(p: (T) ⇒ Boolean): Int

def lastOption: Option[T]

def length: Int

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[T]

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

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

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

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

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

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, ResizableArray[T]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def padTo[B >: T, That](len: Int, elem: B)(implicit bf: CanBuildFrom[ResizableArray[T], B, That]): That

def par: ParSeq[T]

def parCombiner: Combiner[T, ParSeq[T]]

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

def patch[B >: T, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[ResizableArray[T], B, That]): That

def permutations: Iterator[ResizableArray[T]]

def prefixLength(p: (T) ⇒ Boolean): Int

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

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

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

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

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

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

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

def reduceToSize(sz: Int): Unit

def repr: ResizableArray[T]

def reverse: ResizableArray[T]

def reverseIterator: Iterator[T]

def reverseMap[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[ResizableArray[T], B, That]): That

def reversed: List[T]

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

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

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

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

def segmentLength(p: (T) ⇒ Boolean, from: Int): Int

def seq: Seq[T]

def size: Int

var size0: Int

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

def sliding[B >: T](size: Int, step: Int): Iterator[ResizableArray[T]]

def sliding[B >: T](size: Int): Iterator[ResizableArray[T]]

def sortBy[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): ResizableArray[T]

def sortWith(lt: (T, T) ⇒ Boolean): ResizableArray[T]

def sorted[B >: T](implicit ord: Ordering[B]): ResizableArray[T]

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

def splitAt(n: Int): (ResizableArray[T], ResizableArray[T])

def startsWith[B](that: GenSeq[B], offset: Int): Boolean

def startsWith[B](that: GenSeq[B]): Boolean

def stringPrefix: String

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

def swap(a: Int, b: Int): Unit

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

def tail: ResizableArray[T]

def tails: Iterator[ResizableArray[T]]

def take(n: Int): ResizableArray[T]

def takeRight(n: Int): ResizableArray[T]

def takeWhile(p: (T) ⇒ Boolean): ResizableArray[T]

def thisCollection: IndexedSeq[T]

def toArray[B >: T](implicit arg0: ClassManifest[B]): Array[B]

def toBuffer[A1 >: T]: Buffer[A1]

def toCollection(repr: ResizableArray[T]): IndexedSeq[T]

def toIndexedSeq[B >: T]: IndexedSeq[B]

def toIterable: Iterable[T]

def toIterator: Iterator[T]

def toList: List[T]

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

def toSeq: Seq[T]

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

def toStream: Stream[T]

def toString(): String

Show the contents of the priority queue.

def toTraversable: Traversable[T]

def transform(f: (T) ⇒ T): PQueue.this.type

def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): ResizableArray[ResizableArray[B]]

def union[B >: T, That](that: GenSeq[B])(implicit bf: CanBuildFrom[ResizableArray[T], B, That]): That

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

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

def update(idx: Int, elem: T): Unit

def updated[B >: T, That](index: Int, elem: B)(implicit bf: CanBuildFrom[ResizableArray[T], B, That]): That

def view(from: Int, until: Int): IndexedSeqView[T, ResizableArray[T]]

def view: IndexedSeqView[T, ResizableArray[T]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

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

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

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

def elements: Iterator[T]

def equalsWith[B](that: Seq[B])(f: (T, B) ⇒ Boolean): Boolean

def findIndexOf(p: (T) ⇒ Boolean): Int

def findLastIndexOf(p: (T) ⇒ Boolean): Int

def first: T

def firstOption: Option[T]

def projection: SeqView[T, ResizableArray[T]]

def reversedElements: Iterator[T]