scala.collection.mutable

# StackProxy

#### trait StackProxy [A] extends Stack[A] with Proxy

A stack implements a data structure which allows to store and retrieve objects in a last-in-first-out (LIFO) fashion.

A

  type of the elements in this stack proxy.

Source
  StackProxy.scala
Version

  1.0, 10/05/2004

Since

  1

Linear Supertypes
Proxy, Stack[A], Serializable, Serializable, Seq[A], SeqLike[A, Stack[A]], Cloneable[Stack[A]], Seq[A], SeqLike[A, Stack[A]], GenSeq[A], GenSeqLike[A, Stack[A]], PartialFunction[Int, A], (Int) ⇒ A, Iterable[A], Iterable[A], IterableLike[A, Stack[A]], Equals, GenIterable[A], GenIterableLike[A, Stack[A]], Traversable[A], Mutable, Traversable[A], GenTraversable[A], GenericTraversableTemplate[A, Stack], TraversableLike[A, Stack[A]], GenTraversableLike[A, Stack[A]], Parallelizable[A, ParSeq[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, Stack[A]], HasNewBuilder[A, Stack[A]], AnyRef, Any
Ordering

1. Alphabetic
2. By inheritance

Inherited

1. Hide All
2. Show all

1. StackProxy
2. Proxy
3. Stack
4. Serializable
5. Serializable
6. Seq
7. SeqLike
8. Cloneable
9. Seq
10. SeqLike
11. GenSeq
12. GenSeqLike
13. PartialFunction
14. Function1
15. Iterable
16. Iterable
17. IterableLike
18. Equals
19. GenIterable
20. GenIterableLike
21. Traversable
22. Mutable
23. Traversable
24. GenTraversable
25. GenericTraversableTemplate
26. TraversableLike
27. GenTraversableLike
28. Parallelizable
29. TraversableOnce
30. GenTraversableOnce
31. FilterMonadic
32. HasNewBuilder
33. AnyRef
34. Any

Visibility

1. Public
2. All

### Type Members

1. #### type Self = Stack[A]

   The type implementing this traversable

   The type implementing this traversable

   Attributes
     protected
   Definition Classes
     TraversableLike

2. #### class WithFilter extends FilterMonadic[A, Repr]

   A class supporting filtered operations.

### Abstract Value Members

1. #### def self : Stack[A]

   Attributes
     abstract
   Definition Classes
     StackProxy → Proxy

### Concrete Value Members

1. #### def != (arg0: AnyRef): Boolean

   Attributes
     final
   Definition Classes
     AnyRef

2. #### def != (arg0: Any): Boolean

   Test two objects for inequality.

   Test two objects for inequality.

   returns

     `true` if !(this == that), false otherwise.

   Attributes
     final
   Definition Classes
     Any

3. #### def ## (): Int

   Equivalent to `x.hashCode` except for boxed numeric types.

   Equivalent to `x.hashCode` except for boxed numeric types. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them.

   returns

     a hash value consistent with ==

   Attributes
     final
   Definition Classes
     AnyRef → Any

4. #### def ++ [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[Stack[A], B, That]): That

   Definition Classes
     TraversableLike
   Annotations
     @bridge()

5. #### def ++ [B] (that: GenTraversableOnce[B]): Stack[B]

   [use case] Concatenates this stack with the elements of a traversable collection.

   [use case]

   Concatenates this stack with the elements of a traversable collection.

   B

     the element type of the returned collection.

   that

     the traversable to append.

   returns

     a new collection of type `That` which contains all elements of this stack followed by all elements of `that`.

   Attributes
     abstract
   Definition Classes
     GenTraversableLike

6. #### def ++ [B >: A, That] (that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Stack[A], B, That]): That

   Concatenates this stack with the elements of a traversable collection.

   Concatenates this stack with the elements of a traversable collection.

   B

     the element type of the returned collection.

   That

     the class of the returned collection. Where possible, `That` is the same class as the current collection class `Repr`, but this depends on the element type `B` being admissible for that class, which means that an implicit instance of type `CanBuildFrom[Repr, B, That]` is found.

   that

     the traversable to append.

   bf

     an implicit value of class `CanBuildFrom` which determines the result class `That` from the current representation type `Repr` and the new element type `B`.

   returns

     a new collection of type `That` which contains all elements of this stack followed by all elements of `that`.

   Definition Classes
     TraversableLike → GenTraversableLike

7. #### def ++: [B >: A, That] (that: Traversable[B])(implicit bf: CanBuildFrom[Stack[A], B, That]): That

   This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions.

   This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions. Since TraversableOnce has no '++' method, we have to implement that directly, but Traversable and down can use the overload.

   Definition Classes
     TraversableLike

8. #### def ++: [B] (that: TraversableOnce[B]): Stack[B]

   [use case] Concatenates this stack with the elements of a traversable collection.

   [use case]

   Concatenates this stack with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

   B

     the element type of the returned collection.

   that

     the traversable to append.

   returns

     a new collection of type `That` which contains all elements of this stack followed by all elements of `that`.

   Attributes
     abstract
   Definition Classes
     TraversableLike

9. #### def ++: [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[Stack[A], B, That]): That

   Concatenates this stack with the elements of a traversable collection.

   Concatenates this stack with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

   B

     the element type of the returned collection.

   That

     the class of the returned collection. Where possible, `That` is the same class as the current collection class `Repr`, but this depends on the element type `B` being admissible for that class, which means that an implicit instance of type `CanBuildFrom[Repr, B, That]` is found.

   that

     the traversable to append.

   bf

     an implicit value of class `CanBuildFrom` which determines the result class `That` from the current representation type `Repr` and the new element type `B`.

   returns

     a new collection of type `That` which contains all elements of this stack followed by all elements of `that`.

   Definition Classes
     TraversableLike

10. #### def +: (elem: A): Stack[A]

    [use case] Prepends an element to this stack

    [use case]

    Prepends an element to this stack

    elem

      the prepended element

    returns

      a new collection of type `That` consisting of `elem` followed by all elements of this stack.

    Attributes
      abstract
    Definition Classes
      GenSeqLike

11. #### def +: [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[Stack[A], B, That]): That

    Prepends an element to this stack

    Prepends an element to this stack

    B

      the element type of the returned stack.

    That

      the class of the returned collection. Where possible, `That` is the same class as the current collection class `Repr`, but this depends on the element type `B` being admissible for that class, which means that an implicit instance of type `CanBuildFrom[Repr, B, That]` is found.

    elem

      the prepended element

    bf

      an implicit value of class `CanBuildFrom` which determines the result class `That` from the current representation type `Repr` and the new element type `B`.

    returns

      a new collection of type `That` consisting of `elem` followed by all elements of this stack.

    Definition Classes
      SeqLike → GenSeqLike

12. #### def += (elem: A): StackProxy.this.type

    Pushes a single element on top of the stack.

    Pushes a single element on top of the stack.

    elem

      the element to push onto the stack

13. #### def /: [B] (z: B)(op: (B, A) ⇒ B): B

    Applies a binary operator to a start value and all elements of this stack, going left to right.

    Applies a binary operator to a start value and all elements of this stack, going left to right.

    Note: `/:` is alternate syntax for `foldLeft`; `z /: xs` is the same as `xs foldLeft z`.

    B

      the result type of the binary operator.

    z

      the start value.

    op

      the binary operator.

    returns

      the result of inserting `op` between consecutive elements of this stack, going left to right with the start value `z` on the left:

                      op(...op(op(z, x,,1,,), x,,2,,), ..., x,,n,,)

      where `x,,1,,, ..., x,,n,,` are the elements of this stack.

    Definition Classes
      TraversableOnce → GenTraversableOnce

14. #### def /:\ [A1 >: A] (z: A1)(op: (A1, A1) ⇒ A1): A1

    A syntactic sugar for out of order folding.

    A syntactic sugar for out of order folding. See `fold`.

    Definition Classes
      GenTraversableOnce

15. #### def :+ (elem: A): Stack[A]

    [use case] Appends an element to this stack

    [use case]

    Appends an element to this stack

    elem

      the appended element

    returns

      a new collection of type `That` consisting of all elements of this stack followed by `elem`.

    Attributes
      abstract
    Definition Classes
      GenSeqLike

16. #### def :+ [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[Stack[A], B, That]): That

    Appends an element to this stack

    Appends an element to this stack

    B

      the element type of the returned stack.

    That

      the class of the returned collection. Where possible, `That` is the same class as the current collection class `Repr`, but this depends on the element type `B` being admissible for that class, which means that an implicit instance of type `CanBuildFrom[Repr, B, That]` is found.

    elem

      the appended element

    bf

      an implicit value of class `CanBuildFrom` which determines the result class `That` from the current representation type `Repr` and the new element type `B`.

    returns

      a new collection of type `That` consisting of all elements of this stack followed by `elem`.

    Definition Classes
      SeqLike → GenSeqLike

17. #### def :\ [B] (z: B)(op: (A, B) ⇒ B): B

    Applies a binary operator to all elements of this stack and a start value, going right to left.

    Applies a binary operator to all elements of this stack and a start value, going right to left.

    Note: `:\` is alternate syntax for `foldRight`; `xs :\ z` is the same as `xs foldRight z`.

    B

      the result type of the binary operator.

    z

      the start value

    op

      the binary operator

    returns

      the result of inserting `op` between consecutive elements of this stack, going right to left with the start value `z` on the right:

                      op(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))

      where `x,,1,,, ..., x,,n,,` are the elements of this stack.

    Definition Classes
      TraversableOnce → GenTraversableOnce

18. #### def == (arg0: AnyRef): Boolean

    Attributes
      final
    Definition Classes
      AnyRef

19. #### def == (arg0: Any): Boolean

    Test two objects for equality.

    Test two objects for equality.

    returns

      `true` if the receiver object is equivalent to the argument; `false` otherwise.

    Attributes
      final
    Definition Classes
      Any

20. #### def addString (b: StringBuilder): StringBuilder

    Appends all elements of this stack to a string builder.

    Appends all elements of this stack to a string builder. The written text consists of the string representations (w.r.t. the method `toString`) of all elements of this stack without any separator string.

    b

      the string builder to which elements are appended.

    returns

      the string builder `b` to which elements were appended.

    Definition Classes
      TraversableOnce

21. #### def addString (b: StringBuilder, sep: String): StringBuilder

    Appends all elements of this stack to a string builder using a separator string.

    Appends all elements of this stack to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method `toString`) of all elements of this stack, separated by the string `sep`.

    b

      the string builder to which elements are appended.

    sep

      the separator string.

    returns

      the string builder `b` to which elements were appended.

    Definition Classes
      TraversableOnce

22. #### def addString (b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Appends all elements of this stack to a string builder using start, end, and separator strings.

    Appends all elements of this stack to a string builder using start, end, and separator strings. The written text begins with the string `start` and ends with the string `end`. Inside, the string representations (w.r.t. the method `toString`) of all elements of this stack are separated by the string `sep`.

    b

      the string builder to which elements are appended.

    start

      the starting string.

    sep

      the separator string.

    end

      the ending string.

    returns

      the string builder `b` to which elements were appended.

    Definition Classes
      TraversableOnce

23. #### def aggregate [B] (z: B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

    This is a more general form of `fold` and `reduce`. It has similar semantics, but does not require the result to be a supertype of the element type. It traverses the elements in different partitions sequentially, using `seqop` to update the result, and then applies `combop` to results from different partitions. The implementation of this operation may operate on an arbitrary number of collection partitions, so `combop` may be invoked arbitrary number of times.

    For example, one might want to process some elements and then produce a `Set`. In this case, `seqop` would process an element and append it to the list, while `combop` would concatenate two lists from different partitions together. The initial value `z` would be an empty set.

           pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)

    Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).

    z

      the initial value for the accumulated result of the partition - this will typically be the neutral element for the `seqop` operator (e.g. `Nil` for list concatenation or `0` for summation)

    seqop

      an operator used to accumulate results within a partition

    combop

      an associative operator used to combine results from different partitions

    Definition Classes
      TraversableOnce → GenTraversableOnce

24. #### def andThen [C] (k: (A) ⇒ C): PartialFunction[Int, C]

    Composes this partial function with a transformation function that gets applied to results of this partial function.

    Composes this partial function with a transformation function that gets applied to results of this partial function.

    C

      the result type of the transformation function.

    k

      the transformation function

    returns

      a partial function with the same domain as this partial function, which maps arguments `x` to `k(this(x))`.

    Definition Classes
      PartialFunction → Function1

25. #### def apply (n: Int): A

    Access element number `n`.

    Access element number `n`.

    returns

      the element at index `n`.

    Definition Classes
      StackProxy → Stack → SeqLike → GenSeqLike → Function1

26. #### def asInstanceOf [T0] : T0

    Cast the receiver object to be of type `T0`.

    Cast the receiver object to be of type `T0`.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression `1.asInstanceOf[String]` will throw a `ClassCastException` at runtime, while the expression `List(1).asInstanceOf[List[String]]` will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.

    returns

      the receiver object.

    Attributes
      final
    Definition Classes
      Any

27. #### def canEqual (that: Any): Boolean

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    that

      The object with which this stack should be compared

    returns

      `true`, if this stack can possibly equal `that`, `false` otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    Definition Classes
      IterableLike → Equals

28. #### def clear (): Unit

    Removes all elements from the stack.

    Removes all elements from the stack. After this operation completed, the stack will be empty.

    Definition Classes
      StackProxy → Stack

29. #### def clone (): Stack[A]

    This method clones the stack.

    This method clones the stack.

    returns

      a stack with the same elements.

    Definition Classes
      StackProxy → Stack → Cloneable → AnyRef

30. #### def collect [B] (pf: PartialFunction[A, B]): Stack[B]

    [use case] Builds a new collection by applying a partial function to all elements of this stack on which the function is defined.

    [use case]

    Builds a new collection by applying a partial function to all elements of this stack on which the function is defined.

    B

      the element type of the returned collection.

    pf

      the partial function which filters and maps the stack.

    returns

      a new collection of type `That` resulting from applying the partial function `pf` to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Attributes
      abstract
    Definition Classes
      GenTraversableLike

31. #### def collect [B, That] (pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Stack[A], B, That]): That

    Builds a new collection by applying a partial function to all elements of this stack on which the function is defined.

    Builds a new collection by applying a partial function to all elements of this stack on which the function is defined.

    B

      the element type of the returned collection.

    That

      the class of the returned collection. Where possible, `That` is the same class as the current collection class `Repr`, but this depends on the element type `B` being admissible for that class, which means that an implicit instance of type `CanBuildFrom[Repr, B, That]` is found.

    pf

      the partial function which filters and maps the stack.

    bf

      an implicit value of class `CanBuildFrom` which determines the result class `That` from the current representation type `Repr` and the new element type `B`.

    returns

      a new collection of type `That` resulting from applying the partial function `pf` to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Definition Classes
      TraversableLike → GenTraversableLike

32. #### def collectFirst [B] (pf: PartialFunction[A, B]): Option[B]

    Finds the first element of the stack for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the stack for which the given partial function is defined, and applies the partial function to it.

    pf

      the partial function

    returns

      an option value containing pf applied to the first value for which it is defined, or `None` if none exists.

    Definition Classes
      TraversableOnce
    Example:

    1. `Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)`

33. #### def combinations (n: Int): Iterator[Stack[A]]

    Iterates over combinations.

    Iterates over combinations.

    returns

      An Iterator which traverses the possible n-element combinations of this stack.

    Definition Classes
      SeqLike
    Example:

    1. `"abbbc".combinations(2) = Iterator(ab, ac, bb, bc)`

34. #### def companion : scala.collection.mutable.Stack.type

    The factory companion object that builds instances of class Stack.

    The factory companion object that builds instances of class Stack. (or its `Iterable` superclass where class Stack is not a `Seq`.)

    Definition Classes
      Stack → Seq → Seq → GenSeq → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate

35. #### def compose [A] (g: (A) ⇒ Int): (A) ⇒ A

    Composes two instances of Function1 in a new Function1, with this function applied last.

    Composes two instances of Function1 in a new Function1, with this function applied last.

    A

      the type to which function `g` can be applied

    g

      a function A => T1

    returns

      a new function `f` such that `f(x) == apply(g(x))`

    Definition Classes
      Function1

36. #### def contains (elem: Any): Boolean

    Tests whether this stack contains a given value as an element.

    Tests whether this stack contains a given value as an element.

    elem

      the element to test.

    returns

      `true` if this stack has an element that is is equal (wrt `==`) to `elem`, `false` otherwise.

    Definition Classes
      SeqLike

37. #### def containsSlice [B] (that: Seq[B]): Boolean

    Definition Classes
      SeqLike
    Annotations
      @bridge()

38. #### def containsSlice [B] (that: GenSeq[B]): Boolean

    Tests whether this stack contains a given sequence as a slice.

    Tests whether this stack contains a given sequence as a slice.

    that

      the sequence to test

    returns

      `true` if this stack contains a slice with the same elements as `that`, otherwise `false`.

    Definition Classes
      SeqLike

39. #### def copyToArray (xs: Array[A], start: Int, len: Int): Unit

    [use case] Copies elements of this stack to an array.

    [use case]

    Copies elements of this stack to an array. Fills the given array `xs` with at most `len` elements of this stack, starting at position `start`. Copying will stop once either the end of the current stack is reached, or the end of the array is reached, or `len` elements have been copied.

    xs

      the array to fill.

    start

      the starting index.

    len

      the maximal number of elements to copy.

    Attributes
      abstract
    Definition Classes
      TraversableLike

40. #### def copyToArray [B >: A] (xs: Array[B], start: Int, len: Int): Unit

    Copies elements of this stack to an array.

    Copies elements of this stack to an array. Fills the given array `xs` with at most `len` elements of this stack, starting at position `start`. Copying will stop once either the end of the current stack is reached, or the end of the array is reached, or `len` elements have been copied.

    B

      the type of the elements of the array.

    xs

      the array to fill.

    start

      the starting index.

    len

      the maximal number of elements to copy.

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

41. #### def copyToArray (xs: Array[A]): Unit

    [use case] Copies values of this stack to an array.

    [use case]

    Copies values of this stack to an array. Fills the given array `xs` with values of this stack. Copying will stop once either the end of the current stack is reached, or the end of the array is reached.

    xs

      the array to fill.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

42. #### def copyToArray [B >: A] (xs: Array[B]): Unit

    Copies values of this stack to an array.

    Copies values of this stack to an array. Fills the given array `xs` with values of this stack. Copying will stop once either the end of the current stack is reached, or the end of the array is reached.

    B

      the type of the elements of the array.

    xs

      the array to fill.

    Definition Classes
      TraversableOnce → GenTraversableOnce

43. #### def copyToArray (xs: Array[A], start: Int): Unit

    [use case] Copies values of this stack to an array.

    [use case]

    Copies values of this stack to an array. Fills the given array `xs` with values of this stack, beginning at index `start`. Copying will stop once either the end of the current stack is reached, or the end of the array is reached.

    xs

      the array to fill.

    start

      the starting index.

    Attributes
      abstract
    Definition Classes
      GenTraversableOnce

44. #### def copyToArray [B >: A] (xs: Array[B], start: Int): Unit

    Copies values of this stack to an array.

    Copies values of this stack to an array. Fills the given array `xs` with values of this stack, beginning at index `start`. Copying will stop once either the end of the current stack is reached, or the end of the array is reached.

    B

      the type of the elements of the array.

    xs

      the array to fill.

    start

      the starting index.

    Definition Classes
      TraversableOnce → GenTraversableOnce

45. #### def copyToBuffer [B >: A] (dest: Buffer[B]): Unit

    Copies all elements of this stack to a buffer.

    Copies all elements of this stack to a buffer.

    dest

      The buffer to which elements are copied.

    Definition Classes
      TraversableOnce

46. #### def corresponds [B] (that: Seq[B])(p: (A, B) ⇒ Boolean): Boolean

    Definition Classes
      SeqLike
    Annotations
      @bridge()

47. #### def corresponds [B] (that: GenSeq[B])(p: (A, B) ⇒ Boolean): Boolean

    Tests whether every element of this stack relates to the corresponding element of another sequence by satisfying a test predicate.

    Tests whether every element of this stack relates to the corresponding element of another sequence by satisfying a test predicate.

    B

      the type of the elements of `that`

    that

      the other sequence

    p

      the test predicate, which relates elements from both sequences

    returns

      `true` if both sequences have the same length and `p(x, y)` is `true` for all corresponding elements `x` of this stack and `y` of `that`, otherwise `false`.

    Definition Classes
      SeqLike → GenSeqLike

48. #### def count (p: (A) ⇒ Boolean): Int

    Counts the number of elements in the stack which satisfy a predicate.

    Counts the number of elements in the stack which satisfy a predicate.

    p

      the predicate used to test elements.

    returns

      the number of elements satisfying the predicate `p`.

    Definition Classes
      TraversableOnce → GenTraversableOnce

49. #### def diff [B >: A] (that: Seq[B]): Stack[A]

    Definition Classes
      SeqLike
    Annotations
      @bridge()

50. #### def diff (that: Seq[A]): Stack[A]

    [use case] Computes the multiset difference between this stack and another sequence.

    [use case]

    Computes the multiset difference between this stack and another sequence.

    that

      the sequence of elements to remove

    returns

      a new collection of type `That` which contains all elements of this stack except some of occurrences of elements that also appear in `that`. If an element value `x` appears n times in `that`, then the first n occurrences of `x` will not form part of the result, but any following occurrences will.

    Attributes
      abstract
    Definition Classes
      SeqLike

51. #### def diff [B >: A] (that: GenSeq[B]): Stack[A]

    Computes the multiset difference between this stack and another sequence.

    Computes the multiset difference between this stack and another sequence.

    B

      the element type of the returned stack.

    that

      the sequence of elements to remove

    returns

      a new collection of type `That` which contains all elements of this stack except some of occurrences of elements that also appear in `that`. If an element value `x` appears n times in `that`, then the first n occurrences of `x` will not form part of the result, but any following occurrences will.

    Definition Classes
      SeqLike → GenSeqLike

52. #### def distinct : Stack[A]

    Builds a new stack from this stack without any duplicate elements.

    Builds a new stack from this stack without any duplicate elements.

    returns

      A new stack which contains the first occurrence of every element of this stack.

    Definition Classes
      SeqLike → GenSeqLike

53. #### def drop (n: Int): Stack[A]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

      the number of elements to drop from this stack.

    returns

      a stack consisting of all elements of this stack except the first `n` ones, or else the empty stack, if this stack has less than `n` elements.

    Definition Classes
      IterableLike → TraversableLike → GenTraversableLike

54. #### def dropRight (n: Int): Stack[A]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

      The number of elements to take

    returns

      a stack consisting of all elements of this stack except the last `n` ones, or else the empty stack, if this stack has less than `n` elements.

    Definition Classes
      IterableLike

55. #### def dropWhile (p: (A) ⇒ Boolean): Stack[A]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    p

      The predicate used to test elements.

    returns

      the longest suffix of this stack whose first element does not satisfy the predicate `p`.

    Definition Classes
      TraversableLike → GenTraversableLike

56. #### var elems : List[A]

    Definition Classes
      Stack

57. #### def endsWith [B] (that: Seq[B]): Boolean

    Definition Classes
      SeqLike
    Annotations
      @bridge()

58. #### def endsWith [B] (that: GenSeq[B]): Boolean

    Tests whether this stack ends with the given sequence.

    Tests whether this stack ends with the given sequence.

    that

      the sequence to test

    returns

      `true` if this stack has `that` as a suffix, `false` otherwise.

    Definition Classes
      SeqLike → GenSeqLike

59. #### def eq (arg0: AnyRef): Boolean

    Tests whether the argument (`arg0`) is a reference to the receiver object (`this`).

    Tests whether the argument (`arg0`) is a reference to the receiver object (`this`).

    The `eq` method implements an equivalence relation on non-null instances of `AnyRef`, and has three additional properties:

    - It is consistent: for any non-null instances `x` and `y` of type `AnyRef`, multiple invocations of `x.eq(y)` consistently returns `true` or consistently returns `false`.
    - For any non-null instance `x` of type `AnyRef`, `x.eq(null)` and `null.eq(x)` returns `false`.
    - `null.eq(null)` returns `true`.

    When overriding the `equals` or `hashCode` methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (`o1 eq o2`), they should be equal to each other (`o1 == o2`) and they should hash to the same value (`o1.hashCode == o2.hashCode`).

    returns

      `true` if the argument is a reference to the receiver object; `false` otherwise.

    Attributes
      final
    Definition Classes
      AnyRef

60. #### def equals (that: Any): Boolean

    The equality method for reference types.

    The equality method for reference types. See equals in Any.

    that

      the object to compare against this object for equality.

    returns

      `true` if the receiver object is equivalent to the argument; `false` otherwise.

    Definition Classes
      Proxy → AnyRef → Any

61. #### def exists (p: (A) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some of the elements of this stack.

    Tests whether a predicate holds for some of the elements of this stack.

    p

      the predicate used to test elements.

    returns

      `true` if the given predicate `p` holds for some of the elements of this stack, otherwise `false`.

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

62. #### def filter (p: (A) ⇒ Boolean): Stack[A]

    Selects all elements of this stack which satisfy a predicate.

    Selects all elements of this stack which satisfy a predicate.

    p

      the predicate used to test elements.

    returns

      a new stack consisting of all elements of this stack that satisfy the given predicate `p`. The order of the elements is preserved.

    Definition Classes
      TraversableLike → GenTraversableLike

63. #### def filterNot (p: (A) ⇒ Boolean): Stack[A]

    Selects all elements of this stack which do not satisfy a predicate.

    Selects all elements of this stack which do not satisfy a predicate.

    p

      the predicate used to test elements.

    returns

      a new stack consisting of all elements of this stack that do not satisfy the given predicate `p`. The order of the elements is preserved.

    Definition Classes
      TraversableLike → GenTraversableLike

64. #### def finalize (): Unit

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

    The details of when and if the `finalize` method is invoked, as well as the interaction between `finalize` and non-local returns and exceptions, are all platform dependent.

    Attributes
      protected[lang]
    Definition Classes
      AnyRef
    Annotations
      @throws()

65. #### def find (p: (A) ⇒ Boolean): Option[A]

    Finds the first element of the stack satisfying a predicate, if any.

    Finds the first element of the stack satisfying a predicate, if any.

    p

      the predicate used to test elements.

    returns

      an option value containing the first element in the stack that satisfies `p`, or `None` if none exists.

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

66. #### def flatMap [B] (f: (A) ⇒ GenTraversableOnce[B]): Stack[B]

    [use case] Builds a new collection by applying a function to all elements of this stack and concatenating the results.

    [use case]

    Builds a new collection by applying a function to all elements of this stack and concatenating the results.

    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

      a new collection of type `That` resulting from applying the given collection-valued function `f` to each element of this stack and concatenating the results.

    Attributes
      abstract
    Definition Classes
      GenTraversableLike

67. #### def flatMap [B, That] (f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Stack[A], B, That]): That

    Builds a new collection by applying a function to all elements of this stack and concatenating the results.

    Builds a new collection by applying a function to all elements of this stack and concatenating the results.

    B

      the element type of the returned collection.

    That

      the class of the returned collection. Where possible, `That` is the same class as the current collection class `Repr`, but this depends on the element type `B` being admissible for that class, which means that an implicit instance of type `CanBuildFrom[Repr, B, That]` is found.

    f

      the function to apply to each element.

    bf

      an implicit value of class `CanBuildFrom` which determines the result class `That` from the current representation type `Repr` and the new element type `B`.

    returns

      a new collection of type `That` resulting from applying the given collection-valued function `f` to each element of this stack and concatenating the results.

    Definition Classes
      TraversableLike → GenTraversableLike → FilterMonadic

68. #### def flatten [B] : Stack[B]

    [use case] Converts this stack of traversable collections into a stack in which all element collections are concatenated.

    [use case]

    Converts this stack of traversable collections into a stack in which all element collections are concatenated.

    B

      the type of the elements of each traversable collection.

    returns

      a new stack resulting from concatenating all element stacks.

    Attributes
      abstract
    Definition Classes
      GenericTraversableTemplate

69. #### def flatten [B] (implicit asTraversable: (A) ⇒ TraversableOnce[B]): Traversable[B]

    Converts this stack of traversable collections into a stack in which all element collections are concatenated.

    Converts this stack of traversable collections into a stack in which all element collections are concatenated.

    B

      the type of the elements of each traversable collection.

    asTraversable

      an implicit conversion which asserts that the element type of this stack is a `Traversable`.

    returns

      a new stack resulting from concatenating all element stacks.

    Definition Classes
      Traversable → GenericTraversableTemplate
    Annotations
      @bridge()

70. #### def fold [A1 >: A] (z: A1)(op: (A1, A1) ⇒ A1): A1

    Folds the elements of this sequence using the specified associative binary operator.

    Folds the elements of this sequence using the specified associative binary operator. The order in which the elements are reduced is unspecified and may be nondeterministic.

    Note this method has a different signature than the `foldLeft` and `foldRight` methods of the trait `Traversable`. The result of folding may only be a supertype of this parallel collection's type parameter `T`.

    z

      a neutral element for the fold operation, it may be added to the result an arbitrary number of times, not changing the result (e.g. `Nil` for list concatenation, 0 for addition, or 1 for multiplication)

    op

      a binary operator that must be associative

    returns

      the result of applying fold operator `op` between all the elements and `z`

    Definition Classes
      TraversableOnce → GenTraversableOnce

71. #### def foldLeft [B] (z: B)(op: (B, A) ⇒ B): B

    Applies a binary operator to a start value and all elements of this stack, going left to right.

    Applies a binary operator to a start value and all elements of this stack, going left to right.

    B

      the result type of the binary operator.

    z

      the start value.

    op

      the binary operator.

    returns

      the result of inserting `op` between consecutive elements of this stack, going left to right with the start value `z` on the left:

                      op(...op(z, x,,1,,), x,,2,,, ..., x,,n,,)

      where `x,,1,,, ..., x,,n,,` are the elements of this stack.

    Definition Classes
      TraversableOnce → GenTraversableOnce

72. #### def foldRight [B] (z: B)(op: (A, B) ⇒ B): B

    Applies a binary operator to all elements of this stack and a start value, going right to left.

    Applies a binary operator to all elements of this stack and a start value, going right to left.

    B

      the result type of the binary operator.

    z

      the start value.

    op

      the binary operator.

    returns

      the result of inserting `op` between consecutive elements of this stack, going right to left with the start value `z` on the right:

                      op(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))

      where `x,,1,,, ..., x,,n,,` are the elements of this stack.

    Definition Classes
      IterableLike → TraversableOnce → GenTraversableOnce

73. #### def forall (p: (A) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this stack.

    Tests whether a predicate holds for all elements of this stack.

    p

      the predicate used to test elements.

    returns

      `true` if the given predicate `p` holds for all elements of this stack, otherwise `false`.

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

74. #### def foreach (f: (A) ⇒ Unit): Unit

    [use case] Applies a function `f` to all elements of this stack.

    [use case]

    Applies a function `f` to all elements of this stack.

    f

      the function that is applied for its side-effect to every element. The result of function `f` is discarded.

    Attributes
      abstract
    Definition Classes
      IterableLike

75. #### def foreach [U] (f: (A) ⇒ U): Unit

    Applies a function `f` to all elements of this stack.

    Applies a function `f` to all elements of this stack.

    Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

    U

      the type parameter describing the result of function `f`. This result will always be ignored. Typically `U` is `Unit`, but this is not necessary.

    f

      the function that is applied for its side-effect to every element. The result of function `f` is discarded.

    Definition Classes
      Stack → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
    Annotations
      @migration
    Migration

      "Stack iterator and foreach now traverse in FIFO order."

76. #### def genericBuilder [B] : Builder[B, Stack[B]]

    The generic builder that builds instances of Stack at arbitrary element types.

    The generic builder that builds instances of Stack at arbitrary element types.

    Definition Classes
      GenericTraversableTemplate

77. #### def getClass (): java.lang.Class[_]

    A representation that corresponds to the dynamic class of the receiver object.

    A representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

      a representation that corresponds to the dynamic class of the receiver object.

    Attributes
      final
    Definition Classes
      AnyRef → Any

78. #### def groupBy [K] (f: (A) ⇒ K): Map[K, Stack[A]]

    Partitions this stack into a map of stacks according to some discriminator function.

    Partitions this stack into a map of stacks according to some discriminator function.

    Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new stack.

    K

      the type of keys returned by the discriminator function.

    f

      the discriminator function.

    returns

      A map from keys to stacks such that the following invariant holds:

                          (xs partition f)(k) = xs filter (x => f(x) == k)

      That is, every key `k` is bound to a stack of those elements `x` for which `f(x)` equals `k`.

    Definition Classes
      TraversableLike → GenTraversableLike

79. #### def grouped (size: Int): Iterator[Stack[A]]

    Partitions elements in fixed size stacks.

    Partitions elements in fixed size stacks.

    size

      the number of elements per group

    returns

      An iterator producing stacks of size `size`, except the last will be truncated if the elements don't divide evenly.

    Definition Classes
      IterableLike
    See also

      Iterator#grouped

80. #### def hasDefiniteSize : Boolean

    Tests whether this stack is known to have a finite size.

    Tests whether this stack is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as `Stream`, the predicate returns `true` if all elements have been computed. It returns `false` if the stream is not yet evaluated to the end.

    Note: many collection methods will not work on collections of infinite sizes.

    returns

      `true` if this collection is known to have finite size, `false` otherwise.

    Definition Classes
      TraversableLike → TraversableOnce → GenTraversableOnce

81. #### def hashCode (): Int

    The hashCode method for reference types.

    The hashCode method for reference types. See hashCode in Any.

    returns

      the hash code value for this object.

    Definition Classes
      Proxy → AnyRef → Any

82. #### def head : A

    Selects the first element of this stack.

    Selects the first element of this stack.

    returns

      the first element of this stack.

    Definition Classes
      IterableLike → GenIterableLike → TraversableLike → GenTraversableLike

83. #### def headOption : Option[A]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

      the first element of this stack if it is nonempty, `None` if it is empty.

    Definition Classes
      TraversableLike

84. #### def indexOf (elem: A, from: Int): Int

    [use case] Finds index of first occurrence of some value in this stack after or at some start index.

    [use case]

    Finds index of first occurrence of some value in this stack after or at some start index.

    elem

      the element value to search for.

    from

      the start index

    returns

      the index `>= from` of the first element of this stack that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

    Attributes
      abstract
    Definition Classes
      GenSeqLike

85. #### def indexOf [B >: A] (elem: B, from: Int): Int

    Finds index of first occurrence of some value in this stack after or at some start index.

    Finds index of first occurrence of some value in this stack after or at some start index.

    B

      the type of the element `elem`.

    elem

      the element value to search for.

    from

      the start index

    returns

      the index `>= from` of the first element of this stack that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

86. #### def indexOf (elem: A): Int

    [use case] Finds index of first occurrence of some value in this stack.

    [use case]

    Finds index of first occurrence of some value in this stack.

    elem

      the element value to search for.

    returns

      the index of the first element of this stack that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

    Attributes
      abstract
    Definition Classes
      GenSeqLike

87. #### def indexOf [B >: A] (elem: B): Int

    Finds index of first occurrence of some value in this stack.

    Finds index of first occurrence of some value in this stack.

    B

      the type of the element `elem`.

    elem

      the element value to search for.

    returns

      the index of the first element of this stack that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

88. #### def indexOfSlice [B >: A] (that: Seq[B], from: Int): Int

    Definition Classes
      SeqLike
    Annotations
      @bridge()

89. #### def indexOfSlice [B >: A] (that: GenSeq[B], from: Int): Int

    Finds first index after or at a start index where this stack contains a given sequence as a slice.

    Finds first index after or at a start index where this stack contains a given sequence as a slice.

    that

      the sequence to test

    from

      the start index

    returns

      the first index `>= from` such that the elements of this stack starting at this index match the elements of sequence `that`, or `-1` of no such subsequence exists.

    Definition Classes
      SeqLike

90. #### def indexOfSlice [B >: A] (that: Seq[B]): Int

    Definition Classes
      SeqLike
    Annotations
      @bridge()

91. #### def indexOfSlice [B >: A] (that: GenSeq[B]): Int

    Finds first index where this stack contains a given sequence as a slice.

    Finds first index where this stack contains a given sequence as a slice.

    that

      the sequence to test

    returns

      the first index such that the elements of this stack starting at this index match the elements of sequence `that`, or `-1` of no such subsequence exists.

    Definition Classes
      SeqLike

92. #### def indexWhere (p: (A) ⇒ Boolean, from: Int): Int

    Finds index of the first element satisfying some predicate after or at some start index.

    Finds index of the first element satisfying some predicate after or at some start index.

    p

      the predicate used to test elements.

    from

      the start index

    returns

      the index `>= from` of the first element of this stack that satisfies the predicate `p`, or `-1`, if none exists.

    Definition Classes
      SeqLike → GenSeqLike

93. #### def indexWhere (p: (A) ⇒ Boolean): Int

    Finds index of first element satisfying some predicate.

    Finds index of first element satisfying some predicate.

    p

      the predicate used to test elements.

    returns

      the index of the first element of this stack that satisfies the predicate `p`, or `-1`, if none exists.

    Definition Classes
      GenSeqLike

94. #### def indices : Range

    Produces the range of all indices of this sequence.

    Produces the range of all indices of this sequence.

    returns

      a `Range` value from `0` to one less than the length of this stack.

    Definition Classes
      SeqLike

95. #### def init : Stack[A]

    Selects all elements except the last.

    Selects all elements except the last.

    returns

      a stack consisting of all elements of this stack except the last one.

    Definition Classes
      TraversableLike

96. #### def inits : Iterator[Stack[A]]

    Iterates over the inits of this stack.

    Iterates over the inits of this stack. The first value will be this stack and the final one will be an empty stack, with the intervening values the results of successive applications of `init`.

    returns

      an iterator over all the inits of this stack

    Definition Classes
      TraversableLike
    Example:

    1. `List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)`

97. #### def intersect [B >: A] (that: Seq[B]): Stack[A]

    Definition Classes
      SeqLike
    Annotations
      @bridge()

98. #### def intersect (that: Seq[A]): Stack[A]

    [use case] Computes the multiset intersection between this stack and another sequence.

    [use case]

    Computes the multiset intersection between this stack and another sequence.

    that

      the sequence of elements to intersect with.

    returns

      a new collection of type `That` which contains all elements of this stack which also appear in `that`. If an element value `x` appears n times in `that`, then the first n occurrences of `x` will be retained in the result, but any following occurrences will be omitted.

    Attributes
      abstract
    Definition Classes
      SeqLike

99. #### def intersect [B >: A] (that: GenSeq[B]): Stack[A]

    Computes the multiset intersection between this stack and another sequence.

    Computes the multiset intersection between this stack and another sequence.

    B

      the element type of the returned stack.

    that

      the sequence of elements to intersect with.

    returns

      a new collection of type `That` which contains all elements of this stack which also appear in `that`. If an element value `x` appears n times in `that`, then the first n occurrences of `x` will be retained in the result, but any following occurrences will be omitted.

    Definition Classes
      SeqLike → GenSeqLike

100. #### def isDefinedAt (idx: Int): Boolean

     Tests whether this stack contains given index.

     Tests whether this stack contains given index.

     The implementations of methods `apply` and `isDefinedAt` turn a `Seq[A]` into a `PartialFunction[Int, A]`.

     idx

       the index to test

     returns

       `true` if this stack contains an element at position `idx`, `false` otherwise.

     Definition Classes
       GenSeqLike

101. #### def isEmpty : Boolean

     Checks if the stack is empty.

     Checks if the stack is empty.

     returns

       true, iff there is no element on the stack

     Definition Classes
       StackProxy → Stack → IterableLike → GenIterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → GenTraversableOnce

102. #### def isInstanceOf [T0] : Boolean

     Test whether the dynamic type of the receiver object is `T0`.

     Test whether the dynamic type of the receiver object is `T0`.

     Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression `1.isInstanceOf[String]` will return `false`, while the expression `List(1).isInstanceOf[List[String]]` will return `true`. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.

     returns

       `true` if the receiver object is an instance of erasure of type `T0`; `false` otherwise.

     Attributes
       final
     Definition Classes
       Any

103. #### def isTraversableAgain : Boolean

     Tests whether this stack can be repeatedly traversed.

     Tests whether this stack can be repeatedly traversed.

     returns

       `true`

     Attributes
       final
     Definition Classes
       GenTraversableLike → GenTraversableOnce

104. #### def iterator : Iterator[A]

     Returns an iterator over all elements on the stack.

     Returns an iterator over all elements on the stack. This iterator is stable with respect to state changes in the stack object; i.e. such changes will not be reflected in the iterator. The iterator issues elements in the order they were inserted into the stack (FIFO order).

     returns

       an iterator over all stack elements.

     Definition Classes
       StackProxy → Stack → IterableLike → GenIterableLike

105. #### def last : A

     Selects the last element.

     Selects the last element.

     returns

       The last element of this stack.

     Definition Classes
       TraversableLike

106. #### def lastIndexOf (elem: A, end: Int): Int

     [use case] Finds index of last occurrence of some value in this stack before or at a given end index.

     [use case]

     Finds index of last occurrence of some value in this stack before or at a given end index.

     elem

       the element value to search for.

     end

       the end index.

     returns

       the index `<= end` of the last element of this stack that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

     Attributes
       abstract
     Definition Classes
       GenSeqLike

107. #### def lastIndexOf [B >: A] (elem: B, end: Int): Int

     Finds index of last occurrence of some value in this stack before or at a given end index.

     Finds index of last occurrence of some value in this stack before or at a given end index.

     B

       the type of the element `elem`.

     elem

       the element value to search for.

     end

       the end index.

     returns

       the index `<= end` of the last element of this stack that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

     Definition Classes
       GenSeqLike

108. #### def lastIndexOf (elem: A): Int

     [use case] Finds index of last occurrence of some value in this stack.

     [use case]

     Finds index of last occurrence of some value in this stack.

     elem

       the element value to search for.

     returns

       the index of the last element of this stack that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

     Attributes
       abstract
     Definition Classes
       GenSeqLike

109. #### def lastIndexOf [B >: A] (elem: B): Int

     Finds index of last occurrence of some value in this stack.

     Finds index of last occurrence of some value in this stack.

     B

       the type of the element `elem`.

     elem

       the element value to search for.

     returns

       the index of the last element of this stack that is equal (wrt `==`) to `elem`, or `-1`, if none exists.

     Definition Classes
       GenSeqLike

110. #### def lastIndexOfSlice [B >: A] (that: Seq[B], end: Int): Int

     Definition Classes
       SeqLike
     Annotations
       @bridge()

111. #### def lastIndexOfSlice [B >: A] (that: GenSeq[B], end: Int): Int

     Finds last index before or at a given end index where this stack contains a given sequence as a slice.

     Finds last index before or at a given end index where this stack contains a given sequence as a slice.

     that

       the sequence to test

     end

       the end index

     returns

       the last index `<= end` such that the elements of this stack starting at this index match the elements of sequence `that`, or `-1` of no such subsequence exists.

     Definition Classes
       SeqLike

112. #### def lastIndexOfSlice [B >: A] (that: Seq[B]): Int

     Definition Classes
       SeqLike
     Annotations
       @bridge()

113. #### def lastIndexOfSlice [B >: A] (that: GenSeq[B]): Int

     Finds last index where this stack contains a given sequence as a slice.

     Finds last index where this stack contains a given sequence as a slice.

     that

       the sequence to test

     returns

       the last index such that the elements of this stack starting a this index match the elements of sequence `that`, or `-1` of no such subsequence exists.

     Definition Classes
       SeqLike

114. #### def lastIndexWhere (p: (A) ⇒ Boolean, end: Int): Int

     Finds index of last element satisfying some predicate before or at given end index.

     Finds index of last element satisfying some predicate before or at given end index.

     p

       the predicate used to test elements.

     returns

       the index `<= end` of the last element of this stack that satisfies the predicate `p`, or `-1`, if none exists.

     Definition Classes
       SeqLike → GenSeqLike

115. #### def lastIndexWhere (p: (A) ⇒ Boolean): Int

     Finds index of last element satisfying some predicate.

     Finds index of last element satisfying some predicate.

     p

       the predicate used to test elements.

     returns

       the index of the last element of this stack that satisfies the predicate `p`, or `-1`, if none exists.

     Definition Classes
       GenSeqLike

116. #### def lastOption : Option[A]

     Optionally selects the last element.

     Optionally selects the last element.

     returns

       the last element of this stack$ if it is nonempty, `None` if it is empty.

     Definition Classes
       TraversableLike

117. #### def length : Int

     Returns the length of this stack.

     Returns the length of this stack.

     returns

       the number of elements in this stack.

     Definition Classes
       StackProxy → Stack → SeqLike → GenSeqLike

118. #### def lengthCompare (len: Int): Int

     Compares the length of this stack to a test value.

     Compares the length of this stack to a test value.

     len

       the test value that gets compared with the length.

     returns

       A value `x` where

                  x <  0       if this.length <  len
                  x == 0       if this.length == len
                  x >  0       if this.length >  len

       The method as implemented here does not call `length` directly; its running time is `O(length min len)` instead of `O(length)`. The method should be overwritten if computing `length` is cheap.

     Definition Classes
       SeqLike

119. #### def lift : (Int) ⇒ Option[A]

     Turns this partial function into an plain function returning an `Option` result.

     Turns this partial function into an plain function returning an `Option` result.

     returns

       a function that takes an argument `x` to `Some(this(x))` if `this` is defined for `x`, and to `None` otherwise.

     Definition Classes
       PartialFunction
     See also

       Function.unlift

120. #### def map [B] (f: (A) ⇒ B): Stack[B]

     [use case] Builds a new collection by applying a function to all elements of this stack.

     [use case]

     Builds a new collection by applying a function to all elements of this stack.

     B

       the element type of the returned collection.

     f

       the function to apply to each element.

     returns

       a new collection of type `That` resulting from applying the given function `f` to each element of this stack and collecting the results.

     Attributes
       abstract
     Definition Classes
       GenTraversableLike

121. #### def map [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[Stack[A], B, That]): That

     Builds a new collection by applying a function to all elements of this stack.

     Builds a new collection by applying a function to all elements of this stack.

     B

       the element type of the returned collection.

     That

       the class of the returned collection. Where possible, `That` is the same class as the current collection class `Repr`, but this depends on the element type `B` being admissible for that class, which means that an implicit instance of type `CanBuildFrom[Repr, B, That]` is found.

     f

       the function to apply to each element.

     bf

       an implicit value of class `CanBuildFrom` which determines the result class `That` from the current representation type `Repr` and the new element type `B`.

     returns

       a new collection of type `That` resulting from applying the given function `f` to each element of this stack and collecting the results.

     Definition Classes
       TraversableLike → GenTraversableLike → FilterMonadic

122. #### def max : A

     [use case] Finds the largest element.

     [use case]

     Finds the largest element.

     returns

       the largest element of this stack with respect to the ordering `cmp`.

     Attributes
       abstract
     Definition Classes
       GenTraversableOnce

123. #### def max [B >: A] (implicit cmp: Ordering[B]): A

     Finds the largest element.

     Finds the largest element.

     B

       The type over which the ordering is defined.

     cmp

       An ordering to be used for comparing elements.

     returns

       the largest element of this stack with respect to the ordering `cmp`.

     Definition Classes
       TraversableOnce → GenTraversableOnce

124. #### def maxBy [B] (f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

     Definition Classes
       TraversableOnce → GenTraversableOnce

125. #### def min : A

     [use case] Finds the smallest element.

     [use case]

     Finds the smallest element.

     returns

       the smallest element of this stack with respect to the ordering `cmp`.

     Attributes
       abstract
     Definition Classes
       GenTraversableOnce

126. #### def min [B >: A] (implicit cmp: Ordering[B]): A

     Finds the smallest element.

     Finds the smallest element.

     B

       The type over which the ordering is defined.

     cmp

       An ordering to be used for comparing elements.

     returns

       the smallest element of this stack with respect to the ordering `cmp`.

     Definition Classes
       TraversableOnce → GenTraversableOnce

127. #### def minBy [B] (f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

     Definition Classes
       TraversableOnce → GenTraversableOnce

128. #### def mkString : String

     Displays all elements of this stack in a string.

     Displays all elements of this stack in a string.

     returns

       a string representation of this stack. In the resulting string the string representations (w.r.t. the method `toString`) of all elements of this stack follow each other without any separator string.

     Definition Classes
       TraversableOnce → GenTraversableOnce

129. #### def mkString (sep: String): String

     Displays all elements of this stack in a string using a separator string.

     Displays all elements of this stack in a string using a separator string.

     sep

       the separator string.

     returns

       a string representation of this stack. In the resulting string the string representations (w.r.t. the method `toString`) of all elements of this stack are separated by the string `sep`.

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Example:

     1. `List(1, 2, 3).mkString("|") = "1|2|3"`

130. #### def mkString (start: String, sep: String, end: String): String

     Displays all elements of this stack in a string using start, end, and separator strings.

     Displays all elements of this stack in a string using start, end, and separator strings.

     start

       the starting string.

     sep

       the separator string.

     end

       the ending string.

     returns

       a string representation of this stack. The resulting string begins with the string `start` and ends with the string `end`. Inside, the string representations (w.r.t. the method `toString`) of all elements of this stack are separated by the string `sep`.

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Example:

     1. `List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"`

