The type implementing this traversable
The type implementing this traversable
A class supporting filtered operations .
o != arg0
is the same as !(o == (arg0))
.
o != arg0
is the same as !(o == (arg0))
.
the object to compare against this object for dis-equality .
false
if the receiver object is equivalent to the argument; true
otherwise.
[use case] Concatenates this traversable collection with the elements of a traversable collection .
Concatenates this traversable collection with the elements of a traversable collection .
the traversable to append .
a new traversable collection which contains all elements of this traversable collection
followed by all elements of that
.
Concatenates this traversable collection with the elements of a traversable collection .
Concatenates this traversable collection with the elements of a traversable collection .
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
and the new element type B
.
a new collection of type That
which contains all elements of this traversable collection
followed by all elements of that
.
Applies a binary operator to a start value and all elements of this traversable collection, going left to right .
Applies a binary operator to a start value and all elements of this traversable collection, going left to right .
Note: /:
is alternate syntax for foldLeft
; z /: xs
is the same as xs foldLeft z
.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
the result type of the binary operator .
the start value .
the binary operator .
the result of inserting op
between consecutive elements of this traversable collection,
going left to right with the start value z
on the left:
op(...op(op(z, x1), x2), ..., xn)
where x,,1,,, ..., x,,n,,
are the elements of this traversable collection.
Applies a binary operator to all elements of this traversable collection and a start value, going right to left .
Applies a binary operator to all elements of this traversable collection and a start value, going right to left .
Note: :\
is alternate syntax for foldRight
; xs :\ z
is the same as xs foldRight z
.
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
the result type of the binary operator .
the start value
the binary operator
the result of inserting op
between consecutive elements of this traversable collection,
going right to left with the start value z
on the right:
op(x1, op(x2, ... op(xn, z)...))
where x,,1,,, ..., x,,n,,
are the elements of this traversable collection.
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)
.
the object to compare against this object for equality .
true
if the receiver object is equivalent to the argument; false
otherwise.
o == arg0
is the same as o.equals(arg0)
.
o == arg0
is the same as o.equals(arg0)
.
the object to compare against this object for equality .
true
if the receiver object is equivalent to the argument; false
otherwise.
Appends all elements of this traversable collection to a string builder .
Appends all elements of this traversable collection to a string builder.
The written text consists of the string representations (w.r.t. the method toString
)
of all elements of this traversable collection without any separator string.
the string builder to which elements are appended .
the string builder b
to which elements were appended.
Appends all elements of this traversable collection to a string builder using a separator string .
Appends all elements of this traversable collection 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 traversable collection, separated by the string sep
.
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 traversable collection to a string builder using start, end, and separator strings .
Appends all elements of this traversable collection 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 traversable collection are separated by the string sep
.
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.
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.
the receiver object .
This method creates and returns a copy of the receiver object .
This method creates and returns a copy of the receiver object .
The default implementation of the clone
method is platform dependent.
a copy of the receiver object .
[use case] Builds a new collection by applying a partial function to all elements of this traversable collection on which the function is defined .
Builds a new collection by applying a partial function to all elements of this traversable collection on which the function is defined .
the element type of the returned collection .
the partial function which filters and maps the traversable collection .
a new traversable collection 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.
Builds a new collection by applying a partial function to all elements of this traversable collection on which the function is defined .
Builds a new collection by applying a partial function to all elements of this traversable collection on which the function is defined .
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 partial function which filters and maps the traversable collection .
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and
and the new element type B
.
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.
[use case] Copies elements of this traversable collection to an array .
Copies elements of this traversable collection to an array.
Fills the given array xs
with at most len
elements of
this traversable collection, starting at position start
.
Copying will stop once either the end of the current traversable collection 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 .
Copies elements of this traversable collection to an array .
Copies elements of this traversable collection to an array.
Fills the given array xs
with at most len
elements of
this traversable collection, starting at position start
.
Copying will stop once either the end of the current traversable collection is reached,
or the end of the array is reached, or len
elements have been copied.
Note: will not terminate for infinite-sized collections.
the type of the elements of the array .
the array to fill .
the starting index .
the maximal number of elements to copy .
[use case] Copies values of this traversable collection to an array .
Copies values of this traversable collection to an array.
Fills the given array xs
with values of this traversable collection.
Copying will stop once either the end of the current traversable collection is reached,
or the end of the array is reached.
the array to fill .
Copies values of this traversable collection to an array .
Copies values of this traversable collection to an array.
Fills the given array xs
with values of this traversable collection.
Copying will stop once either the end of the current traversable collection is reached,
or the end of the array is reached.
Note: will not terminate for infinite-sized collections.
the type of the elements of the array .
the array to fill .
[use case] Copies values of this traversable collection to an array .
Copies values of this traversable collection to an array.
Fills the given array xs
with values of this traversable collection, after skipping start
values.
Copying will stop once either the end of the current traversable collection is reached,
or the end of the array is reached.
the array to fill .
the starting index .
Copies values of this traversable collection to an array .
Copies values of this traversable collection to an array.
Fills the given array xs
with values of this traversable collection, after skipping start
values.
Copying will stop once either the end of the current traversable collection is reached,
or the end of the array is reached.
Note: will not terminate for infinite-sized collections.
the type of the elements of the array .
the array to fill .
the starting index .
Copies all elements of this traversable collection to a buffer .
Copies all elements of this traversable collection to a buffer .
Note: will not terminate for infinite-sized collections.
The buffer to which elements are copied .
Counts the number of elements in the traversable collection which satisfy a predicate .
Counts the number of elements in the traversable collection which satisfy a predicate .
the predicate used to test elements .
the number of elements satisfying the predicate p
.
Selects all elements except first n ones.
Selects all elements except first n ones.
Note: might return different results for different runs, unless the underlying collection type is ordered.
the number of elements to drop from this traversable collection .
a traversable collection consisting of all elements of this traversable collection except the first n
ones, or else the
empty traversable collection, if this traversable collection has less than n
elements.
Drops longest prefix of elements that satisfy a predicate .
Drops longest prefix of elements that satisfy a predicate .
Note: might return different results for different runs, unless the underlying collection type is ordered.
The predicate used to test elements .
the longest suffix of this traversable collection whose first element
does not satisfy the predicate p
.
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
).
the object to compare against this object for reference equality .
true
if the argument is a reference to the receiver object; false
otherwise.
This method is used to compare the receiver object (this
) with the argument object (arg0
) for equivalence.
This method is used to compare the receiver object (this
) with the argument object (arg0
) for equivalence.
The default implementations of this method is an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence
relation]:
* It is reflexive: for any instance x
of type Any
, x.equals(x)
should return true
.
* It is symmetric: for any instances x
and y
of type Any
, x.equals(y)
should return true
if and
only if y.equals(x)
returns true
.
* It is transitive: for any instances 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 often necessary to override hashCode
to ensure that objects
that 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 traversable collection .
Tests whether a predicate holds for some of the elements of this traversable collection .
Note: may not terminate for infinite-sized collections.
the predicate used to test elements .
true
if the given predicate p
holds for some of the elements
of this traversable collection, otherwise false
.
Selects all elements of this traversable collection which satisfy a predicate .
Selects all elements of this traversable collection which satisfy a predicate .
the predicate used to test elements .
a new traversable collection consisting of all elements of this traversable collection that satisfy the given
predicate p
. The order of the elements is preserved.
Selects all elements of this traversable collection which do not satisfy a predicate .
Selects all elements of this traversable collection which do not satisfy a predicate .
the predicate used to test elements .
a new traversable collection consisting of all elements of this traversable collection that do not satisfy the given
predicate p
. The order of the elements is preserved.
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 finalize
and non-local returns and exceptions, are all platform dependent.
Finds the first element of the traversable collection satisfying a predicate, if any .
Finds the first element of the traversable collection satisfying a predicate, if any .
Note: may not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
the predicate used to test elements .
an option value containing the first element in the traversable collection
that satisfies p
, or None
if none exists.
[use case] Builds a new collection by applying a function to all elements of this traversable collection and concatenating the results .
Builds a new collection by applying a function to all elements of this traversable collection and concatenating the results .
the element type of the returned collection .
the function to apply to each element .
a new traversable collection resulting from applying the given collection-valued function
f
to each element of this traversable collection and concatenating the results.
Builds a new collection by applying a function to all elements of this traversable collection and concatenating the results .
Builds a new collection by applying a function to all elements of this traversable collection and concatenating the results .
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 function to apply to each element .
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and
and the new element type B
.
a new collection of type That
resulting from applying the given collection-valued function
f
to each element of this traversable collection and concatenating the results.
Applies a binary operator to a start value and all elements of this traversable collection, going left to right .
Applies a binary operator to a start value and all elements of this traversable collection, going left to right .
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
the result type of the binary operator .
the start value .
the binary operator .
the result of inserting op
between consecutive elements of this traversable collection,
going left to right with the start value z
on the left:
op(...op(z, x1), x2, ..., xn)
where x,,1,,, ..., x,,n,,
are the elements of this traversable collection.
Applies a binary operator to all elements of this traversable collection and a start value, going right to left .
Applies a binary operator to all elements of this traversable collection and a start value, going right to left .
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
the result type of the binary operator .
the start value .
the binary operator .
the result of inserting op
between consecutive elements of this traversable collection,
going right to left with the start value z
on the right:
op(x1, op(x2, ... op(xn, z)...))
where x,,1,,, ..., x,,n,,
are the elements of this traversable collection.
Tests whether a predicate holds for all elements of this traversable collection .
Tests whether a predicate holds for all elements of this traversable collection .
Note: may not terminate for infinite-sized collections.
the predicate used to test elements .
true
if the given predicate p
holds for all elements
of this traversable collection, otherwise false
.
[use case] Applies a function f
to all elements of this traversable collection.
Applies a function f
to all elements of this traversable collection.
the function that is applied for its side-effect to every element.
The result of function f
is discarded.
Applies a function f
to all elements of this traversable collection.
Applies a function f
to all elements of this traversable collection.
Note: this method underlies the implementation of most other bulk operations. It's important to implement this method in an efficient way.
the type parameter describing the result of function f
.
This result will always be ignored. Typically U
is Unit
,
but this is not necessary.
the function that is applied for its side-effect to every element.
The result of function f
is discarded.
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.
a representation that corresponds to the dynamic class of the receiver object .
Partitions this traversable collection into a map of traversable collections according to some discriminator function .
Partitions this traversable collection into a map of traversable collections 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 traversable collection.
the type of keys returned by the discriminator function .
the discriminator function .
A map from keys to traversable collections 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 traversable collection of those elements x
for which f(x)
equals k
.
Tests whether this traversable collection is known to have a finite size .
Tests whether this traversable collection 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.
Returns a hash code value for the object .
Returns 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 the object .
Selects the first element of this traversable collection .
Selects the first element of this traversable collection .
Note: might return different results for different runs, unless the underlying collection type is ordered.
the first element of this traversable collection .
Optionally selects the first element .
Optionally selects the first element .
Note: might return different results for different runs, unless the underlying collection type is ordered.
the first element of this traversable collection if it is nonempty, None
if it is empty.
Selects all elements except the last .
Selects all elements except the last .
Note: might return different results for different runs, unless the underlying collection type is ordered.
a traversable collection consisting of all elements of this traversable collection except the last one .
Tests whether this traversable collection is empty .
Tests whether this traversable collection is empty .
true
if the traversable collection contain no elements, false
otherwise.
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.
true
if the receiver object is an instance of erasure of type T0
; false
otherwise.
Tests whether this traversable collection can be repeatedly traversed .
Tests whether this traversable collection can be repeatedly traversed .
true
Selects the last element .
Selects the last element .
Note: might return different results for different runs, unless the underlying collection type is ordered.
the first element of this traversable collection .
Optionally selects the last element .
Optionally selects the last element .
Note: might return different results for different runs, unless the underlying collection type is ordered.
the last element of this traversable collection$ if it is nonempty, None
if it is empty.
[use case] Builds a new collection by applying a function to all elements of this traversable collection .
Builds a new collection by applying a function to all elements of this traversable collection .
the element type of the returned collection .
the function to apply to each element .
a new traversable collection resulting from applying the given function
f
to each element of this traversable collection and collecting the results.
Builds a new collection by applying a function to all elements of this traversable collection .
Builds a new collection by applying a function to all elements of this traversable collection .
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 function to apply to each element .
an implicit value of class CanBuildFrom
which determines the
result class That
from the current representation type Repr
and
and the new element type B
.
a new collection of type That
resulting from applying the given function
f
to each element of this traversable collection and collecting the results.
[use case] Finds the largest element .
Finds the largest element .
the largest element of this traversable collection .
Finds the largest element .
Finds the largest element .
The type over which the ordering is defined .
An ordering to be used for comparing elements .
the largest element of this traversable collection with respect to the ordering cmp
.
[use case] Finds the smallest element .
Finds the smallest element .
the smallest element of this traversable collection
Finds the smallest element .
Finds the smallest element .
The type over which the ordering is defined .
An ordering to be used for comparing elements .
the smallest element of this traversable collection with respect to the ordering cmp
.
Displays all elements of this traversable collection in a string .
Displays all elements of this traversable collection in a string .
a string representation of this traversable collection. In the resulting string
the string representations (w.r.t. the method toString
)
of all elements of this traversable collection follow each other without any separator string.
Displays all elements of this traversable collection in a string using a separator string .
Displays all elements of this traversable collection in a string using a separator string .
the separator string .
a string representation of this traversable collection. In the resulting string
the string representations (w.r.t. the method toString
)
of all elements of this traversable collection are separated by the string sep
.
Displays all elements of this traversable collection in a string using start, end, and separator strings .
Displays all elements of this traversable collection in a string using start, end, and separator strings .
the starting string .
the separator string .
the ending string .
a string representation of this traversable collection. 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 traversable collection are separated by the string sep
.
o.ne(arg0)
is the same as !(o.eq(arg0))
.
o.ne(arg0)
is the same as !(o.eq(arg0))
.
the object to compare against this object for reference dis-equality .
false
if the argument is not a reference to the receiver object; true
otherwise.
Creates a new builder for this collection type .
Creates a new builder for this collection type .
Tests whether the traversable collection is not empty .
Tests whether the traversable collection is not empty .
true
if the traversable collection 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 .
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 .
Partitions this traversable collection in two traversable collections according to a predicate .
Partitions this traversable collection in two traversable collections according to a predicate .
the predicate on which to partition .
a pair of traversable collections: the first traversable collection consists of all elements that
satisfy the predicate p
and the second traversable collection consists of all elements
that don't. The relative order of the elements in the resulting traversable collections
is the same as in the original traversable collection.
[use case] Multiplies up the elements of this collection .
Multiplies up the elements of this collection .
the product of all elements in this traversable collection 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 traversable collection and as result type of product
.
Examples of such types are: Long
, Float
, Double
, BigInt
.
Multiplies up the elements of this collection .
Multiplies up the elements of this collection .
the result type of the *
operator.
an implicit parameter defining a set of numeric operations
which includes the *
operator to be used in forming the product.
the product of all elements of this traversable collection with respect to the *
operator in num
.
Applies a binary operator to all elements of this traversable collection, going left to right .
Applies a binary operator to all elements of this traversable collection, going left to right .
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
the result type of the binary operator .
the binary operator .
the result of inserting op
between consecutive elements of this traversable collection,
going left to right:
op(...(op(x1, x2), ... ) , xn)
where x,,1,,, ..., x,,n,,
are the elements of this traversable collection.
Optionally applies a binary operator to all elements of this traversable collection, going left to right .
Optionally applies a binary operator to all elements of this traversable collection, going left to right .
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
the result type of the binary operator .
the binary operator .
an option value containing the result of reduceLeft(op)
is this traversable collection is nonempty,
None
otherwise.
Applies a binary operator to all elements of this traversable collection, going right to left .
Applies a binary operator to all elements of this traversable collection, going right to left .
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
the result type of the binary operator .
the binary operator .
the result of inserting op
between consecutive elements of this traversable collection,
going right to left:
op(x1, op(x2, ..., op(xn-1, xn)...))
where x,,1,,, ..., x,,n,,
are the elements of this traversable collection.
Optionally applies a binary operator to all elements of this traversable collection, going right to left .
Optionally applies a binary operator to all elements of this traversable collection, going right to left .
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.
the result type of the binary operator .
the binary operator .
an option value containing the result of reduceRight(op)
is this traversable collection is nonempty,
None
otherwise.
The collection of type traversable collection underlying this TraversableLike
object.
The collection of type traversable collection underlying this TraversableLike
object.
By default this is implemented as the TraversableLike
object itself, but this can be overridden.
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 .
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
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
and the new element type B
.
collection with intermediate results
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 .
Note: will not terminate for infinite-sized collections.
Note: might return different results for different runs, unless the underlying collection type is ordered.
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
and the new element type B
.
collection with intermediate results
The size of this traversable collection .
The size of this traversable collection .
Note: will not terminate for infinite-sized collections.
the number of elements in this traversable collection .
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)
Note: might return different results for different runs, unless the underlying collection type is ordered.
the index of the first returned element in this traversable collection .
the index one past the last returned element in this traversable collection .
a traversable collection containing the elements starting at index from
and extending up to (but not including) index until
of this traversable collection.
Splits this traversable collection into a prefix/suffix pair according to a predicate .
Splits this traversable collection 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.
Note: might return different results for different runs, unless the underlying collection type is ordered.
the test predicate
a pair consisting of the longest prefix of this traversable collection whose
elements all satisfy p
, and the rest of this traversable collection.
Splits this traversable collection into two at a given position .
Splits this traversable collection into two at a given position.
Note: c splitAt n
is equivalent to (but possibly more efficient than)
(c take n, c drop n)
.
Note: might return different results for different runs, unless the underlying collection type is ordered.
the position at which to split .
a pair of traversable collections consisting of the first n
elements of this traversable collection, and the other elements.
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 traversable collection.
By default the string prefix is the simple name of the collection class traversable collection.
[use case] Sums up the elements of this collection .
Sums up the elements of this collection .
the sum of all elements in this traversable collection 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 traversable collection and as result type of sum
.
Examples of such types are: Long
, Float
, Double
, BigInt
.
Sums up the elements of this collection .
Sums up the elements of this collection .
the result type of the +
operator.
an implicit parameter defining a set of numeric operations
which includes the +
operator to be used in forming the sum.
the sum of all elements of this traversable collection with respect to the +
operator in num
.
Selects all elements except the first .
Selects all elements except the first .
Note: might return different results for different runs, unless the underlying collection type is ordered.
a traversable collection consisting of all elements of this traversable collection except the first one .
Selects first n elements.
Selects first n elements.
Note: might return different results for different runs, unless the underlying collection type is ordered.
Tt number of elements to take from this traversable collection .
a traversable collection consisting only of the first n
elements of this traversable collection, or else the
whole traversable collection, 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 .
Note: might return different results for different runs, unless the underlying collection type is ordered.
The predicate used to test elements .
the longest prefix of this traversable collection whose elements all satisfy
the predicate p
.
The underlying collection seen as an instance of Traversable
.
The underlying collection seen as an instance of Traversable
.
By default this is implemented as the current collection object itself,
but this can be overridden.
[use case] Converts this traversable collection to an array .
Converts this traversable collection to an array .
Note: will not terminate for infinite-sized collections.
an array containing all elements of this traversable collection.
A ClassManifest
must be available for the element type of this traversable collection.
Converts this traversable collection to an array .
Converts this traversable collection to an array .
Note: will not terminate for infinite-sized collections.
the type of the elements of the array. A ClassManifest
for this type must
be available.
an array containing all elements of this traversable collection .
A conversion from collections of type Repr
to Traversable
objects.
A conversion from collections of type Repr
to Traversable
objects.
By default this is implemented as just a cast, but this can be overridden.
Converts this traversable collection to an indexed sequence .
Converts this traversable collection to an indexed sequence .
Note: will not terminate for infinite-sized collections.
an indexed sequence containing all elements of this traversable collection .
Converts this traversable collection to an iterable collection .
Converts this traversable collection to an iterable collection .
Note: will not terminate for infinite-sized collections.
an Iterable
containing all elements of this traversable collection.
Returns an Iterator over the elements in this traversable collection .
Returns an Iterator over the elements in this traversable collection . Will return the same Iterator if this instance is already an Iterator.
Note: will not terminate for infinite-sized collections.
an Iterator containing all elements of this traversable collection .
Converts this traversable collection to a list .
Converts this traversable collection to a list .
Note: will not terminate for infinite-sized collections.
a list containing all elements of this traversable collection .
Converts this traversable collection to a map .
Converts this traversable collection 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.
Note: will not terminate for infinite-sized collections.
a map containing all elements of this traversable collection .
Converts this traversable collection to a sequence .
Converts this traversable collection to a sequence .
Note: will not terminate for infinite-sized collections.
a sequence containing all elements of this traversable collection .
Converts this traversable collection to a set .
Converts this traversable collection to a set .
Note: will not terminate for infinite-sized collections.
a set containing all elements of this traversable collection .
Converts this traversable collection to a stream .
Converts this traversable collection to a stream .
Note: will not terminate for infinite-sized collections.
a stream containing all elements of this traversable collection .
Converts this traversable collection to a string .
Converts this traversable collection to a string .
a string representation of this collection. By default this
string consists of the stringPrefix
of this traversable collection,
followed by all elements separated by commas and enclosed in parentheses.
Converts this traversable collection to an unspecified Traversable .
Converts this traversable collection to an unspecified Traversable . Will return the same collection if this instance is already Traversable.
Note: will not terminate for infinite-sized collections.
a Traversable containing all elements of this traversable collection .
Creates a non-strict view of a slice of this traversable collection .
Creates a non-strict view of a slice of this traversable collection .
Note: the difference between view
and slice
is that view
produces
a view of the current traversable collection, whereas slice
produces a new traversable collection.
Note: view(from, to)
is equivalent to view.slice(from, to)
Note: might return different results for different runs, unless the underlying collection type is ordered.
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 traversable collection, starting at index from
and extending up to (but not including) index until
.
Creates a non-strict view of this traversable collection .
Creates a non-strict view of this traversable collection .
a non-strict view of this traversable collection .
Creates a non-strict filter of this traversable collection .
Creates a non-strict filter of this traversable collection .
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.
Note: might return different results for different runs, unless the underlying collection type is ordered.
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 traversable collection which
satisfy the predicate p
.
A template trait for traversable collections of type
Traversable[A]
.This is a base trait of all kinds of Scala collections. It implements the behavior common to all collections, in terms of a method
foreach
with signature:Collection classes mixing in this trait provide a concrete
foreach
method which traverses all the elements contained in the collection, applying a given function to each. They also need to provide a methodnewBuilder
which creates a builder for collections of the same kind.A traversable class might or might not have two properties: strictness and orderedness. Neither is represented as a type.
The instances of a strict collection class have all their elements computed before they can be used as values. By contrast, instances of a non-strict collection class may defer computation of some of their elements until after the instance is available as a value. A typical example of a non-strict collection class is a
scala.collection.immutable.Stream
. A more general class of examples areTraversableViews
.If a collection is an instance of an ordered collection class, traversing its elements with
foreach
will always visit elements in the same order, even for different runs of the program. If the class is not ordered,foreach
can visit elements in different orders for different runs (but it will keep the same order in the same run).'A typical example of a collection class which is not ordered is a
HashMap
of objects. The traversal order for hash maps will depend on the hash codes of its elements, and these hash codes might differ from one run to the next. By contrast, aLinkedHashMap
is ordered because it'sforeach
method visits elements in the order they were inserted into theHashMap
.the element type of the collection
the type of the actual collection containing the elements .
version
2 . 8
since
2 . 8
authors:
Martin Odersky