Stack

Type Members

type Coll = Stack[_]

The underlying collection type with unknown element type
The underlying collection type with unknown element type

Attributes
protected[this]
Definition Classes
GenericCompanion
class GenericCanBuildFrom[A] extends CanBuildFrom[CC[_], A, CC[A]]

A generic implementation of the CanBuildFrom trait, which forwards all calls to apply(from) to the genericBuilder method of collection from, and which forwards all calls of apply() to the newBuilder method of this factory.
class StackBuilder[A] extends Builder[A, Stack[A]]

Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
def ReusableCBF: GenericCanBuildFrom[Nothing]

Definition Classes
GenTraversableFactory
def apply[A](elems: A*): Stack[A]

Creates a mutable stack with the specified elements.
Creates a mutable stack with the specified elements.
A
the type of the mutable stack's elements
elems
the elements of the created mutable stack
returns
a new mutable stack with elements elems

Definition Classes
GenericCompanion
final def asInstanceOf[T0]: T0

Definition Classes
Any
implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Stack[A]]
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
def concat[A](xss: collection.Traversable[A]*): Stack[A]

Concatenates all argument collections into a single mutable stack.
Concatenates all argument collections into a single mutable stack.
xss
the collections that are to be concatenated.
returns
the concatenation of all the collections.

Definition Classes
GenTraversableFactory
def empty[A]: Stack[A]

An empty collection of type mutable.Stack[A]
An empty collection of type mutable.Stack[A]
A
the type of the mutable stack's elements