131. #### def ne (arg0: AnyRef): Boolean

     Equivalent to `!(this eq that)`.

     Equivalent to `!(this eq that)`.

     returns

       `true` if the argument is not a reference to the receiver object; `false` otherwise.

     Attributes
       final
     Definition Classes
       AnyRef

132. #### def newBuilder : Builder[A, Stack[A]]

     The builder that builds instances of type Stack[A]

     The builder that builds instances of type Stack[A]

     Attributes
       protected[this]
     Definition Classes
       GenericTraversableTemplate → HasNewBuilder

133. #### def nonEmpty : Boolean

     Tests whether the stack is not empty.

     Tests whether the stack is not empty.

     returns

       `true` if the stack contains at least one element, `false` otherwise.

     Definition Classes
       TraversableOnce → GenTraversableOnce

134. #### def notify (): Unit

     Wakes up a single thread that is waiting on the receiver object's monitor.

     Wakes up a single thread that is waiting on the receiver object's monitor.

     Attributes
       final
     Definition Classes
       AnyRef

135. #### def notifyAll (): Unit

     Wakes up all threads that are waiting on the receiver object's monitor.

     Wakes up all threads that are waiting on the receiver object's monitor.

     Attributes
       final
     Definition Classes
       AnyRef

136. #### def orElse [A1 <: Int, B1 >: A] (that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

     Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.

     Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.

     A1

       the argument type of the fallback function

     B1

       the result type of the fallback function

     that

       the fallback function

     returns

       a partial function which has as domain the union of the domains of this partial function and `that`. The resulting partial function takes `x` to `this(x)` where `this` is defined, and to `that(x)` where it is not.

     Definition Classes
       PartialFunction

