Packages

trait MinMaxStack[A] extends IterableOnce[A] with Cloneable[MinMaxStack[A]]

Allows to push and pop elements in a last-in-first-out (LIFO) fashion. This data structure also allows to retrieval of the minimum and maximum value efficiently.

Linear Supertypes
Cloneable[MinMaxStack[A]], Cloneable, IterableOnce[A], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MinMaxStack
  2. Cloneable
  3. Cloneable
  4. IterableOnce
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. 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)

  2. 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)

  3. abstract def bottomOption: Option[A]

    Returns the bottom element of this stack

    Returns the bottom element of this stack

    Note

    Time Complexity: O(1)

  4. abstract def clear(): Unit

    Removes all elements of this stack

    Removes all elements of this stack

    Note

    Time Complexity: O(N)

  5. abstract def isEmpty: Boolean

    Returns true if this stack is empty

    Returns true if this stack is empty

    Note

    Time Complexity: O(1)

  6. abstract def iterator: Iterator[A]
    Definition Classes
    IterableOnce
  7. 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)

  8. abstract def maxOption: Option[A]

    Returns the maximum element of this stack

    Returns the maximum element of this stack

    Note

    Time Complexity: O(1)

  9. 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)

  10. abstract def minOption: Option[A]

    Returns the minimum element of this stack

    Returns the minimum element of this stack

    Note

    Time Complexity: O(1)

  11. 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)

  12. 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)

  13. abstract def nonEmpty: Boolean

    Returns true if this stack is not empty

    Returns true if this stack is not empty

    Note

    Time Complexity: O(1)

  14. abstract def ordering: Ordering[A]

    Returns the ordering of this stack

    Returns the ordering of this stack

    Note

    Time Complexity: O(1)

  15. abstract def pop(): 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)

  16. abstract def popAll(): IndexedSeq[A]

    Pops and returns all elements from this stack

    Pops and returns all elements from this stack

    Note

    Time Complexity: O(N)

  17. abstract def popWhile(f: (A) => Boolean): IndexedSeq[A]

    Pops and returns all elements from this stack that satisfy the given predicate

  18. abstract def push(value: A, values: A*): MinMaxStack.this.type

    Pushes the given elements onto this stack

  19. abstract def push(value: A): MinMaxStack.this.type

    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)

  20. abstract def pushAll(iterable: IterableOnce[A]): MinMaxStack.this.type

    Pushes all elements of the given iterable onto this stack

  21. abstract def reverseIterator: Iterator[A]

    Returns a reverse iterator of this stack

    Returns a reverse iterator of this stack

    Note

    Time Complexity: O(1)

  22. abstract def size: Int

    Returns the size of this stack

    Returns the size of this stack

    Note

    Time Complexity: O(1)

  23. abstract def to[C](factory: Factory[A, C]): C

    Builds a collection from this stack

  24. 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)

  25. 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

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): MinMaxStack[A]
    Definition Classes
    Cloneable → AnyRef
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  8. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  9. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  10. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  11. def knownSize: Int
    Definition Classes
    IterableOnce
  12. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  14. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  15. def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
    Definition Classes
    IterableOnce
  16. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  17. def toString(): String
    Definition Classes
    AnyRef → Any
  18. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  19. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  20. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

Inherited from Cloneable[MinMaxStack[A]]

Inherited from Cloneable

Inherited from IterableOnce[A]

Inherited from AnyRef

Inherited from Any

Ungrouped