trait MinMaxQueue[A] extends IterableOnce[A]
- Alphabetic
- By Inheritance
- MinMaxQueue
- IterableOnce
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def apply(index: Int): A
Returns the element at the given index
Returns the element at the given index
- Exceptions thrown
java.lang.IndexOutOfBoundsException
if the index is out of bounds- Note
Time Complexity: O(1)
- abstract def back: A
Returns the last element of this queue
Returns the last element of this queue
- Exceptions thrown
java.util.NoSuchElementException
if this queue is empty- Note
Time Complexity: O(1)
- abstract def backOption: Option[A]
Returns the last element of this queue
Returns the last element of this queue
- Note
Time Complexity: O(1)
- abstract def clear(): MinMaxQueue[A]
Removes all elements from this queue
Removes all elements from this queue
- Note
Time Complexity: O(1)
- abstract def dequeue(): (A, MinMaxQueue[A])
Dequeues and returns the first element from this queue
Dequeues and returns the first element from this queue
- Exceptions thrown
java.util.NoSuchElementException
if this queue is empty- Note
Time Complexity: amortized O(1)
- abstract def dequeueAll(): (IndexedSeq[A], MinMaxQueue[A])
Dequeues and returns all elements from this queue
- abstract def dequeueWhile(f: (A) => Boolean): (IndexedSeq[A], MinMaxQueue[A])
Dequeues and returns elements from this queue that satisfy the given predicate
- abstract def enqueue(value: A, values: A*): MinMaxQueue[A]
Enqueues all elements to the last of this queue
- abstract def enqueue(value: A): MinMaxQueue[A]
Enqueues the element to the last of this queue
Enqueues the element to the last of this queue
- Note
Time Complexity: O(1)
- abstract def enqueueAll(values: IterableOnce[A]): MinMaxQueue[A]
Enqueues elements of the given iterable to the last of this queue
- abstract def front: A
Returns the first element of this queue
Returns the first element of this queue
- Exceptions thrown
java.util.NoSuchElementException
if this queue is empty- Note
Time Complexity: O(1)
- abstract def frontOption: Option[A]
Returns the first element of this queue
Returns the first element of this queue
- Note
Time Complexity: O(1)
- abstract def isEmpty: Boolean
Returns true if this queue is empty
Returns true if this queue is empty
- Note
Time Complexity: O(1)
- abstract def iterator: Iterator[A]
- Definition Classes
- IterableOnce
- abstract def max: A
Returns the maximum element of this queue
Returns the maximum element of this queue
- Exceptions thrown
java.util.NoSuchElementException
if this queue is empty- Note
Time Complexity: O(1)
- abstract def maxOption: Option[A]
Returns the maximum element of this queue
Returns the maximum element of this queue
- Note
Time Complexity: O(1)
- abstract def min: A
Returns the minimum element of this queue
Returns the minimum element of this queue
- Exceptions thrown
java.util.NoSuchElementException
if this queue is empty- Note
Time Complexity: O(1)
- abstract def minOption: Option[A]
Returns the minimum element of this queue
Returns the minimum element of this queue
- Note
Time Complexity: O(1)
- abstract def minmax: (A, A)
Returns the minimum and maximum elements of this queue
Returns the minimum and maximum elements of this queue
- Exceptions thrown
java.util.NoSuchElementException
if this queue is empty- Note
Time Complexity: O(1)
- abstract def minmaxOption: Option[(A, A)]
Returns the minimum and maximum elements of this queue
Returns the minimum and maximum elements of this queue
- Note
Time Complexity: O(1)
- abstract def nonEmpty: Boolean
Returns true if this queue is not empty
Returns true if this queue is not empty
- Note
Time Complexity: O(1)
- abstract def ordering: Ordering[A]
Returns the ordering of this queue
Returns the ordering of this queue
- Note
Time Complexity: O(1)
- abstract def reverseIterator: Iterator[A]
Returns a reverse iterator of this queue
Returns a reverse iterator of this queue
- Note
Time Complexity: O(1)
- abstract def size: Int
Returns the size of this queue
Returns the size of this queue
- Note
Time Complexity: O(1)
- abstract def to[C](factory: Factory[A, C]): C
Builds a collection from this queue
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def knownSize: Int
- Definition Classes
- IterableOnce
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
- Definition Classes
- IterableOnce
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- 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])