Type Members
-
class
GroupedIterator[B >: A] extends AbstractIterator[Seq[B]] with Iterator[Seq[B]]
Abstract Value Members
-
abstract
def
hasNext: Boolean
-
abstract
def
index: Int
-
-
abstract
def
value: Double
Concrete Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
++[B >: DoubleSeqIterator](that: ⇒ GenTraversableOnce[B]): Iterator[B]
-
-
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
-
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
aggregate[B](z: B)(seqop: (B, DoubleSeqIterator) ⇒ B, combop: (B, B) ⇒ B): B
-
final
def
asInstanceOf[T0]: T0
-
-
def
clone(): AnyRef
-
def
collect[B](pf: PartialFunction[DoubleSeqIterator, B]): Iterator[B]
-
def
collectFirst[B](pf: PartialFunction[DoubleSeqIterator, B]): Option[B]
-
def
contains(elem: Any): Boolean
-
def
copyToArray[B >: DoubleSeqIterator](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: DoubleSeqIterator](xs: Array[B]): Unit
-
def
copyToArray[B >: DoubleSeqIterator](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: DoubleSeqIterator](dest: Buffer[B]): Unit
-
def
corresponds[B](that: GenTraversableOnce[B])(p: (DoubleSeqIterator, B) ⇒ Boolean): Boolean
-
-
-
-
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
exists(p: (DoubleSeqIterator) ⇒ Boolean): Boolean
-
-
-
def
finalize(): Unit
-
-
def
flatMap[B](f: (DoubleSeqIterator) ⇒ GenTraversableOnce[B]): Iterator[B]
-
def
fold[A1 >: DoubleSeqIterator](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, DoubleSeqIterator) ⇒ B): B
-
def
foldRight[B](z: B)(op: (DoubleSeqIterator, B) ⇒ B): B
-
def
forall(p: (DoubleSeqIterator) ⇒ Boolean): Boolean
-
-
final
def
getClass(): Class[_]
-
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
-
def
indexWhere(p: (DoubleSeqIterator) ⇒ Boolean): Int
-
def
isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
isTraversableAgain: Boolean
-
def
length: Int
-
-
-
-
-
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
final
def
ne(arg0: AnyRef): Boolean
-
def
nonEmpty: Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
padTo[A1 >: DoubleSeqIterator](len: Int, elem: A1): Iterator[A1]
-
-
def
patch[B >: DoubleSeqIterator](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
-
-
def
reduce[A1 >: DoubleSeqIterator](op: (A1, A1) ⇒ A1): A1
-
-
-
def
reduceOption[A1 >: DoubleSeqIterator](op: (A1, A1) ⇒ A1): Option[A1]
-
-
-
-
def
sameElements(that: Iterator[_]): Boolean
-
def
scanLeft[B](z: B)(op: (B, DoubleSeqIterator) ⇒ B): Iterator[B]
-
def
scanRight[B](z: B)(op: (DoubleSeqIterator, B) ⇒ B): Iterator[B]
-
-
def
size: Int
-
def
slice(from: Int, until: Int): Iterator[DoubleSeqIterator]
-
-
-
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
-
def
toArray[B >: DoubleSeqIterator](implicit arg0: ClassTag[B]): Array[B]
-
-
-
-
-
-
def
toMap[T, U](implicit ev: <:<[DoubleSeqIterator, (T, U)]): Map[T, U]
-
-
-
-
def
toString(): String
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
def
zip[B](that: Iterator[B]): Iterator[(DoubleSeqIterator, B)]
-
def
zipAll[B, A1 >: DoubleSeqIterator, B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]
-
def
zipWithIndex: Iterator[(DoubleSeqIterator, Int)]
Deprecated Value Members
-
def
/:\[A1 >: DoubleSeqIterator](z: A1)(op: (A1, A1) ⇒ A1): A1
Used to iterate over the contents of a DoubleSeq, with access to both the index and the value, but, unlike an Iterator[(Int,Double)], not needing to allocate memory for each iteration. Typical usage: for (e <- myDoubleSeq.elements) println("index="+e.index+" value="+e.value)