scalax.collection.io

EdgeInputStream

abstract class EdgeInputStream[N, E[N] <: EdgeLike[N], L, +C[EE[N] <: E[N]] <: EdgeCompanionBase[EE[N]], +A[N, EE[N] <: E[N], AL <: L] <: EdgeAdapterBase[N, EE[N], AL]] extends GenEdgeInputStream[N, E] with EdgeAdapterBase[N, E, L] with Iterator[A[N, E, L]]

This abstract class is to be used to construct a concrete edge input stream that may be passed to the from factory method of a Graph companion object.

N

type of nodes to be passed to a Graph factory method from this stream.

E

kind of the edges to be passed to a Graph factory method from this stream.

L

type of edge labels or Nothing.

C

kind of the edge factory to be invoked when creating edges from the raw edge data read from this stream.

A

kind of edge adapter that will be the return type of next.

Linear Supertypes
Iterator[A[N, E, L]], TraversableOnce[A[N, E, L]], GenTraversableOnce[A[N, E, L]], EdgeAdapterBase[N, E, L], GenEdgeInputStream[N, E], AnyRef, Any
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. EdgeInputStream
  2. Iterator
  3. TraversableOnce
  4. GenTraversableOnce
  5. EdgeAdapterBase
  6. GenEdgeInputStream
  7. AnyRef
  8. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new EdgeInputStream(factory: C[E])

Type Members

  1. class GroupedIterator[B >: A] extends AbstractIterator[Seq[B]] with Iterator[Seq[B]]

    Definition Classes
    Iterator

Abstract Value Members

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

    The consumer of the stream calls this method to get informed whether there are any more edges left in the stream. After having served this inquiry, the producer will be asked by a call to next to move to the next edge available.

    returns

    true if there is at least one more edge, false if the stream has reached its end.

    Definition Classes
    EdgeInputStream → Iterator
  2. 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.

    The consumer of the stream calls this method to tell the provider to move to the next edge. Moving the edge stream cursor to the next edge must assert that all subsequent calls to methods of the returned adapter will return data belonging to that next input edge.

    Note that this semantic is different from that normally experienced in that next does not return the expected result (nodes, weight and label) but an adapter to be queried first to get the expected results.

    returns

    the adapter that the edge stream cursor has been moved to.

    Definition Classes
    EdgeInputStream → Iterator

