LIterator

Abstract Value Members

abstract def hasNext: Boolean
abstract def next(): A

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
final def asInstanceOf[T0]: T0

Definition Classes
Any
def buffered: BufferedLIterator[A]
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def collect[B](pf: PartialFunction[A, B]): LIterator[B]
def contains(elem: Any): Boolean
def drop(n: Long): LIterator[A]

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.
n
the number of elements to drop
returns
an iterator which produces all values of the current iterator, except it omits the first n values.
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def exists(p: (A) ⇒ Boolean): Boolean
def filter(pred: (A) ⇒ Boolean): LIterator[A]
def filterNot(p: (A) ⇒ Boolean): LIterator[A]
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def find(p: (A) ⇒ Boolean): Option[A]
def flatMap[B](f: (A) ⇒ LIterator[B]): LIterator[B]
def forall(pred: (A) ⇒ Boolean): Boolean
def foreach[U](f: (A) ⇒ U): Unit
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def indexOf[B >: A](elem: B): Long

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.
elem
element to search for.
returns
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.
def indexWhere(p: (A) ⇒ Boolean): Long

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.
p
the predicate to test values
returns
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.
def isEmpty: Boolean

Tests whether this iterator is empty.
Tests whether this iterator is empty.
returns
true if hasNext is false, false otherwise.
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def map[B](f: (A) ⇒ B): LIterator[B]
def mkString: String
def mkString(sep: String): String
def mkString(start: String, sep: String, end: String): String
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def partition(p: (A) ⇒ Boolean): (LIterator[A], LIterator[A])

Partitions this iterator in two iterators according to a predicate.
Partitions this iterator in two iterators according to a predicate.
p
the predicate on which to partition
returns
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.
def reduceLeft[B >: A](op: (B, A) ⇒ B): B
def sameElements(that: LIterator[_]): Boolean
def scanLeft[B](z: B)(op: (B, A) ⇒ B): LIterator[B]
def size: Long
def slice(from: Long, until: Long): LIterator[A]
def span(p: (A) ⇒ Boolean): (LIterator[A], LIterator[A])

Splits this Iterator into a prefix/suffix pair according to a predicate.
Splits this Iterator into a prefix/suffix pair according to a predicate.
p
the test predicate
returns
a pair of Iterators consisting of the longest prefix of this whose elements all satisfy p, and the rest of the Iterator.
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def take(n: Long): LIterator[A]

Selects first n values of this iterator.
Selects first n values of this iterator.
n
the number of values to take
returns
an iterator producing only of the first n values of this iterator, or else the whole iterator, if it produces fewer than n values.
def takeWhile(p: (A) ⇒ Boolean): LIterator[A]

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.
p
The predicate used to test elements.
returns
An iterator returning the values produced by this iterator, until this iterator produces a value that does not satisfy the predicate p.
def toArray[A1 >: A](implicit arg0: ClassTag[A1]): Array[A1]
def toLArray[B >: A](implicit arg0: ClassTag[B]): LArray[B]
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
def withFilter(p: (A) ⇒ Boolean): LIterator[A]
def zip[B](that: LIterator[B]): LIterator[(A, B)]
def zipAll[B, A1 >: A, B1 >: B](that: LIterator[B], thisElem: A1, thatElem: B1): LIterator[(A1, B1)]
def zipWithIndex: LIterator[(A, Long)]

Related Docs: object LIterator | package larray

trait LIterator[+A] extends AnyRef

Abstract Value Members

abstract def hasNext: Boolean

abstract def next(): A

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

final def asInstanceOf[T0]: T0

def buffered: BufferedLIterator[A]

def clone(): AnyRef

def collect[B](pf: PartialFunction[A, B]): LIterator[B]

def contains(elem: Any): Boolean

def drop(n: Long): LIterator[A]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: (A) ⇒ Boolean): Boolean

def filter(pred: (A) ⇒ Boolean): LIterator[A]

def filterNot(p: (A) ⇒ Boolean): LIterator[A]

def finalize(): Unit

def find(p: (A) ⇒ Boolean): Option[A]

def flatMap[B](f: (A) ⇒ LIterator[B]): LIterator[B]

def forall(pred: (A) ⇒ Boolean): Boolean

def foreach[U](f: (A) ⇒ U): Unit

final def getClass(): Class[_]

def hashCode(): Int

def indexOf[B >: A](elem: B): Long

def indexWhere(p: (A) ⇒ Boolean): Long

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def map[B](f: (A) ⇒ B): LIterator[B]

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def partition(p: (A) ⇒ Boolean): (LIterator[A], LIterator[A])

def reduceLeft[B >: A](op: (B, A) ⇒ B): B

def sameElements(that: LIterator[_]): Boolean

def scanLeft[B](z: B)(op: (B, A) ⇒ B): LIterator[B]

def size: Long

def slice(from: Long, until: Long): LIterator[A]

def span(p: (A) ⇒ Boolean): (LIterator[A], LIterator[A])

final def synchronized[T0](arg0: ⇒ T0): T0

def take(n: Long): LIterator[A]

def takeWhile(p: (A) ⇒ Boolean): LIterator[A]

def toArray[A1 >: A](implicit arg0: ClassTag[A1]): Array[A1]

def toLArray[B >: A](implicit arg0: ClassTag[B]): LArray[B]

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def withFilter(p: (A) ⇒ Boolean): LIterator[A]

def zip[B](that: LIterator[B]): LIterator[(A, B)]

def zipAll[B, A1 >: A, B1 >: B](that: LIterator[B], thisElem: A1, thatElem: B1): LIterator[(A1, B1)]

def zipWithIndex: LIterator[(A, Long)]

Inherited from AnyRef

Inherited from Any

Ungrouped