The type implementing this traversable
The type implementing this traversable
A class supporting filtered operations.
Test two objects for inequality.
Test two objects for inequality.
true
if !(this == that), false otherwise.
Equivalent to x.hashCode
except for boxed numeric types and null
.
Equivalent to x.hashCode
except for boxed numeric types and null
.
For numerics, it returns a hash value which is consistent
with value equality: if two value type instances compare
as true, then ## will produce the same hash value for each
of them.
For null
returns a hashcode where null.hashCode
throws a
NullPointerException
.
a hash value consistent with ==
[use case] Returns a new stack containing the elements from the left hand operand followed by the elements from the right hand operand.
Returns a new stack containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the stack is the most specific superclass encompassing the element types of the two operands.
Example:
scala> val a = LinkedList(1) a: scala.collection.mutable.LinkedList[Int] = LinkedList(1) scala> val b = LinkedList(2) b: scala.collection.mutable.LinkedList[Int] = LinkedList(2) scala> val c = a ++ b c: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2) scala> val d = LinkedList('a') d: scala.collection.mutable.LinkedList[Char] = LinkedList(a) scala> val e = c ++ d e: scala.collection.mutable.LinkedList[AnyVal] = LinkedList(1, 2, a)
the element type of the returned collection.
the traversable to append.
a new stack which contains all elements of this stack
followed by all elements of that
.
As with ++
, returns a new collection containing the elements from the
left operand followed by the elements from the right operand.
As with ++
, returns a new collection containing the elements from the
left operand followed by the elements from the right operand.
It differs from ++
in that the right operand determines the type of
the resulting collection rather than the left one.
Mnemonic: the COLon is on the side of the new COLlection type.
Example:
scala> val x = List(1) x: List[Int] = List(1) scala> val y = LinkedList(2) y: scala.collection.mutable.LinkedList[Int] = LinkedList(2) scala> val z = x ++: y z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
This overload exists because: for the implementation of ++:
we should
reuse that of ++
because many collections override it with more
efficient versions.
Since TraversableOnce
has no ++
method, we have to implement that
directly, but Traversable
and down can use the overload.
the element type of the returned collection.
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.
the traversable to append.
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and the new element type B
.
a new collection of type That
which contains all elements
of this stack followed by all elements of that
.
[use case] As with ++
, returns a new collection containing the elements from the left operand followed by the
elements from the right operand.
As with ++
, returns a new collection containing the elements from the left operand followed by the
elements from the right operand.
It differs from ++
in that the right operand determines the type of
the resulting collection rather than the left one.
Mnemonic: the COLon is on the side of the new COLlection type.
Example:
scala> val x = List(1) x: List[Int] = List(1) scala> val y = LinkedList(2) y: scala.collection.mutable.LinkedList[Int] = LinkedList(2) scala> val z = x ++: y z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
the element type of the returned collection.
the traversable to append.
a new stack which contains all elements of this stack
followed by all elements of that
.
[use case] A copy of the stack with an element prepended.
A copy of the stack with an element prepended.
Note that :-ending operators are right associative (see example).
A mnemonic for +:
vs. :+
is: the COLon goes on the COLlection side.
Also, the original stack is not modified, so you will want to capture the result.
Example:
scala> val x = LinkedList(1) x: scala.collection.mutable.LinkedList[Int] = LinkedList(1) scala> val y = 2 +: x y: scala.collection.mutable.LinkedList[Int] = LinkedList(2, 1) scala> println(x) LinkedList(1)
the prepended element
a new stack consisting of elem
followed
by all elements of this stack.
Pushes a single element on top of the stack.
Pushes a single element on top of the stack.
the element to push onto the stack
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
.
Examples:
Note that the folding function used to compute b is equivalent to that used to compute c.
scala> val a = LinkedList(1,2,3,4) a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4) scala> val b = (5 /: a)(_+_) b: Int = 15 scala> val c = (5 /: a)((x,y) => x + y) c: Int = 15
the result type of the binary operator.
the start value.
the binary operator.
the result of inserting op
between consecutive elements of this stack,
going left to right with the start value z
on the left:
op(...op(op(z, x_1), x_2), ..., x_n)
where x_{1}, ..., x_{n}
are the elements of this stack.
[use case] A copy of this stack with an element appended.
A copy of this stack with an element appended.
A mnemonic for +:
vs. :+
is: the COLon goes on the COLlection side.
Example:
scala> import scala.collection.mutable.LinkedList import scala.collection.mutable.LinkedList scala> val a = LinkedList(1) a: scala.collection.mutable.LinkedList[Int] = LinkedList(1) scala> val b = a :+ 2 b: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2) scala> println(a) LinkedList(1)
the appended element
a new stack consisting of
all elements of this stack followed by elem
.
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
.
Examples:
Note that the folding function used to compute b is equivalent to that used to compute c.
scala> val a = LinkedList(1,2,3,4) a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4) scala> val b = (a :\ 5)(_+_) b: Int = 15 scala> val c = (a :\ 5)((x,y) => x + y) c: Int = 15
the result type of the binary operator.
the start value
the binary operator
the result of inserting op
between consecutive elements of this stack,
going right to left with the start value z
on the right:
op(x_1, op(x_2, ... op(x_n, z)...))
where x_{1}, ..., x_{n}
are the elements of this stack.
Test two objects for equality.
Test two objects for equality.
The expression x == that
is equivalent to if (x eq null) that eq null else x.equals(that)
.
true
if the receiver object is equivalent to the argument; false
otherwise.
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.
Example:
scala> val a = LinkedList(1,2,3,4) a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4) scala> val b = new StringBuilder() b: StringBuilder = scala> val h = a.addString(b) b: StringBuilder = 1234
the string builder to which elements are appended.
the string builder b
to which elements were appended.
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
.
Example:
scala> val a = LinkedList(1,2,3,4) a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4) scala> val b = new StringBuilder() b: StringBuilder = scala> a.addString(b, ", ") res0: StringBuilder = 1, 2, 3, 4
the string builder to which elements are appended.
the separator string.
the string builder b
to which elements were appended.
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
.
Example:
scala> val a = LinkedList(1,2,3,4) a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4) scala> val b = new StringBuilder() b: StringBuilder = scala> a.addString(b, "LinkedList(", ", ", ")") res1: StringBuilder = LinkedList(1, 2, 3, 4)
the string builder to which elements are appended.
the starting string.
the separator string.
the ending string.
the string builder b
to which elements were appended.
Aggregates the results of applying an operator to subsequent elements.
Aggregates the results of applying an operator to subsequent elements.
This is a more general form of fold
and reduce
. It has similar
semantics, but does not require the result to be a supertype of the
element type. It traverses the elements in different partitions
sequentially, using seqop
to update the result, and then applies
combop
to results from different partitions. The implementation of
this operation may operate on an arbitrary number of collection
partitions, so combop
may be invoked an arbitrary number of times.
For example, one might want to process some elements and then produce
a Set
. In this case, seqop
would process an element and append it
to the list, while combop
would concatenate two lists from different
partitions together. The initial value z
would be an empty set.
pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)
Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).
the type of accumulated results
the initial value for the accumulated result of the partition - this
will typically be the neutral element for the seqop
operator (e.g.
Nil
for list concatenation or 0
for summation)
an operator used to accumulate results within a partition
an associative operator used to combine results from different partitions
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.
the result type of the transformation function.
the transformation function
a partial function with the same domain as this partial function, which maps
arguments x
to k(this(x))
.
Access element number n
.
Access element number n
.
the element at index n
.
Applies this partial function to the given argument when it is contained in the function domain.
Applies this partial function to the given argument when it is contained in the function domain. Applies fallback function where this partial function is not defined.
Note that expression pf.applyOrElse(x, default)
is equivalent to
if(pf isDefinedAt x) pf(x) else default(x)
except that applyOrElse
method can be implemented more efficiently.
For all partial function literals compiler generates applyOrElse
implementation which
avoids double evaluation of pattern matchers and guards.
This makes applyOrElse
the basis for the efficient implementation for many operations and scenarios, such as:
orElse
/andThen
chains does not lead to
excessive apply
/isDefinedAt
evaluationlift
and unlift
do not evaluate source functions twice on each invocationrunWith
allows efficient imperative-style combining of partial functions
with conditionally applied actions For non-literal partial function classes with nontrivial isDefinedAt
method
it is recommended to override applyOrElse
with custom implementation that avoids
double isDefinedAt
evaluation. This may result in better performance
and more predictable behavior w.r.t. side effects.
the function argument
the fallback function
the result of this function or fallback function application.
2.10
Cast the receiver object to be of type T0
.
Cast the receiver object to be of type T0
.
Note that the success of a cast at runtime is modulo Scala's erasure semantics.
Therefore the expression 1.asInstanceOf[String]
will throw a ClassCastException
at
runtime, while the expression List(1).asInstanceOf[List[String]]
will not.
In the latter example, because the type argument is erased as part of compilation it is
not possible to check whether the contents of the list are of the requested type.
the receiver object.
if the receiver object is not an instance of the erasure of type T0
.
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.
The object with which this stack should be compared
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.
Removes all elements from the stack.
Removes all elements from the stack. After this operation completed, the stack will be empty.
This method clones the stack.
This method clones the stack.
a stack with the same elements.
[use case] 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.
the element type of the returned collection.
the partial function which filters and maps the stack.
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.
Finds the first element of the stack for which the given partial function is defined, and applies the partial function to it.
Finds the first element of the stack for which the given partial function is defined, and applies the partial function to it.
the partial function
an option value containing pf applied to the first
value for which it is defined, or None
if none exists.
Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)
Iterates over combinations.
Iterates over combinations.
An Iterator which traverses the possible n-element combinations of this stack.
"abbbc".combinations(2) = Iterator(ab, ac, bb, bc)
The factory companion object that builds instances of class Stack
.
The factory companion object that builds instances of class Stack
.
(or its Iterable
superclass where class Stack
is not a Seq
.)
Composes two instances of Function1 in a new Function1, with this function applied last.
Composes two instances of Function1 in a new Function1, with this function applied last.
the type to which function g
can be applied
a function A => T1
a new function f
such that f(x) == apply(g(x))
Tests whether this stack contains a given value as an element.
Tests whether this stack contains a given value as an element.
the element to test.
true
if this stack has an element that is equal (as
determined by ==
) to elem
, false
otherwise.
Tests whether this stack contains a given sequence as a slice.
Tests whether this stack contains a given sequence as a slice.
the sequence to test
true
if this stack contains a slice with the same elements
as that
, otherwise false
.
[use case] 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.
the array to fill.
the starting index.
the maximal number of elements to copy.
[use case] 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.
the array to fill.
[use case] Copies values of this stack to an array.
Copies values of this stack to an array.
Fills the given array xs
with values of this stack, beginning at index start
.
Copying will stop once either the end of the current stack is reached,
or the end of the array is reached.
the array to fill.
the starting index.
Copies all elements of this stack to a buffer.
Copies all elements of this stack to a buffer.
The buffer to which elements are copied.
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.
the type of the elements of that
the other sequence
the test predicate, which relates elements from both sequences
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
.
Counts the number of elements in the stack which satisfy a predicate.
Counts the number of elements in the stack which satisfy a predicate.
the predicate used to test elements.
the number of elements satisfying the predicate p
.
[use case] Computes the multiset difference between this stack and another sequence.
Computes the multiset difference between this stack and another sequence.
the sequence of elements to remove
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.
Builds a new stack from this stack without any duplicate elements.
Builds a new stack from this stack without any duplicate elements.
A new stack which contains the first occurrence of every element of this stack.
Selects all elements except first n ones.
Selects all elements except first n ones.
the number of elements to drop from this stack.
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.
Selects all elements except last n ones.
Selects all elements except last n ones.
The number of elements to take
a stack consisting of all elements of this stack except the last n
ones, or else the
empty stack, if this stack has less than n
elements.
Drops longest prefix of elements that satisfy a predicate.
Drops longest prefix of elements that satisfy a predicate.
the longest suffix of this stack whose first element
does not satisfy the predicate p
.
Tests whether this stack ends with the given sequence.
Tests whether this stack ends with the given sequence.
the sequence to test
true
if this stack has that
as a suffix, false
otherwise.
Tests whether the argument (arg0
) is a reference to the receiver object (this
).
Tests whether the argument (arg0
) is a reference to the receiver object (this
).
The eq
method implements an equivalence relation on
non-null instances of AnyRef
, and has three additional properties:
x
and y
of type AnyRef
, multiple invocations of
x.eq(y)
consistently returns true
or consistently returns false
.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
).
true
if the argument is a reference to the receiver object; false
otherwise.
Compares the receiver object (this
) with the argument object (that
) for equivalence.
Compares the receiver object (this
) with the argument object (that
) for equivalence.
Any implementation of this method should be an equivalence relation:
x
of type Any
, x.equals(x)
should return true
.x
and y
of type Any
, x.equals(y)
should return true
if and
only if y.equals(x)
returns true
.x
, y
, and z
of type AnyRef
if x.equals(y)
returns true
and
y.equals(z)
returns true
, then x.equals(z)
should return true
. If you override this method, you should verify that your implementation remains an equivalence relation.
Additionally, when overriding this method it is usually necessary to override hashCode
to ensure that
objects which are "equal" (o1.equals(o2)
returns true
) hash to the same scala.Int.
(o1.hashCode.equals(o2.hashCode)
).
the object to compare against this object for equality.
true
if the receiver object is equivalent to the argument; false
otherwise.
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.
the predicate used to test elements.
true
if the given predicate p
holds for some of the
elements of this stack, otherwise false
.
Selects all elements of this stack which satisfy a predicate.
Selects all elements of this stack which satisfy a predicate.
the predicate used to test elements.
a new stack consisting of all elements of this stack that satisfy the given
predicate p
. The order of the elements is preserved.
Selects all elements of this stack which do not satisfy a predicate.
Selects all elements of this stack which do not satisfy a predicate.
the predicate used to test elements.
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.
Called by the garbage collector on the receiver object when there are no more references to the object.
Called by the garbage collector on the receiver object when there are no more references to the object.
The details of when and if the finalize
method is invoked, as
well as the interaction between finalize
and non-local returns
and exceptions, are all platform dependent.
not specified by SLS as a member of AnyRef
Finds the first element of the stack satisfying a predicate, if any.
Finds the first element of the stack satisfying a predicate, if any.
the predicate used to test elements.
an option value containing the first element in the stack
that satisfies p
, or None
if none exists.
[use case] Builds a new collection by applying a function to all elements of this stack and using the elements of the resulting collections.
Builds a new collection by applying a function to all elements of this stack and using the elements of the resulting collections.
For example:
def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")
The type of the resulting collection is guided by the static type of stack. This might cause unexpected results sometimes. For example:
// lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet) // lettersOf will return a Set[Char], not a Seq def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq) // xs will be a an Iterable[Int] val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2) // ys will be a Map[Int, Int] val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
the element type of the returned collection.
the function to apply to each element.
a new stack resulting from applying the given collection-valued function
f
to each element of this stack and concatenating the results.
[use case] Converts this stack of traversable collections into a stack formed by the elements of these traversable collections.
Converts this stack of traversable collections into a stack formed by the elements of these traversable collections.
The resulting collection's type will be guided by the static type of stack. For example:
val xs = List(Set(1, 2, 3), Set(1, 2, 3)) // xs == List(1, 2, 3, 1, 2, 3) val ys = Set(List(1, 2, 3), List(3, 2, 1)) // ys == Set(1, 2, 3)
the type of the elements of each traversable collection.
a new stack resulting from concatenating all element stacks.
Folds the elements of this stack using the specified associative binary operator.
Folds the elements of this stack using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
a type parameter for the binary operator, a supertype of A
.
a neutral element for the fold operation; may be added to the result
an arbitrary number of times, and must not change the result (e.g., Nil
for list concatenation,
0 for addition, or 1 for multiplication.)
a binary operator that must be associative
the result of applying fold operator op
between all the elements and z
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.
the result type of the binary operator.
the start value.
the binary operator.
the result of inserting op
between consecutive elements of this stack,
going left to right with the start value z
on the left:
op(...op(z, x_1), x_2, ..., x_n)
where x_{1}, ..., x_{n}
are the elements of this stack.
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.
the result type of the binary operator.
the start value.
the binary operator.
the result of inserting op
between consecutive elements of this stack,
going right to left with the start value z
on the right:
op(x_1, op(x_2, ... op(x_n, z)...))
where x_{1}, ..., x_{n}
are the elements of this stack.
Tests whether a predicate holds for all elements of this stack.
Tests whether a predicate holds for all elements of this stack.
the predicate used to test elements.
true
if the given predicate p
holds for all elements
of this stack, otherwise false
.
[use case] 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.
the function that is applied for its side-effect to every element.
The result of function f
is discarded.
Returns string formatted according to given format
string.
Returns string formatted according to given format
string.
Format strings are as for String.format
(@see java.lang.String.format).
The generic builder that builds instances of Stack
at arbitrary element types.
The generic builder that builds instances of Stack
at arbitrary element types.
A representation that corresponds to the dynamic class of the receiver object.
A representation that corresponds to the dynamic class of the receiver object.
The nature of the representation is platform dependent.
a representation that corresponds to the dynamic class of the receiver object.
not specified by SLS as a member of AnyRef
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.
the type of keys returned by the discriminator function.
the discriminator function.
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
.
Partitions elements in fixed size stacks.
Partitions elements in fixed size stacks.
the number of elements per group
An iterator producing stacks of size size
, except the
last will be truncated if the elements don't divide evenly.
scala.collection.Iterator, method grouped
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.
true
if this collection is known to have finite size,
false
otherwise.
Calculate a hash code value for the object.
Calculate a hash code value for the object.
The default hashing algorithm is platform dependent.
Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)
) yet
not be equal (o1.equals(o2)
returns false
). A degenerate implementation could always return 0
.
However, it is required that if two objects are equal (o1.equals(o2)
returns true
) that they have
identical hash codes (o1.hashCode.equals(o2.hashCode)
). Therefore, when overriding this method, be sure
to verify that the behavior is consistent with the equals
method.
the hash code value for this object.
Selects the first element of this stack.
Selects the first element of this stack.
the first element of this stack.
if the stack is empty.
Optionally selects the first element.
Optionally selects the first element.
the first element of this stack if it is nonempty,
None
if it is empty.
[use case] 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.
the element value to search for.
the start index
the index >= from
of the first element of this stack that is equal (as determined by ==
)
to elem
, or -1
, if none exists.
[use case] Finds index of first occurrence of some value in this stack.
Finds index of first occurrence of some value in this stack.
the element value to search for.
the index of the first element of this stack that is equal (as determined by ==
)
to elem
, or -1
, if none exists.
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.
the sequence to test
the start index
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.
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.
the sequence to test
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.
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.
the predicate used to test elements.
the start index
the index >= from
of the first element of this stack that satisfies the predicate p
,
or -1
, if none exists.
Finds index of first element satisfying some predicate.
Finds index of first element satisfying some predicate.
the predicate used to test elements.
the index of the first element of this stack that satisfies the predicate p
,
or -1
, if none exists.
Produces the range of all indices of this sequence.
Produces the range of all indices of this sequence.
a Range
value from 0
to one less than the length of this stack.
Selects all elements except the last.
Selects all elements except the last.
a stack consisting of all elements of this stack except the last one.
if the stack is empty.
Iterates over the inits of this stack.
Iterates over the inits of this stack. The first value will be this
stack and the final one will be an empty stack, with the intervening
values the results of successive applications of init
.
an iterator over all the inits of this stack
List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)
[use case] Computes the multiset intersection between this stack and another sequence.
Computes the multiset intersection between this stack and another sequence.
the sequence of elements to intersect with.
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.
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]
.
the index to test
true
if this stack contains an element at position idx
, false
otherwise.
Checks if the stack is empty.
Checks if the stack is empty.
true, iff there is no element on the stack
Test whether the dynamic type of the receiver object is T0
.
Test whether the dynamic type of the receiver object is T0
.
Note that the result of the test is modulo Scala's erasure semantics.
Therefore the expression 1.isInstanceOf[String]
will return false
, while the
expression List(1).isInstanceOf[List[String]]
will return true
.
In the latter example, because the type argument is erased as part of compilation it is
not possible to check whether the contents of the list are of the specified type.
true
if the receiver object is an instance of erasure of type T0
; false
otherwise.
Tests whether this stack can be repeatedly traversed.
Tests whether this stack can be repeatedly traversed.
true
Returns an iterator over all elements on the stack.
Returns an iterator over all elements on the stack. This iterator is stable with respect to state changes in the stack object; i.e. such changes will not be reflected in the iterator. The iterator issues elements in the order they were inserted into the stack (FIFO order).
an iterator over all stack elements.
Selects the last element.
Selects the last element.
The last element of this stack.
If the stack is empty.
[use case] 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.
the element value to search for.
the end index.
the index <= end
of the last element of this stack that is equal (as determined by ==
)
to elem
, or -1
, if none exists.
[use case] Finds index of last occurrence of some value in this stack.
Finds index of last occurrence of some value in this stack.
the element value to search for.
the index of the last element of this stack that is equal (as determined by ==
)
to elem
, or -1
, if none exists.
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.
the sequence to test
the end index
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.
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.
the sequence to test
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.
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.
the predicate used to test elements.
the index <= end
of the last element of this stack that satisfies the predicate p
,
or -1
, if none exists.
Finds index of last element satisfying some predicate.
Finds index of last element satisfying some predicate.
the predicate used to test elements.
the index of the last element of this stack that satisfies the predicate p
,
or -1
, if none exists.
Optionally selects the last element.
Optionally selects the last element.
the last element of this stack$ if it is nonempty,
None
if it is empty.
Returns the length of this stack.
Returns the length of this stack.
the number of elements in this stack.
Compares the length of this stack to a test value.
Compares the length of this stack to a test value.
the test value that gets compared with the length.
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.
Turns this partial function into an plain function returning an Option
result.
Turns this partial function into an plain function returning an Option
result.
a function that takes an argument x
to Some(this(x))
if this
is defined for x
, and to None
otherwise.
Function.unlift
[use case] 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.
the element type of the returned collection.
the function to apply to each element.
a new stack resulting from applying the given function
f
to each element of this stack and collecting the results.
[use case] Finds the largest element.
Finds the largest element.
the largest element of this stack.
[use case] Finds the smallest element.
Finds the smallest element.
the smallest element of this stack
Displays all elements of this stack in a string.
Displays all elements of this stack in a string.
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.
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.
the separator string.
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
.
List(1, 2, 3).mkString("|") = "1|2|3"
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.
the starting string.
the separator string.
the ending string.
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
.
List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"
Equivalent to !(this eq that)
.
Equivalent to !(this eq that)
.
true
if the argument is not a reference to the receiver object; false
otherwise.
The builder that builds instances of type Stack
[A]
The builder that builds instances of type Stack
[A]
Tests whether the stack is not empty.
Tests whether the stack is not empty.
true
if the stack contains at least one element, false
otherwise.
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.
not specified by SLS as a member of AnyRef
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.
not specified by SLS as a member of AnyRef
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.
the argument type of the fallback function
the result type of the fallback function
the fallback function
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.
[use case] A copy of this stack with an element value appended until a given target length is reached.
A copy of this stack with an element value appended until a given target length is reached.
the target length
the padding value
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
.
Returns a parallel implementation of this collection.
Returns a parallel implementation of this collection.
For most collection types, this method creates a new parallel collection by copying
all the elements. For these collection, par
takes linear time. Mutable collections
in this category do not produce a mutable parallel collection that has the same
underlying dataset, so changes in one collection will not be reflected in the other one.
Specific collections (e.g. ParArray
or mutable.ParHashMap
) override this default
behaviour by creating a parallel collection which shares the same underlying dataset.
For these collections, par
takes constant or sublinear time.
All parallel collections return a reference to themselves.
a parallel implementation of this collection
The default par
implementation uses the combiner provided by this method
to create a new parallel collection.
The default par
implementation uses the combiner provided by this method
to create a new parallel collection.
a combiner for the parallel collection of type ParRepr
Partitions this stack in two stacks according to a predicate.
Partitions this stack in two stacks according to a predicate.
the predicate on which to partition.
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.
[use case] 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.
the index of the first replaced element
the number of elements to drop in the original stack
a new stack consisting of all elements of this stack
except that replaced
elements starting from from
are replaced
by patch
.
Iterates over distinct permutations.
Iterates over distinct permutations.
An Iterator which traverses the distinct permutations of this stack.
"abb".permutations = Iterator(abb, bab, bba)
Removes the top element from the stack.
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.
the predicate used to test elements.
the length of the longest prefix of this stack
such that every element of the segment satisfies the predicate p
.
[use case] Multiplies up the elements of this collection.
Multiplies up the elements of this collection.
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
.
Push an element on the stack.
Push an element on the stack.
the element to push on the stack.
the stack with the new element on top.
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.
the element sequence.
the stack with the new elements on top.
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.
the traversable object.
the stack with the new elements on top.
Reduces the elements of this stack using the specified associative binary operator.
Reduces the elements of this stack using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
A type parameter for the binary operator, a supertype of A
.
A binary operator that must be associative.
The result of applying reduce operator op
between all the elements if the stack is nonempty.
if this stack is empty.
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.
the result type of the binary operator.
the binary operator.
an option value containing the result of reduceLeft(op)
is this stack is nonempty,
None
otherwise.
Reduces the elements of this stack, if any, using the specified associative binary operator.
Reduces the elements of this stack, if any, using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
A type parameter for the binary operator, a supertype of A
.
A binary operator that must be associative.
An option value containing result of applying reduce operator op
between all
the elements if the collection is nonempty, and None
otherwise.
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.
the result type of the binary operator.
the binary operator.
the result of inserting op
between consecutive elements of this stack,
going right to left:
op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))
where x_{1}, ..., x_{n}
are the elements of this stack.
if this stack is empty.
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.
the result type of the binary operator.
the binary operator.
an option value containing the result of reduceRight(op)
is this stack is nonempty,
None
otherwise.
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.
Returns new stack wih elements in reversed order.
Returns new stack wih elements in reversed order.
A new stack with all elements of this stack in reversed order.
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.
an iterator yielding the elements of this stack 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.
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.
the element type of the returned collection.
the function to apply to each element.
a new stack resulting from applying the given function
f
to each element of this stack and collecting the results in reversed order.
Composes this partial function with an action function which gets applied to results of this partial function.
Composes this partial function with an action function which gets applied to results of this partial function. The action function is invoked only for its side effects; its result is ignored.
Note that expression pf.runWith(action)(x)
is equivalent to
if(pf isDefinedAt x) { action(pf(x)); true } else false
except that runWith
is implemented via applyOrElse
and thus potentially more efficient.
Using runWith
avoids double evaluation of pattern matchers and guards for partial function literals.
the action function
a function which maps arguments x
to isDefinedAt(x)
. The resulting function
runs action(this(x))
where this
is defined.
2.10
applyOrElse
.
[use case] 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.
the collection to compare with.
true
, if both collections contain the same elements in the same order, false
otherwise.
Computes a prefix scan of the elements of the collection.
Computes a prefix scan of the elements of the collection.
Note: The neutral element z
may be applied more than once.
element type of the resulting collection
type of the resulting collection
neutral element for the operator op
the associative operator for the scan
combiner factory which provides a combiner
a new stack containing the prefix scan of the elements in this stack
Produces a collection containing cumulative results of applying the operator going left to right.
Produces a collection containing cumulative results of applying the operator going left to right.
the type of the elements in the resulting collection
the actual type of the resulting collection
the initial value
the binary operator applied to the intermediate result and the element
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and the new element type B
.
collection with intermediate results
Produces a collection containing cumulative results of applying the operator going right to left.
Produces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative result.
Example:
List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
the type of the elements in the resulting collection
the actual type of the resulting collection
the initial value
the binary operator applied to the intermediate result and the element
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and the new element type B
.
collection with intermediate results
(Changed in version 2.9.0) The behavior of scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
Computes length of longest segment whose elements all satisfy some predicate.
Computes length of longest segment whose elements all satisfy some predicate.
the predicate used to test elements.
the index where the search starts.
the length of the longest segment of this stack starting from index from
such that every element of the segment satisfies the predicate p
.
A version of this collection with all of the operations implemented sequentially (i.
A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).
This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.
a sequential view of the collection.
The size of this stack, equivalent to length
.
The size of this stack, equivalent to length
.
the number of elements in this stack.
Selects an interval of elements.
Selects an interval of elements. The returned collection is made up
of all elements x
which satisfy the invariant:
from <= indexOf(x) < until
a stack containing the elements greater than or equal to
index from
extending up to (but not including) index until
of this stack.
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.)
the number of elements per group
the distance between the first elements of successive groups (defaults to 1)
An iterator producing stacks of size size
, except the
last and the only element will be truncated if there are
fewer elements than size.
scala.collection.Iterator, method sliding
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.)
the number of elements per group
An iterator producing stacks of size size
, except the
last and the only element will be truncated if there are
fewer elements than size.
scala.collection.Iterator, method sliding
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.
the target type of the transformation f
, and the type where
the ordering ord
is defined.
the transformation function mapping elements
to some other domain B
.
the ordering assumed on domain B
.
a stack consisting of the elements of this stack
sorted according to the ordering where x < y
if
ord.lt(f(x), f(y))
.
val words = "The quick brown fox jumped over the lazy dog".split(' ') // this works because scala.Ordering will implicitly provide an Ordering[Tuple2[Int, Char]] words.sortBy(x => (x.length, x.head)) res0: Array[String] = Array(The, dog, fox, the, lazy, over, brown, quick, jumped)
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 (as determined by
lt
) appear in the same order in the sorted sequence as in the original.
the comparison function which tests whether its first argument precedes its second argument in the desired ordering.
a stack consisting of the elements of this stack
sorted according to the comparison function lt
.
List("Steve", "Tom", "John", "Bob").sortWith(_.compareTo(_) < 0) = List("Bob", "John", "Steve", "Tom")
Sorts this stack according to an Ordering.
Sorts this stack according to an Ordering.
The sort is stable. That is, elements that are equal (as determined by
lt
) appear in the same order in the sorted sequence as in the original.
the ordering to be used to compare elements.
a stack consisting of the elements of this stack
sorted according to the ordering ord
.
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.
a pair consisting of the longest prefix of this stack whose
elements all satisfy p
, and the rest of this stack.
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)
.
the position at which to split.
a pair of stacks consisting of the first n
elements of this stack, and the other elements.
Tests whether this stack contains the given sequence at a given index.
Tests whether this stack contains the given sequence at a given index.
Note: If the both the receiver object this
and the argument
that
are infinite sequences this method may not terminate.
the sequence to test
the index where the sequence is searched.
true
if the sequence that
is contained in this stack at
index offset
, otherwise false
.
Tests whether this stack starts with the given sequence.
Tests whether this stack starts with the given sequence.
the sequence to test
true
if this collection has that
as a prefix, false
otherwise.
Defines the prefix of this object's toString
representation.
Defines the prefix of this object's toString
representation.
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.
[use case] Sums up the elements of this collection.
Sums up the elements of this collection.
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
.
Selects all elements except the first.
Selects all elements except the first.
a stack consisting of all elements of this stack except the first one.
if the stack is empty.
Iterates over the tails of this stack.
Iterates over the tails of this stack. The first value will be this
stack and the final one will be an empty stack, with the intervening
values the results of successive applications of tail
.
an iterator over all the tails of this stack
List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)
Selects first n elements.
Selects first n elements.
the number of elements to take from this stack.
a stack consisting only of the first n
elements of this stack,
or else the whole stack, if it has less than n
elements.
Selects last n elements.
Selects last n elements.
the number of elements to take
a stack consisting only of the last n
elements of this stack, or else the
whole stack, if it has less than n
elements.
Takes longest prefix of elements that satisfy a predicate.
Takes longest prefix of elements that satisfy a predicate.
the longest prefix of this stack whose elements all satisfy
the predicate p
.
The underlying collection seen as an instance of
.Stack
The underlying collection seen as an instance of
.
By default this is implemented as the current collection object itself,
but this can be overridden.
Stack
[use case] Converts this stack into another by copying all elements.
Converts this stack into another by copying all elements.
The collection type to build.
a new collection containing all elements of this stack.
[use case] Converts this stack to an array.
Converts this stack to an array.
an array containing all elements of this stack.
An ClassTag
must be available for the element type of this stack.
Converts this stack to a mutable buffer.
Converts this stack to a mutable buffer.
a buffer containing all elements of this stack.
A conversion from collections of type Repr
to
objects.Stack
A conversion from collections of type Repr
to
objects.
By default this is implemented as just a cast, but this can be overridden.
Stack
Converts this stack to an indexed sequence.
Converts this stack to an indexed sequence.
an indexed sequence containing all elements of this stack.
Converts this stack to an iterable collection.
Converts this stack to an iterable collection. Note that
the choice of target Iterable
is lazy in this default implementation
as this TraversableOnce
may be lazy and unevaluated (i.e. it may
be an iterator which is only traversable once).
an Iterable
containing all elements of this stack.
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.
an Iterator containing all elements of this stack.
Creates a list of all stack elements in FIFO order.
Creates a list of all stack elements in FIFO order.
the created list.
[use case] Converts this stack to a map.
Converts this stack to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.
a map of type immutable.Map[T, U]
containing all key/value pairs of type (T, U)
of this stack.
Converts this stack to a sequence.
Converts this stack to a sequence.
Overridden for efficiency.
a sequence containing all elements of this stack.
Converts this stack to a set.
Converts this stack to a set.
a set containing all elements of this stack.
Converts this stack to a stream.
Converts this stack to a stream.
a stream containing all elements of this stack.
Returns a string representation of the object.
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.
a Traversable containing all elements of this stack.
Converts this stack to a Vector.
Converts this stack to a Vector.
a vector containing all elements of this stack.
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.
the top element
Applies a transformation function to all values contained in this sequence.
Applies a transformation function to all values contained in this sequence. The transformation function produces new values from existing elements.
the transformation to apply
the sequence itself.
Transposes this stack of traversable collections into a stack of stacks.
Transposes this stack of traversable collections into a stack of stacks.
the type of the elements of each traversable collection.
an implicit conversion which asserts that the
element type of this stack is a Traversable
.
a two-dimensional stack of stacks which has as nth row the nth column of this stack.
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
if all collections in this stack are not of the same size.
[use case] 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.
the sequence to add.
a new stack which contains all elements of this stack
followed by all elements of that
.
Converts this stack of pairs into two collections of the first and second half of each pair.
Converts this stack of pairs into two collections of the first and second half of each pair.
the type of the first half of the element pairs
the type of the second half of the element pairs
an implicit conversion which asserts that the element type of this stack is a pair.
a pair stacks, containing the first, respectively second half of each element pair of this stack.
Converts this stack of triples into three collections of the first, second, and third element of each triple.
Converts this stack of triples into three collections of the first, second, and third element of each triple.
the type of the first member of the element triples
the type of the second member of the element triples
the type of the third member of the element triples
an implicit conversion which asserts that the element type of this stack is a triple.
a triple stacks, containing the first, second, respectively third member of each element triple of this stack.
Replace element at index n
with the new element newelem
.
[use case] A copy of this stack with one single replaced element.
A copy of this stack with one single replaced element.
the position of the replacement
the replacing element
a copy of this stack with the element at position index
replaced by elem
.
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)
the index of the first element of the view
the index of the element following the view
a non-strict view of a slice of this stack, starting at index from
and extending up to (but not including) index until
.
Creates a non-strict view of this stack.
Creates a non-strict view of this stack.
a non-strict view of this stack.
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.
the predicate used to test elements.
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
.
[use case] 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.
the type of the second half of the returned pairs
The iterable providing the second half of each result pair
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
.
[use case] 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.
the type of the second half of the returned pairs
The iterable providing the second half of each result pair
the element to be used to fill up the result if this stack is shorter than that
.
the element to be used to fill up the result if that
is shorter than this stack.
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.
[use case] Zips this stack with its indices.
Zips this stack with its indices.
A new stack containing pairs consisting of all elements of this
stack paired with their index. Indices start at 0
.
List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))
(stackProxy: MonadOps[A]).filter(p)
(stackProxy: MonadOps[A]).flatMap(f)
(stackProxy: MonadOps[A]).map(f)
(stackProxy: StringAdd).self
(stackProxy: StringFormat).self
(stackProxy: MonadOps[A]).withFilter(p)
A syntactic sugar for out of order folding.
A syntactic sugar for out of order folding. See fold
.
Example:
scala> val a = LinkedList(1,2,3,4) a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4) scala> val b = (a /:\ 5)(_+_) b: Int = 15
(Since version 2.10.0) use fold instead
(stackProxy: ArrowAssoc[StackProxy[A]]).x
(Since version 2.10.0) Use leftOfArrow
instead
(stackProxy: Ensuring[StackProxy[A]]).x
(Since version 2.10.0) Use resultOfEnsuring
instead
A stack implements a data structure which allows to store and retrieve objects in a last-in-first-out (LIFO) fashion.
type of the elements in this stack proxy.
1.0, 10/05/2004
1