Definition Classes
GenericCompanion
val empty: Stack[Nothing]
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def fill[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(elem: ⇒ A): Stack[Stack[Stack[Stack[Stack[A]]]]]

Produces a five-dimensional mutable stack containing the results of some element computation a number of times.
Produces a five-dimensional mutable stack containing the results of some element computation a number of times.
n1
the number of elements in the 1st dimension
n2
the number of elements in the 2nd dimension
n3
the number of elements in the 3nd dimension
n4
the number of elements in the 4th dimension
n5
the number of elements in the 5th dimension
elem
the element computation
returns
A mutable stack that contains the results of n1 x n2 x n3 x n4 x n5 evaluations of elem.

Definition Classes
GenTraversableFactory
def fill[A](n1: Int, n2: Int, n3: Int, n4: Int)(elem: ⇒ A): Stack[Stack[Stack[Stack[A]]]]

Produces a four-dimensional mutable stack containing the results of some element computation a number of times.
Produces a four-dimensional mutable stack containing the results of some element computation a number of times.
n1
the number of elements in the 1st dimension
n2
the number of elements in the 2nd dimension
n3
the number of elements in the 3nd dimension
n4
the number of elements in the 4th dimension
elem
the element computation
returns
A mutable stack that contains the results of n1 x n2 x n3 x n4 evaluations of elem.

Definition Classes
GenTraversableFactory
def fill[A](n1: Int, n2: Int, n3: Int)(elem: ⇒ A): Stack[Stack[Stack[A]]]

Produces a three-dimensional mutable stack containing the results of some element computation a number of times.
Produces a three-dimensional mutable stack containing the results of some element computation a number of times.
n1
the number of elements in the 1st dimension
n2
the number of elements in the 2nd dimension
n3
the number of elements in the 3nd dimension
elem
the element computation
returns
A mutable stack that contains the results of n1 x n2 x n3 evaluations of elem.

Definition Classes
GenTraversableFactory
def fill[A](n1: Int, n2: Int)(elem: ⇒ A): Stack[Stack[A]]

Produces a two-dimensional mutable stack containing the results of some element computation a number of times.
Produces a two-dimensional mutable stack containing the results of some element computation a number of times.
n1
the number of elements in the 1st dimension
n2
the number of elements in the 2nd dimension
elem
the element computation
returns
A mutable stack that contains the results of n1 x n2 evaluations of elem.

Definition Classes
GenTraversableFactory
def fill[A](n: Int)(elem: ⇒ A): Stack[A]

Produces a mutable stack containing the results of some element computation a number of times.
Produces a mutable stack containing the results of some element computation a number of times.
n
the number of elements contained in the mutable stack.
elem
the element computation
returns
A mutable stack that contains the results of n evaluations of elem.

Definition Classes
GenTraversableFactory
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def iterate[A](start: A, len: Int)(f: (A) ⇒ A): Stack[A]

Produces a mutable stack containing repeated applications of a function to a start value.
Produces a mutable stack containing repeated applications of a function to a start value.
start
the start value of the mutable stack
len
the number of elements contained inthe mutable stack
f
the function that's repeatedly applied
returns
a mutable stack with len values in the sequence start, f(start), f(f(start)), ...

Definition Classes
GenTraversableFactory
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def newBuilder[A]: Builder[A, Stack[A]]

The default builder for mutable.Stack objects.
The default builder for mutable.Stack objects.
A
the type of the mutable stack's elements

Definition Classes
Stack → GenericCompanion
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def range[T](start: T, end: T, step: T)(implicit arg0: Integral[T]): Stack[T]

Produces a mutable stack containing equally spaced values in some integer interval.
Produces a mutable stack containing equally spaced values in some integer interval.
start
the start value of the mutable stack
end
the end value of the mutable stack (the first value NOT contained)
step
the difference between successive elements of the mutable stack (must be positive or negative)
returns
a mutable stack with values start, start + step, ... up to, but excluding end

Definition Classes
GenTraversableFactory
def range[T](start: T, end: T)(implicit arg0: Integral[T]): Stack[T]

Produces a mutable stack containing a sequence of increasing of integers.
Produces a mutable stack containing a sequence of increasing of integers.
start
the first element of the mutable stack
end
the end value of the mutable stack (the first value NOT contained)
returns
a mutable stack with values start, start + 1, ..., end - 1

Definition Classes
GenTraversableFactory
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(f: (Int, Int, Int, Int, Int) ⇒ A): Stack[Stack[Stack[Stack[Stack[A]]]]]

Produces a five-dimensional mutable stack containing values of a given function over ranges of integer values starting from 0.
Produces a five-dimensional mutable stack containing values of a given function over ranges of integer values starting from 0.
n1
the number of elements in the 1st dimension
n2
the number of elements in the 2nd dimension
n3
the number of elements in the 3nd dimension
n4
the number of elements in the 4th dimension
n5
the number of elements in the 5th dimension
f
The function computing element values
returns
A mutable stack consisting of elements f(i1, i2, i3, i4, i5) for 0 <= i1 < n1, 0 <= i2 < n2, 0 <= i3 < n3, 0 <= i4 < n4, and 0 <= i5 < n5.

Definition Classes
GenTraversableFactory
def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int)(f: (Int, Int, Int, Int) ⇒ A): Stack[Stack[Stack[Stack[A]]]]

Produces a four-dimensional mutable stack containing values of a given function over ranges of integer values starting from 0.
Produces a four-dimensional mutable stack containing values of a given function over ranges of integer values starting from 0.
n1
the number of elements in the 1st dimension
n2
the number of elements in the 2nd dimension
n3
the number of elements in the 3nd dimension
n4
the number of elements in the 4th dimension
f
The function computing element values
returns
A mutable stack consisting of elements f(i1, i2, i3, i4) for 0 <= i1 < n1, 0 <= i2 < n2, 0 <= i3 < n3, and 0 <= i4 < n4.

Definition Classes
GenTraversableFactory
def tabulate[A](n1: Int, n2: Int, n3: Int)(f: (Int, Int, Int) ⇒ A): Stack[Stack[Stack[A]]]

Produces a three-dimensional mutable stack containing values of a given function over ranges of integer values starting from 0.
Produces a three-dimensional mutable stack containing values of a given function over ranges of integer values starting from 0.
n1
the number of elements in the 1st dimension
n2
the number of elements in the 2nd dimension
n3
the number of elements in the 3nd dimension
f
The function computing element values
returns
A mutable stack consisting of elements f(i1, i2, i3) for 0 <= i1 < n1, 0 <= i2 < n2, and 0 <= i3 < n3.

Definition Classes
GenTraversableFactory
def tabulate[A](n1: Int, n2: Int)(f: (Int, Int) ⇒ A): Stack[Stack[A]]

