Scaladoc for scala.collection.mutable.Stack

Inherited

Hide All
Show all

Cloneable
Seq
SeqLike
Iterable
IterableLike
Equals
Traversable
GenericTraversableTemplate
TraversableLike
TraversableOnce
HasNewBuilder
PartialFunction
Function1
AnyRef
Any

Visibility

Public
All

Instance constructors

new Stack()

Type Members

type Self = Seq[A]

The type implementing this traversable

The type implementing this traversable
attributes: protected
definition classes: TraversableLike
class WithFilter extends AnyRef

A class supporting filtered operations .

Value Members

def !=(arg0: AnyRef): Boolean

attributes: final
definition classes: AnyRef
def !=(arg0: Any): Boolean

o != arg0 is the same as !(o == (arg0)).

o != arg0 is the same as !(o == (arg0)).
arg0
the object to compare against this object for dis-equality .
returns
false if the receiver object is equivalent to the argument; true otherwise.
attributes: final
definition classes: Any
def ##(): Int

attributes: final
definition classes: AnyRef → Any
def $asInstanceOf[T0](): T0

attributes: final
definition classes: AnyRef
def $isInstanceOf[T0](): Boolean

attributes: final
definition classes: AnyRef
def ++(that: TraversableOnce[A]): Stack[A]

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