137. #### def padTo (len: Int, elem: A): Stack[A]

     [use case] Appends an element value to this stack until a given target length is reached.

     [use case]

     Appends an element value to this stack until a given target length is reached.

     len

       the target length

     elem

       the padding value

     returns

       a new collection of type `That` consisting of all elements of this stack followed by the minimal number of occurrences of `elem` so that the resulting collection has a length of at least `len`.

     Attributes
       abstract
     Definition Classes
       GenSeqLike

138. #### def padTo [B >: A, That] (len: Int, elem: B)(implicit bf: CanBuildFrom[Stack[A], B, That]): That

     Appends an element value to this stack until a given target length is reached.

     Appends an element value to this stack until a given target length is reached.

     B

       the element type of the returned stack.

     That

       the class of the returned collection. Where possible, `That` is the same class as the current collection class `Repr`, but this depends on the element type `B` being admissible for that class, which means that an implicit instance of type `CanBuildFrom[Repr, B, That]` is found.

     len

       the target length

     elem

       the padding value

     bf

       an implicit value of class `CanBuildFrom` which determines the result class `That` from the current representation type `Repr` and the new element type `B`.

     returns

       a new collection of type `That` consisting of all elements of this stack followed by the minimal number of occurrences of `elem` so that the resulting collection has a length of at least `len`.

     Definition Classes
       SeqLike → GenSeqLike

