With the advent of TraversableOnce, it can be useful to have a builder for Iterators so they can be treated uniformly along with the collections.
A wrapper class for the flatten
method that is added to
class Iterator
with implicit conversion
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.
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.
Creates an iterator with given elements
Creates an iterator with given elements
The elements returned one-by-one from the iterator
An iterator which produces the given elements on the
first calls to next
, and which has no further elements.
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.
Creates an infinite-length iterator returning the results of evaluating an expression.
Creates an infinite-length iterator returning the results of evaluating an expression. The expression is recomputed for every element.
the element computation.
the iterator containing an infinite number of results of evaluating elem
.
The iterator which produces no values
The iterator which produces no values
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.
Creates iterator that produces the results of some element computation a number of times.
Creates iterator that produces the results of some element computation a number of times.
the element computation
An iterator that produces the results of n
evaluations of elem
.
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.
Create an iterator that is the concatenation of all iterators returned by a given iterator of iterators.
Create an iterator that is the concatenation of all iterators returned by a given iterator of iterators.
The iterator which returns on each call to next a new iterator whose elements are to be concatenated to the result.
use its.flatten instead
Create an iterator with elements
e<sub>n+1</sub> = step(e<sub>n</sub>)
where e<sub>0</sub> = start
.
Create an iterator with elements
e<sub>n+1</sub> = step(e<sub>n</sub>)
where e<sub>0</sub> = start
.
the start value of the iterator
the increment function of the iterator
the iterator starting at value start
.
use iterate(start)(step) instead
Creates an infinite-length iterator returning values equally spaced apart.
Creates an infinite-length iterator returning values equally spaced apart.
the start value of the iterator
the increment between successive values
the iterator producing the infinite sequence of values start, start + 1 * step, start + 2 * step, ...
Creates an infinite-length iterator which returns successive values from some start value.
Creates an infinite-length iterator which returns successive values from some start value.
the start value of the iterator
the iterator producing the infinite sequence of values start, start + 1, start + 2, ...
no summary matey
the array of elements
the start index
the length
use xs.slice(start, start + length).iterator' instead
also: IndexedSeq.iterator and slice
no summary matey
the array of elements
use xs.iterator' instead
also: IndexedSeq.iterator and slice
no summary matey
the product arity
the iterator on Product<n>
.
use product.productIterator instead
use xs.iterator' or
Iterator(xs)' instead
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.
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.
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.
Creates an infinite iterator that repeatedly applies a given function to the previous result.
Creates an infinite iterator that repeatedly applies a given function to the previous result.
the start value of the iterator
the function that's repeatedly applied
the iterator producing the infinite sequence of values start, f(start), f(f(start)), ...
An implicit conversion which adds the flatten
method to class Iterator
An implicit conversion which adds the flatten
method to class Iterator
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.
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.
Create an iterator with elements
e<sub>n+1</sub> = step(e<sub>n</sub>)
where e<sub>0</sub> = start
and elements are in the range between start
(inclusive)
and end
(exclusive)
Create an iterator with elements
e<sub>n+1</sub> = step(e<sub>n</sub>)
where e<sub>0</sub> = start
and elements are in the range between start
(inclusive)
and end
(exclusive)
the start value of the iterator
the end value of the iterator
the increment function of the iterator, must be monotonically increasing or decreasing
the iterator with values in range [start;end)
.
use Iterator.iterate(start, end - start)(step) instead
An iterator producing equally spaced values in some integer interval.
An iterator producing equally spaced values in some integer interval.
the start value of the iterator
the end value of the iterator (the first value NOT returned)
the increment value of the iterator (must be positive or negative)
the iterator producing values start, start + step, ...
up to, but excluding end
Creates nn iterator returning successive values in some integer interval.
Creates nn iterator returning successive values in some integer interval.
the start value of the iterator
the end value of the iterator (the first value NOT returned)
the iterator producing values start, start + 1, ..., end - 1
Creates an iterator which produces a single element.
Creates an iterator which produces a single element. Note: Equivalent, but more efficient than Iterator(elem)
the element
An iterator which produces elem
on the first call to next
,
and which has no further elements.
Creates an iterator producing the values of a given function over a range of integer values starting from 0.
Creates an iterator producing the values of a given function over a range of integer values starting from 0.
The function computing element values
An iterator that produces the values f(0), ..., f(n -1)
.
Returns a string representation of the object.
Returns a string representation of the object.
The default representation is platform dependent.
a string representation of the object.
The
Iterator
object provides various functions for creating specialized iterators.version
2.8
since
2.8
authors: ,
Matthias Zenger
Martin Odersky