scalax.collection.GraphBase

InnerEdge

trait InnerEdge extends Iterable[NodeT] with Edge with InnerElem

Linear Supertypes
InnerElem, 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. InnerEdge
  2. InnerElem
  3. Edge
  4. Serializable
  5. Serializable
  6. Iterable
  7. IterableLike
  8. Equals
  9. GenIterable
  10. GenIterableLike
  11. Traversable
  12. GenTraversable
  13. GenericTraversableTemplate
  14. TraversableLike
  15. GenTraversableLike
  16. Parallelizable
  17. TraversableOnce
  18. GenTraversableOnce
  19. FilterMonadic
  20. HasNewBuilder
  21. AnyRef
  22. Any
Implicitly
  1. by anyToNode
  2. by traversable2ops
  3. by MonadOps
  4. by flattenTraversableOnce
  5. by EdgeAssoc
  6. by graphParamsToPartition
  7. by any2stringadd
  8. by any2stringfmt
  9. by any2ArrowAssoc
  10. by any2Ensuring
  11. by alternateImplicit
  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 +(other: String): String

    Implicit information
    This member is added by an implicit conversion from InnerEdge to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    TraversableLike

  8. def ->[B](y: B): (InnerEdge, B)

    Implicit information
    This member is added by an implicit conversion from InnerEdge to ArrowAssoc[InnerEdge] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  13. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  18. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  19. def asParIterable: ParIterable[NodeT]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to TraversableOps[NodeT] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  20. def asParSeq: ParSeq[NodeT]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to TraversableOps[NodeT] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  21. def canEqual(that: Any): Boolean

    Definition Classes
    InnerEdge → IterableLike → Equals

  22. def clone(): AnyRef

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

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce

  25. def companion: GenericCompanion[Iterable]

    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

  34. def edgeParams: Iterable[EdgeParam]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions

  35. val elems: Iterable[Param[N, E]]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions

  36. def ensuring(cond: (InnerEdge) ⇒ Boolean, msg: ⇒ Any): InnerEdge

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  37. def ensuring(cond: (InnerEdge) ⇒ Boolean): InnerEdge

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  38. def ensuring(cond: Boolean, msg: ⇒ Any): InnerEdge

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  39. def ensuring(cond: Boolean): InnerEdge

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

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

    Definition Classes
    AnyRef

  41. def equals(other: Any): Boolean

    Definition Classes
    InnerEdge → Equals → AnyRef → Any

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

  45. def finalize(): Unit

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

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

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

  54. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from InnerEdge to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

  59. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  60. def hashCode(): Int

    Definition Classes
    InnerEdge → AnyRef → Any

  61. def head: NodeT

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  62. def headOption: Option[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  63. def ifParSeq[R](isbody: (ParSeq[NodeT]) ⇒ R): (TraversableOps[NodeT])#Otherwise[R]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to TraversableOps[NodeT] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  64. def init: Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike

  66. def isDefined: Boolean

    Implicit information
    This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param

  67. def isEdge: Boolean

    Implicit information
    This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam

  68. def isEmpty: Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  69. def isIn: Boolean

    Implicit information
    This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param

  70. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  71. def isNode: Boolean

    Implicit information
    This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam

  72. def isOut: Boolean

    Implicit information
    This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param

  73. def isParIterable: Boolean

    Implicit information
    This member is added by an implicit conversion from InnerEdge to TraversableOps[NodeT] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  74. def isParSeq: Boolean

    Implicit information
    This member is added by an implicit conversion from InnerEdge to TraversableOps[NodeT] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  75. def isParallel: Boolean

    Implicit information
    This member is added by an implicit conversion from InnerEdge to TraversableOps[NodeT] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  76. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  77. def last: NodeT

    Definition Classes
    TraversableLike → GenTraversableLike

  78. def lastOption: Option[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  84. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  85. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  87. val n1: InnerEdge

    Implicit information
    This member is added by an implicit conversion from InnerEdge to EdgeAssoc[InnerEdge] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc

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

    Definition Classes
    AnyRef

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

    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder

  90. def nodeParams: Iterable[NodeParam[N]]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions

  91. 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()

  92. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  93. final def notify(): Unit

    Definition Classes
    AnyRef

  94. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  95. def par: ParIterable[NodeT]

    Definition Classes
    Parallelizable

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

    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable

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

    Definition Classes
    TraversableLike → GenTraversableLike

  98. lazy val partitioned: (Iterable[Param[N, E]], Iterable[Param[N, E]])

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  107. def repr: Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  108. def reversed: List[NodeT]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

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

    Definition Classes
    IterableLike → GenIterableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

  113. def seq: Iterable[NodeT]

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

  114. def size: Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

  120. def stringPrefix: String

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

  123. def tail: Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

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

    Definition Classes
    IterableLike

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  128. def thisCollection: Iterable[NodeT]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  129. def to: NodeT

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

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  134. def toInParams: Iterable[InParam[N, E]]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions

  135. def toIndexedSeq: IndexedSeq[NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  136. def toIterable: Iterable[NodeT]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  137. def toIterator: Iterator[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  138. def toList: List[NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  140. def toOuter: E[N]

    Reconstructs the outer edge by means of the copy method.

  141. def toOuterEdges: Iterable[E[N]]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions

  142. def toOuterNodes: Iterable[N]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions

  143. def toParArray: ParArray[NodeT]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to TraversableOps[NodeT] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps

  144. def toSeq: Seq[NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  146. def toStream: Stream[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  147. def toString(): String

    Definition Classes
    InnerEdge → TraversableLike → AnyRef → Any

  148. def toTraversable: Traversable[NodeT]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  149. def toVector: Vector[NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    GenericTraversableTemplate

  153. val value: InnerEdge

    Implicit information
    This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam

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

    Definition Classes
    IterableLike → TraversableLike

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

    Definition Classes
    IterableLike → TraversableLike

  156. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    TraversableLike → FilterMonadic

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

    Definition Classes
    IterableLike → GenIterableLike

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

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

    Definition Classes
    IterableLike → GenIterableLike

  163. def ~[N >: N1, N2 <: N](n2: N2): UnDiEdge[N]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to EdgeAssoc[InnerEdge] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

  164. def ~>[N >: N1, N2 <: N](n2: N2): DiEdge[N]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to EdgeAssoc[InnerEdge] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

  165. final def ~~: Set[EdgeT]

    Synonym for adjacents.

    Synonym for adjacents.

    Annotations
    @inline()

  166. def →[B](y: B): (InnerEdge, B)

    Implicit information
    This member is added by an implicit conversion from InnerEdge to ArrowAssoc[InnerEdge] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def filter(p: (NodeT) ⇒ Boolean): TraversableOnce[NodeT]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to MonadOps[NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: MonadOps[NodeT]).filter(p)
    Definition Classes
    MonadOps

  2. def flatMap[B](f: (NodeT) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to MonadOps[NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: MonadOps[NodeT]).flatMap(f)
    Definition Classes
    MonadOps

  3. def flatten: Iterator[N]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to FlattenOps[N] performed by method flattenTraversableOnce in scala.collection.TraversableOnce. This conversion will take place only if an implicit value of type (InnerNodeParam[N]) ⇒ TraversableOnce[N] is in scope.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: FlattenOps[N]).flatten
    Definition Classes
    FlattenOps

  4. def map[B](f: (NodeT) ⇒ B): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to MonadOps[NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: MonadOps[NodeT]).map(f)
    Definition Classes
    MonadOps

  5. val self: Any

    Implicit information
    This member is added by an implicit conversion from InnerEdge to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (innerEdge: StringAdd).self
    Definition Classes
    StringAdd

  6. val self: Any

    Implicit information
    This member is added by an implicit conversion from InnerEdge to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (innerEdge: StringFormat).self
    Definition Classes
    StringFormat

  7. def stringPrefix: String

    Implicit information
    This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: OuterNode[InnerEdge]).stringPrefix
    Definition Classes
    NodeParam

  8. def toString(): String

    Implicit information
    This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: OuterNode[InnerEdge]).toString()
    Definition Classes
    NodeParam → AnyRef → Any

  9. def withFilter(p: (NodeT) ⇒ Boolean): Iterator[NodeT]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to MonadOps[NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: MonadOps[NodeT]).withFilter(p)
    Definition Classes
    MonadOps

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

  2. def toEdgeIn: E[N]

    Annotations
    @deprecated
    Deprecated

    (Since version 1.8.0) Use toOuter instead

  3. def x: InnerEdge

    Implicit information
    This member is added by an implicit conversion from InnerEdge to ArrowAssoc[InnerEdge] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (innerEdge: ArrowAssoc[InnerEdge]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  4. def x: InnerEdge

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (innerEdge: Ensuring[InnerEdge]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from InnerElem

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

Inherited by implicit conversion anyToNode from InnerEdge to OuterNode[InnerEdge]

Inherited by implicit conversion traversable2ops from InnerEdge to TraversableOps[NodeT]

Inherited by implicit conversion MonadOps from InnerEdge to MonadOps[NodeT]

Inherited by implicit conversion flattenTraversableOnce from InnerEdge to FlattenOps[N]

Inherited by implicit conversion EdgeAssoc from InnerEdge to EdgeAssoc[InnerEdge]

Inherited by implicit conversion graphParamsToPartition from InnerEdge to Partitions[N, E]

Inherited by implicit conversion any2stringadd from InnerEdge to StringAdd

Inherited by implicit conversion any2stringfmt from InnerEdge to StringFormat

Inherited by implicit conversion any2ArrowAssoc from InnerEdge to ArrowAssoc[InnerEdge]

Inherited by implicit conversion any2Ensuring from InnerEdge to Ensuring[InnerEdge]

Inherited by implicit conversion alternateImplicit from InnerEdge to ForceImplicitAmbiguity

Ungrouped