Packages

class EdgeSet extends This.EdgeSet

Linear Supertypes
This.EdgeSet, This.EdgeSet, This.EdgeSet, Serializable, Serializable, ExtSetMethods[This.EdgeT], Set[This.EdgeT], SetLike[This.EdgeT, Set[This.EdgeT]], Subtractable[This.EdgeT, Set[This.EdgeT]], GenSet[This.EdgeT], GenericSetTemplate[This.EdgeT, Set], GenSetLike[This.EdgeT, Set[This.EdgeT]], Iterable[This.EdgeT], IterableLike[This.EdgeT, Set[This.EdgeT]], Equals, GenIterable[This.EdgeT], GenIterableLike[This.EdgeT, Set[This.EdgeT]], Traversable[This.EdgeT], GenTraversable[This.EdgeT], GenericTraversableTemplate[This.EdgeT, Set], TraversableLike[This.EdgeT, Set[This.EdgeT]], GenTraversableLike[This.EdgeT, Set[This.EdgeT]], Parallelizable[This.EdgeT, ParSet[This.EdgeT]], TraversableOnce[This.EdgeT], GenTraversableOnce[This.EdgeT], FilterMonadic[This.EdgeT, Set[This.EdgeT]], HasNewBuilder[This.EdgeT, Set[This.EdgeT]], (This.EdgeT) ⇒ Boolean, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EdgeSet
  2. EdgeSet
  3. EdgeSet
  4. EdgeSet
  5. Serializable
  6. Serializable
  7. ExtSetMethods
  8. Set
  9. SetLike
  10. Subtractable
  11. GenSet
  12. GenericSetTemplate
  13. GenSetLike
  14. Iterable
  15. IterableLike
  16. Equals
  17. GenIterable
  18. GenIterableLike
  19. Traversable
  20. GenTraversable
  21. GenericTraversableTemplate
  22. TraversableLike
  23. GenTraversableLike
  24. Parallelizable
  25. TraversableOnce
  26. GenTraversableOnce
  27. FilterMonadic
  28. HasNewBuilder
  29. Function1
  30. AnyRef
  31. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by flattenTraversableOnce
  5. by EdgeAssoc
  6. by predicateToNodePredicate
  7. by graphParamsToPartition
  8. by any2stringadd
  9. by StringFormat
  10. by Ensuring
  11. by ArrowAssoc
  12. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new EdgeSet()

