scalax.collection.GraphBase

InnerEdgeLike

trait InnerEdgeLike extends Iterable[NodeT] with Edge

Linear Supertypes
Edge, Serializable, Serializable, Iterable[NodeT], IterableLike[NodeT, Iterable[NodeT]], Equals, GenIterable[NodeT], GenIterableLike[NodeT, Iterable[NodeT]], Traversable[NodeT], GenTraversable[NodeT], GenericTraversableTemplate[NodeT, Iterable], TraversableLike[NodeT, Iterable[NodeT]], GenTraversableLike[NodeT, Iterable[NodeT]], Parallelizable[NodeT, ParIterable[NodeT]], TraversableOnce[NodeT], GenTraversableOnce[NodeT], FilterMonadic[NodeT, Iterable[NodeT]], HasNewBuilder[NodeT, Iterable[NodeT]], AnyRef, Any
Known Subclasses
EdgeBase, EdgeImpl
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. InnerEdgeLike
  2. Edge
  3. Serializable
  4. Serializable
  5. Iterable
  6. IterableLike
  7. Equals
  8. GenIterable
  9. GenIterableLike
  10. Traversable
  11. GenTraversable
  12. GenericTraversableTemplate
  13. TraversableLike
  14. GenTraversableLike
  15. Parallelizable
  16. TraversableOnce
  17. GenTraversableOnce
  18. FilterMonadic
  19. HasNewBuilder
  20. AnyRef
  21. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. type Self = Iterable[NodeT]

    Attributes
    protected
    Definition Classes
    TraversableLike

  2. class WithFilter extends FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def edge: E[NodeT]

    The outer edge after transformation by means of the copy method.

    The outer edge after transformation by means of the copy method. This edge contains references to inner nodes while the original outer edge contained references to outer nodes.

  2. abstract def iterator: Iterator[NodeT]

    Definition Classes
    IterableLike → GenIterableLike

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 >: NodeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  5. def ++:[B >: NodeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That

    Definition Classes
    TraversableLike

  6. def ++:[B >: NodeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That

    Definition Classes
    TraversableLike

  7. def /:[B](z: B)(op: (B, NodeT) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  8. def :\[B](z: B)(op: (NodeT, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  9. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  10. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  11. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

  14. def adjacents: Set[EdgeT]

    All connecting edges, that is all edges at any of the nodes incident with this edge.

    All connecting edges, that is all edges at any of the nodes incident with this edge.

    returns

    set of connecting edges including hooks.

  15. def aggregate[B](z: B)(seqop: (B, NodeT) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  16. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  17. def canEqual(that: Any): Boolean

    Definition Classes
    InnerEdgeLike → IterableLike → Equals

  18. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  19. def collect[B, That](pf: PartialFunction[NodeT, B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  20. def collectFirst[B](pf: PartialFunction[NodeT, B]): Option[B]

    Definition Classes
    TraversableOnce

  21. def companion: GenericCompanion[Iterable]

    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

  22. def copyToArray[B >: NodeT](xs: Array[B], start: Int, len: Int): Unit

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  23. def copyToArray[B >: NodeT](xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  24. def copyToArray[B >: NodeT](xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  25. def copyToBuffer[B >: NodeT](dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce

  26. def count(p: (NodeT) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  27. def drop(n: Int): Iterable[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  28. def dropRight(n: Int): Iterable[NodeT]

    Definition Classes
    IterableLike

  29. def dropWhile(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  30. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  31. def equals(other: Any): Boolean

    Definition Classes
    InnerEdgeLike → Equals → AnyRef → Any

  32. def exists(p: (NodeT) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  33. def filter(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  34. def filterNot(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  35. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  36. def find(p: (NodeT) ⇒ Boolean): Option[NodeT]

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  37. def flatMap[B, That](f: (NodeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  38. def flatten[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Iterable[B]

    Definition Classes
    GenericTraversableTemplate

  39. def fold[A1 >: NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  40. def foldLeft[B](z: B)(op: (B, NodeT) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  41. def foldRight[B](z: B)(op: (NodeT, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  42. def forall(p: (NodeT) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  43. def foreach[U](f: (NodeT) ⇒ U): Unit

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

  44. def genericBuilder[B]: Builder[B, Iterable[B]]

    Definition Classes
    GenericTraversableTemplate

  45. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  46. def groupBy[K](f: (NodeT) ⇒ K): Map[K, Iterable[NodeT]]

    Definition Classes
    TraversableLike → GenTraversableLike

  47. def grouped(size: Int): Iterator[Iterable[NodeT]]

    Definition Classes
    IterableLike

  48. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  49. def hashCode(): Int

    Definition Classes
    InnerEdgeLike → AnyRef → Any

  50. def head: NodeT

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  51. def headOption: Option[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  52. def init: Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  53. def inits: Iterator[Iterable[NodeT]]

    Definition Classes
    TraversableLike

  54. def isEmpty: Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  55. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  56. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  57. def last: NodeT

    Definition Classes
    TraversableLike → GenTraversableLike

  58. def lastOption: Option[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  59. def map[B, That](f: (NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  60. def max[B >: NodeT](implicit cmp: Ordering[B]): NodeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  61. def maxBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  62. def min[B >: NodeT](implicit cmp: Ordering[B]): NodeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  63. def minBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  64. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  65. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  67. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  68. def newBuilder: Builder[NodeT, Iterable[NodeT]]

    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder

  69. final def nodes: Iterable[NodeT]

    The inner nodes incident with this inner edge.

    The inner nodes incident with this inner edge. This is just a synonym to this that extends Iterable[NodeT].

    Annotations
    @inline()

  70. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  71. final def notify(): Unit

    Definition Classes
    AnyRef

  72. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  73. def par: ParIterable[NodeT]

    Definition Classes
    Parallelizable

  74. def parCombiner: Combiner[NodeT, ParIterable[NodeT]]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable

  75. def partition(p: (NodeT) ⇒ Boolean): (Iterable[NodeT], Iterable[NodeT])

    Definition Classes
    TraversableLike → GenTraversableLike

  76. def privateNodes: Set[NodeT]

    Finds nodes of this edge which only participate in this edge.

    Finds nodes of this edge which only participate in this edge.

    returns

    those nodes of this edge which do not participate in any other edge

  77. def product[B >: NodeT](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  78. def reduce[A1 >: NodeT](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  79. def reduceLeft[B >: NodeT](op: (B, NodeT) ⇒ B): B

    Definition Classes
    TraversableOnce

  80. def reduceLeftOption[B >: NodeT](op: (B, NodeT) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  81. def reduceOption[A1 >: NodeT](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  82. def reduceRight[B >: NodeT](op: (NodeT, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  83. def reduceRightOption[B >: NodeT](op: (NodeT, B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  84. def repr: Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  85. def reversed: List[NodeT]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  86. def sameElements[B >: NodeT](that: GenIterable[B]): Boolean

    Definition Classes
    IterableLike → GenIterableLike

  87. def scan[B >: NodeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  88. def scanLeft[B, That](z: B)(op: (B, NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  89. def scanRight[B, That](z: B)(op: (NodeT, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  90. def seq: Iterable[NodeT]

    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

  91. def size: Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  92. def slice(from: Int, until: Int): Iterable[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  93. def sliding(size: Int, step: Int): Iterator[Iterable[NodeT]]

    Definition Classes
    IterableLike

  94. def sliding(size: Int): Iterator[Iterable[NodeT]]

    Definition Classes
    IterableLike

  95. def span(p: (NodeT) ⇒ Boolean): (Iterable[NodeT], Iterable[NodeT])

    Definition Classes
    TraversableLike → GenTraversableLike

  96. def splitAt(n: Int): (Iterable[NodeT], Iterable[NodeT])

    Definition Classes
    TraversableLike → GenTraversableLike

  97. def stringPrefix: String

    Definition Classes
    TraversableLike → GenTraversableLike

  98. def sum[B >: NodeT](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

  100. def tail: Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  101. def tails: Iterator[Iterable[NodeT]]

    Definition Classes
    TraversableLike

  102. def take(n: Int): Iterable[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  103. def takeRight(n: Int): Iterable[NodeT]

    Definition Classes
    IterableLike

  104. def takeWhile(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  105. def thisCollection: Iterable[NodeT]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  106. def to: NodeT

  107. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, NodeT, Col[NodeT]]): Col[NodeT]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  108. def toArray[B >: NodeT](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  109. def toBuffer[B >: NodeT]: Buffer[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  110. def toCollection(repr: Iterable[NodeT]): Iterable[NodeT]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  111. def toEdgeIn: E[N]

    Reconstructs the outer edge by means of the copymethod.

  112. def toIndexedSeq: IndexedSeq[NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  113. def toIterable: Iterable[NodeT]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  114. def toIterator: Iterator[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  115. def toList: List[NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  116. def toMap[T, U](implicit ev: <:<[NodeT, (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  117. def toSeq: Seq[NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  118. def toSet[B >: NodeT]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  119. def toStream: Stream[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  120. def toString(): String

    Definition Classes
    InnerEdgeLike → TraversableLike → AnyRef → Any

  121. def toTraversable: Traversable[NodeT]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  122. def toVector: Vector[NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  123. def transpose[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  124. def unzip[A1, A2](implicit asPair: (NodeT) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

    Definition Classes
    GenericTraversableTemplate

  125. def unzip3[A1, A2, A3](implicit asTriple: (NodeT) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

    Definition Classes
    GenericTraversableTemplate

  126. def view(from: Int, until: Int): IterableView[NodeT, Iterable[NodeT]]

    Definition Classes
    IterableLike → TraversableLike

  127. def view: IterableView[NodeT, Iterable[NodeT]]

    Definition Classes
    IterableLike → TraversableLike

  128. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  130. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  131. def withFilter(p: (NodeT) ⇒ Boolean): FilterMonadic[NodeT, Iterable[NodeT]]

    Definition Classes
    TraversableLike → FilterMonadic

  132. def zip[A1 >: NodeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[NodeT], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike

  133. def zipAll[B, A1 >: NodeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[NodeT], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike

  134. def zipWithIndex[A1 >: NodeT, That](implicit bf: CanBuildFrom[Iterable[NodeT], (A1, Int), That]): That

    Definition Classes
    IterableLike → GenIterableLike

  135. final def ~~: Set[EdgeT]

    Synonym for adjacents.

    Synonym for adjacents.

    Annotations
    @inline()

Deprecated Value Members

  1. def /:\[A1 >: NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

Inherited from Edge

Inherited from Serializable

Inherited from Serializable

Inherited from Iterable[NodeT]

Inherited from IterableLike[NodeT, Iterable[NodeT]]

Inherited from Equals

Inherited from GenIterable[NodeT]

Inherited from GenIterableLike[NodeT, Iterable[NodeT]]

Inherited from Traversable[NodeT]

Inherited from GenTraversable[NodeT]

Inherited from GenericTraversableTemplate[NodeT, Iterable]

Inherited from TraversableLike[NodeT, Iterable[NodeT]]

Inherited from GenTraversableLike[NodeT, Iterable[NodeT]]

Inherited from Parallelizable[NodeT, ParIterable[NodeT]]

Inherited from TraversableOnce[NodeT]

Inherited from GenTraversableOnce[NodeT]

Inherited from FilterMonadic[NodeT, Iterable[NodeT]]

Inherited from HasNewBuilder[NodeT, Iterable[NodeT]]

Inherited from AnyRef

Inherited from Any

Ungrouped