139. #### def par : ParSeq[A]

     Returns a parallel implementation of this collection.

     Returns a parallel implementation of this collection.

     For most collection types, this method creates a new parallel collection by copying all the elements. For these collection, `par` takes linear time. Mutable collections in this category do not produce a mutable parallel collection that has the same underlying dataset, so changes in one collection will not be reflected in the other one.

     Specific collections (e.g. `ParArray` or `mutable.ParHashMap`) override this default behaviour by creating a parallel collection which shares the same underlying dataset. For these collections, `par` takes constant or sublinear time.

     All parallel collections return a reference to themselves.

     returns

       a parallel implementation of this collection

     Definition Classes
       Parallelizable

140. #### def parCombiner : Combiner[A, ParSeq[A]]

     The default `par` implementation uses the combiner provided by this method to create a new parallel collection.

     The default `par` implementation uses the combiner provided by this method to create a new parallel collection.

     returns

       a combiner for the parallel collection of type `ParRepr`

     Attributes
       protected[this]
     Definition Classes
       SeqLike → SeqLike → TraversableLike → Parallelizable

141. #### def partition (p: (A) ⇒ Boolean): (Stack[A], Stack[A])

     Partitions this stack in two stacks according to a predicate.

     Partitions this stack in two stacks according to a predicate.

     p

       the predicate on which to partition.

     returns

       a pair of stacks: the first stack consists of all elements that satisfy the predicate `p` and the second stack consists of all elements that don't. The relative order of the elements in the resulting stacks is the same as in the original stack.

     Definition Classes
       TraversableLike → GenTraversableLike

