class WaitQueue extends Queue[SimActor] with Component
The WaitQueue
class is a wrapper for Scala's Queue
class, which supports
First-Come, First-Serve 'FCSC' Queues. It adds monitoring capabilities and
optional capacity restrictions. If the queue is full, entities (SimActor
s)
attempting to enter the queue are 'barred'. At the model level, such entities
may be (1) held in place, (2) take an alternate route, or (3) be lost (e.g.,
dropped call/packet).
- Alphabetic
- By Inheritance
- WaitQueue
- Component
- Locatable
- Identifiable
- Error
- Queue
- ArrayDeque
- DefaultSerializable
- Serializable
- ArrayDequeOps
- StrictOptimizedSeqOps
- StrictOptimizedIterableOps
- IndexedBuffer
- IndexedSeq
- IndexedSeqOps
- IndexedSeq
- IndexedSeqOps
- AbstractBuffer
- Buffer
- Shrinkable
- Growable
- Clearable
- AbstractSeq
- Seq
- SeqOps
- Cloneable
- Cloneable
- Iterable
- AbstractSeq
- Seq
- Equals
- SeqOps
- PartialFunction
- Function1
- AbstractIterable
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new WaitQueue(name: String, xy: (Double, Double), cap: Int)
Auxiliary constructor that uses defaults for width (w) and height (h).
Auxiliary constructor that uses defaults for width (w) and height (h).
- name
the name of the wait-queue
- xy
the (x, y) coordinates for the top-left corner of the wait-queue.
- cap
the capacity of the queue (defaults to unbounded)
- new WaitQueue(name: String, at: Array[Double], cap: Int = Int.MaxValue)
- name
the name of the wait-queue
- at
the location of the wait-queue (x, y, w, h)
- cap
the capacity of the queue (defaults to unbounded)
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ++[B >: SimActor](suffix: IterableOnce[B]): Queue[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- final def ++:[B >: SimActor](prefix: IterableOnce[B]): Queue[B]
- Definition Classes
- SeqOps → IterableOps
- Annotations
- @inline()
- final def ++=(xs: IterableOnce[SimActor]): WaitQueue.this.type
- Definition Classes
- Growable
- Annotations
- @inline()
- final def ++=:(elems: IterableOnce[SimActor]): WaitQueue.this.type
- Definition Classes
- Buffer
- Annotations
- @inline()
- final def +:[B >: SimActor](elem: B): Queue[B]
- Definition Classes
- SeqOps
- Annotations
- @inline()
- final def +=(elem: SimActor): WaitQueue.this.type
- Definition Classes
- Growable
- Annotations
- @inline()
- final def +=:(elem: SimActor): WaitQueue.this.type
- Definition Classes
- Buffer
- Annotations
- @inline()
- final def --=(xs: IterableOnce[SimActor]): WaitQueue.this.type
- Definition Classes
- Shrinkable
- Annotations
- @inline()
- final def -=(elem: SimActor): WaitQueue.this.type
- Definition Classes
- Shrinkable
- Annotations
- @inline()
- final def :+[B >: SimActor](elem: B): Queue[B]
- Definition Classes
- SeqOps
- Annotations
- @inline()
- final def :++[B >: SimActor](suffix: IterableOnce[B]): Queue[B]
- Definition Classes
- SeqOps
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- val DIAM: Double
Diameter of a token (for animating entities)
Diameter of a token (for animating entities)
- Definition Classes
- Component
- val RAD: Double
Radius of a token (for animating entities)
Radius of a token (for animating entities)
- Definition Classes
- Component
- def accum(value: Double): Unit
Accumulate the value (e.g., number in queue) weighted by its time duration.
Accumulate the value (e.g., number in queue) weighted by its time duration.
- value
the value to accumulate
- Definition Classes
- Component
- def addAll(elems: IterableOnce[SimActor]): WaitQueue.this.type
- Definition Classes
- ArrayDeque → Growable
- def addOne(elem: SimActor): WaitQueue.this.type
- Definition Classes
- ArrayDeque → Growable
- final def addString(b: StringBuilder): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- IterableOnceOps
- def aggregate(): Unit
Aggregate the statistics of this component's subparts.
Aggregate the statistics of this component's subparts.
- Definition Classes
- Component
- def andThen[C](k: PartialFunction[SimActor, C]): PartialFunction[Int, C]
- Definition Classes
- PartialFunction
- def andThen[C](k: (SimActor) => C): PartialFunction[Int, C]
- Definition Classes
- PartialFunction → Function1
- final def append(elem: SimActor): WaitQueue.this.type
- Definition Classes
- Buffer
- Annotations
- @inline()
- final def appendAll(xs: IterableOnce[SimActor]): WaitQueue.this.type
- Definition Classes
- Buffer
- Annotations
- @inline()
- def appended[B >: SimActor](elem: B): Queue[B]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def appendedAll[B >: SimActor](suffix: IterableOnce[B]): Queue[B]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def apply(idx: Int): SimActor
- Definition Classes
- ArrayDeque → SeqOps → Function1
- def applyOrElse[A1 <: Int, B1 >: SimActor](x: A1, default: (A1) => B1): B1
- Definition Classes
- PartialFunction
- var array: Array[AnyRef]
- Attributes
- protected
- Definition Classes
- ArrayDeque → ArrayDequeOps
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def at: Array[Double]
- Definition Classes
- Locatable
- def at_=(at: Array[Double]): Unit
- Definition Classes
- Locatable
- def barred: Int
Return the number entities barred because of 'this' wait-queue being full.
- def canEqual(that: Any): Boolean
- Definition Classes
- Seq → Equals
- def className: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- def clear(): Unit
- Definition Classes
- ArrayDeque → Clearable
- def clearAndShrink(size: Int): WaitQueue.this.type
- Definition Classes
- ArrayDeque
- final def clone(): Queue[SimActor]
- Definition Classes
- ArrayDequeOps → AnyRef
- final def coll: WaitQueue.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[SimActor, B]): Queue[B]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[SimActor, B]): Option[B]
- Definition Classes
- IterableOnceOps
- def combinations(n: Int): Iterator[Queue[SimActor]]
- Definition Classes
- SeqOps
- def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, SimActor]
- Definition Classes
- PartialFunction
- def compose[A](g: (A) => Int): (A) => SimActor
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def composite: Boolean
Indicate whether this component is composite, i.e., has subparts.
Indicate whether this component is composite, i.e., has subparts.
- Definition Classes
- Component
- final def concat[B >: SimActor](suffix: IterableOnce[B]): Queue[B]
- Definition Classes
- SeqOps → IterableOps
- Annotations
- @inline()
- def contains[A1 >: SimActor](elem: A1): Boolean
- Definition Classes
- SeqOps
- def containsSlice[B >: SimActor](that: Seq[B]): Boolean
- Definition Classes
- SeqOps
- def copySliceToArray(srcStart: Int, dest: Array[_], destStart: Int, maxItems: Int): dest.type
- Definition Classes
- ArrayDequeOps
- def copyToArray[B >: SimActor](dest: Array[B], destStart: Int, len: Int): Int
- Definition Classes
- ArrayDeque → IterableOnceOps
- def copyToArray[B >: SimActor](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def copyToArray[B >: SimActor](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def corresponds[B](that: Seq[B])(p: (SimActor, B) => Boolean): Boolean
- Definition Classes
- SeqOps
- def corresponds[B](that: IterableOnce[B])(p: (SimActor, B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: (SimActor) => Boolean): Int
- Definition Classes
- IterableOnceOps
- def dequeue(): SimActor
- Definition Classes
- Queue
- def dequeueAll(p: (SimActor) => Boolean): Seq[SimActor]
- Definition Classes
- Queue
- def dequeueFirst(p: (SimActor) => Boolean): Option[SimActor]
- Definition Classes
- Queue
- def dequeueWhile(f: (SimActor) => Boolean): Seq[SimActor]
- Definition Classes
- Queue
- def diff[B >: SimActor](that: Seq[B]): Queue[SimActor]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def director: Model
Get the director who controls the play/simulation this component is in.
Get the director who controls the play/simulation this component is in.
- Definition Classes
- Component
- def director_=(director: Model): Unit
Set this component's director (the controller of the simulation model).
Set this component's director (the controller of the simulation model).
- director
the director of the play/simulation
- Definition Classes
- Component
- def display(): Unit
Tell the animation queue to display 'this' wait-queue.
- def distinct: Queue[SimActor]
- Definition Classes
- SeqOps
- def distinctBy[B](f: (SimActor) => B): Queue[SimActor]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def drop(n: Int): Queue[SimActor]
- Definition Classes
- IndexedSeqOps → IterableOps → IterableOnceOps
- def dropInPlace(n: Int): WaitQueue.this.type
- Definition Classes
- Buffer
- def dropRight(n: Int): Queue[SimActor]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def dropRightInPlace(n: Int): WaitQueue.this.type
- Definition Classes
- Buffer
- def dropWhile(p: (SimActor) => Boolean): Queue[SimActor]
- Definition Classes
- IterableOps → IterableOnceOps
- def dropWhileInPlace(p: (SimActor) => Boolean): WaitQueue.this.type
- Definition Classes
- Buffer
- def durationStat: Statistic
Return sample statistics for durations for this component (e.g., Time in queue).
Return sample statistics for durations for this component (e.g., Time in queue).
- Definition Classes
- Component
- def elementWise: ElementWiseExtractor[Int, SimActor]
- Definition Classes
- PartialFunction
- def empty: Queue[SimActor]
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def endsWith[B >: SimActor](that: Iterable[B]): Boolean
- Definition Classes
- SeqOps
- def enqueue(elem1: SimActor, elem2: SimActor, elems: SimActor*): WaitQueue.this.type
- Definition Classes
- Queue
- def enqueue(elem: SimActor): WaitQueue.this.type
- Definition Classes
- Queue
- def enqueueAll(elems: IterableOnce[SimActor]): WaitQueue.this.type
- Definition Classes
- Queue
- def ensureSize(hint: Int): Unit
- Definition Classes
- ArrayDeque
- Annotations
- @inline()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(that: Any): Boolean
- Definition Classes
- Identifiable → AnyRef → Any
- def exists(p: (SimActor) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def filter(pred: (SimActor) => Boolean): Queue[SimActor]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def filterImpl(pred: (SimActor) => Boolean, isFlipped: Boolean): Queue[SimActor]
- Attributes
- protected[collection]
- Definition Classes
- StrictOptimizedIterableOps
- def filterInPlace(p: (SimActor) => Boolean): WaitQueue.this.type
- Definition Classes
- IndexedBuffer
- def filterNot(pred: (SimActor) => Boolean): Queue[SimActor]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def find(p: (SimActor) => Boolean): Option[SimActor]
- Definition Classes
- IterableOnceOps
- def findLast(p: (SimActor) => Boolean): Option[SimActor]
- Definition Classes
- SeqOps
- def flatMap[B](f: (SimActor) => IterableOnce[B]): Queue[B]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def flatMapInPlace(f: (SimActor) => IterableOnce[SimActor]): WaitQueue.this.type
- Definition Classes
- IndexedBuffer
- def flatten[B](implicit toIterableOnce: (SimActor) => IterableOnce[B]): Queue[B]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- final def flaw(method: String, message: String): Unit
- Definition Classes
- Error
- def fold[A1 >: SimActor](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, SimActor) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: (SimActor, B) => B): B
- Definition Classes
- IndexedSeqOps → IterableOnceOps
- def forall(p: (SimActor) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: (SimActor) => U): Unit
- Definition Classes
- IterableOnceOps
- def fromSpecific(coll: IterableOnce[SimActor]): Queue[SimActor]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def front: SimActor
- Definition Classes
- Queue
- Annotations
- @inline()
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def groupBy[K](f: (SimActor) => K): Map[K, Queue[SimActor]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (SimActor) => K)(f: (SimActor) => B): Map[K, Queue[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: (SimActor) => K)(f: (SimActor) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(n: Int): Iterator[Queue[SimActor]]
- Definition Classes
- ArrayDequeOps → IterableOps
- def hashCode(): Int
- Definition Classes
- Identifiable → AnyRef → Any
- def head: SimActor
- Definition Classes
- IndexedSeqOps → IterableOps
- def headOption: Option[SimActor]
- Definition Classes
- IndexedSeqOps → IterableOps
- val id: Int
- Definition Classes
- Identifiable
- def indexOf[B >: SimActor](elem: B): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding()
- def indexOf[B >: SimActor](elem: B, from: Int): Int
- Definition Classes
- SeqOps
- def indexOfSlice[B >: SimActor](that: Seq[B]): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding()
- def indexOfSlice[B >: SimActor](that: Seq[B], from: Int): Int
- Definition Classes
- SeqOps
- def indexWhere(p: (SimActor) => Boolean): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding()
- def indexWhere(p: (SimActor) => Boolean, from: Int): Int
- Definition Classes
- SeqOps
- def indices: Range
- Definition Classes
- SeqOps
- def init: Queue[SimActor]
- Definition Classes
- IterableOps
- def initComponent(label: String, loc: Array[Double]): Unit
Initialize this component (all of its 'var's).
Initialize this component (all of its 'var's).
- label
the name of this component
- loc
the location of this component
- Definition Classes
- Component
- def initStats(label: String): Unit
Initialize this component's statistical collectors.
Initialize this component's statistical collectors. Sample statistics: all
Component
s. Time-persistent statistics: all exceptGate
,Source
andSink
.- label
the name of this component
- Definition Classes
- Component
- def inits: Iterator[Queue[SimActor]]
- Definition Classes
- IterableOps
- def insert(idx: Int, elem: SimActor): Unit
- Definition Classes
- ArrayDeque → Buffer
- def insertAll(idx: Int, elems: IterableOnce[SimActor]): Unit
- Definition Classes
- ArrayDeque → Buffer
- def intersect[B >: SimActor](that: Seq[B]): Queue[SimActor]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def isDefinedAt(idx: Int): Boolean
- Definition Classes
- SeqOps
- def isEmpty: Boolean
- Definition Classes
- ArrayDeque → SeqOps → IterableOnceOps
- def isFull: Boolean
Return whether 'this' queue is full.
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- def iterableFactory: SeqFactory[Queue]
- Definition Classes
- Queue → ArrayDeque → IndexedBuffer → IndexedSeq → IndexedSeq → Buffer → Seq → Iterable → Seq → Iterable → IterableOps
- def iterator: Iterator[SimActor]
- Definition Classes
- IndexedSeqOps → IterableOnce
- def klone(): Queue[SimActor]
- Attributes
- protected
- Definition Classes
- Queue → ArrayDeque → ArrayDequeOps
- def knownSize: Int
- Definition Classes
- ArrayDeque → IndexedSeqOps → Buffer → Growable → IterableOnce
- def last: SimActor
- Definition Classes
- IndexedSeqOps → IterableOps
- def lastIndexOf[B >: SimActor](elem: B, end: Int): Int
- Definition Classes
- SeqOps
- def lastIndexOfSlice[B >: SimActor](that: Seq[B]): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding()
- def lastIndexOfSlice[B >: SimActor](that: Seq[B], end: Int): Int
- Definition Classes
- SeqOps
- def lastIndexWhere(p: (SimActor) => Boolean): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding()
- def lastIndexWhere(p: (SimActor) => Boolean, end: Int): Int
- Definition Classes
- SeqOps
- def lastOption: Option[SimActor]
- Definition Classes
- IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[SimActor, B, WaitQueue.this.type]
- Definition Classes
- Iterable
- def length: Int
- Definition Classes
- ArrayDeque → SeqOps
- final def lengthCompare(that: Iterable[_]): Int
- Definition Classes
- IndexedSeqOps → SeqOps
- final def lengthCompare(len: Int): Int
- Definition Classes
- IndexedSeqOps → SeqOps
- final def lengthIs: SizeCompareOps
- Definition Classes
- SeqOps
- Annotations
- @inline()
- def lift: (Int) => Option[SimActor]
- Definition Classes
- PartialFunction
- def map[B](f: (SimActor) => B): Queue[B]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def mapInPlace(f: (SimActor) => SimActor): WaitQueue.this.type
- Definition Classes
- IndexedSeqOps
- def max[B >: SimActor](implicit ord: Ordering[B]): SimActor
- Definition Classes
- IterableOnceOps
- def maxBy[B](f: (SimActor) => B)(implicit cmp: Ordering[B]): SimActor
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: (SimActor) => B)(implicit cmp: Ordering[B]): Option[SimActor]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: SimActor](implicit ord: Ordering[B]): Option[SimActor]
- Definition Classes
- IterableOnceOps
- def me: String
- Definition Classes
- Identifiable
- def min[B >: SimActor](implicit ord: Ordering[B]): SimActor
- Definition Classes
- IterableOnceOps
- def minBy[B](f: (SimActor) => B)(implicit cmp: Ordering[B]): SimActor
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: (SimActor) => B)(implicit cmp: Ordering[B]): Option[SimActor]
- Definition Classes
- IterableOnceOps
- def minOption[B >: SimActor](implicit ord: Ordering[B]): Option[SimActor]
- Definition Classes
- IterableOnceOps
- final def mkString: String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(start: String, sep: String, end: String): String
- Definition Classes
- IterableOnceOps
- def name: String
- Definition Classes
- Identifiable
- def name_=(name: String): Unit
- Definition Classes
- Identifiable
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSpecificBuilder: Builder[SimActor, Queue[SimActor]]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def noWait(): Unit
Do not wait in the queue and record zero waiting time.
Do not wait in the queue and record zero waiting time. Call this method to get average waiting time for all actors. If you just want the waiting time for those who wait, do not call this method.
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def occCounts[B](sq: Seq[B]): Map[B, Int]
- Attributes
- protected[collection]
- Definition Classes
- SeqOps
- def ofArray(array: Array[AnyRef], end: Int): Queue[SimActor]
- Attributes
- protected
- Definition Classes
- Queue → ArrayDeque → ArrayDequeOps
- def orElse[A1 <: Int, B1 >: SimActor](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
- def padTo[B >: SimActor](len: Int, elem: B): Queue[B]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def padToInPlace(len: Int, elem: SimActor): WaitQueue.this.type
- Definition Classes
- Buffer
- def partition(p: (SimActor) => Boolean): (Queue[SimActor], Queue[SimActor])
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def partitionMap[A1, A2](f: (SimActor) => Either[A1, A2]): (Queue[A1], Queue[A2])
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def patch[B >: SimActor](from: Int, other: IterableOnce[B], replaced: Int): Queue[B]
- Definition Classes
- SeqOps
- def patchInPlace(from: Int, patch: IterableOnce[SimActor], replaced: Int): WaitQueue.this.type
- Definition Classes
- IndexedBuffer → Buffer
- def permutations: Iterator[Queue[SimActor]]
- Definition Classes
- SeqOps
- def persistentStat: TimeStatistic
Return time persistent statistics for value for this component (e.g.
Return time persistent statistics for value for this component (e.g. Number in queue).
- Definition Classes
- Component
- def prepend(elem: SimActor): WaitQueue.this.type
- Definition Classes
- ArrayDeque → Buffer
- def prependAll(elems: IterableOnce[SimActor]): WaitQueue.this.type
- Definition Classes
- ArrayDeque → Buffer
- def prepended[B >: SimActor](elem: B): Queue[B]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def prependedAll[B >: SimActor](prefix: IterableOnce[B]): Queue[B]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def product[B >: SimActor](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def reduce[B >: SimActor](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: SimActor](op: (B, SimActor) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: SimActor](op: (B, SimActor) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: SimActor](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: SimActor](op: (SimActor, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: SimActor](op: (SimActor, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def remove(idx: Int): SimActor
- Definition Classes
- ArrayDeque → Buffer
- def remove(idx: Int, count: Int): Unit
- Definition Classes
- ArrayDeque → Buffer
- def removeAll(p: (SimActor) => Boolean): Seq[SimActor]
- Definition Classes
- ArrayDeque
- def removeAll(): Seq[SimActor]
- Definition Classes
- ArrayDeque
- def removeAllReverse(): Seq[SimActor]
- Definition Classes
- ArrayDeque
- def removeFirst(p: (SimActor) => Boolean, from: Int): Option[SimActor]
- Definition Classes
- ArrayDeque
- def removeHead(resizeInternalRepr: Boolean): SimActor
- Definition Classes
- ArrayDeque
- def removeHeadOption(resizeInternalRepr: Boolean): Option[SimActor]
- Definition Classes
- ArrayDeque
- def removeHeadWhile(f: (SimActor) => Boolean): Seq[SimActor]
- Definition Classes
- ArrayDeque
- def removeLast(resizeInternalRepr: Boolean): SimActor
- Definition Classes
- ArrayDeque
- def removeLastOption(resizeInternalRepr: Boolean): Option[SimActor]
- Definition Classes
- ArrayDeque
- def removeLastWhile(f: (SimActor) => Boolean): Seq[SimActor]
- Definition Classes
- ArrayDeque
- final def requireBounds(idx: Int, until: Int): Unit
- Attributes
- protected
- Definition Classes
- ArrayDequeOps
- Annotations
- @inline()
- def reverse: Queue[SimActor]
- Definition Classes
- ArrayDequeOps → SeqOps
- def reverseIterator: Iterator[SimActor]
- Definition Classes
- IndexedSeqOps → SeqOps
- def reversed: Iterable[SimActor]
- Attributes
- protected
- Definition Classes
- IndexedSeqOps → IterableOnceOps
- def runWith[U](action: (SimActor) => U): (Int) => Boolean
- Definition Classes
- PartialFunction
- def sameElements[B >: SimActor](that: IterableOnce[B]): Boolean
- Definition Classes
- SeqOps
- def scan[B >: SimActor](z: B)(op: (B, B) => B): Queue[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, SimActor) => B): Queue[B]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: (SimActor, B) => B): Queue[B]
- Definition Classes
- IterableOps
- def search[B >: SimActor](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
- Definition Classes
- IndexedSeqOps → SeqOps
- def search[B >: SimActor](elem: B)(implicit ord: Ordering[B]): SearchResult
- Definition Classes
- IndexedSeqOps → SeqOps
- def segmentLength(p: (SimActor) => Boolean, from: Int): Int
- Definition Classes
- SeqOps
- final def segmentLength(p: (SimActor) => Boolean): Int
- Definition Classes
- SeqOps
- def simType: String
- Definition Classes
- Identifiable
- final def size: Int
- Definition Classes
- SeqOps → IterableOnceOps
- final def sizeCompare(that: Iterable[_]): Int
- Definition Classes
- SeqOps → IterableOps
- final def sizeCompare(otherSize: Int): Int
- Definition Classes
- SeqOps → IterableOps
- final def sizeIs: SizeCompareOps
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def slice(from: Int, until: Int): Queue[SimActor]
- Definition Classes
- ArrayDequeOps → IterableOps → IterableOnceOps
- def sliceInPlace(start: Int, end: Int): WaitQueue.this.type
- Definition Classes
- Buffer
- def sliding(window: Int, step: Int): Iterator[Queue[SimActor]]
- Definition Classes
- ArrayDequeOps → IterableOps
- def sliding(size: Int): Iterator[Queue[SimActor]]
- Definition Classes
- IterableOps
- def sortBy[B](f: (SimActor) => B)(implicit ord: Ordering[B]): Queue[SimActor]
- Definition Classes
- SeqOps
- def sortInPlace[B >: SimActor]()(implicit ord: Ordering[B]): WaitQueue.this.type
- Definition Classes
- IndexedSeqOps
- def sortInPlaceBy[B](f: (SimActor) => B)(implicit ord: Ordering[B]): WaitQueue.this.type
- Definition Classes
- IndexedSeqOps
- def sortInPlaceWith(lt: (SimActor, SimActor) => Boolean): WaitQueue.this.type
- Definition Classes
- IndexedSeqOps
- def sortWith(lt: (SimActor, SimActor) => Boolean): Queue[SimActor]
- Definition Classes
- SeqOps
- def sorted[B >: SimActor](implicit ord: Ordering[B]): Queue[SimActor]
- Definition Classes
- SeqOps
- def span(p: (SimActor) => Boolean): (Queue[SimActor], Queue[SimActor])
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def splitAt(n: Int): (Queue[SimActor], Queue[SimActor])
- Definition Classes
- IterableOps → IterableOnceOps
- def start_+(idx: Int): Int
- Attributes
- protected
- Definition Classes
- ArrayDeque → ArrayDequeOps
- Annotations
- @inline()
- def startsWith[B >: SimActor](that: IterableOnce[B], offset: Int): Boolean
- Definition Classes
- SeqOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[SimActor, S]): S with EfficientSplit
- Definition Classes
- ArrayDeque → IndexedSeqOps → IterableOnce
- final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[SimActor, B]): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedConcat[B >: SimActor, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (SimActor) => IterableOnce[B]): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (SimActor) => IterableOnce[B]): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (SimActor) => B): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(SimActor, B), C2]): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- def stringPrefix: String
- Attributes
- protected[this]
- Definition Classes
- Queue → ArrayDeque → IndexedSeq → Buffer → Seq → Iterable
- val subpart: ListBuffer[Component]
List of subparts of the Component (empty for atomic components, nonempty for composites)
List of subparts of the Component (empty for atomic components, nonempty for composites)
- Definition Classes
- Component
- def subtractAll(xs: IterableOnce[SimActor]): WaitQueue.this.type
- Definition Classes
- Shrinkable
- def subtractOne(elem: SimActor): WaitQueue.this.type
- Definition Classes
- ArrayDeque → Buffer → Shrinkable
- def sum[B >: SimActor](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tail: Queue[SimActor]
- Definition Classes
- IterableOps
- def tails: Iterator[Queue[SimActor]]
- Definition Classes
- IterableOps
- def take(n: Int): Queue[SimActor]
- Definition Classes
- IndexedSeqOps → IterableOps → IterableOnceOps
- def takeInPlace(n: Int): WaitQueue.this.type
- Definition Classes
- Buffer
- def takeRight(n: Int): Queue[SimActor]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def takeRightInPlace(n: Int): WaitQueue.this.type
- Definition Classes
- Buffer
- def takeWhile(p: (SimActor) => Boolean): Queue[SimActor]
- Definition Classes
- IterableOps → IterableOnceOps
- def takeWhileInPlace(p: (SimActor) => Boolean): WaitQueue.this.type
- Definition Classes
- Buffer
- def tally(duration: Double): Unit
Tally the duration (e.g., waiting time) of an activity or delay.
Tally the duration (e.g., waiting time) of an activity or delay.
- duration
the time duration
- Definition Classes
- Component
- def tapEach[U](f: (SimActor) => U): Queue[SimActor]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def to[C1](factory: Factory[SimActor, C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: SimActor](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- ArrayDeque → IterableOnceOps
- final def toBuffer[B >: SimActor]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: IndexedSeq[SimActor]
- Definition Classes
- IterableOnceOps
- final def toIterable: WaitQueue.this.type
- Definition Classes
- Iterable → IterableOps
- def toList: List[SimActor]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[SimActor, (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toSeq: Seq[SimActor]
- Definition Classes
- IterableOnceOps
- def toSet[B >: SimActor]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
- Definition Classes
- Seq → Function1 → Iterable → AnyRef → Any
- def toVector: Vector[SimActor]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: (SimActor) => Iterable[B]): Queue[Queue[B]]
- Definition Classes
- IterableOps
- def trimToSize(): Unit
- Definition Classes
- ArrayDeque
- def unapply(a: Int): Option[SimActor]
- Definition Classes
- PartialFunction
- def unzip[A1, A2](implicit asPair: (SimActor) => (A1, A2)): (Queue[A1], Queue[A2])
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (SimActor) => (A1, A2, A3)): (Queue[A1], Queue[A2], Queue[A3])
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def update(idx: Int, elem: SimActor): Unit
- Definition Classes
- ArrayDeque → SeqOps
- def updated[B >: SimActor](index: Int, elem: B): Queue[B]
- Definition Classes
- SeqOps
- def view: IndexedSeqView[SimActor]
- Definition Classes
- IndexedSeqOps → SeqOps → IterableOps
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def waitIn(): Boolean
Wait in the queue, recording the waiting time.
Wait in the queue, recording the waiting time. Return whether the entity was able to actually join the queue or was barred.
- def withFilter(p: (SimActor) => Boolean): WithFilter[SimActor, [_]Queue[_]]
- Definition Classes
- IterableOps
- def writeReplace(): AnyRef
- Attributes
- protected[this]
- Definition Classes
- DefaultSerializable
- def zip[B](that: IterableOnce[B]): Queue[(SimActor, B)]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def zipAll[A1 >: SimActor, B](that: Iterable[B], thisElem: A1, thatElem: B): Queue[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: Queue[(SimActor, Int)]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
Deprecated Value Members
- final def +=(elem1: SimActor, elem2: SimActor, elems: SimActor*): WaitQueue.this.type
- Definition Classes
- Growable
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
++=
akaaddAll
instead of varargs+=
; infix operations with an operand of multiple args will be deprecated
- def -=(elem1: SimActor, elem2: SimActor, elems: SimActor*): WaitQueue.this.type
- Definition Classes
- Shrinkable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.3) Use
--=
akasubtractAll
instead of varargs-=
; infix operations with an operand of multiple args will be deprecated
- final def /:[B](z: B)(op: (B, SimActor) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- final def :\[B](z: B)(op: (SimActor, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldRight instead of :\
- def aggregate[B](z: => B)(seqop: (B, SimActor) => B, combop: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0)
aggregate
is not relevant for sequential collections. UsefoldLeft(z)(seqop)
instead.
- final def append(elems: SimActor*): WaitQueue.this.type
- Definition Classes
- Buffer
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use appendAll instead
- def companion: IterableFactory[[_]Queue[_]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @deprecatedOverriding() @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- final def copyToBuffer[B >: SimActor](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= coll
instead
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- def hasDefiniteSize: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
- final def prefixLength(p: (SimActor) => Boolean): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use segmentLength instead of prefixLength
- final def prepend(elems: SimActor*): WaitQueue.this.type
- Definition Classes
- Buffer
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use prependAll instead
- final def repr: Queue[SimActor]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
- def reverseMap[B](f: (SimActor) => B): Queue[B]
- Definition Classes
- SeqOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)
- def seq: WaitQueue.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- final def toIterator: Iterator[SimActor]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- final def toStream: Stream[SimActor]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: Traversable[SimActor]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use toIterable instead
- final def transform(f: (SimActor) => SimActor): WaitQueue.this.type
- Definition Classes
- SeqOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
mapInPlace
on anIndexedSeq
instead
- def trimEnd(n: Int): Unit
- Definition Classes
- Buffer
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.4) use dropRightInPlace instead
- def trimStart(n: Int): Unit
- Definition Classes
- Buffer
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.4) use dropInPlace instead
- final def union[B >: SimActor](that: Seq[B]): Queue[B]
- Definition Classes
- SeqOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
concat
instead
- def view(from: Int, until: Int): IndexedSeqView[SimActor]
- Definition Classes
- IndexedSeqOps → IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)