scala.collection.parallel.ParSeqLike
A flexible iterator for transforming an Iterator[A] into an
Iterator[Seq[A]], with configurable sequence size, step, and
strategy for dealing with elements which don't fit evenly.
Creates a copy of this iterator.
Creates a copy of this iterator.
Tests whether this iterator can provide another element.
Tests whether this iterator can provide another element.
true if a subsequent call to next will yield an element,
false otherwise.
Produces the next element of this iterator.
Produces the next element of this iterator.
the next element of this iterator, if hasNext is true,
undefined behavior otherwise.
Splits the splitter into disjunct views.
Splits the splitter into disjunct views.
This overloaded version of the split method is specific to precise splitters.
It returns a sequence of splitters, each iterating some subset of the
elements in this splitter. The sizes of the subsplitters in the partition is equal to
the size in the corresponding argument, as long as there are enough elements in this
splitter to split it that way.
If there aren't enough elements, a zero element splitter is appended for each additional argument. If there are additional elements, an additional splitter is appended at the end to compensate.
For example, say we have a splitter ps with 100 elements. Invoking:
ps.split(50, 25, 25, 10, 5)
will return a sequence of five splitters, last two views being empty. On the other hand, calling:
ps.split(50, 40)
will return a sequence of three splitters, last of them containing ten elements.
Note: this method actually invalidates the current splitter.
Unlike the case with split found in splitters, views returned by this method can be empty.
the sizes used to split this split iterator into iterators that traverse disjunct subsets
a sequence of disjunct subsequence iterators of this parallel iterator
The number of elements this iterator has yet to traverse.
The number of elements this iterator has yet to traverse. This method
doesn't change the state of the iterator. Unlike the version of this method in the supertrait,
method remaining in ParSeqLike.this.ParIterator must return an exact number
of elements remaining in the iterator.
an exact number of elements this iterator has yet to iterate
Splits the iterator into a sequence of disjunct views.
Splits the iterator into a sequence of disjunct views.
Returns a sequence of split iterators, each iterating over some subset of the elements in the collection. These subsets are disjoint and should be approximately equal in size. These subsets are not empty, unless the iterator is empty in which case this method returns a sequence with a single empty iterator. If the splitter has more than two elements, this method will return two or more splitters.
Implementors are advised to keep this partition relatively small - two splitters are already enough when partitioning the collection, although there may be a few more.
Note: this method actually invalidates the current splitter.
a sequence of disjunct iterators of the collection
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.
Equivalent to x.hashCode except for boxed numeric types.
For numerics, it returns a hash value which is consistent
with value equality: if two value type instances compare
as true, then ## will produce the same hash value for each
of them.
a hash value consistent with ==
[use case] Concatenates this iterator with another.
Concatenates this iterator with another.
the other iterator
a new iterator that first yields the values produced by this
iterator followed by the values produced by iterator that.
Concatenates this iterator with another.
Concatenates this iterator with another.
the other iterator
a new iterator that first yields the values produced by this
iterator followed by the values produced by iterator that.
Applies a binary operator to a start value and all elements of this traversable or iterator, going left to right.
Applies a binary operator to a start value and all elements of this traversable or iterator, 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 iterators.
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 or iterator,
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 traversable or iterator.
A syntactic sugar for out of order folding.
A syntactic sugar for out of order folding. See fold.
Applies a binary operator to all elements of this traversable or iterator and a start value, going right to left.
Applies a binary operator to all elements of this traversable or iterator 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 iterators.
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 or iterator,
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 traversable or iterator.
Test two objects for equality.
Test two objects for equality.
true if the receiver object is equivalent to the argument; false otherwise.
Sends an abort signal to other workers.
Sends an abort signal to other workers.
Abort flag being true means that a worker can abort and produce whatever result,
since its result will not affect the final result of computation. An example
of operations using this are find, forall and exists methods.
Appends all elements of this traversable or iterator to a string builder.
Appends all elements of this traversable or iterator to a string builder.
The written text consists of the string representations (w.r.t. the method
toString) of all elements of this traversable or iterator 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 or iterator to a string builder using a separator string.
Appends all elements of this traversable or iterator 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 or iterator, 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 or iterator to a string builder using start, end, and separator strings.
Appends all elements of this traversable or iterator 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 or iterator 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.
Aggregates the results of applying an operator to subsequent elements.
Aggregates the results of applying an operator to subsequent elements.
This is a more general form of fold and reduce. It has similar semantics, but does
not require the result to be a supertype of the element type. It traverses the elements in
different partitions sequentially, using seqop to update the result, and then
applies combop to results from different partitions. The implementation of this
operation may operate on an arbitrary number of collection partitions, so combop
may be invoked arbitrary number of times.
For example, one might want to process some elements and then produce a Set. In this
case, seqop would process an element and append it to the list, while combop
would concatenate two lists from different partitions together. The initial value
z would be an empty set.
pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)
Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).
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
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.
Creates a buffered iterator from this iterator.
Creates a buffered iterator from this iterator.
a buffered iterator producing the same values as this iterator.
BufferedIterator
Create a copy of the receiver object.
Creates an iterator by transforming values produced by this iterator with a partial function, dropping those values for which the partial function is not defined.
Creates an iterator by transforming values produced by this iterator with a partial function, dropping those values for which the partial function is not defined.
the partial function which filters and maps the iterator.
a new iterator which yields each value x produced by this iterator for
which pf is defined the image pf(x).
"This collect implementation bears no relationship to the one before 2.8.\n"+ "The previous behavior can be reproduced with toSeq."
Finds the first element of the traversable or iterator for which the given partial function is defined, and applies the partial function to it.
Finds the first element of the traversable or iterator for which the given partial function is defined, and applies the partial function to it.
Note: may not terminate for infinite iterators.
Note: might return different results for different runs, unless the underlying collection type is ordered.
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)
Tests whether this iterator contains a given value as an element.
Tests whether this iterator contains a given value as an element.
Note: may not terminate for infinite iterators.
the element to test.
true if this iterator produces some value that is
is equal (wrt ==) to elem, false otherwise.
[use case] Copies selected values produced by this iterator to an array.
Copies selected values produced by this iterator to an array.
Fills the given array xs starting at index start with at most
len values produced by this iterator.
Copying will stop once either the end of the current iterator 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 selected values produced by this iterator to an array.
Copies selected values produced by this iterator to an array.
Fills the given array xs starting at index start with at most
len values produced by this iterator.
Copying will stop once either the end of the current iterator is reached,
or the end of the array is reached, or len elements have been copied.
Note: will not terminate for infinite iterators.
the maximal number of elements to copy.
[use case] Copies values of this traversable or iterator to an array.
Copies values of this traversable or iterator to an array.
Fills the given array xs with values of this traversable or iterator.
Copying will stop once either the end of the current traversable or iterator is reached,
or the end of the array is reached.
the array to fill.
Copies values of this traversable or iterator to an array.
Copies values of this traversable or iterator to an array.
Fills the given array xs with values of this traversable or iterator.
Copying will stop once either the end of the current traversable or iterator is reached,
or the end of the array is reached.
Note: will not terminate for infinite iterators.
the type of the elements of the array.
the array to fill.
[use case] Copies values of this traversable or iterator to an array.
Copies values of this traversable or iterator to an array.
Fills the given array xs with values of this traversable or iterator, beginning at index start.
Copying will stop once either the end of the current traversable or iterator is reached,
or the end of the array is reached.
the array to fill.
the starting index.
Copies values of this traversable or iterator to an array.
Copies values of this traversable or iterator to an array.
Fills the given array xs with values of this traversable or iterator, beginning at index start.
Copying will stop once either the end of the current traversable or iterator is reached,
or the end of the array is reached.
Note: will not terminate for infinite iterators.
the type of the elements of the array.
the array to fill.
the starting index.
Copies all elements of this traversable or iterator to a buffer.
Copies all elements of this traversable or iterator to a buffer.
Note: will not terminate for infinite iterators.
The buffer to which elements are copied.
Counts the number of elements in the traversable or iterator which satisfy a predicate.
Counts the number of elements in the traversable or iterator which satisfy a predicate.
the predicate used to test elements.
the number of elements satisfying the predicate p.
Advances this iterator past the first n elements, or the length of the iterator, whichever is smaller.
Advances this iterator past the first n elements, or the length of the iterator, whichever is smaller.
the number of elements to drop
an iterator which produces all values of the current iterator, except
it omits the first n values.
Skips longest sequence of elements of this iterator which satisfy given
predicate p, and returns an iterator of the remaining elements.
Skips longest sequence of elements of this iterator which satisfy given
predicate p, and returns an iterator of the remaining elements.
the predicate used to skip elements.
an iterator consisting of the remaining elements
Creates two new iterators that both iterate over the same elements as this iterator (in the same order).
Creates two new iterators that both iterate over the same elements as this iterator (in the same order). The duplicate iterators are considered equal if they are positioned at the same element.
a pair of iterators
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.
The equality method for reference types.
Tests whether a predicate holds for some of the values produced by this iterator.
Tests whether a predicate holds for some of the values produced by this iterator.
Note: may not terminate for infinite iterators.
the predicate used to test elements.
true if the given predicate p holds for some of the values
produced by this iterator, otherwise false.
Returns an iterator over all the elements of this iterator that
satisfy the predicate p.
Returns an iterator over all the elements of this iterator that
satisfy the predicate p. The order of the elements
is preserved.
the predicate used to test values.
an iterator which produces those values of this iterator which satisfy the predicate p.
Creates an iterator over all the elements of this iterator which do not satisfy a predicate p.
Creates an iterator over all the elements of this iterator which do not satisfy a predicate p.
the predicate used to test values.
an iterator which produces those values of this iterator which do not satisfy the predicate p.
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.
Finds the first value produced by the iterator satisfying a predicate, if any.
Finds the first value produced by the iterator satisfying a predicate, if any.
Note: may not terminate for infinite iterators.
the predicate used to test values.
an option value containing the first value produced by the iterator that satisfies
predicate p, or None if none exists.
Creates a new iterator by applying a function to all values produced by this iterator and concatenating the results.
Creates a new iterator by applying a function to all values produced by this iterator and concatenating the results.
the function to apply on each element.
the iterator resulting from applying the given iterator-valued function
f to each value produced by this iterator and concatenating the results.
Folds the elements of this sequence using the specified associative binary operator.
Folds the elements of this sequence using the specified associative binary operator. The order in which the elements are reduced is unspecified and may be nondeterministic.
Note this method has a different signature than the foldLeft
and foldRight methods of the trait Traversable.
The result of folding may only be a supertype of this parallel collection's
type parameter T.
a type parameter for the binary operator, a supertype of T.
a neutral element for the fold operation, it may be added to the result
an arbitrary number of times, not changing the result (e.g. Nil for list concatenation,
0 for addition, or 1 for multiplication)
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 traversable or iterator, going left to right.
Applies a binary operator to a start value and all elements of this traversable or iterator, going left to right.
Note: will not terminate for infinite iterators.
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 or iterator,
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 traversable or iterator.
Applies a binary operator to all elements of this traversable or iterator and a start value, going right to left.
Applies a binary operator to all elements of this traversable or iterator and a start value, going right to left.
Note: will not terminate for infinite iterators.
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 or iterator,
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 traversable or iterator.
Tests whether a predicate holds for all values produced by this iterator.
Tests whether a predicate holds for all values produced by this iterator.
Note: may not terminate for infinite iterators.
the predicate used to test elements.
true if the given predicate p holds for all values
produced by this iterator, otherwise false.
[use case] Applies a function f to all values produced by this iterator.
Applies a function f to all values produced by this iterator.
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 values produced by this iterator.
Applies a function f to all values produced by this iterator.
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.
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.
Returns an iterator which groups this iterator into fixed size blocks.
Returns an iterator which groups this iterator into fixed size blocks. Example usages:
// Returns List(List(1, 2, 3), List(4, 5, 6), List(7))) (1 to 7).iterator grouped 3 toList // Returns List(List(1, 2, 3), List(4, 5, 6)) (1 to 7).iterator grouped 3 withPartial false toList // Returns List(List(1, 2, 3), List(4, 5, 6), List(7, 20, 25) // Illustrating that withPadding's argument is by-name. val it2 = Iterator.iterate(20)(_ + 5) (1 to 7).iterator grouped 3 withPadding it2.next toList
Tests whether this Iterator has a known size.
Tests whether this Iterator has a known size.
true for empty Iterators, false otherwise.
The hashCode method for reference types.
Returns the value of the index flag.
Returns the value of the index flag.
The index flag holds an integer which carries some operation-specific meaning. For
instance, takeWhile operation sets the index flag to the position of the element
where the predicate fails. Other workers may check this index against the indices
they are working on and return if this index is smaller than their index. Examples
of operations using this are takeWhile, dropWhile, span and indexOf.
the value of the index flag
Returns the index of the first occurrence of the specified object in this iterable object.
Returns the index of the first occurrence of the specified object in this iterable object.
Note: may not terminate for infinite iterators.
element to search for.
the index of the first occurrence of elem in the values produced by this iterator,
or -1 if such an element does not exist until the end of the iterator is reached.
Returns the index of the first produced value satisfying a predicate, or -1.
Returns the index of the first produced value satisfying a predicate, or -1.
Note: may not terminate for infinite iterators.
the index of the first produced value satisfying p,
or -1 if such an element does not exist until the end of the iterator is reached.
Checks whether an abort signal has been issued.
Checks whether an abort signal has been issued.
Abort flag being true means that a worker can abort and produce whatever result,
since its result will not affect the final result of computation. An example
of operations using this are find, forall and exists methods.
the state of the abort
Tests whether this iterator is empty.
Tests whether this iterator is empty.
true if hasNext is false, false otherwise.
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 Iterator can be repeatedly traversed.
Tests whether this Iterator can be repeatedly traversed.
false
Returns the number of elements in this iterator.
Returns the number of elements in this iterator.
Note: will not terminate for infinite iterators.
Note: The iterator is at its end after this method returns.
Creates a new iterator that maps all produced values of this iterator to new values using a transformation function.
Creates a new iterator that maps all produced values of this iterator to new values using a transformation function.
the transformation function
a new iterator which transforms every value produced by this
iterator by applying the function f to it.
[use case] Finds the largest element.
Finds the largest element.
the largest element of this traversable or iterator with respect to the ordering cmp.
Finds the largest element.
Finds the largest element.
the largest element of this traversable or iterator with respect to the ordering cmp.
[use case] Finds the smallest element.
Finds the smallest element.
the smallest element of this traversable or iterator with respect to the ordering cmp.
Finds the smallest element.
Finds the smallest element.
the smallest element of this traversable or iterator with respect to the ordering cmp.
Displays all elements of this traversable or iterator in a string.
Displays all elements of this traversable or iterator in a string.
a string representation of this traversable or iterator. In the resulting string
the string representations (w.r.t. the method toString)
of all elements of this traversable or iterator follow each other without any
separator string.
Displays all elements of this traversable or iterator in a string using a separator string.
Displays all elements of this traversable or iterator in a string using a separator string.
the separator string.
a string representation of this traversable or iterator. In the resulting string
the string representations (w.r.t. the method toString)
of all elements of this traversable or iterator are separated by the string sep.
List(1, 2, 3).mkString("|") = "1|2|3"
Displays all elements of this traversable or iterator in a string using start, end, and separator strings.
Displays all elements of this traversable or iterator in a string using start, end, and separator strings.
the starting string.
the separator string.
the ending string.
a string representation of this traversable or iterator. 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 or iterator 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.
Tests whether the traversable or iterator is not empty.
Tests whether the traversable or iterator is not empty.
true if the traversable or iterator 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.
[use case] Appends an element value to this iterator until a given target length is reached.
Appends an element value to this iterator until a given target length is reached.
the target length
the padding value
a new iterator consisting of producing all values of this iterator,
followed by the minimal number of occurrences of elem so
that the number of produced values is at least len.
Appends an element value to this iterator until a given target length is reached.
Appends an element value to this iterator until a given target length is reached.
the target length
the padding value
a new iterator consisting of producing all values of this iterator,
followed by the minimal number of occurrences of elem so
that the number of produced values is at least len.
Partitions this iterator in two iterators according to a predicate.
Partitions this iterator in two iterators according to a predicate.
the predicate on which to partition
a pair of iterators: the iterator that satisfies the predicate
p and the iterator that does not.
The relative order of the elements in the resulting iterators
is the same as in the original iterator.
Returns this iterator with patched values.
Returns this iterator with patched values.
The start index from which to patch
The number of values in the original iterator that are replaced by the patch.
[use case] Multiplies up the elements of this collection.
Multiplies up the elements of this collection.
the product of all elements of this traversable or iterator with respect to the * operator in num.
Multiplies up the elements of this collection.
Multiplies up the elements of this collection.
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 or iterator with respect to the * operator in num.
Reduces the elements of this sequence using the specified associative binary operator.
Reduces the elements of this sequence using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
Note this method has a different signature than the reduceLeft
and reduceRight methods of the trait Traversable.
The result of reducing may only be a supertype of this parallel collection's
type parameter T.
A type parameter for the binary operator, a supertype of T.
A binary operator that must be associative.
The result of applying reduce operator op between all the elements if the collection is nonempty.
Optionally applies a binary operator to all elements of this traversable or iterator, going left to right.
Optionally applies a binary operator to all elements of this traversable or iterator, going left to right.
Note: will not terminate for infinite iterators.
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 or iterator is nonempty,
None otherwise.
Optionally reduces the elements of this sequence using the specified associative binary operator.
Optionally reduces the elements of this sequence using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
Note this method has a different signature than the reduceLeftOption
and reduceRightOption methods of the trait Traversable.
The result of reducing may only be a supertype of this parallel collection's
type parameter T.
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 traversable or iterator, going right to left.
Applies a binary operator to all elements of this traversable or iterator, going right to left.
Note: will not terminate for infinite iterators.
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 or iterator,
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 traversable or iterator.
Optionally applies a binary operator to all elements of this traversable or iterator, going right to left.
Optionally applies a binary operator to all elements of this traversable or iterator, going right to left.
Note: will not terminate for infinite iterators.
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 or iterator is nonempty,
None otherwise.
Tests if another iterator produces the same values as this one.
Tests if another iterator produces the same values as this one.
Note: will not terminate for infinite iterators.
the other iterator
true, if both iterators produce the same elements in the same order, false otherwise.
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.
Sets the value of the index flag.
Sets the value of the index flag.
The index flag holds an integer which carries some operation-specific meaning. For
instance, takeWhile operation sets the index flag to the position of the element
where the predicate fails. Other workers may check this index against the indices
they are working on and return if this index is smaller than their index. Examples
of operations using this are takeWhile, dropWhile, span and indexOf.
the value to which the index flag is set.
Sets the value of the index flag if argument is greater than current value.
Sets the value of the index flag if argument is greater than current value. This method does this atomically.
The index flag holds an integer which carries some operation-specific meaning. For
instance, takeWhile operation sets the index flag to the position of the element
where the predicate fails. Other workers may check this index against the indices
they are working on and return if this index is smaller than their index. Examples
of operations using this are takeWhile, dropWhile, span and indexOf.
the value to which the index flag is set
Sets the value of the index flag if argument is lesser than current value.
Sets the value of the index flag if argument is lesser than current value. This method does this atomically.
The index flag holds an integer which carries some operation-specific meaning. For
instance, takeWhile operation sets the index flag to the position of the element
where the predicate fails. Other workers may check this index against the indices
they are working on and return if this index is smaller than their index. Examples
of operations using this are takeWhile, dropWhile, span and indexOf.
the value to which the index flag is set
A delegate that method calls are redirected to.
A delegate that method calls are redirected to.
The size of this traversable or iterator.
The size of this traversable or iterator.
Note: will not terminate for infinite iterators.
the number of elements in this traversable or iterator.
Creates an iterator returning an interval of the values produced by this iterator.
Creates an iterator returning an interval of the values produced by this iterator.
an iterator which advances this iterator past the first from elements using drop,
and then takes until - from elements, using take.
Returns an iterator which presents a "sliding window" view of another iterator.
Returns an iterator which presents a "sliding window" view of another iterator. The first argument is the window size, and the second is how far to advance the window on each iteration; defaults to 1. Example usages:
// Returns List(List(1, 2, 3), List(2, 3, 4), List(3, 4, 5)) (1 to 5).iterator.sliding(3).toList // Returns List(List(1, 2, 3, 4), List(4, 5)) (1 to 5).iterator.sliding(4, 3).toList // Returns List(List(1, 2, 3, 4)) (1 to 5).iterator.sliding(4, 3).withPartial(false).toList // Returns List(List(1, 2, 3, 4), List(4, 5, 20, 25)) // Illustrating that withPadding's argument is by-name. val it2 = Iterator.iterate(20)(_ + 5) (1 to 5).iterator.sliding(4, 3).withPadding(it2.next).toList
Splits this Iterator into a prefix/suffix pair according to a predicate.
Splits this Iterator into a prefix/suffix pair according to a predicate.
the test predicate
a pair of Iterators consisting of the longest prefix of this
whose elements all satisfy p, and the rest of the Iterator.
[use case] Sums up the elements of this collection.
Sums up the elements of this collection.
the sum of all elements of this traversable or iterator with respect to the + operator in num.
Sums up the elements of this collection.
Sums up the elements of this collection.
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 or iterator with respect to the + operator in num.
A read only tag specific to the signalling object.
A read only tag specific to the signalling object. It is used to give specific workers information on the part of the collection being operated on.
Selects first n values of this iterator.
Selects first n values of this iterator.
the number of values to take
an iterator producing only of the first n values of this iterator, or else the
whole iterator, if it produces fewer than n values.
Takes longest prefix of values produced by this iterator that satisfy a predicate.
Takes longest prefix of values produced by this iterator that satisfy a predicate.
The predicate used to test elements.
An iterator returning the values produced by this iterator, until
this iterator produces a value that does not satisfy
the predicate p.
[use case] Converts this traversable or iterator to an array.
Converts this traversable or iterator to an array.
Note: will not terminate for infinite iterators.
an array containing all elements of this traversable or iterator.
Converts this traversable or iterator to an array.
Converts this traversable or iterator to an array.
Note: will not terminate for infinite iterators.
the type of the elements of the array. A ClassManifest for
this type must be available.
an array containing all elements of this traversable or iterator.
Converts this traversable or iterator to a mutable buffer.
Converts this traversable or iterator to a mutable buffer.
Note: will not terminate for infinite iterators.
a buffer containing all elements of this traversable or iterator.
Converts this traversable or iterator to an indexed sequence.
Converts this traversable or iterator to an indexed sequence.
Note: will not terminate for infinite iterators.
an indexed sequence containing all elements of this traversable or iterator.
Converts this traversable or iterator to an iterable collection.
Converts this traversable or iterator 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).
Note: will not terminate for infinite iterators.
an Iterable containing all elements of this traversable or iterator.
Returns an Iterator over the elements in this traversable or iterator.
Returns an Iterator over the elements in this traversable or iterator. Will return the same Iterator if this instance is already an Iterator.
Note: will not terminate for infinite iterators.
an Iterator containing all elements of this traversable or iterator.
Converts this traversable or iterator to a list.
Converts this traversable or iterator to a list.
Note: will not terminate for infinite iterators.
a list containing all elements of this traversable or iterator.
[use case] Converts this traversable or iterator to a map.
Converts this traversable or iterator 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.
Note: will not terminate for infinite iterators.
a map containing all elements of this traversable or iterator.
Converts this traversable or iterator to a map.
Converts this traversable or iterator 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.
Note: will not terminate for infinite iterators.
a map containing all elements of this traversable or iterator.
Converts this traversable or iterator to a sequence.
Converts this traversable or iterator to a sequence. As with toIterable, it's lazy
in this default implementation, as this TraversableOnce may be
lazy and unevaluated.
Note: will not terminate for infinite iterators.
a sequence containing all elements of this traversable or iterator.
Converts this traversable or iterator to a set.
Converts this traversable or iterator to a set.
Note: will not terminate for infinite iterators.
a set containing all elements of this traversable or iterator.
Converts this traversable or iterator to a stream.
Converts this traversable or iterator to a stream.
Note: will not terminate for infinite iterators.
a stream containing all elements of this traversable or iterator.
Converts this iterator to a string.
Converts this traversable or iterator to an unspecified Traversable.
Converts this traversable or iterator to an unspecified Traversable. Will return the same collection if this instance is already Traversable.
Note: will not terminate for infinite iterators.
a Traversable containing all elements of this traversable or iterator.
Creates an iterator over all the elements of this iterator that
satisfy the predicate p.
Creates an iterator over all the elements of this iterator that
satisfy the predicate p. The order of the elements
is preserved.
Note: withFilter is the same as filter on iterators. It exists so that
for-expressions with filters work over iterators.
the predicate used to test values.
an iterator which produces those values of this iterator which satisfy the predicate p.
Creates an iterator formed from this iterator and another iterator by combining corresponding values in pairs.
Creates an iterator formed from this iterator and another iterator by combining corresponding values in pairs. If one of the two iterators is longer than the other, its remaining elements are ignored.
The iterator providing the second half of each result pair
a new iterator containing pairs consisting of
corresponding elements of this iterator and that. The number
of elements returned by the new iterator is the
minimum of the number of elements returned by this
iterator and that.
[use case] Creates an iterator formed from this iterator and another iterator by combining corresponding elements in pairs.
Creates an iterator formed from this iterator and another iterator by combining corresponding elements in pairs. If one of the two iterators is shorter than the other, placeholder elements are used to extend the shorter iterator to the length of the longer.
iterator that may have a different length
as the self iterator.
element thisElem is used to fill up the
resulting iterator if the self iterator is shorter than
that
element thatElem is used to fill up the
resulting iterator if that is shorter than
the self iterator
a new iterator containing pairs consisting of
corresponding values of this iterator and that. The length
of the returned iterator is the maximum of the lengths of this iterator and that.
If this iterator is shorter than that, thisElem values are used to pad the result.
If that is shorter than this iterator, thatElem values are used to pad the result.
Creates an iterator formed from this iterator and another iterator by combining corresponding elements in pairs.
Creates an iterator formed from this iterator and another iterator by combining corresponding elements in pairs. If one of the two iterators is shorter than the other, placeholder elements are used to extend the shorter iterator to the length of the longer.
iterator that may have a different length
as the self iterator.
element thisElem is used to fill up the
resulting iterator if the self iterator is shorter than
that
element thatElem is used to fill up the
resulting iterator if that is shorter than
the self iterator
a new iterator containing pairs consisting of
corresponding values of this iterator and that. The length
of the returned iterator is the maximum of the lengths of this iterator and that.
If this iterator is shorter than that, thisElem values are used to pad the result.
If that is shorter than this iterator, thatElem values are used to pad the result.
Creates an iterator that pairs each element produced by this iterator with its index, counting from 0.
Creates an iterator that pairs each element produced by this iterator with its index, counting from 0.
Returns a new iterator that first yields the elements of this
iterator followed by the elements provided by iterator that.
Returns a new iterator that first yields the elements of this
iterator followed by the elements provided by iterator that.
use ++
Returns a counted iterator from this iterator.
Returns a counted iterator from this iterator.
use zipWithIndex in Iterator
Returns index of the first element satisfying a predicate, or -1.
Returns index of the first element satisfying a predicate, or -1.
use indexWhere instead
use copyToArray instead
use copyToArray instead
Fills the given array xs with the elements of
this sequence starting at position start.
Fills the given array xs with the elements of
this sequence starting at position start. Like copyToArray,
but designed to accomodate IO stream operations.
Note: the array must be large enough to hold sz elements.
the array to fill.
the starting index.
the maximum number of elements to be read.
use copyToArray instead
An iterator that can be split into arbitrary subsets of iterators. The self-type requirement ensures that the signal context passing behaviour gets mixed in the concrete iterator instance in some concrete collection.
Note: In concrete collection classes, collection implementers might want to override the iterator
reverse2buildermethod to ensure higher efficiency.