142. #### def patch [B >: A, That] (from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[Stack[A], B, That]): That

     Definition Classes
       SeqLike
     Annotations
       @bridge()

143. #### def patch (from: Int, that: GenSeq[A], replaced: Int): Stack[A]

     [use case] Produces a new stack where a slice of elements in this stack is replaced by another sequence.

     [use case]

     Produces a new stack where a slice of elements in this stack is replaced by another sequence.

     from

       the index of the first replaced element

     replaced

       the number of elements to drop in the original stack

     returns

       a new stack consisting of all elements of this stack except that `replaced` elements starting from `from` are replaced by `patch`.

     Attributes
       abstract
     Definition Classes
       GenSeqLike

144. #### def patch [B >: A, That] (from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[Stack[A], B, That]): That

     Produces a new stack where a slice of elements in this stack is replaced by another sequence.

     Produces a new stack where a slice of elements in this stack is replaced by another sequence.

     B

       the element type of the returned stack.

     That

       the class of the returned collection. Where possible, `That` is the same class as the current collection class `Repr`, but this depends on the element type `B` being admissible for that class, which means that an implicit instance of type `CanBuildFrom[Repr, B, That]` is found.

     from

       the index of the first replaced element

     patch

       the replacement sequence

     replaced

       the number of elements to drop in the original stack

     bf

       an implicit value of class `CanBuildFrom` which determines the result class `That` from the current representation type `Repr` and the new element type `B`.

     returns

       a new stack consisting of all elements of this stack except that `replaced` elements starting from `from` are replaced by `patch`.

     Definition Classes
       SeqLike → GenSeqLike

145. #### def permutations : Iterator[Stack[A]]

     Iterates over distinct permutations.

     Iterates over distinct permutations.

     returns

       An Iterator which traverses the distinct permutations of this stack.

     Definition Classes
       SeqLike
     Example:

     1. `"abb".permutations = Iterator(abb, bab, bba)`

146. #### def pop (): A

     Removes the top element from the stack.

     Removes the top element from the stack.

     returns

       the top element

     Definition Classes
       StackProxy → Stack

147. #### def prefixLength (p: (A) ⇒ Boolean): Int

     Returns the length of the longest prefix whose elements all satisfy some predicate.

     Returns the length of the longest prefix whose elements all satisfy some predicate.

     p

       the predicate used to test elements.

     returns

       the length of the longest prefix of this stack such that every element of the segment satisfies the predicate `p`.

     Definition Classes
       GenSeqLike

148. #### def product : A

     [use case] Multiplies up the elements of this collection.

     [use case]

     Multiplies up the elements of this collection.

     returns

       the product of all elements of this stack with respect to the `*` operator in `num`.

     Attributes
       abstract
     Definition Classes
       GenTraversableOnce

149. #### def product [B >: A] (implicit num: Numeric[B]): B

     Multiplies up the elements of this collection.

     Multiplies up the elements of this collection.

     B

       the result type of the `*` operator.

     num

       an implicit parameter defining a set of numeric operations which includes the `*` operator to be used in forming the product.

     returns

       the product of all elements of this stack with respect to the `*` operator in `num`.

     Definition Classes
       TraversableOnce → GenTraversableOnce

150. #### def push (elem1: A, elem2: A, elems: A*): StackProxy.this.type

     Push two or more elements onto the stack.

     Push two or more elements onto the stack. The last element of the sequence will be on top of the new stack.

     elems

       the element sequence.

     returns

       the stack with the new elements on top.

     Definition Classes
       StackProxy → Stack

151. #### def push (elem: A): StackProxy.this.type

     Push an element on the stack.

     Push an element on the stack.

     elem

       the element to push on the stack.

     returns

       the stack with the new element on top.

     Definition Classes
       Stack

152. #### def pushAll (xs: TraversableOnce[A]): StackProxy.this.type

     Push all elements in the given traversable object onto the stack.

     Push all elements in the given traversable object onto the stack. The last element in the traversable object will be on top of the new stack.

     xs

       the traversable object.

     returns

       the stack with the new elements on top.

     Definition Classes
       StackProxy → Stack

153. #### def reduce [A1 >: A] (op: (A1, A1) ⇒ A1): A1

     Reduces the elements of this sequence using the specified associative binary operator.

     Reduces the elements of this sequence using the specified associative binary operator.

     The order in which operations are performed on elements is unspecified and may be nondeterministic.

     Note this method has a different signature than the `reduceLeft` and `reduceRight` methods of the trait `Traversable`. The result of reducing may only be a supertype of this parallel collection's type parameter `T`.

     op

       A binary operator that must be associative.

     returns

       The result of applying reduce operator `op` between all the elements if the collection is nonempty.

     Definition Classes
       TraversableOnce → GenTraversableOnce

154. #### def reduceLeft [B >: A] (op: (B, A) ⇒ B): B

     Definition Classes
       TraversableOnce