Concrete Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. def ++[B >: A[N, E, L]](that: ⇒ GenTraversableOnce[B]): Iterator[B]

    Definition Classes
    Iterator
  5. def /:[B](z: B)(op: (B, A[N, E, L]) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  6. def :\[B](z: B)(op: (A[N, E, L], B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  7. final def ==(arg0: AnyRef): Boolean

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

    Definition Classes
    Any
  9. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce
  10. def addString(b: StringBuilder, sep: String): StringBuilder

    Definition Classes
    TraversableOnce
  11. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Definition Classes
    TraversableOnce
  12. def aggregate[B](z: B)(seqop: (B, A[N, E, L]) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  13. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  14. def buffered: BufferedIterator[A[N, E, L]]

    Definition Classes
    Iterator
  15. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  16. def collect[B](pf: PartialFunction[A[N, E, L], B]): Iterator[B]

    Definition Classes
    Iterator
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) collect has changed. The previous behavior can be reproduced with toSeq.

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

    Definition Classes
    TraversableOnce
  18. def contains(elem: Any): Boolean

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

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  20. def copyToArray[B >: A[N, E, L]](xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce
  21. def copyToArray[B >: A[N, E, L]](xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce
  22. def copyToBuffer[B >: A[N, E, L]](dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce
  23. def corresponds[B](that: GenTraversableOnce[B])(p: (A[N, E, L], B) ⇒ Boolean): Boolean

    Definition Classes
    Iterator
  24. def count(p: (A[N, E, L]) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce
  25. def drop(n: Int): Iterator[A[N, E, L]]

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

    Definition Classes
    Iterator
  27. def duplicate: (Iterator[A[N, E, L]], Iterator[A[N, E, L]])

    Definition Classes
    Iterator
  28. final def eq(arg0: AnyRef): Boolean

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

    Definition Classes
    AnyRef → Any
  30. def exists(p: (A[N, E, L]) ⇒ Boolean): Boolean

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  31. val factory: C[E]

    Definition Classes
    EdgeInputStreamGenEdgeInputStream
  32. def filter(p: (A[N, E, L]) ⇒ Boolean): Iterator[A[N, E, L]]

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

    Definition Classes
    Iterator
  34. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  35. def find(p: (A[N, E, L]) ⇒ Boolean): Option[A[N, E, L]]

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  36. def flatMap[B](f: (A[N, E, L]) ⇒ GenTraversableOnce[B]): Iterator[B]

    Definition Classes
    Iterator
  37. def fold[A1 >: A[N, E, L]](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce
  38. def foldLeft[B](z: B)(op: (B, A[N, E, L]) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  39. def foldRight[B](z: B)(op: (A[N, E, L], B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  40. def forall(p: (A[N, E, L]) ⇒ Boolean): Boolean

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  41. def foreach[U](f: (A[N, E, L]) ⇒ U): Unit

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  42. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  43. def grouped[B >: A[N, E, L]](size: Int): GroupedIterator[B]

    Definition Classes
    Iterator
  44. def hasDefiniteSize: Boolean

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  45. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  46. def indexOf[B >: A[N, E, L]](elem: B): Int

    Definition Classes
    Iterator
  47. def indexWhere(p: (A[N, E, L]) ⇒ Boolean): Int

    Definition Classes
    Iterator
  48. def isEmpty: Boolean

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  49. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  50. def isTraversableAgain: Boolean

    Definition Classes
    Iterator → GenTraversableOnce
  51. def length: Int

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

    Definition Classes
    Iterator
  53. def max[B >: A[N, E, L]](implicit cmp: Ordering[B]): A[N, E, L]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  54. def maxBy[B](f: (A[N, E, L]) ⇒ B)(implicit cmp: Ordering[B]): A[N, E, L]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  55. def min[B >: A[N, E, L]](implicit cmp: Ordering[B]): A[N, E, L]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  56. def minBy[B](f: (A[N, E, L]) ⇒ B)(implicit cmp: Ordering[B]): A[N, E, L]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  57. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  58. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  59. def mkString(start: String, sep: String, end: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  60. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  61. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce
  62. final def notify(): Unit

    Definition Classes
    AnyRef
  63. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  64. def padTo[A1 >: A[N, E, L]](len: Int, elem: A1): Iterator[A1]

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

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

    Definition Classes
    Iterator
  67. def product[B >: A[N, E, L]](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  68. def reduce[A1 >: A[N, E, L]](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce
  69. def reduceLeft[B >: A[N, E, L]](op: (B, A[N, E, L]) ⇒ B): B

    Definition Classes
    TraversableOnce
  70. def reduceLeftOption[B >: A[N, E, L]](op: (B, A[N, E, L]) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  71. def reduceOption[A1 >: A[N, E, L]](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  72. def reduceRight[B >: A[N, E, L]](op: (A[N, E, L], B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  73. def reduceRightOption[B >: A[N, E, L]](op: (A[N, E, L], B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  74. def reversed: List[A[N, E, L]]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  75. def sameElements(that: Iterator[_]): Boolean

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

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

    Definition Classes
    Iterator
  78. def seq: Iterator[A[N, E, L]]

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  79. def size: Int

    Definition Classes
    TraversableOnce → GenTraversableOnce
  80. def slice(from: Int, until: Int): Iterator[A[N, E, L]]

    Definition Classes
    Iterator
  81. def sliding[B >: A[N, E, L]](size: Int, step: Int): GroupedIterator[B]

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

    Definition Classes
    Iterator
  83. def sum[B >: A[N, E, L]](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  85. def take(n: Int): Iterator[A[N, E, L]]

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

    Definition Classes
    Iterator
  87. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A[N, E, L], Col[A[N, E, L]]]): Col[A[N, E, L]]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def toArray[B >: A[N, E, L]](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def toBuffer[B >: A[N, E, L]]: Buffer[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def toIndexedSeq: IndexedSeq[A[N, E, L]]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def toIterable: Iterable[A[N, E, L]]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def toIterator: Iterator[A[N, E, L]]

    Definition Classes
    Iterator → GenTraversableOnce
  93. def toList: List[A[N, E, L]]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def toMap[T, U](implicit ev: <:<[A[N, E, L], (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def toSeq: Seq[A[N, E, L]]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def toSet[B >: A[N, E, L]]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def toStream: Stream[A[N, E, L]]

    Definition Classes
    Iterator → GenTraversableOnce
  98. def toString(): String

    Definition Classes
    Iterator → AnyRef → Any
  99. def toTraversable: Traversable[A[N, E, L]]

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  100. def toVector: Vector[A[N, E, L]]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  104. def withFilter(p: (A[N, E, L]) ⇒ Boolean): Iterator[A[N, E, L]]

    Definition Classes
    Iterator
  105. def zip[B](that: Iterator[B]): Iterator[(A[N, E, L], B)]

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

    Definition Classes
    Iterator
  107. def zipWithIndex: Iterator[(A[N, E, L], Int)]

    Definition Classes
    Iterator

Deprecated Value Members

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

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

Inherited from Iterator[A[N, E, L]]

Inherited from TraversableOnce[A[N, E, L]]

Inherited from GenTraversableOnce[A[N, E, L]]

Inherited from EdgeAdapterBase[N, E, L]

Inherited from GenEdgeInputStream[N, E]

Inherited from AnyRef

Inherited from Any

Ungrouped