Produces a two-dimensional mutable stack containing values of a given function over ranges of integer values starting from 0.
Produces a two-dimensional mutable stack containing values of a given function over ranges of integer values starting from 0.
n1
the number of elements in the 1st dimension
n2
the number of elements in the 2nd dimension
f
The function computing element values
returns
A mutable stack consisting of elements f(i1, i2) for 0 <= i1 < n1 and 0 <= i2 < n2.

Definition Classes
GenTraversableFactory
def tabulate[A](n: Int)(f: (Int) ⇒ A): Stack[A]

Produces a mutable stack containing values of a given function over a range of integer values starting from 0.
Produces a mutable stack containing values of a given function over a range of integer values starting from 0.
n
The number of elements in the mutable stack
f
The function computing element values
returns
A mutable stack consisting of elements f(0), ..., f(n -1)

Definition Classes
GenTraversableFactory
def toString(): String

Definition Classes
AnyRef → Any
def unapplySeq[A](x: Stack[A]): Some[Stack[A]]

This method is called in a pattern match { case Seq(.
This method is called in a pattern match { case Seq(...) => }.
x
the selector value
returns
sequence wrapped in an option, if this is a Seq, otherwise none

Definition Classes
SeqFactory
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws()
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws()
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws()

object Stack extends SeqFactory[Stack] with Serializable

Type Members

type Coll = Stack[_]

class GenericCanBuildFrom[A] extends CanBuildFrom[CC[_], A, CC[A]]

class StackBuilder[A] extends Builder[A, Stack[A]]

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def ReusableCBF: GenericCanBuildFrom[Nothing]

def apply[A](elems: A*): Stack[A]

final def asInstanceOf[T0]: T0

implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Stack[A]]

def clone(): AnyRef

def concat[A](xss: collection.Traversable[A]*): Stack[A]

def empty[A]: Stack[A]

val empty: Stack[Nothing]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def fill[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(elem: ⇒ A): Stack[Stack[Stack[Stack[Stack[A]]]]]

def fill[A](n1: Int, n2: Int, n3: Int, n4: Int)(elem: ⇒ A): Stack[Stack[Stack[Stack[A]]]]

def fill[A](n1: Int, n2: Int, n3: Int)(elem: ⇒ A): Stack[Stack[Stack[A]]]

def fill[A](n1: Int, n2: Int)(elem: ⇒ A): Stack[Stack[A]]

def fill[A](n: Int)(elem: ⇒ A): Stack[A]

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def iterate[A](start: A, len: Int)(f: (A) ⇒ A): Stack[A]

final def ne(arg0: AnyRef): Boolean

def newBuilder[A]: Builder[A, Stack[A]]

final def notify(): Unit

final def notifyAll(): Unit

def range[T](start: T, end: T, step: T)(implicit arg0: Integral[T]): Stack[T]

def range[T](start: T, end: T)(implicit arg0: Integral[T]): Stack[T]

final def synchronized[T0](arg0: ⇒ T0): T0

def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(f: (Int, Int, Int, Int, Int) ⇒ A): Stack[Stack[Stack[Stack[Stack[A]]]]]

def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int)(f: (Int, Int, Int, Int) ⇒ A): Stack[Stack[Stack[Stack[A]]]]

def tabulate[A](n1: Int, n2: Int, n3: Int)(f: (Int, Int, Int) ⇒ A): Stack[Stack[Stack[A]]]

def tabulate[A](n1: Int, n2: Int)(f: (Int, Int) ⇒ A): Stack[Stack[A]]

def tabulate[A](n: Int)(f: (Int) ⇒ A): Stack[A]

def toString(): String

def unapplySeq[A](x: Stack[A]): Some[Stack[A]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from java.io.Serializable

Inherited from SeqFactory[Stack]

Inherited from TraversableFactory[Stack]

Inherited from GenericSeqCompanion[Stack]

Inherited from GenSeqFactory[Stack]

Inherited from GenTraversableFactory[Stack]

Inherited from GenericCompanion[Stack]

Inherited from AnyRef

Inherited from Any

Ungrouped