WaitQueue

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

def ++=(xs: TraversableOnce[Entity]): WaitQueue.this.type

def +:[B >: Entity, That](elem: B)(implicit bf: CanBuildFrom[Queue[Entity], B, That]): That

def +=(ent: Entity): WaitQueue.this.type

Add the entity 'ent' in the wait queue and record when waiting started.

def +=(elem1: Entity, elem2: Entity, elems: Entity*): WaitQueue.this.type

def +=:(elem: Entity): WaitQueue.this.type

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

def :+[B >: Entity, That](elem: B)(implicit bf: CanBuildFrom[Queue[Entity], B, That]): That

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

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

def appendElem(elem: Entity): Unit

def apply(n: Int): Entity

def applyOrElse[A1 <: Int, B1 >: Entity](x: A1, default: (A1) ⇒ B1): B1

final def asInstanceOf[T0]: T0

def barred: Int

Return the number entities barred because of this wait queue being full.

def canEqual(that: Any): Boolean

val cap: Int

the capacity of the queue (defaults to unbounded)

def clear(): Unit

def clone(): Queue[Entity]

def collect[B, That](pf: PartialFunction[Entity, B])(implicit bf: CanBuildFrom[Queue[Entity], B, That]): That

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

def combinations(n: Int): Iterator[Queue[Entity]]

def companion: GenericCompanion[Queue]

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

def contains(elem: Any): Boolean

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

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

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

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

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

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

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

def dequeue(): Entity

Dequeue the first entity from the wait queue and record the time in the wait queue.

def dequeueAll(p: (Entity) ⇒ Boolean): Seq[Entity]

def dequeueFirst(p: (Entity) ⇒ Boolean): Option[Entity]

def diff[B >: Entity](that: GenSeq[B]): Queue[Entity]

val director: Model

the controller/scheduler that this event is a part of

def distinct: Queue[Entity]

def drop(n: Int): Queue[Entity]

def dropRight(n: Int): Queue[Entity]

def dropWhile(p: (Entity) ⇒ Boolean): Queue[Entity]

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

def enqueue(elems: Entity*): Unit

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

val ext: String

the extension to distinguish the wait queues

def extractFirst(start: LinkedList[Entity], p: (Entity) ⇒ Boolean): Option[LinkedList[Entity]]

def filter(p: (Entity) ⇒ Boolean): Queue[Entity]

def filterNot(p: (Entity) ⇒ Boolean): Queue[Entity]

def finalize(): Unit

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

var first0: LinkedList[Entity]

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

def flatten[B](implicit asTraversable: (Entity) ⇒ GenTraversableOnce[B]): Queue[B]

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

def foldLeft[B](z: B)(f: (B, Entity) ⇒ B): B

def foldRight[B](z: B)(f: (Entity, B) ⇒ B): B

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

def foreach[B](f: (Entity) ⇒ B): Unit

def front: Entity

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

def get(n: Int): Option[Entity]

final def getClass(): Class[_]

def groupBy[K](f: (Entity) ⇒ K): Map[K, Queue[Entity]]

def grouped(size: Int): Iterator[Queue[Entity]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Entity

def headOption: Option[Entity]

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

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

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

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

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

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

def indices: Range

def init: Queue[Entity]

def inits: Iterator[Queue[Entity]]

def intersect[B >: Entity](that: GenSeq[B]): Queue[Entity]

def isDefinedAt(x: Int): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[Entity]

val l_q_stat: TimeStatistic

The number in Queue (l_q) time-persistent statistics

def last: Entity

var last0: LinkedList[Entity]

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

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

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

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

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

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

def lastOption: Option[Entity]

var len: Int

def length: Int

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[Entity]

def map[B, That](f: (Entity) ⇒ B)(implicit bf: CanBuildFrom[Queue[Entity], B, That]): That

def mapResult[NewTo](f: (MutableList[Entity]) ⇒ NewTo): Builder[Entity, NewTo]

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

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

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

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

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[Entity, Queue[Entity]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

def par: ParSeq[Entity]

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

def partition(p: (Entity) ⇒ Boolean): (Queue[Entity], Queue[Entity])

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

def permutations: Iterator[Queue[Entity]]

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

def prependElem(elem: Entity): Unit

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

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

def reduceLeft[B >: Entity](f: (B, Entity) ⇒ B): B

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

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

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

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

def repr: Queue[Entity]

def result(): MutableList[Entity]

def reverse: Queue[Entity]

def reverseIterator: Iterator[Entity]

def reverseMap[B, That](f: (Entity) ⇒ B)(implicit bf: CanBuildFrom[Queue[Entity], B, That]): That

def reversed: List[Entity]

def runWith[U](action: (Entity) ⇒ U): (Int) ⇒ Boolean

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

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

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

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

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

def seq: LinearSeq[Entity]

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): Queue[Entity]

def sliding(size: Int, step: Int): Iterator[Queue[Entity]]

def sliding(size: Int): Iterator[Queue[Entity]]

def sortBy[B](f: (Entity) ⇒ B)(implicit ord: Ordering[B]): Queue[Entity]

def sortWith(lt: (Entity, Entity) ⇒ Boolean): Queue[Entity]

def sorted[B >: Entity](implicit ord: Ordering[B]): Queue[Entity]

def span(p: (Entity) ⇒ Boolean): (Queue[Entity], Queue[Entity])

def splitAt(n: Int): (Queue[Entity], Queue[Entity])

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

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

def stringPrefix: String

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

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

val t_q_stat: Statistic

The time in Queue (t_q) sample statistics

def tail: Queue[Entity]

def tails: Iterator[Queue[Entity]]

def take(n: Int): Queue[Entity]

def takeRight(n: Int): Queue[Entity]

def takeWhile(p: (Entity) ⇒ Boolean): Queue[Entity]

def thisCollection: LinearSeq[Entity]

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

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

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

def toCollection(repr: Queue[Entity]): LinearSeq[Entity]

def toIndexedSeq: IndexedSeq[Entity]

def toIterable: Iterable[Entity]

def toIterator: Iterator[Entity]

def toList: List[Entity]

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

def toQueue: Queue[Entity]

def toSeq: Seq[Entity]

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

def toStream: Stream[Entity]

def toString(): String

def toTraversable: Traversable[Entity]

def toVector: Vector[Entity]

def transform(f: (Entity) ⇒ Entity): WaitQueue.this.type

def transpose[B](implicit asTraversable: (Entity) ⇒ GenTraversableOnce[B]): Queue[Queue[B]]

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

def unzip[A1, A2](implicit asPair: (Entity) ⇒ (A1, A2)): (Queue[A1], Queue[A2])

def unzip3[A1, A2, A3](implicit asTriple: (Entity) ⇒ (A1, A2, A3)): (Queue[A1], Queue[A2], Queue[A3])

def update(n: Int, x: Entity): Unit

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

def view(from: Int, until: Int): SeqView[Entity, Queue[Entity]]

def view: SeqView[Entity, Queue[Entity]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (Entity) ⇒ Boolean): FilterMonadic[Entity, Queue[Entity]]

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

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

def zipWithIndex[A1 >: Entity, That](implicit bf: CanBuildFrom[Queue[Entity], (A1, Int), That]): That

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