155. #### def reduceLeftOption [B >: A] (op: (B, A) ⇒ B): Option[B]

     Optionally applies a binary operator to all elements of this stack, going left to right.

     Optionally applies a binary operator to all elements of this stack, going left to right.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

       an option value containing the result of `reduceLeft(op)` is this stack is nonempty, `None` otherwise.

     Definition Classes
       TraversableOnce → GenTraversableOnce

156. #### def reduceOption [A1 >: A] (op: (A1, A1) ⇒ A1): Option[A1]

     Optionally reduces the elements of this sequence using the specified associative binary operator.

     Optionally reduces the elements of this sequence using the specified associative binary operator.

     The order in which operations are performed on elements is unspecified and may be nondeterministic.

     Note this method has a different signature than the `reduceLeftOption` and `reduceRightOption` methods of the trait `Traversable`. The result of reducing may only be a supertype of this parallel collection's type parameter `T`.

     op

       A binary operator that must be associative.

     returns

       An option value containing result of applying reduce operator `op` between all the elements if the collection is nonempty, and `None` otherwise.

     Definition Classes
       TraversableOnce → GenTraversableOnce

157. #### def reduceRight [B >: A] (op: (A, B) ⇒ B): B

     Applies a binary operator to all elements of this stack, going right to left.

     Applies a binary operator to all elements of this stack, going right to left.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

       the result of inserting `op` between consecutive elements of this stack, going right to left:

                       op(x,,1,,, op(x,,2,,, ..., op(x,,n-1,,, x,,n,,)...))

       where `x,,1,,, ..., x,,n,,` are the elements of this stack.

     Definition Classes
       IterableLike → TraversableOnce → GenTraversableOnce

158. #### def reduceRightOption [B >: A] (op: (A, B) ⇒ B): Option[B]

     Optionally applies a binary operator to all elements of this stack, going right to left.

     Optionally applies a binary operator to all elements of this stack, going right to left.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

       an option value containing the result of `reduceRight(op)` is this stack is nonempty, `None` otherwise.

     Definition Classes
       TraversableOnce → GenTraversableOnce

159. #### def repr : Stack[A]

     The collection of type stack underlying this `TraversableLike` object.

     The collection of type stack underlying this `TraversableLike` object. By default this is implemented as the `TraversableLike` object itself, but this can be overridden.

     Definition Classes
       TraversableLike → GenTraversableLike

160. #### def reverse : Stack[A]

     Returns new stack wih elements in reversed order.

     Returns new stack wih elements in reversed order.

     returns

       A new stack with all elements of this stack in reversed order.

     Definition Classes
       SeqLike → GenSeqLike

161. #### def reverseIterator : Iterator[A]

     An iterator yielding elements in reversed order.

     An iterator yielding elements in reversed order.

     Note: `xs.reverseIterator` is the same as `xs.reverse.iterator` but might be more efficient.

     returns

       an iterator yielding the elements of this stack in reversed order

     Definition Classes
       SeqLike

162. #### def reverseMap [B] (f: (A) ⇒ B): Stack[B]

     [use case] Builds a new collection by applying a function to all elements of this stack and collecting the results in reversed order.

     [use case]

     Builds a new collection by applying a function to all elements of this stack and collecting the results in reversed order.

     B

       the element type of the returned collection.

     f

       the function to apply to each element.

     returns

       a new collection of type `That` resulting from applying the given function `f` to each element of this stack and collecting the results in reversed order.

       Note: `xs.reverseMap(f)` is the same as `xs.reverse.map(f)` but might be more efficient.

     Attributes
       abstract
     Definition Classes
       GenSeqLike

163. #### def reverseMap [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[Stack[A], B, That]): That

     Builds a new collection by applying a function to all elements of this stack and collecting the results in reversed order.

     Builds a new collection by applying a function to all elements of this stack and collecting the results in reversed order.

     Note: `xs.reverseMap(f)` is the same as `xs.reverse.map(f)` but might be more efficient.

     B

       the element type of the returned collection.

     That

       the class of the returned collection. Where possible, `That` is the same class as the current collection class `Repr`, but this depends on the element type `B` being admissible for that class, which means that an implicit instance of type `CanBuildFrom[Repr, B, That]` is found.

     f

       the function to apply to each element.

     bf

       an implicit value of class `CanBuildFrom` which determines the result class `That` from the current representation type `Repr` and the new element type `B`.

     returns

       a new collection of type `That` resulting from applying the given function `f` to each element of this stack and collecting the results in reversed order.

     Definition Classes
       SeqLike → GenSeqLike

164. #### def reversed : List[A]

     Attributes
       protected[this]
     Definition Classes
       TraversableOnce

165. #### def sameElements [B >: A] (that: Iterable[B]): Boolean

     Definition Classes
       IterableLike
     Annotations
       @bridge()

166. #### def sameElements (that: GenIterable[A]): Boolean

     [use case] Checks if the other iterable collection contains the same elements in the same order as this stack.

     [use case]

     Checks if the other iterable collection contains the same elements in the same order as this stack.

     that

       the collection to compare with.

     returns

       `true`, if both collections contain the same elements in the same order, `false` otherwise.

     Attributes
       abstract
     Definition Classes
       GenIterableLike

167. #### def sameElements [B >: A] (that: GenIterable[B]): Boolean

     Checks if the other iterable collection contains the same elements in the same order as this stack.

     Checks if the other iterable collection contains the same elements in the same order as this stack.

     B

       the type of the elements of collection `that`.

     that

       the collection to compare with.

     returns

       `true`, if both collections contain the same elements in the same order, `false` otherwise.

     Definition Classes
       IterableLike → GenIterableLike

168. #### def scan [B >: A, That] (z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Stack[A], B, That]): That

     Computes a prefix scan of the elements of the collection.

     Computes a prefix scan of the elements of the collection.

     Note: The neutral element `z` may be applied more than once.

     B

       element type of the resulting collection

     That

       type of the resulting collection

     z

       neutral element for the operator `op`

     op

       the associative operator for the scan

     cbf

       combiner factory which provides a combiner

     returns

       a new stack containing the prefix scan of the elements in this stack

     Definition Classes
       TraversableLike → GenTraversableLike

169. #### def scanLeft [B, That] (z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Stack[A], B, That]): That

     Produces a collection containing cummulative results of applying the operator going left to right.

     Produces a collection containing cummulative results of applying the operator going left to right.

     B

       the type of the elements in the resulting collection

     That

       the actual type of the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     bf

       an implicit value of class `CanBuildFrom` which determines the result class `That` from the current representation type `Repr` and the new element type `B`.

     returns

       collection with intermediate results

     Definition Classes
       TraversableLike → GenTraversableLike

170. #### def scanRight [B, That] (z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Stack[A], B, That]): That

     Produces a collection containing cummulative results of applying the operator going right to left.

     Produces a collection containing cummulative results of applying the operator going right to left. The head of the collection is the last cummulative result.

     Example:

            List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)

     B

       the type of the elements in the resulting collection

     That

       the actual type of the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     bf

       an implicit value of class `CanBuildFrom` which determines the result class `That` from the current representation type `Repr` and the new element type `B`.

     returns

       collection with intermediate results

     Definition Classes
       TraversableLike → GenTraversableLike
     Annotations
       @migration
     Migration

       "This scanRight definition has changed in 2.9.\n" + "The previous behavior can be reproduced with scanRight.reverse."

171. #### def segmentLength (p: (A) ⇒ Boolean, from: Int): Int

     Computes length of longest segment whose elements all satisfy some predicate.

     Computes length of longest segment whose elements all satisfy some predicate.

     p

       the predicate used to test elements.

     from

       the index where the search starts.

     returns

       the length of the longest segment of this stack starting from index `from` such that every element of the segment satisfies the predicate `p`.

     Definition Classes
       SeqLike → GenSeqLike

172. #### def seq : Seq[A]

     A version of this collection with all of the operations implemented sequentially (i.

     A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).

     This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.

     returns

       a sequential view of the collection.

     Definition Classes
       Seq → Seq → GenSeq → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

173. #### def size : Int

     The size of this stack, equivalent to `length`.

     The size of this stack, equivalent to `length`.

     returns

       the number of elements in this stack.

     Definition Classes
       SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce

174. #### def slice (from: Int, until: Int): Stack[A]

     Selects an interval of elements.

     Selects an interval of elements. The returned collection is made up of all elements `x` which satisfy the invariant:

            from <= indexOf(x) < until

     from

       the lowest index to include from this stack.

     until

       the highest index to EXCLUDE from this stack.

     returns

       a stack containing the elements greater than or equal to index `from` extending up to (but not including) index `until` of this stack.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableLike

175. #### def sliding [B >: A] (size: Int, step: Int): Iterator[Stack[A]]

     Definition Classes
       IterableLike

176. #### def sliding [B >: A] (size: Int): Iterator[Stack[A]]

     Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.

     Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

     size

       the number of elements per group

     returns

       An iterator producing stacks of size `size`, except the last and the only element will be truncated if there are fewer elements than size.

     Definition Classes
       IterableLike
     See also

       Iterator#sliding

177. #### def sortBy [B] (f: (A) ⇒ B)(implicit ord: Ordering[B]): Stack[A]

     Sorts this Stack according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.

     Sorts this Stack according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.

     B

       the target type of the transformation `f`, and the type where the ordering `ord` is defined.

     f

       the transformation function mapping elements to some other domain `B`.

     ord

       the ordering assumed on domain `B`.

     returns

       a stack consisting of the elements of this stack sorted according to the ordering where `x < y` if `ord.lt(f(x), f(y))`.

     Definition Classes
       SeqLike
     Example:

     1.        val words = "The quick brown fox jumped over the lazy dog".split(' ')
               // this works because scala.Ordering will implicitly provide an Ordering[Tuple2[Int, Char]]
               words.sortBy(x => (x.length, x.head))
               res0: Array[String] = Array(The, dog, fox, the, lazy, over, brown, quick, jumped)

     See also

       scala.math.Ordering

178. #### def sortWith (lt: (A, A) ⇒ Boolean): Stack[A]

     Sorts this stack according to a comparison function.

     Sorts this stack according to a comparison function.

     The sort is stable. That is, elements that are equal wrt `lt` appear in the same order in the sorted sequence as in the original.

     lt

       the comparison function which tests whether its first argument precedes its second argument in the desired ordering.

     returns

       a stack consisting of the elements of this stack sorted according to the comparison function `lt`.

     Definition Classes
       SeqLike
     Example:

     1.        List("Steve", "Tom", "John", "Bob").sortWith(_.compareTo(_) < 0) =
               List("Bob", "John", "Steve", "Tom")

179. #### def sorted [B >: A] (implicit ord: Ordering[B]): Stack[A]

     Sorts this stack according to an Ordering.

     Sorts this stack according to an Ordering.

     The sort is stable. That is, elements that are equal wrt `lt` appear in the same order in the sorted sequence as in the original.

     ord

       the ordering to be used to compare elements.

     returns

       a stack consisting of the elements of this stack sorted according to the ordering `ord`.

     Definition Classes
       SeqLike
     See also

       scala.math.Ordering

180. #### def span (p: (A) ⇒ Boolean): (Stack[A], Stack[A])

     Splits this stack into a prefix/suffix pair according to a predicate.

     Splits this stack into a prefix/suffix pair according to a predicate.

     Note: `c span p` is equivalent to (but possibly more efficient than) `(c takeWhile p, c dropWhile p)`, provided the evaluation of the predicate `p` does not cause any side-effects.

     p

       the test predicate

     returns

       a pair consisting of the longest prefix of this stack whose elements all satisfy `p`, and the rest of this stack.

     Definition Classes
       TraversableLike → GenTraversableLike

181. #### def splitAt (n: Int): (Stack[A], Stack[A])

     Splits this stack into two at a given position.

     Splits this stack into two at a given position. Note: `c splitAt n` is equivalent to (but possibly more efficient than) `(c take n, c drop n)`.

     n

       the position at which to split.

     returns

       a pair of stacks consisting of the first `n` elements of this stack, and the other elements.

     Definition Classes
       TraversableLike → GenTraversableLike

