trait MinMaxStack[A] extends IterableOnce[A]
- Alphabetic
- By Inheritance
- MinMaxStack
- 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 bottom: A
Returns the bottom element of this stack
Returns the bottom element of this stack
- Exceptions thrown
java.util.NoSuchElementException
if this stack is empty- Note
Time Complexity: O(1)
- abstract def bottomOption: Option[A]
Returns the bottom element of this stack
Returns the bottom element of this stack
- Note
Time Complexity: O(1)
- abstract def clear(): MinMaxStack[A]
Removes all elements of this stack
Removes all elements of this stack
- Note
Time Complexity: O(N)
- abstract def isEmpty: Boolean
Returns true if this stack is empty
Returns true if this stack 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 stack
Returns the maximum element of this stack
- Exceptions thrown
java.util.NoSuchElementException
if this stack is empty- Note
Time Complexity: O(1)
- abstract def maxOption: Option[A]
Returns the maximum element of this stack
Returns the maximum element of this stack
- Note
Time Complexity: O(1)
- abstract def min: A
Returns the minimum element of this stack
Returns the minimum element of this stack
- Exceptions thrown
java.util.NoSuchElementException
if this stack is empty- Note
Time Complexity: O(1)
- abstract def minOption: Option[A]
Returns the minimum element of this stack
Returns the minimum element of this stack
- Note
Time Complexity: O(1)
- abstract def minmax: (A, A)
Returns the minimum and maximum elements of this stack
Returns the minimum and maximum elements of this stack
- Exceptions thrown
java.util.NoSuchElementException
if this stack is empty- Note
Time Complexity: O(1)
- abstract def minmaxOption: Option[(A, A)]
Returns the minimum and maximum elements of this stack
Returns the minimum and maximum elements of this stack
- Note
Time Complexity: O(1)
- abstract def nonEmpty: Boolean
Returns true if this stack not empty
Returns true if this stack not empty
- Note
Time Complexity: O(1)
- abstract def ordering: Ordering[A]
Returns the ordering of this stack
Returns the ordering of this stack
- Note
Time Complexity: O(1)
- abstract def pop(): (A, MinMaxStack[A])
Pops and returns the top element from this stack
Pops and returns the top element from this stack
- Exceptions thrown
java.util.NoSuchElementException
if this stack is empty- Note
Time Complexity: O(1)
- abstract def popAll(): (IndexedSeq[A], MinMaxStack[A])
Pops and returns all elements from this stack
Pops and returns all elements from this stack
- Note
Time Complexity: O(N)
- abstract def popWhile(f: (A) => Boolean): (IndexedSeq[A], MinMaxStack[A])
Pops and returns all elements from this stack that satisfy the given predicate
- abstract def push(value: A, values: A*): MinMaxStack[A]
Pushes the given elements onto this stack
- abstract def push(value: A): MinMaxStack[A]
Pushes the given element to the top of this stack
Pushes the given element to the top of this stack
- Note
Time Complexity: O(1)
- abstract def pushAll(iterable: IterableOnce[A]): MinMaxStack[A]
Pushes all elements of the given iterable onto this stack
- abstract def reverseIterator: Iterator[A]
Returns a reverse iterator of this stack
Returns a reverse iterator of this stack
- Note
Time Complexity: O(1)
- abstract def size: Int
Returns the size of this stack
Returns the size of this stack
- Note
Time Complexity: O(1)
- abstract def to[C](factory: Factory[A, C]): C
Builds a collection from this stack
- abstract def top: A
Returns the top element of this stack
Returns the top element of this stack
- Exceptions thrown
java.util.NoSuchElementException
if this stack is empty- Note
Time Complexity: O(1)
- abstract def topOption: Option[A]
Returns the top element of this stack
Returns the top element of this stack
- Note
Time Complexity: O(1)
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])