Type Members

  1. type Self = Set[This.EdgeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def &(that: GenSet[This.EdgeT]): Set[This.EdgeT]
    Definition Classes
    GenSetLike
  4. def &~(that: GenSet[This.EdgeT]): Set[This.EdgeT]
    Definition Classes
    GenSetLike
  5. final def +(edge: This.EdgeT): Set[This.EdgeT]
    Definition Classes
    EdgeSet → SetLike → GenSetLike
    Annotations
    @inline()
  6. def +(elem1: This.EdgeT, elem2: This.EdgeT, elems: This.EdgeT*): Set[This.EdgeT]
    Definition Classes
    SetLike
  7. def ++(elems: GenTraversableOnce[This.EdgeT]): Set[This.EdgeT]
    Definition Classes
    SetLike
  8. def ++[B >: This.EdgeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  9. def ++:[B >: This.EdgeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
    Definition Classes
    TraversableLike
  10. def ++:[B >: This.EdgeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
    Definition Classes
    TraversableLike
  11. final def +=(edge: This.EdgeT): EdgeSet.this.type
    Attributes
    protected[scalax.collection.immutable.AdjacencyListGraph]
    Annotations
    @inline()
  12. final def -(edge: This.EdgeT): Set[This.EdgeT]
    Definition Classes
    EdgeSet → SetLike → Subtractable → GenSetLike
    Annotations
    @inline()
  13. def -(elem1: This.EdgeT, elem2: This.EdgeT, elems: This.EdgeT*): Set[This.EdgeT]
    Definition Classes
    Subtractable
  14. def --(xs: GenTraversableOnce[This.EdgeT]): Set[This.EdgeT]
    Definition Classes
    Subtractable
  15. def ->[B](y: B): (This.EdgeSet, B)
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to ArrowAssoc[This.EdgeSet] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  16. def /:[B](z: B)(op: (B, This.EdgeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  17. def :\[B](z: B)(op: (This.EdgeT, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  18. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  19. final def addEdge(edge: This.EdgeT): Unit
    Attributes
    protected[scalax.collection.immutable]
    Definition Classes
    EdgeSetEdgeSet
    Annotations
    @inline()
  20. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  21. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  22. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  23. def aggregate[B](z: ⇒ B)(seqop: (B, This.EdgeT) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  24. def andThen[A](g: (Boolean) ⇒ A): (This.EdgeT) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  25. def apply(elem: This.EdgeT): Boolean
    Definition Classes
    GenSetLike → Function1
  26. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  27. def asSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: This.EdgeOrdering = defaultEdgeOrdering): String

    Sorts all edges according to ord and concatenates them using separator.

    Sorts all edges according to ord and concatenates them using separator.

    separator

    to separate edges by.

    ord

    custom ordering.

    returns

    sorted and concatenated string representation of this edge set.

    Definition Classes
    EdgeSet
  28. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  29. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. def collect[B, That](pf: PartialFunction[This.EdgeT, B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  31. def collectFirst[B](pf: PartialFunction[This.EdgeT, B]): Option[B]
    Definition Classes
    TraversableOnce
  32. def companion: GenericCompanion[Set]
    Definition Classes
    Set → GenSet → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  33. def compose[A](g: (A) ⇒ This.EdgeT): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  34. final def contains(edge: This.EdgeT): Boolean
    Definition Classes
    EdgeSet → SetLike → GenSetLike
  35. final def contains(node: This.NodeT): Boolean
    Definition Classes
    EdgeSetEdgeSet
  36. def copyToArray[B >: This.EdgeT](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  37. def copyToArray[B >: This.EdgeT](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  38. def copyToArray[B >: This.EdgeT](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  39. def copyToBuffer[B >: This.EdgeT](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  40. def count(p: (This.EdgeT) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  41. def diff(that: GenSet[This.EdgeT]): Set[This.EdgeT]
    Definition Classes
    SetLike → GenSetLike
  42. final def draw(random: Random): This.EdgeT

    Returns a random element of the set if it is nonEmpty otherwise throws IllegalArgumentException.

    Returns a random element of the set if it is nonEmpty otherwise throws IllegalArgumentException.

    random

    a random generator; it is essential that random be instantiated by the caller just once for any sequence of calls

    Definition Classes
    EdgeSetExtSetMethods
  43. def drop(n: Int): Set[This.EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  44. def dropRight(n: Int): Set[This.EdgeT]
    Definition Classes
    IterableLike
  45. def dropWhile(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  46. def edgeParams: Traversable[EdgeParam]
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  47. val elems: Traversable[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  48. def empty: Set[This.EdgeT]
    Definition Classes
    GenericSetTemplate
  49. def ensuring(cond: (This.EdgeSet) ⇒ Boolean, msg: ⇒ Any): This.EdgeSet
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to Ensuring[This.EdgeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  50. def ensuring(cond: (This.EdgeSet) ⇒ Boolean): This.EdgeSet
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to Ensuring[This.EdgeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  51. def ensuring(cond: Boolean, msg: ⇒ Any): This.EdgeSet
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to Ensuring[This.EdgeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  52. def ensuring(cond: Boolean): This.EdgeSet
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to Ensuring[This.EdgeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  53. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  54. def equals(that: Any): Boolean
    Definition Classes
    GenSetLike → Equals → AnyRef → Any
  55. def exists(p: (This.EdgeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  56. def filter(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  57. def filterNot(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  58. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  59. final def find(elem: E[N]): Option[This.EdgeT]

    Finds the inner edge corresponding to outerEdge.

    Finds the inner edge corresponding to outerEdge.

    returns

    the inner node wrapped by Some if found, otherwise None.

    Definition Classes
    EdgeSetEdgeSet
  60. def find(p: (This.EdgeT) ⇒ Boolean): Option[This.EdgeT]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  61. final def findEntry[B](other: B, correspond: (This.EdgeT, B) ⇒ Boolean): This.EdgeT

    Finds an entry in the collection based on toMatch's hashCode and a correspondence function but not on the argument type.

    Finds an entry in the collection based on toMatch's hashCode and a correspondence function but not on the argument type.

    correspond

    function returning whether a given entry corresponds to other

    returns

    the entry corresponding to toMatch or null if not contained

    Definition Classes
    EdgeSetExtSetMethods
  62. def flatMap[B, That](f: (This.EdgeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  63. def flatten[B](implicit asTraversable: (This.EdgeT) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  64. def fold[A1 >: This.EdgeT](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  65. def foldLeft[B](z: B)(op: (B, This.EdgeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  66. def foldRight[B](z: B)(op: (This.EdgeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  67. def forall(p: (This.EdgeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  68. def foreach[U](f: (This.EdgeT) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  69. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to StringFormat[This.EdgeSet] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  70. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  71. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  72. def groupBy[K](f: (This.EdgeT) ⇒ K): Map[K, Set[This.EdgeT]]
    Definition Classes
    TraversableLike → GenTraversableLike
  73. def grouped(size: Int): Iterator[Set[This.EdgeT]]
    Definition Classes
    IterableLike
  74. final def hasAnyHyperEdge: Boolean
    Definition Classes
    EdgeSetEdgeSet
  75. final lazy val hasAnyMultiEdge: Boolean
    Definition Classes
    EdgeSetEdgeSetEdgeSet
    Annotations
    @inline()
  76. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  77. final def hasOnlyDiEdges: Boolean
    Definition Classes
    EdgeSetEdgeSet
  78. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  79. def head: This.EdgeT
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  80. def headOption: Option[This.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  81. def init: Set[This.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  82. def initialize(edges: Traversable[E[N]]): Unit

    This method is called by the primary constructor.

    This method is called by the primary constructor. It must be defined by the trait responsible for the implementation of the graph representation.

    edges

    The outer edges that the edge set of this graph is to be populated with. Nodes being the end of any of these edges will be added to the node set.

    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeSetEdgeSet
  83. def inits: Iterator[Set[This.EdgeT]]
    Definition Classes
    TraversableLike
  84. def intersect(that: GenSet[This.EdgeT]): Set[This.EdgeT]
    Definition Classes
    GenSetLike
  85. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  86. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  87. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  88. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  89. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  90. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  91. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParamParam
  92. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  93. final def iterator: Iterator[This.EdgeT]
    Definition Classes
    EdgeSet → GenSetLike → IterableLike → GenIterableLike
  94. def last: This.EdgeT
    Definition Classes
    TraversableLike → GenTraversableLike
  95. def lastOption: Option[This.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  96. def map[B, That](f: (This.EdgeT) ⇒ B)(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
    Definition Classes
    SetLike → TraversableLike → GenTraversableLike → FilterMonadic
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.

  97. def max[B >: This.EdgeT](implicit cmp: Ordering[B]): This.EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. final lazy val maxArity: Int

    The maximum arity of all edges in this edge set.

    The maximum arity of all edges in this edge set.

    Definition Classes
    EdgeSetEdgeSet
    Annotations
    @inline()
  99. def maxBy[B](f: (This.EdgeT) ⇒ B)(implicit cmp: Ordering[B]): This.EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def min[B >: This.EdgeT](implicit cmp: Ordering[B]): This.EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def minBy[B](f: (This.EdgeT) ⇒ B)(implicit cmp: Ordering[B]): This.EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. val n1: This.EdgeSet
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to EdgeAssoc[This.EdgeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  106. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  107. def newBuilder: Builder[This.EdgeT, Set[This.EdgeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → HasNewBuilder
  108. def nodeParams: Traversable[NodeParam[N]]
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  109. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. final def notify(): Unit
    Definition Classes
    AnyRef
  111. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  112. def par: ParSet[This.EdgeT]
    Definition Classes
    Parallelizable
  113. def parCombiner: Combiner[This.EdgeT, ParSet[This.EdgeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → Parallelizable
  114. def partition(p: (This.EdgeT) ⇒ Boolean): (Set[This.EdgeT], Set[This.EdgeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  115. lazy val partitioned: (Traversable[Param[N, E]], Traversable[Param[N, E]])
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  116. def product[B >: This.EdgeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def reduce[A1 >: This.EdgeT](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def reduceLeft[B >: This.EdgeT](op: (B, This.EdgeT) ⇒ B): B
    Definition Classes
    TraversableOnce
  119. def reduceLeftOption[B >: This.EdgeT](op: (B, This.EdgeT) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. def reduceOption[A1 >: This.EdgeT](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. def reduceRight[B >: This.EdgeT](op: (This.EdgeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  122. def reduceRightOption[B >: This.EdgeT](op: (This.EdgeT, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  123. def repr: Set[This.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  124. def reversed: List[This.EdgeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  125. def sameElements[B >: This.EdgeT](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  126. def scan[B >: This.EdgeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Set[This.EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  127. def scanLeft[B, That](z: B)(op: (B, This.EdgeT) ⇒ B)(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  128. def scanRight[B, That](z: B)(op: (This.EdgeT, B) ⇒ B)(implicit bf: CanBuildFrom[Set[This.EdgeT], 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.

  129. def seq: Set[This.EdgeT]
    Definition Classes
    Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  130. def size: Int
    Definition Classes
    EdgeSet → GenTraversableLike → TraversableOnce → GenTraversableOnce
  131. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  132. def slice(from: Int, until: Int): Set[This.EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  133. def sliding(size: Int, step: Int): Iterator[Set[This.EdgeT]]
    Definition Classes
    IterableLike
  134. def sliding(size: Int): Iterator[Set[This.EdgeT]]
    Definition Classes
    IterableLike
  135. def span(p: (This.EdgeT) ⇒ Boolean): (Set[This.EdgeT], Set[This.EdgeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  136. def splitAt(n: Int): (Set[This.EdgeT], Set[This.EdgeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  137. final def statistics(edge: This.EdgeT, plus: Boolean): Boolean
    Attributes
    protected
    Definition Classes
    EdgeSet
  138. def stringPrefix: String
    Definition Classes
    EdgeSet → SetLike → TraversableLike → GenTraversableLike
  139. def subsetOf(that: GenSet[This.EdgeT]): Boolean
    Definition Classes
    GenSetLike
  140. def subsets(): Iterator[Set[This.EdgeT]]
    Definition Classes
    SetLike
  141. def subsets(len: Int): Iterator[Set[This.EdgeT]]
    Definition Classes
    SetLike
  142. def sum[B >: This.EdgeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  144. def tail: Set[This.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  145. def tails: Iterator[Set[This.EdgeT]]
    Definition Classes
    TraversableLike
  146. def take(n: Int): Set[This.EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  147. def takeRight(n: Int): Set[This.EdgeT]
    Definition Classes
    IterableLike
  148. def takeWhile(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  149. def thisCollection: Iterable[This.EdgeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  150. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, This.EdgeT, Col[This.EdgeT]]): Col[This.EdgeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  151. def toArray[B >: This.EdgeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  152. def toBuffer[A1 >: This.EdgeT]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  153. def toCollection(repr: Set[This.EdgeT]): Iterable[This.EdgeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  154. def toInParams: Traversable[InParam[N, E]]
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  155. def toIndexedSeq: IndexedSeq[This.EdgeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  156. def toIterable: Iterable[This.EdgeT]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  157. def toIterator: Iterator[This.EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  158. def toList: List[This.EdgeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  159. def toMap[T, U](implicit ev: <:<[This.EdgeT, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  160. def toOuter: Set[E[N]]

    Converts this edge set to a set of outer edges.

    Converts this edge set to a set of outer edges.

    Definition Classes
    EdgeSet
  161. def toOuterEdges: Traversable[E[N]]
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  162. def toOuterNodes: Traversable[N]
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  163. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to CollectionsHaveToParArray[This.EdgeSet, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (This.EdgeSet) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  164. def toSeq: Seq[This.EdgeT]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  165. def toSet[B >: This.EdgeT]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  166. def toSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: This.EdgeOrdering = defaultEdgeOrdering): String

    Sorts all edges according to ord, concatenates them using separator and prefixes and parenthesizes the result with stringPrefix.

    Sorts all edges according to ord, concatenates them using separator and prefixes and parenthesizes the result with stringPrefix.

    separator

    to separate edges by.

    ord

    custom ordering.

    returns

    sorted, concatenated and prefixed string representation of this edge set.

    Definition Classes
    EdgeSet
  167. def toStream: Stream[This.EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  168. def toString(): String
    Definition Classes
    SetLike → Function1 → TraversableLike → AnyRef → Any
  169. def toTraversable: Traversable[This.EdgeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  170. def toVector: Vector[This.EdgeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  171. def transpose[B](implicit asTraversable: (This.EdgeT) ⇒ GenTraversableOnce[B]): Set[Set[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  172. def union(that: GenSet[This.EdgeT]): Set[This.EdgeT]
    Definition Classes
    SetLike → GenSetLike
  173. def unzip[A1, A2](implicit asPair: (This.EdgeT) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  174. def unzip3[A1, A2, A3](implicit asTriple: (This.EdgeT) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  175. val value: This.EdgeSet
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNodeNodeParam
  176. def view(from: Int, until: Int): IterableView[This.EdgeT, Set[This.EdgeT]]
    Definition Classes
    IterableLike → TraversableLike
  177. def view: IterableView[This.EdgeT, Set[This.EdgeT]]
    Definition Classes
    IterableLike → TraversableLike
  178. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  179. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  180. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  181. def withFilter(p: (This.EdgeT) ⇒ Boolean): FilterMonadic[This.EdgeT, Set[This.EdgeT]]
    Definition Classes
    TraversableLike → FilterMonadic
  182. def withSetFilter(p: (This.EdgeT) ⇒ Boolean): FilteredSet[This.EdgeT]

    Returns a lazily filtered immutable Set.

    Returns a lazily filtered immutable Set.

    Definition Classes
    ExtSetMethods
  183. def zip[A1 >: This.EdgeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  184. def zipAll[B, A1 >: This.EdgeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Set[This.EdgeT], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  185. def zipWithIndex[A1 >: This.EdgeT, That](implicit bf: CanBuildFrom[Set[This.EdgeT], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  186. def |(that: GenSet[This.EdgeT]): Set[This.EdgeT]
    Definition Classes
    GenSetLike
  187. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to EdgeAssoc[This.EdgeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  188. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to EdgeAssoc[This.EdgeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  189. def [B](y: B): (This.EdgeSet, B)
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to ArrowAssoc[This.EdgeSet] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to any2stringadd[This.EdgeSet] performed by method any2stringadd in scala.Predef.
    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:
    (edgeSet: any2stringadd[This.EdgeSet]).+(other)
    Definition Classes
    any2stringadd
  2. def andThen[A](g: (Boolean) ⇒ A): (Param[This.EdgeT, EI]) ⇒ A
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to (Param[This.EdgeT, EI]) ⇒ Boolean performed by method predicateToNodePredicate 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:
    (edgeSet: (Param[This.EdgeT, EI]) ⇒ Boolean).andThen(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  3. def apply(v1: Param[This.EdgeT, EI]): Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to (Param[This.EdgeT, EI]) ⇒ Boolean performed by method predicateToNodePredicate 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:
    (edgeSet: (Param[This.EdgeT, EI]) ⇒ Boolean).apply(v1)
    Definition Classes
    Function1
  4. def compose[A](g: (A) ⇒ Param[This.EdgeT, EI]): (A) ⇒ Boolean
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to (Param[This.EdgeT, EI]) ⇒ Boolean performed by method predicateToNodePredicate 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:
    (edgeSet: (Param[This.EdgeT, EI]) ⇒ Boolean).compose(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  5. def filter(p: (This.EdgeT) ⇒ Boolean): TraversableOnce[This.EdgeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to MonadOps[This.EdgeT] 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:
    (edgeSet: MonadOps[This.EdgeT]).filter(p)
    Definition Classes
    MonadOps
  6. def flatMap[B](f: (This.EdgeT) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to MonadOps[This.EdgeT] 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:
    (edgeSet: MonadOps[This.EdgeT]).flatMap(f)
    Definition Classes
    MonadOps
  7. def flatten: Iterator[This.NodeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to FlattenOps[This.NodeT] performed by method flattenTraversableOnce in scala.collection.TraversableOnce. This conversion will take place only if an implicit value of type (Iterable[This.NodeT]) ⇒ TraversableOnce[This.NodeT] 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:
    (edgeSet: FlattenOps[This.NodeT]).flatten
    Definition Classes
    FlattenOps
  8. def map[B](f: (This.EdgeT) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to MonadOps[This.EdgeT] 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:
    (edgeSet: MonadOps[This.EdgeT]).map(f)
    Definition Classes
    MonadOps
  9. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] 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:
    (edgeSet: OuterNode[This.EdgeSet]).stringPrefix
    Definition Classes
    NodeParam
  10. def toString(): String
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to OuterNode[This.EdgeSet] 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:
    (edgeSet: OuterNode[This.EdgeSet]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  11. def toString(): String
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to (Param[This.EdgeT, EI]) ⇒ Boolean performed by method predicateToNodePredicate 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:
    (edgeSet: (Param[This.EdgeT, EI]) ⇒ Boolean).toString()
    Definition Classes
    Function1 → AnyRef → Any
  12. def withFilter(p: (This.EdgeT) ⇒ Boolean): Iterator[This.EdgeT]
    Implicit
    This member is added by an implicit conversion from This.EdgeSet to MonadOps[This.EdgeT] 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:
    (edgeSet: MonadOps[This.EdgeT]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

  1. def toEdgeInSet: Set[E[N]]
    Definition Classes
    EdgeSet
    Annotations
    @deprecated
    Deprecated

    (Since version 1.8.0) Use toOuter instead

Inherited from This.EdgeSet

Inherited from This.EdgeSet

Inherited from This.EdgeSet

Inherited from Serializable

Inherited from Serializable

Inherited from ExtSetMethods[This.EdgeT]

Inherited from Set[This.EdgeT]

Inherited from SetLike[This.EdgeT, Set[This.EdgeT]]

Inherited from Subtractable[This.EdgeT, Set[This.EdgeT]]

Inherited from GenSet[This.EdgeT]

Inherited from GenericSetTemplate[This.EdgeT, Set]

Inherited from GenSetLike[This.EdgeT, Set[This.EdgeT]]

Inherited from Iterable[This.EdgeT]

Inherited from IterableLike[This.EdgeT, Set[This.EdgeT]]

Inherited from Equals

Inherited from GenIterable[This.EdgeT]

Inherited from GenIterableLike[This.EdgeT, Set[This.EdgeT]]

Inherited from Traversable[This.EdgeT]

Inherited from GenTraversable[This.EdgeT]

Inherited from GenericTraversableTemplate[This.EdgeT, Set]

Inherited from TraversableLike[This.EdgeT, Set[This.EdgeT]]

Inherited from GenTraversableLike[This.EdgeT, Set[This.EdgeT]]

Inherited from Parallelizable[This.EdgeT, ParSet[This.EdgeT]]

Inherited from TraversableOnce[This.EdgeT]

Inherited from GenTraversableOnce[This.EdgeT]

Inherited from FilterMonadic[This.EdgeT, Set[This.EdgeT]]

Inherited from HasNewBuilder[This.EdgeT, Set[This.EdgeT]]

Inherited from (This.EdgeT) ⇒ Boolean

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from This.EdgeSet to OuterNode[This.EdgeSet]

Inherited by implicit conversion CollectionsHaveToParArray from This.EdgeSet to CollectionsHaveToParArray[This.EdgeSet, T]

Inherited by implicit conversion MonadOps from This.EdgeSet to MonadOps[This.EdgeT]

Inherited by implicit conversion flattenTraversableOnce from This.EdgeSet to FlattenOps[This.NodeT]

Inherited by implicit conversion EdgeAssoc from This.EdgeSet to EdgeAssoc[This.EdgeSet]

Inherited by implicit conversion predicateToNodePredicate from This.EdgeSet to (Param[This.EdgeT, EI]) ⇒ Boolean

Inherited by implicit conversion graphParamsToPartition from This.EdgeSet to Partitions[N, E]

Inherited by implicit conversion any2stringadd from This.EdgeSet to any2stringadd[This.EdgeSet]

Inherited by implicit conversion StringFormat from This.EdgeSet to StringFormat[This.EdgeSet]

Inherited by implicit conversion Ensuring from This.EdgeSet to Ensuring[This.EdgeSet]

Inherited by implicit conversion ArrowAssoc from This.EdgeSet to ArrowAssoc[This.EdgeSet]

Inherited by implicit conversion alternateImplicit from This.EdgeSet to ForceImplicitAmbiguity

Ungrouped