Appended

Test two objects for inequality.

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.

Concatenates this iterator with another.

Concatenates this iterator with another.

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.

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.

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.

Test two objects for equality.

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. 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.

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.

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.

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).

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.

Creates a buffered iterator from this iterator.

Create a copy of the receiver object.

The default implementation of the clone method is platform dependent.

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.

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.

Tests whether this iterator contains a given value as an element.

Note: may not terminate for infinite iterators.

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.

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.

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.

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.

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.

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.

Copies all elements of this traversable or iterator to a buffer.

Note: will not terminate for infinite iterators.

Counts the number of elements in the traversable or iterator which satisfy a predicate.

Advances this iterator past the first n elements, or the length of the iterator, whichever is smaller.

Skips longest sequence of elements of this iterator which satisfy given predicate p, and returns an iterator of the remaining elements.

Creates a copy of this iterator.

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.

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:

• 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 equality method for reference types. See equals in Any.

Tests whether a predicate holds for some of the values produced by this iterator.

Note: may not terminate for infinite iterators.

Returns an iterator over all the elements of this iterator that satisfy the predicate p. The order of the elements is preserved.

Creates an iterator over all the elements of this iterator which do not satisfy a predicate p.

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.

Note: may not terminate for infinite iterators.

Creates a new iterator by applying a function to all values produced by this iterator and concatenating the results.

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.

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.

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.

Tests whether a predicate holds for all values produced by this iterator.

Note: may not terminate for infinite iterators.

Applies a function f to all values produced by this iterator.

Applies a function f to all values produced by this iterator.

A representation that corresponds to the dynamic class of the receiver object.

The nature of the representation is platform dependent.

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 can provide another element.

The hashCode method for reference types. See hashCode in Any.

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.

Returns the index of the first occurrence of the specified object in this iterable object.

Note: may not terminate for infinite iterators.

Returns the index of the first produced value satisfying a predicate, or -1.

Note: may not terminate for infinite iterators.

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.

Tests whether this iterator is empty.

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.

Tests whether this Iterator can be repeatedly traversed.

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.

Finds the largest element.

Finds the largest element.

Finds the smallest element.

Finds the smallest element.

Displays all elements of this traversable or iterator in a 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 start, end, and separator strings.

Equivalent to !(this eq that).

Produces the next element of this iterator.

Tests whether the traversable or iterator is not empty.

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.

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.

Partitions this iterator in two iterators according to a predicate.

Returns this iterator with patched values.

Multiplies up the elements of this collection.

Multiplies up the elements of this collection.

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.

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.

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.

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.

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 number of elements this iterator has yet to traverse. This method doesn't change the state of the iterator.

This method is used to provide size hints to builders and combiners, and to approximate positions of iterators within a data structure.

Note: This method may be implemented to return an upper bound on the number of elements in the iterator, instead of the exact number of elements to iterate. Parallel collections which have such iterators are called non-strict-splitter collections.

In that case, 2 considerations must be taken into account:

1) classes that inherit ParIterable must reimplement methods take, drop, slice, splitAt, copyToArray and all others using this information.

2) if an iterator provides an upper bound on the number of elements, then after splitting the sum of remaining values of split iterators must be less than or equal to this upper bound.

Tests if another iterator produces the same values as this one.

Note: will not terminate for infinite iterators.

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.

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.

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.

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.

A delegate that method calls are redirected to.

The size of this traversable or iterator.

Note: will not terminate for infinite iterators.

Creates an iterator returning an interval of the values produced by this 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 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.

Sums up the elements of this collection.

Sums up the elements of this collection.

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.

Takes longest prefix of values produced by this iterator that satisfy a predicate.

Converts this traversable or iterator to an array.

Note: will not terminate for infinite iterators.

Converts this traversable or iterator to an array.

Note: will not terminate for infinite iterators.

Converts this traversable or iterator to a mutable buffer.

Note: will not terminate for infinite iterators.

Converts this traversable or iterator to an indexed sequence.

Note: will not terminate for infinite iterators.

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.

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.

Converts this traversable or iterator to a list.

Note: will not terminate for infinite iterators.

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.

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.

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.

Converts this traversable or iterator to a set.

Note: will not terminate for infinite iterators.

Converts this traversable or iterator to a stream.

Note: will not terminate for infinite iterators.

Converts this iterator to a string.

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.

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.

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.

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.

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.

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 counted iterator from this iterator.

Returns index of the first element satisfying a predicate, or -1.

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.