182. #### def startsWith [B] (that: Seq[B], offset: Int): Boolean

     Definition Classes
       SeqLike
     Annotations
       @bridge()

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

     Tests whether this stack contains the given sequence at a given index.

     Tests whether this stack contains the given sequence at a given index.

     If the both the receiver object, `this` and the argument, `that` are infinite sequences this method may not terminate.

     that

       the sequence to test

     offset

       the index where the sequence is searched.

     returns

       `true` if the sequence `that` is contained in this stack at index `offset`, otherwise `false`.

     Definition Classes
       SeqLike → GenSeqLike

184. #### def startsWith [B] (that: Seq[B]): Boolean

     Definition Classes
       GenSeqLike
     Annotations
       @bridge()

185. #### def startsWith [B] (that: GenSeq[B]): Boolean

     Tests whether this stack starts with the given sequence.

     Tests whether this stack starts with the given sequence.

     that

       the sequence to test

     returns

       `true` if this collection has `that` as a prefix, `false` otherwise.

     Definition Classes
       GenSeqLike

186. #### def stringPrefix : String

     Defines the prefix of this object's `toString` representation.

     Defines the prefix of this object's `toString` representation.

     returns

       a string representation which starts the result of `toString` applied to this stack. By default the string prefix is the simple name of the collection class stack.

     Definition Classes
       TraversableLike → GenTraversableLike

187. #### def sum : A

     [use case] Sums up the elements of this collection.

     [use case]

     Sums up the elements of this collection.

     returns

       the sum of all elements of this stack with respect to the `+` operator in `num`.

     Attributes
       abstract
     Definition Classes
       GenTraversableOnce

188. #### def sum [B >: A] (implicit num: Numeric[B]): B

     Sums up the elements of this collection.

     Sums up the elements of this collection.

     B

       the result type of the `+` operator.

     num

       an implicit parameter defining a set of numeric operations which includes the `+` operator to be used in forming the sum.

     returns

       the sum of all elements of this stack with respect to the `+` operator in `num`.

     Definition Classes
       TraversableOnce → GenTraversableOnce

189. #### def synchronized [T0] (arg0: ⇒ T0): T0

     Attributes
       final
     Definition Classes
       AnyRef

190. #### def tail : Stack[A]

     Selects all elements except the first.

     Selects all elements except the first.

     returns

       a stack consisting of all elements of this stack except the first one.

     Definition Classes
       TraversableLike → GenTraversableLike

191. #### def tails : Iterator[Stack[A]]

     Iterates over the tails of this stack.

     Iterates over the tails of this stack. The first value will be this stack and the final one will be an empty stack, with the intervening values the results of successive applications of `tail`.

     returns

       an iterator over all the tails of this stack

     Definition Classes
       TraversableLike
     Example:

     1. `List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)`

192. #### def take (n: Int): Stack[A]

     Selects first n elements.

     Selects first n elements.

     n

       Tt number of elements to take from this stack.

     returns

       a stack consisting only of the first `n` elements of this stack, or else the whole stack, if it has less than `n` elements.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableLike

193. #### def takeRight (n: Int): Stack[A]

     Selects last n elements.

     Selects last n elements.

     n

       the number of elements to take

     returns

       a stack consisting only of the last `n` elements of this stack, or else the whole stack, if it has less than `n` elements.

     Definition Classes
       IterableLike

194. #### def takeWhile (p: (A) ⇒ Boolean): Stack[A]

     Takes longest prefix of elements that satisfy a predicate.

     Takes longest prefix of elements that satisfy a predicate.

     p

       The predicate used to test elements.

     returns

       the longest prefix of this stack whose elements all satisfy the predicate `p`.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableLike

195. #### def thisCollection : Seq[A]

     The underlying collection seen as an instance of `Stack`.

     The underlying collection seen as an instance of `Stack`. By default this is implemented as the current collection object itself, but this can be overridden.

     Attributes
       protected[this]
     Definition Classes
       SeqLike → IterableLike → TraversableLike

196. #### def toArray : Array[A]

     [use case] Converts this stack to an array.

     [use case]

     Converts this stack to an array.

     returns

       an array containing all elements of this stack.

     Attributes
       abstract
     Definition Classes
       GenTraversableOnce

197. #### def toArray [B >: A] (implicit arg0: ClassManifest[B]): Array[B]

     Converts this stack to an array.

     Converts this stack to an array.

     B

       the type of the elements of the array. A `ClassManifest` for this type must be available.

     returns

       an array containing all elements of this stack.

     Definition Classes
       TraversableOnce → GenTraversableOnce

198. #### def toBuffer [B >: A] : Buffer[B]

     Converts this stack to a mutable buffer.

     Converts this stack to a mutable buffer.

     returns

       a buffer containing all elements of this stack.

     Definition Classes
       TraversableOnce → GenTraversableOnce

199. #### def toCollection (repr: Stack[A]): Seq[A]

     A conversion from collections of type `Repr` to `Stack` objects.

     A conversion from collections of type `Repr` to `Stack` objects. By default this is implemented as just a cast, but this can be overridden.

     Attributes
       protected[this]
     Definition Classes
       SeqLike → IterableLike → TraversableLike

200. #### def toIndexedSeq [B >: A] : IndexedSeq[B]

     Converts this stack to an indexed sequence.

     Converts this stack to an indexed sequence.

     returns

       an indexed sequence containing all elements of this stack.

     Definition Classes
       TraversableOnce → GenTraversableOnce

201. #### def toIterable : Iterable[A]

     Converts this stack to an iterable collection.

     Converts this stack to an iterable collection. Note that the choice of target `Iterable` is lazy in this default implementation as this `TraversableOnce` may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).

     returns

       an `Iterable` containing all elements of this stack.

     Definition Classes
       IterableLike → TraversableOnce → GenTraversableOnce

202. #### def toIterator : Iterator[A]

     Returns an Iterator over the elements in this stack.

     Returns an Iterator over the elements in this stack. Will return the same Iterator if this instance is already an Iterator.

     returns

       an Iterator containing all elements of this stack.

     Definition Classes
       TraversableLike → GenTraversableOnce

203. #### def toList : List[A]

     Creates a list of all stack elements in FIFO order.

     Creates a list of all stack elements in FIFO order.

     returns

       the created list.

     Definition Classes
       StackProxy → Stack → TraversableOnce → GenTraversableOnce

204. #### def toMap [T, U] : Map[T, U]

     [use case] Converts this stack to a map.

     [use case]

     Converts this stack to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

     returns

       a map containing all elements of this stack.

     Attributes
       abstract
     Definition Classes
       GenTraversableOnce

205. #### def toMap [T, U] (implicit ev: <:<[A, (T, U)]): Map[T, U]

     Converts this stack to a map.

     Converts this stack to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

     returns

       a map containing all elements of this stack.

     Definition Classes
       TraversableOnce → GenTraversableOnce

206. #### def toSeq : Seq[A]

     Converts this stack to a sequence.

     Converts this stack to a sequence.

     Overridden for efficiency.

     returns

       a sequence containing all elements of this stack.

     Definition Classes
       SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce

207. #### def toSet [B >: A] : Set[B]

     Converts this stack to a set.

     Converts this stack to a set.

     returns

       a set containing all elements of this stack.

     Definition Classes
       TraversableOnce → GenTraversableOnce

208. #### def toStream : Stream[A]

     Converts this stack to a stream.

     Converts this stack to a stream.

     returns

       a stream containing all elements of this stack.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableOnce

209. #### def toString (): String

     Creates a String representation of this object.

     Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.

     returns

       a String representation of the object.

     Definition Classes
       Proxy → AnyRef → Any

210. #### def toTraversable : Traversable[A]

     Converts this stack to an unspecified Traversable.

     Converts this stack to an unspecified Traversable. Will return the same collection if this instance is already Traversable.

     returns

       a Traversable containing all elements of this stack.

     Definition Classes
       TraversableLike → TraversableOnce → GenTraversableOnce

211. #### def top : A

     Returns the top element of the stack.

     Returns the top element of the stack. This method will not remove the element from the stack. An error is signaled if there is no element on the stack.

     returns

       the top element

     Definition Classes
       StackProxy → Stack

212. #### def transform (f: (A) ⇒ A): StackProxy.this.type

     Applies a transformation function to all values contained in this sequence.

     Applies a transformation function to all values contained in this sequence. The transformation function produces new values from existing elements.

     f

       the transformation to apply

     returns

       the sequence itself.

     Definition Classes
       SeqLike

213. #### def transpose [B] (implicit asTraversable: (A) ⇒ TraversableOnce[B]): Traversable[Traversable[B]]

     Transposes this stack of traversable collections into a stack of stacks.

     Transposes this stack of traversable collections into a stack of stacks.

     B

       the type of the elements of each traversable collection.

     asTraversable

       an implicit conversion which asserts that the element type of this stack is a `Traversable`.

     returns

       a two-dimensional stack of stacks which has as nth row the nth column of this stack.

     Definition Classes
       Traversable → GenericTraversableTemplate
     Annotations
       @bridge()

214. #### def union (that: Seq[A]): Stack[A]

     [use case] Produces a new sequence which contains all elements of this stack and also all elements of a given sequence.

     [use case]

     Produces a new sequence which contains all elements of this stack and also all elements of a given sequence. `xs union ys` is equivalent to `xs ++ ys`.

     that

       the sequence to add.

     returns

       a new collection of type `That` which contains all elements of this stack followed by all elements of `that`.

     Attributes
       abstract
     Definition Classes
       SeqLike

215. #### def union [B >: A, That] (that: GenSeq[B])(implicit bf: CanBuildFrom[Stack[A], B, That]): That

     Produces a new sequence which contains all elements of this stack and also all elements of a given sequence.

     Produces a new sequence which contains all elements of this stack and also all elements of a given sequence. `xs union ys` is equivalent to `xs ++ ys`.

     Another way to express this is that `xs union ys` computes the order-presevring multi-set union of `xs` and `ys`. `union` is hence a counter-part of `diff` and `intersect` which also work on multi-sets.

     B

       the element type of the returned stack.

     That

       the class of the returned collection. Where possible, `That` is the same class as the current collection class `Repr`, but this depends on the element type `B` being admissible for that class, which means that an implicit instance of type `CanBuildFrom[Repr, B, That]` is found.

     that

       the sequence to add.

     bf

       an implicit value of class `CanBuildFrom` which determines the result class `That` from the current representation type `Repr` and the new element type `B`.

     returns

       a new collection of type `That` which contains all elements of this stack followed by all elements of `that`.

     Definition Classes
       SeqLike → GenSeqLike

216. #### def union [B >: A, That] (that: Seq[B])(implicit bf: CanBuildFrom[Stack[A], B, That]): That

     Definition Classes
       GenSeqLike
     Annotations
       @bridge()

217. #### def unzip [A1, A2] (implicit asPair: (A) ⇒ (A1, A2)): (Stack[A1], Stack[A2])

     Converts this stack of pairs into two collections of the first and second half of each pair.

     Converts this stack of pairs into two collections of the first and second half of each pair.

     asPair

       an implicit conversion which asserts that the element type of this stack is a pair.

     returns

       a pair stacks, containing the first, respectively second half of each element pair of this stack.

     Definition Classes
       GenericTraversableTemplate

218. #### def unzip3 [A1, A2, A3] (implicit asTriple: (A) ⇒ (A1, A2, A3)): (Stack[A1], Stack[A2], Stack[A3])

     Converts this stack of triples into three collections of the first, second, and third element of each triple.

     Converts this stack of triples into three collections of the first, second, and third element of each triple.

     returns

       a triple stacks, containing the first, second, respectively third member of each element triple of this stack.

     Definition Classes
       GenericTraversableTemplate

