EdgeInputStream

abstract def hasNext: Boolean

The consumer of the stream calls this method to get informed whether there are any more edges left in the stream.

abstract def next(): A[N, E, L]

The consumer of the stream calls this method to tell the provider to move to the next edge.

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ++[B >: A[N, E, L]](that: ⇒ GenTraversableOnce[B]): Iterator[B]

def ->[B](y: B): (EdgeInputStream[N, E, L, C, A], B)

def /:[B](z: B)(op: (B, A[N, E, L]) ⇒ B): B

def :\[B](z: B)(op: (A[N, E, L], B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

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

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

def aggregate[B](z: B)(seqop: (B, A[N, E, L]) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

def buffered: BufferedIterator[A[N, E, L]]

def clone(): AnyRef

def collect[B](pf: PartialFunction[A[N, E, L], B]): Iterator[B]

def collectFirst[B](pf: PartialFunction[A[N, E, L], B]): Option[B]

def contains(elem: Any): Boolean

def copyToArray[B >: A[N, E, L]](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: A[N, E, L]](xs: Array[B]): Unit

def copyToArray[B >: A[N, E, L]](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: A[N, E, L]](dest: Buffer[B]): Unit

def corresponds[B](that: GenTraversableOnce[B])(p: (A[N, E, L], B) ⇒ Boolean): Boolean

def count(p: (A[N, E, L]) ⇒ Boolean): Int

def drop(n: Int): Iterator[A[N, E, L]]

def dropWhile(p: (A[N, E, L]) ⇒ Boolean): Iterator[A[N, E, L]]

def duplicate: (Iterator[A[N, E, L]], Iterator[A[N, E, L]])

def ensuring(cond: (EdgeInputStream[N, E, L, C, A]) ⇒ Boolean, msg: ⇒ Any): EdgeInputStream[N, E, L, C, A]

def ensuring(cond: (EdgeInputStream[N, E, L, C, A]) ⇒ Boolean): EdgeInputStream[N, E, L, C, A]

def ensuring(cond: Boolean, msg: ⇒ Any): EdgeInputStream[N, E, L, C, A]

def ensuring(cond: Boolean): EdgeInputStream[N, E, L, C, A]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: (A[N, E, L]) ⇒ Boolean): Boolean

val factory: C[E]

def filter(p: (A[N, E, L]) ⇒ Boolean): Iterator[A[N, E, L]]

def filterNot(p: (A[N, E, L]) ⇒ Boolean): Iterator[A[N, E, L]]

def finalize(): Unit

def find(p: (A[N, E, L]) ⇒ Boolean): Option[A[N, E, L]]

def flatMap[B](f: (A[N, E, L]) ⇒ GenTraversableOnce[B]): Iterator[B]

def fold[A1 >: A[N, E, L]](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, A[N, E, L]) ⇒ B): B

def foldRight[B](z: B)(op: (A[N, E, L], B) ⇒ B): B

def forall(p: (A[N, E, L]) ⇒ Boolean): Boolean

def foreach[U](f: (A[N, E, L]) ⇒ U): Unit

def formatted(fmtstr: String): String

final def getClass(): Class[_]

def grouped[B >: A[N, E, L]](size: Int): GroupedIterator[B]

def hasDefiniteSize: Boolean

def hashCode(): Int

def indexOf[B >: A[N, E, L]](elem: B): Int

def indexWhere(p: (A[N, E, L]) ⇒ Boolean): Int

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isTraversableAgain: Boolean

def length: Int

def map[B](f: (A[N, E, L]) ⇒ B): Iterator[B]

def max[B >: A[N, E, L]](implicit cmp: Ordering[B]): A[N, E, L]

def maxBy[B](f: (A[N, E, L]) ⇒ B)(implicit cmp: Ordering[B]): A[N, E, L]

def min[B >: A[N, E, L]](implicit cmp: Ordering[B]): A[N, E, L]

def minBy[B](f: (A[N, E, L]) ⇒ B)(implicit cmp: Ordering[B]): A[N, E, L]

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 >: A[N, E, L]](len: Int, elem: A1): Iterator[A1]

def partition(p: (A[N, E, L]) ⇒ Boolean): (Iterator[A[N, E, L]], Iterator[A[N, E, L]])

def patch[B >: A[N, E, L]](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]

def product[B >: A[N, E, L]](implicit num: Numeric[B]): B

def reduce[A1 >: A[N, E, L]](op: (A1, A1) ⇒ A1): A1

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

def reduceLeftOption[B >: A[N, E, L]](op: (B, A[N, E, L]) ⇒ B): Option[B]

def reduceOption[A1 >: A[N, E, L]](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: A[N, E, L]](op: (A[N, E, L], B) ⇒ B): B

def reduceRightOption[B >: A[N, E, L]](op: (A[N, E, L], B) ⇒ B): Option[B]

def reversed: List[A[N, E, L]]

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

def scanLeft[B](z: B)(op: (B, A[N, E, L]) ⇒ B): Iterator[B]

def scanRight[B](z: B)(op: (A[N, E, L], B) ⇒ B): Iterator[B]

def seq: Iterator[A[N, E, L]]

def size: Int

def slice(from: Int, until: Int): Iterator[A[N, E, L]]

def sliding[B >: A[N, E, L]](size: Int, step: Int): GroupedIterator[B]

def span(p: (A[N, E, L]) ⇒ Boolean): (Iterator[A[N, E, L]], Iterator[A[N, E, L]])

def sum[B >: A[N, E, L]](implicit num: Numeric[B]): B

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

def take(n: Int): Iterator[A[N, E, L]]

def takeWhile(p: (A[N, E, L]) ⇒ Boolean): Iterator[A[N, E, L]]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A[N, E, L], Col[A[N, E, L]]]): Col[A[N, E, L]]

def toArray[B >: A[N, E, L]](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: A[N, E, L]]: Buffer[B]

def toIndexedSeq: IndexedSeq[A[N, E, L]]

def toIterable: Iterable[A[N, E, L]]

def toIterator: Iterator[A[N, E, L]]

def toList: List[A[N, E, L]]

def toMap[T, U](implicit ev: <:<[A[N, E, L], (T, U)]): Map[T, U]

def toSeq: Seq[A[N, E, L]]

def toSet[B >: A[N, E, L]]: Set[B]

def toStream: Stream[A[N, E, L]]

def toString(): String

def toTraversable: Traversable[A[N, E, L]]

def toVector: Vector[A[N, E, L]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (A[N, E, L]) ⇒ Boolean): Iterator[A[N, E, L]]

def zip[B](that: Iterator[B]): Iterator[(A[N, E, L], B)]

def zipAll[B, A1 >: A[N, E, L], B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]

def zipWithIndex: Iterator[(A[N, E, L], Int)]

def →[B](y: B): (EdgeInputStream[N, E, L, C, A], B)

val self: Any

val self: Any

def /:\[A1 >: A[N, E, L]](z: A1)(op: (A1, A1) ⇒ A1): A1

def x: EdgeInputStream[N, E, L, C, A]

def x: EdgeInputStream[N, E, L, C, A]