[use case]
Concatenates this stack with the elements of a traversable collection .
that
the traversable to append .
returns
a new stack which contains all elements of this stack followed by all elements of that.
attributes: abstract
def ++[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Seq[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
def ++=(xs: TraversableOnce[A]): Stack[A]
1. use pushAll
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 stack consisting of elem followed by all elements of this stack.
attributes: abstract
def +:[B >: A, That](elem: B)(implicit bf: CanBuildFrom[Seq[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
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₁), x₂), ..., x_n) where x,,1,,, ..., x,,n,, are the elements of this stack.
definition classes: TraversableOnce
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 stack consisting of all elements of this stack followed by elem.
attributes: abstract
def :+[B >: A, That](elem: B)(implicit bf: CanBuildFrom[Seq[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
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₁, op(x₂, ... op(x_n, z)...)) where x,,1,,, ..., x,,n,, are the elements of this stack.
definition classes: TraversableOnce
def ==(arg0: AnyRef): Boolean

o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).
arg0
the object to compare against this object for equality .
returns
true if the receiver object is equivalent to the argument; false otherwise.
attributes: final
definition classes: AnyRef
def ==(arg0: Any): Boolean

o == arg0 is the same as o.equals(arg0).

o == arg0 is the same as o.equals(arg0).
arg0
the object to compare against this object for equality .
returns
true if the receiver object is equivalent to the argument; false otherwise.
attributes: final
definition classes: Any
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
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
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
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
def apply(index: Int): A

Retrieve n'th element from stack, where top of stack has index 0@return the element of this stack at index idx, where 0 indicates the first element.

Retrieve n'th element from stack, where top of stack has index 0@return the element of this stack at index idx, where 0 indicates the first element.
definition classes: Stack → SeqLike → Function1
def asInstanceOf[T0]: T0

This method is used to cast the receiver object to be of type T0.

This method is used to 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 expression1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expressionList(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 typed.
returns
the receiver object .
attributes: final
definition classes: Any
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
def clear(): Unit

Removes all elements from the stack .

Removes all elements from the stack . After this operation completed, the stack will be empty.
def clone(): Stack[A]

This method clones the stack .

This method clones the stack .
returns
a stack with the same elements .
definition classes: Stack → Cloneable → AnyRef
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 stack resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.
attributes: abstract
def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Seq[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
def companion: GenericCompanion[Seq[A][A]]

The factory companion object that builds instances of class Stack .

The factory companion object that builds instances of class Stack .
definition classes: Seq → Iterable → Traversable → GenericTraversableTemplate
def compose[A](g: (A) ⇒ Int): (A) ⇒ A

(f compose g)(x) == f(g(x))

(f compose g)(x) == f(g(x))
definition classes: Function1
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
def containsSlice[B](that: Seq[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
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
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
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
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
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, after skipping start values. 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
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, after skipping start values. 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
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
def corresponds[B](that: Seq[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
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
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 stack 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
def diff[B >: A](that: Seq[B]): Seq[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
def distinct: Seq[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
def drop(n: Int): Seq[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: TraversableLike
def dropRight(n: Int): Seq[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 first n ones, or else the empty stack, if this stack has less than n elements.
definition classes: IterableLike
def dropWhile(p: (A) ⇒ Boolean): Seq[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
def elements: Iterator[A]
definition classes: IterableLike
1. use iterator' instead
var elems: List[A]
def endsWith[B](that: Seq[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
def eq(arg0: AnyRef): Boolean

This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

This method is used to test whether the argument (arg0) is a reference to the receiver object (this).
The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on non-null instances of AnyRef: * It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true. * It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and only if y.eq(x) returns true. * It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true and y.eq(z) returns true, then x.eq(z) returns true.
Additionally, the eq method has three other 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).
arg0
the object to compare against this object for reference equality .
returns
true if the argument is a reference to the receiver object; false otherwise.
attributes: final
definition classes: AnyRef
def equals(that: Any): Boolean

The equality method defined in AnyRef.

The equality method defined in AnyRef.@return true if the receiver object is equivalent to the argument; false otherwise. */
definition classes: SeqLike → Equals → AnyRef → Any
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
1. use corresponds instead
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
def filter(p: (A) ⇒ Boolean): Seq[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
def filterNot(p: (A) ⇒ Boolean): Seq[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
def finalize(): Unit

This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object .

This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object .
The details of when and if the finalize method are invoked, as well as the interaction between finalizeand non-local returns and exceptions, are all platform dependent.
attributes: protected
definition classes: AnyRef
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
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
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
1. use lastIndexWhere instead
def first: A
definition classes: IterableLike
1. use head' instead
def firstOption: Option[A]

None if iterable is empty.
None if iterable is empty.
definition classes: IterableLike
1. use headOption' instead
def flatMap[B](f: (A) ⇒ Traversable[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 stack resulting from applying the given collection-valued function f to each element of this stack and concatenating the results.
attributes: abstract
def flatMap[B, That](f: (A) ⇒ Traversable[B])(implicit bf: CanBuildFrom[Seq[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
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
def flatten[B](implicit asTraversable: (A) ⇒ Traversable[B]): Seq[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: GenericTraversableTemplate
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₁), x₂, ..., x_n) where x,,1,,, ..., x,,n,, are the elements of this stack.
definition classes: TraversableOnce
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₁, op(x₂, ... op(x_n, z)...)) where x,,1,,, ..., x,,n,, are the elements of this stack.
definition classes: IterableLike → TraversableOnce
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
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
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 → TraversableOnce
def genericBuilder[B]: Builder[B, Seq[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
def getClass(): java.lang.Class[_ <: java.lang.Object]

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

Returns 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
def groupBy[K](f: (A) ⇒ K): Map[K, Seq[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
def grouped(size: Int): Iterator[Seq[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
1. Iterator#grouped
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
def hashCode(): Int

Hashcodes for Stack produce a value from the hashcodes of all the elements of the stack .

Hashcodes for Stack produce a value from the hashcodes of all the elements of the stack . @return the hash code value for the object. */
definition classes: SeqLike → AnyRef → Any
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 → TraversableLike
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
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
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: SeqLike
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
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: SeqLike
def indexOfSlice[B >: A](that: Seq[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
def indexOfSlice[B >: A](that: Seq[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
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
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: SeqLike
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
def init: Seq[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
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 stack 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
def intersect[B >: A](that: Seq[B]): Seq[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
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: SeqLike
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: Stack → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce
def isInstanceOf[T0]: Boolean

This method is used to test whether the dynamic type of the receiver object is T0.

This method is used to test whether the dynamic type of the receiver object is T0.
Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression1.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 requested typed.
returns
true if the receiver object is an instance of erasure of type T0; false otherwise.
attributes: final
definition classes: Any
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: TraversableLike → TraversableOnce
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 reversed order they were inserted into the stack (LIFO order).
returns
an iterator over all stack elements .
definition classes: Stack → IterableLike
def last: A

Selects the last element .

Selects the last element .
returns
the first element of this stack .
definition classes: TraversableLike
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
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: SeqLike
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
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: SeqLike
def lastIndexOfSlice[B >: A](that: Seq[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
def lastIndexOfSlice[B >: A](that: Seq[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
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
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: SeqLike
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
def length: Int

The number of elements in the stack@return the number of elements in this stack .

The number of elements in the stack@return the number of elements in this stack .
definition classes: Stack → SeqLike
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
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
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 stack resulting from applying the given function f to each element of this stack and collecting the results.
attributes: abstract
def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[Seq[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
def max: A

[use case] Finds the largest element .

[use case]
Finds the largest element .
returns
the largest element of this stack .
attributes: abstract
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
def min: A

[use case] Finds the smallest element .

[use case]
Finds the smallest element .
returns
the smallest element of this stack
attributes: abstract
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
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
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
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
def ne(arg0: AnyRef): Boolean

o.ne(arg0) is the same as !(o.eq(arg0)).

o.ne(arg0) is the same as !(o.eq(arg0)).
arg0
the object to compare against this object for reference dis-equality .
returns
false if the argument is not a reference to the receiver object; true otherwise.
attributes: final
definition classes: AnyRef
def newBuilder: Builder[A, Seq[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
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
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
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
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
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 stack consisting of all elements of this stack followed by the minimal number of occurrences of elem so that the resulting stack has a length of at least len.
attributes: abstract
def padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[Seq[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
def partition(p: (A) ⇒ Boolean): (Seq[A], Seq[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
def patch(from: Int, that: Seq[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
def patch[B >: A, That](from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[Seq[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
def pop(): A

Removes the top element from the stack .

Removes the top element from the stack .
returns
the top element
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: SeqLike
def product: Int

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

[use case]
Multiplies up the elements of this collection .
returns
the product of all elements in this stack of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the stack and as result type of product. Examples of such types are: Long, Float, Double, BigInt.
attributes: abstract
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
def projection: SeqView[A, Seq[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
1. use view' instead
def push(elem1: A, elem2: A, elems: A*): Stack[A]

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 .
def push(elem: A): Stack[A]

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 .
def pushAll(xs: TraversableOnce[A]): Stack[A]

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 .
def reduceLeft[B >: A](op: (B, A) ⇒ B): B

Applies a binary operator to all elements of this stack, going left to right .
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
the result of inserting op between consecutive elements of this stack, going left to right: op(...(op(x₁, x₂), ... ) , x_n) where x,,1,,, ..., x,,n,, are the elements of this stack.
definition classes: TraversableOnce
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
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₁, op(x₂, ..., op(x_n-1, x_n)...)) where x,,1,,, ..., x,,n,, are the elements of this stack.
definition classes: IterableLike → TraversableOnce
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
def repr: Seq[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
def reverse: Seq[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
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
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 .
Note: xs.reverseMap(f) is the same as xs.reverse.map(f) but might be more efficient.
f
the function to apply to each element .
returns
a new stack resulting from applying the given function f to each element of this stack and collecting the results in reversed order.
attributes: abstract
def reverseMap[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[Seq[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
def reversed: List[A]

attributes: protected[this]
definition classes: TraversableOnce
def reversedElements: Iterator[A]
definition classes: SeqLike
1. use reverseIterator' instead
def sameElements(that: Iterable[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
def sameElements[B >: A](that: Iterable[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
def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Seq[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
def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Seq[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 .
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
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
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 → TraversableOnce
def slice(from: Int, until: Int): Seq[A]

Selects an interval of elements .

Selects an interval of elements .
Note: c.slice(from, to) is equivalent to (but possibly more efficient than) c.drop(from).take(to - from)
from
the index of the first returned element in this stack .
until
the index one past the last returned element in this stack .
returns
a stack containing the elements starting at index from and extending up to (but not including) index until of this stack.
definition classes: IterableLike → TraversableLike
def sliding[B >: A](size: Int, step: Int): Iterator[Seq[A]]

definition classes: IterableLike
def sliding[B >: A](size: Int): Iterator[Seq[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 will be truncated if the elements don't divide evenly.
definition classes: IterableLike
1. Iterator#sliding
def sortBy[B](f: (A) ⇒ B)(implicit ord: Ordering[B]): Seq[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
1. scala . math.Ordering
def sortWith(lt: (A, A) ⇒ Boolean): Seq[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
def sorted[B >: A](implicit ord: Ordering[B]): Seq[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
1. scala . math.Ordering
def span(p: (A) ⇒ Boolean): (Seq[A], Seq[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
def splitAt(n: Int): (Seq[A], Seq[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
def startsWith[B](that: Seq[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: SeqLike
def startsWith[B](that: Seq[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
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
def sum: Int

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

[use case]
Sums up the elements of this collection .
returns
the sum of all elements in this stack of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the stack and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.
attributes: abstract
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
def synchronized[T0](arg0: T0): T0

attributes: final
definition classes: AnyRef
def tail: Seq[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
def take(n: Int): Seq[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
def takeRight(n: Int): Seq[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
def takeWhile(p: (A) ⇒ Boolean): Seq[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
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
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. A ClassManifest must be available for the element type of this stack.
attributes: abstract
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
def toCollection(repr: Seq[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
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
def toIterable: Iterable[A]

Converts this stack to an iterable collection .

Converts this stack to an iterable collection .
returns
an Iterable containing all elements of this stack.
definition classes: IterableLike → TraversableOnce
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 → TraversableOnce
def toList: List[A]

Creates a list of all stack elements in LIFO order .

Creates a list of all stack elements in LIFO order .
returns
the created list .
definition classes: Stack → TraversableOnce
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 ((K, V)) 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
def toSeq: Seq[A]

Converts this stack to a sequence .

Converts this stack to a sequence .
Overridden for efficiency.@return a sequence containing all elements of this stack.
definition classes: SeqLike → TraversableOnce
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
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 → TraversableOnce
def toString(): String

Converts this stack to a string .

Converts this stack to a string .
returns
a string representation of this collection. By default this string consists of the stringPrefix of this stack, followed by all elements separated by commas and enclosed in parentheses.
definition classes: SeqLike → TraversableLike → AnyRef → Any
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
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
def transpose[B](implicit asTraversable: (A) ⇒ Traversable[B]): Seq[Seq[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: GenericTraversableTemplate
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 stack which contains all elements of this stack followed by all elements of that.
attributes: abstract
def union[B >: A, That](that: Seq[B])(implicit bf: CanBuildFrom[Seq[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
def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (Seq[A1], Seq[A2])

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

Converts this stack of pairs into two collections of the first and second halfs 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
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 copy of this stack with the element at position index replaced by elem.
attributes: abstract
def updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[Seq[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
def view(from: Int, until: Int): SeqView[A, Seq[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
def view: SeqView[A, Seq[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
def wait(): Unit

attributes: final
definition classes: AnyRef
def wait(arg0: Long, arg1: Int): Unit

attributes: final
definition classes: AnyRef
def wait(arg0: Long): Unit

attributes: final
definition classes: AnyRef
def withFilter(p: (A) ⇒ Boolean): WithFilter

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
def zip[B](that: Iterable[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 stack 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
def zip[A1 >: A, B, That](that: Iterable[B])(implicit bf: CanBuildFrom[Seq[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
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.
B
the type of the second half of the returned pairs
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 stack 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
def zipAll[B, A1 >: A, That](that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Seq[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
def zipWithIndex: Stack[(A, Int)]

[use case] Zips this stack with its indices .

[use case]
Zips this stack with its indices .
returns
A new stack containing pairs consisting of all elements of this stack paired with their index. Indices start at 0. @example List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))
attributes: abstract
def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[Seq[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

Stack

class Stack[A] extends Seq[A] with Cloneable[Stack[A]]

Inherited

Visibility

Instance constructors

new Stack()

Type Members

type Self = Seq[A]

class WithFilter extends AnyRef

Value Members

def !=(arg0: AnyRef): Boolean

def !=(arg0: Any): Boolean

def ##(): Int

def $asInstanceOf[T0](): T0

def $isInstanceOf[T0](): Boolean

def ++(that: TraversableOnce[A]): Stack[A]

def ++[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Seq[A], B, That]): That

def ++=(xs: TraversableOnce[A]): Stack[A]

def +:(elem: A): Stack[A]

def +:[B >: A, That](elem: B)(implicit bf: CanBuildFrom[Seq[A], B, That]): That

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

def :+(elem: A): Stack[A]

def :+[B >: A, That](elem: B)(implicit bf: CanBuildFrom[Seq[A], B, That]): That

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

def ==(arg0: AnyRef): Boolean

def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

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

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

def apply(index: Int): A

def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clear(): Unit

def clone(): Stack[A]

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

def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Seq[A], B, That]): That

def companion: GenericCompanion[Seq[A][A]]

def compose[A](g: (A) ⇒ Int): (A) ⇒ A

def contains(elem: Any): Boolean

def containsSlice[B](that: Seq[B]): Boolean

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

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

def copyToArray(xs: Array[A]): Unit

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

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

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

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

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

def count(p: (A) ⇒ Boolean): Int

def diff(that: Seq[A]): Stack[A]

def diff[B >: A](that: Seq[B]): Seq[A]

def distinct: Seq[A]

def drop(n: Int): Seq[A]

def dropRight(n: Int): Seq[A]

def dropWhile(p: (A) ⇒ Boolean): Seq[A]

def elements: Iterator[A]

var elems: List[A]

def endsWith[B](that: Seq[B]): Boolean

def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

def exists(p: (A) ⇒ Boolean): Boolean

def filter(p: (A) ⇒ Boolean): Seq[A]

def filterNot(p: (A) ⇒ Boolean): Seq[A]

def finalize(): Unit

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

def findIndexOf(p: (A) ⇒ Boolean): Int

def findLastIndexOf(p: (A) ⇒ Boolean): Int

def first: A

def firstOption: Option[A]

def flatMap[B](f: (A) ⇒ Traversable[B]): Stack[B]

def flatMap[B, That](f: (A) ⇒ Traversable[B])(implicit bf: CanBuildFrom[Seq[A], B, That]): That

def flatten[B]: Stack[B]

def flatten[B](implicit asTraversable: (A) ⇒ Traversable[B]): Seq[B]

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

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

def forall(p: (A) ⇒ Boolean): Boolean

def foreach(f: (A) ⇒ Unit): Unit

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