219. #### def update (n: Int, newelem: A): Unit

     Replace element at index `n` with the new element `newelem`.

     Replace element at index `n` with the new element `newelem`.

     This is a linear time operation.

     n

       the index of the element to replace.

     newelem

       the new element.

     Definition Classes
       Stack → SeqLike

220. #### def updated (index: Int, elem: A): Stack[A]

     [use case] A copy of this stack with one single replaced element.

     [use case]

     A copy of this stack with one single replaced element.

     index

       the position of the replacement

     elem

       the replacing element

     returns

       a new stack`which is a copy of this stack with the element at position` index`replaced by` elem`.`

     Attributes
       abstract
     Definition Classes
       GenSeqLike

221. #### def updated [B >: A, That] (index: Int, elem: B)(implicit bf: CanBuildFrom[Stack[A], B, That]): That

     A copy of this stack with one single replaced element.

     A copy of this stack with one single replaced element.

     B

       the element type of the returned stack.

     That

       the class of the returned collection. Where possible, `That` is the same class as the current collection class `Repr`, but this depends on the element type `B` being admissible for that class, which means that an implicit instance of type `CanBuildFrom[Repr, B, That]` is found.

     index

       the position of the replacement

     elem

       the replacing element

     bf

       an implicit value of class `CanBuildFrom` which determines the result class `That` from the current representation type `Repr` and the new element type `B`.

     returns

       a new stack`which is a copy of this stack with the element at position` index`replaced by` elem`.`

     Definition Classes
       SeqLike → GenSeqLike

222. #### def view (from: Int, until: Int): SeqView[A, Stack[A]]

     Creates a non-strict view of a slice of this stack.

     Creates a non-strict view of a slice of this stack.

     Note: the difference between `view` and `slice` is that `view` produces a view of the current stack, whereas `slice` produces a new stack.

     Note: `view(from, to)` is equivalent to `view.slice(from, to)`

     from

       the index of the first element of the view

     until

       the index of the element following the view

     returns

       a non-strict view of a slice of this stack, starting at index `from` and extending up to (but not including) index `until`.

     Definition Classes
       SeqLike → IterableLike → TraversableLike

223. #### def view : SeqView[A, Stack[A]]

     Creates a non-strict view of this stack.

     Creates a non-strict view of this stack.

     returns

       a non-strict view of this stack.

     Definition Classes
       SeqLike → IterableLike → TraversableLike

224. #### def wait (): Unit

     Attributes
       final
     Definition Classes
       AnyRef
     Annotations
       @throws()

225. #### def wait (arg0: Long, arg1: Int): Unit

     Attributes
       final
     Definition Classes
       AnyRef
     Annotations
       @throws()

226. #### def wait (arg0: Long): Unit

     Attributes
       final
     Definition Classes
       AnyRef
     Annotations
       @throws()

227. #### def withFilter (p: (A) ⇒ Boolean): FilterMonadic[A, Stack[A]]

     Creates a non-strict filter of this stack.

     Creates a non-strict filter of this stack.

     Note: the difference between `c filter p` and `c withFilter p` is that the former creates a new collection, whereas the latter only restricts the domain of subsequent `map`, `flatMap`, `foreach`, and `withFilter` operations.

     p

       the predicate used to test elements.

     returns

       an object of class `WithFilter`, which supports `map`, `flatMap`, `foreach`, and `withFilter` operations. All these operations apply to those elements of this stack which satisfy the predicate `p`.

     Definition Classes
       TraversableLike → FilterMonadic

228. #### def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[Stack[A], (A1, B), That]): That

     Definition Classes
       IterableLike
     Annotations
       @bridge()

229. #### def zip [B] (that: GenIterable[B]): Stack[(A, B)]

     [use case] Returns a stack formed from this stack and another iterable collection by combining corresponding elements in pairs.

     [use case]

     Returns a stack formed from this stack and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

     B

       the type of the second half of the returned pairs

     that

       The iterable providing the second half of each result pair

     returns

       a new collection of type `That` containing pairs consisting of corresponding elements of this stack and `that`. The length of the returned collection is the minimum of the lengths of this stack and `that`.

     Attributes
       abstract
     Definition Classes
       GenIterableLike

230. #### def zip [A1 >: A, B, That] (that: GenIterable[B])(implicit bf: CanBuildFrom[Stack[A], (A1, B), That]): That

     Returns a stack formed from this stack and another iterable collection by combining corresponding elements in pairs.

     Returns a stack formed from this stack and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

     A1

       the type of the first half of the returned pairs (this is always a supertype of the collection's element type `A`).

     B

       the type of the second half of the returned pairs

     That

       the class of the returned collection. Where possible, `That` is the same class as the current collection class `Repr`, but this depends on the element type `(A1, B)` being admissible for that class, which means that an implicit instance of type `CanBuildFrom[Repr, (A1, B), That]`. is found.

     that

       The iterable providing the second half of each result pair

     bf

       an implicit value of class `CanBuildFrom` which determines the result class `That` from the current representation type `Repr` and the new element type `(A1, B)`.

     returns

       a new collection of type `That` containing pairs consisting of corresponding elements of this stack and `that`. The length of the returned collection is the minimum of the lengths of this stack and `that`.

     Definition Classes
       IterableLike → GenIterableLike

231. #### def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Stack[A], (A1, B), That]): That

     Definition Classes
       IterableLike
     Annotations
       @bridge()

232. #### def zipAll [B] (that: Iterable[B], thisElem: A, thatElem: B): Stack[(A, B)]

     [use case] Returns a stack formed from this stack and another iterable collection by combining corresponding elements in pairs.

     [use case]

     Returns a stack formed from this stack and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

     that

       the iterable providing the second half of each result pair

     thisElem

       the element to be used to fill up the result if this stack is shorter than `that`.

     thatElem

       the element to be used to fill up the result if `that` is shorter than this stack.

     returns

       a new collection of type `That` containing pairs consisting of corresponding elements of this stack and `that`. The length of the returned collection is the maximum of the lengths of this stack and `that`. If this stack is shorter than `that`, `thisElem` values are used to pad the result. If `that` is shorter than this stack, `thatElem` values are used to pad the result.

     Attributes
       abstract
     Definition Classes
       GenIterableLike

233. #### def zipAll [B, A1 >: A, That] (that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Stack[A], (A1, B), That]): That

     Returns a stack formed from this stack and another iterable collection by combining corresponding elements in pairs.

     Returns a stack formed from this stack and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

     that

       the iterable providing the second half of each result pair

     thisElem

       the element to be used to fill up the result if this stack is shorter than `that`.

     thatElem

       the element to be used to fill up the result if `that` is shorter than this stack.

     returns

       a new collection of type `That` containing pairs consisting of corresponding elements of this stack and `that`. The length of the returned collection is the maximum of the lengths of this stack and `that`. If this stack is shorter than `that`, `thisElem` values are used to pad the result. If `that` is shorter than this stack, `thatElem` values are used to pad the result.

     Definition Classes
       IterableLike → GenIterableLike

234. #### def zipWithIndex : Stack[(A, Int)]

     [use case] Zips this stack with its indices.

     [use case]

     Zips this stack with its indices.

     returns

       A new collection of type `That` containing pairs consisting of all elements of this stack paired with their index. Indices start at `0`.

     Attributes
       abstract
     Definition Classes
       GenIterableLike

235. #### def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[Stack[A], (A1, Int), That]): That

     Zips this stack with its indices.

     Zips this stack with its indices.

     A1

       the type of the first half of the returned pairs (this is always a supertype of the collection's element type `A`).

     That

       the class of the returned collection. Where possible, `That` is the same class as the current collection class `Repr`, but this depends on the element type `(A1, Int)` being admissible for that class, which means that an implicit instance of type `CanBuildFrom[Repr, (A1, Int), That]`. is found.

     returns

       A new collection of type `That` containing pairs consisting of all elements of this stack paired with their index. Indices start at `0`.

     Definition Classes
       IterableLike → GenIterableLike

### Deprecated Value Members

1. #### def ++= (xs: TraversableOnce[A]): StackProxy.this.type

   Pushes all elements provided by an `Iterable` object on top of the stack.

   Pushes all elements provided by an `Iterable` object on top of the stack. The elements are pushed in the order they are given out by the iterator.

   Definition Classes
     StackProxy → Stack
   Annotations
     @deprecated
   Deprecated

     use pushAll

2. #### def elements : Iterator[A]

   Definition Classes
     IterableLike
   Annotations
     @deprecated
   Deprecated

     use `iterator' instead`

3. #### def equalsWith [B] (that: Seq[B])(f: (A, B) ⇒ Boolean): Boolean

   Tests whether every element of this stack relates to the corresponding element of another sequence by satisfying a test predicate.

   Tests whether every element of this stack relates to the corresponding element of another sequence by satisfying a test predicate.

   B

     the type of the elements of `that`

   that

     the other sequence

   returns

     `true` if both sequences have the same length and `p(x, y)` is `true` for all corresponding elements `x` of this stack and `y` of `that`, otherwise `false`.

   Definition Classes
     SeqLike
   Annotations
     @deprecated
   Deprecated

     use `corresponds` instead

4. #### def findIndexOf (p: (A) ⇒ Boolean): Int

   Returns index of the first element satisfying a predicate, or `-1`.

   Returns index of the first element satisfying a predicate, or `-1`.

   Definition Classes
     SeqLike
   Annotations
     @deprecated
   Deprecated

     Use indexWhere(p) instead.

5. #### def findLastIndexOf (p: (A) ⇒ Boolean): Int

   Returns index of the last element satisfying a predicate, or -1.

   Returns index of the last element satisfying a predicate, or -1.

   Definition Classes
     SeqLike
   Annotations
     @deprecated
   Deprecated

     use `lastIndexWhere` instead

6. #### def first : A

   Definition Classes
     IterableLike
   Annotations
     @deprecated
   Deprecated

     use `head' instead`

7. #### def firstOption : Option[A]

   `None` if iterable is empty.

   `None` if iterable is empty.

   Definition Classes
     IterableLike
   Annotations
     @deprecated
   Deprecated

     use `headOption' instead`

8. #### def projection : SeqView[A, Stack[A]]

   returns a projection that can be used to call non-strict `filter`, `map`, and `flatMap` methods that build projections of the collection.

   returns a projection that can be used to call non-strict `filter`, `map`, and `flatMap` methods that build projections of the collection.

   Definition Classes
     SeqLike → IterableLike
   Annotations
     @deprecated
   Deprecated

     use `view' instead`

9. #### def reversedElements : Iterator[A]

   Definition Classes
     SeqLike
   Annotations
     @deprecated
   Deprecated

     use `reverseIterator' instead`

### Inherited from Proxy

### Inherited from Stack[A]

### Inherited from Serializable

### Inherited from Seq[A]

### Inherited from SeqLike[A, Stack[A]]

### Inherited from Cloneable[Stack[A]]

### Inherited from Seq[A]

### Inherited from SeqLike[A, Stack[A]]

### Inherited from GenSeq[A]

### Inherited from GenSeqLike[A, Stack[A]]

### Inherited from PartialFunction[Int, A]

### Inherited from (Int) ⇒ A

### Inherited from Iterable[A]

### Inherited from IterableLike[A, Stack[A]]

### Inherited from Equals

### Inherited from GenIterable[A]

### Inherited from GenIterableLike[A, Stack[A]]

### Inherited from Traversable[A]

### Inherited from Mutable

### Inherited from Traversable[A]

### Inherited from GenTraversable[A]

### Inherited from GenericTraversableTemplate[A, Stack]

### Inherited from TraversableLike[A, Stack[A]]

### Inherited from GenTraversableLike[A, Stack[A]]

### Inherited from Parallelizable[A, ParSeq[A]]

### Inherited from TraversableOnce[A]

### Inherited from GenTraversableOnce[A]

### Inherited from FilterMonadic[A, Stack[A]]

### Inherited from HasNewBuilder[A, Stack[A]]

### Inherited from AnyRef

### Inherited from Any