Packages

class EdgeSet extends This.EdgeSet

Annotations
@SerialVersionUID()
Linear Supertypes
This.EdgeSet, This.EdgeSet, This.EdgeSet, This.EdgeSet, This.EdgeSet, Serializable, Serializable, ExtSetMethods[This.EdgeT], Set[This.EdgeT], SetLike[This.EdgeT, Set[This.EdgeT]], Cloneable[Set[This.EdgeT]], Cloneable, Cloneable, Shrinkable[This.EdgeT], Builder[This.EdgeT, Set[This.EdgeT]], Growable[This.EdgeT], Clearable, Scriptable[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]], (This.EdgeT) ⇒ Boolean, Iterable[This.EdgeT], Iterable[This.EdgeT], IterableLike[This.EdgeT, Set[This.EdgeT]], Equals, GenIterable[This.EdgeT], GenIterableLike[This.EdgeT, Set[This.EdgeT]], Traversable[This.EdgeT], Mutable, 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]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EdgeSet
  2. EdgeSet
  3. EdgeSet
  4. EdgeSet
  5. EdgeSet
  6. EdgeSet
  7. Serializable
  8. Serializable
  9. ExtSetMethods
  10. Set
  11. SetLike
  12. Cloneable
  13. Cloneable
  14. Cloneable
  15. Shrinkable
  16. Builder
  17. Growable
  18. Clearable
  19. Scriptable
  20. Set
  21. SetLike
  22. Subtractable
  23. GenSet
  24. GenericSetTemplate
  25. GenSetLike
  26. Function1
  27. Iterable
  28. Iterable
  29. IterableLike
  30. Equals
  31. GenIterable
  32. GenIterableLike
  33. Traversable
  34. Mutable
  35. Traversable
  36. GenTraversable
  37. GenericTraversableTemplate
  38. TraversableLike
  39. GenTraversableLike
  40. Parallelizable
  41. TraversableOnce
  42. GenTraversableOnce
  43. FilterMonadic
  44. HasNewBuilder
  45. AnyRef
  46. Any
Implicitly
  1. by anyToNode
  2. by MonadOps
  3. by CollectionsHaveToParArray
  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. def +(elem1: This.EdgeT, elem2: This.EdgeT, elems: This.EdgeT*): Set[This.EdgeT]
    Definition Classes
    SetLike → SetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new set. Use += to add an element to this set and return that set itself.

  6. def +(elem: This.EdgeT): Set[This.EdgeT]
    Definition Classes
    SetLike → SetLike → GenSetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new set. Use += to add an element to this set and return that set itself.

  7. def ++(xs: GenTraversableOnce[This.EdgeT]): Set[This.EdgeT]
    Definition Classes
    SetLike → SetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) ++ creates a new set. Use ++= to add elements to this set and return that set itself.

  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. def ++=(xs: TraversableOnce[This.EdgeT]): EdgeSet.this.type
    Definition Classes
    Growable
  12. final def +=(edge: This.EdgeT): EdgeSet.this.type
    Definition Classes
    EdgeSet → SetLike → Builder → Growable
    Annotations
    @inline()
  13. def +=(elem1: This.EdgeT, elem2: This.EdgeT, elems: This.EdgeT*): EdgeSet.this.type
    Definition Classes
    Growable
  14. def -(elem1: This.EdgeT, elem2: This.EdgeT, elems: This.EdgeT*): Set[This.EdgeT]
    Definition Classes
    SetLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new set. Use -= to remove an element from this set and return that set itself.

  15. def -(elem: This.EdgeT): Set[This.EdgeT]
    Definition Classes
    SetLike → SetLike → Subtractable → GenSetLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new set. Use -= to remove an element from this set and return that set itself.

  16. def --(xs: GenTraversableOnce[This.EdgeT]): Set[This.EdgeT]
    Definition Classes
    SetLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) -- creates a new set. Use --= to remove elements from this set and return that set itself.

  17. def --=(xs: TraversableOnce[This.EdgeT]): EdgeSet.this.type
    Definition Classes
    Shrinkable
  18. final def -=(edge: This.EdgeT): EdgeSet.this.type
    Definition Classes
    EdgeSet → SetLike → Shrinkable
    Annotations
    @inline()
  19. def -=(elem1: This.EdgeT, elem2: This.EdgeT, elems: This.EdgeT*): EdgeSet.this.type
    Definition Classes
    Shrinkable
  20. 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()
  21. def /:[B](z: B)(op: (B, This.EdgeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  22. def :\[B](z: B)(op: (This.EdgeT, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  23. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  24. def add(edge: This.EdgeT): Boolean
    Definition Classes
    EdgeSet → EdgeSet → SetLike
  25. final def addEdge(edge: This.EdgeT): Unit
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeSet → EdgeSet
    Annotations
    @inline()
  26. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  27. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  28. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  29. def aggregate[B](z: ⇒ B)(seqop: (B, This.EdgeT) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  30. def andThen[A](g: (Boolean) ⇒ A): (This.EdgeT) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  31. def apply(elem: This.EdgeT): Boolean
    Definition Classes
    GenSetLike → Function1
  32. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  33. def asSortedString(separator: String)(implicit ord: This.EdgeOrdering): String
    Definition Classes
    EdgeSet
  34. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  35. def checkedRemove(edge: This.EdgeT, forced: Boolean, remove: (This.EdgeT) ⇒ Boolean): Boolean

    generic constrained subtraction

    generic constrained subtraction

    Attributes
    protected
  36. def clear(): Unit
    Definition Classes
    SetLike → Builder → Growable → Clearable
  37. def clone(): Set[This.EdgeT]
    Definition Classes
    SetLike → Cloneable → AnyRef
  38. def collect[B, That](pf: PartialFunction[This.EdgeT, B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  39. def collectFirst[B](pf: PartialFunction[This.EdgeT, B]): Option[B]
    Definition Classes
    TraversableOnce
  40. def companion: GenericCompanion[Set]
    Definition Classes
    Set → Set → GenSet → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  41. def compose[A](g: (A) ⇒ This.EdgeT): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  42. final def contains(edge: This.EdgeT): Boolean
    Definition Classes
    EdgeSet → SetLike → GenSetLike
  43. final def contains(node: This.NodeT): Boolean
    Definition Classes
    EdgeSet → EdgeSet
  44. def copyToArray[B >: This.EdgeT](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  45. def copyToArray[B >: This.EdgeT](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  46. def copyToArray[B >: This.EdgeT](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  47. def copyToBuffer[B >: This.EdgeT](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  48. def count(p: (This.EdgeT) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  49. def diff(that: GenSet[This.EdgeT]): Set[This.EdgeT]
    Definition Classes
    SetLike → GenSetLike
  50. final def draw(random: Random): This.EdgeT
    Definition Classes
    EdgeSet → ExtSetMethods
  51. def drop(n: Int): Set[This.EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  52. def dropRight(n: Int): Set[This.EdgeT]
    Definition Classes
    IterableLike
  53. def dropWhile(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  54. 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
  55. 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
  56. def empty: Set[This.EdgeT]
    Definition Classes
    GenericSetTemplate
  57. 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
  58. 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
  59. 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
  60. 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
  61. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  62. def equals(that: Any): Boolean
    Definition Classes
    GenSetLike → Equals → AnyRef → Any
  63. def exists(p: (This.EdgeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  64. def filter(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  65. def filterNot(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  66. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  67. final def find(elem: E[N]): Option[This.EdgeT]
    Definition Classes
    EdgeSet → EdgeSet
  68. def find(p: (This.EdgeT) ⇒ Boolean): Option[This.EdgeT]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  69. final def findEntry[B](other: B, correspond: (This.EdgeT, B) ⇒ Boolean): This.EdgeT
    Definition Classes
    EdgeSet → ExtSetMethods
  70. def flatMap[B, That](f: (This.EdgeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  71. def flatten[B](implicit asTraversable: (This.EdgeT) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  72. def fold[A1 >: This.EdgeT](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  73. def foldLeft[B](z: B)(op: (B, This.EdgeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  74. def foldRight[B](z: B)(op: (This.EdgeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  75. def forall(p: (This.EdgeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  76. def foreach[U](f: (This.EdgeT) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  77. 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()
  78. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  79. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  80. def groupBy[K](f: (This.EdgeT) ⇒ K): Map[K, Set[This.EdgeT]]
    Definition Classes
    TraversableLike → GenTraversableLike
  81. def grouped(size: Int): Iterator[Set[This.EdgeT]]
    Definition Classes
    IterableLike
  82. final def hasAnyHyperEdge: Boolean
    Definition Classes
    EdgeSet → EdgeSet
  83. def hasAnyMultiEdge: Boolean
    Definition Classes
    EdgeSet → EdgeSet
  84. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  85. final def hasOnlyDiEdges: Boolean
    Definition Classes
    EdgeSet → EdgeSet
  86. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  87. def head: This.EdgeT
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  88. def headOption: Option[This.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  89. def init: Set[This.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  90. def initialize(edges: Traversable[E[N]]): Unit
    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeSet → EdgeSet
  91. var initialized: Boolean
    Attributes
    protected[scalax.collection.mutable.AdjacencyListGraph]
    Definition Classes
    EdgeSet
  92. def inits: Iterator[Set[This.EdgeT]]
    Definition Classes
    TraversableLike
  93. def intersect(that: GenSet[This.EdgeT]): Set[This.EdgeT]
    Definition Classes
    GenSetLike
  94. 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
  95. 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
  96. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  97. 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
    InParam → Param
  98. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  99. 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
  100. 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
    InParam → Param
  101. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  102. final def iterator: Iterator[This.EdgeT]
    Definition Classes
    EdgeSet → GenSetLike → IterableLike → GenIterableLike
  103. def last: This.EdgeT
    Definition Classes
    TraversableLike → GenTraversableLike
  104. def lastOption: Option[This.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  105. 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.

  106. def mapResult[NewTo](f: (Set[This.EdgeT]) ⇒ NewTo): Builder[This.EdgeT, NewTo]
    Definition Classes
    Builder
  107. def max[B >: This.EdgeT](implicit cmp: Ordering[B]): This.EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  108. final def maxArity: Int
    Definition Classes
    EdgeSet → EdgeSet
    Annotations
    @inline()
  109. def maxBy[B](f: (This.EdgeT) ⇒ B)(implicit cmp: Ordering[B]): This.EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def min[B >: This.EdgeT](implicit cmp: Ordering[B]): This.EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def minBy[B](f: (This.EdgeT) ⇒ B)(implicit cmp: Ordering[B]): This.EdgeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. 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
  116. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  117. def newBuilder: Builder[This.EdgeT, Set[This.EdgeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → HasNewBuilder
  118. 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
  119. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. final def notify(): Unit
    Definition Classes
    AnyRef
  121. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  122. def par: ParSet[This.EdgeT]
    Definition Classes
    Parallelizable
  123. def parCombiner: Combiner[This.EdgeT, ParSet[This.EdgeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → Parallelizable
  124. def partition(p: (This.EdgeT) ⇒ Boolean): (Set[This.EdgeT], Set[This.EdgeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  125. 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
  126. def product[B >: This.EdgeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  127. def reduce[A1 >: This.EdgeT](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  128. def reduceLeft[B >: This.EdgeT](op: (B, This.EdgeT) ⇒ B): B
    Definition Classes
    TraversableOnce
  129. def reduceLeftOption[B >: This.EdgeT](op: (B, This.EdgeT) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def reduceOption[A1 >: This.EdgeT](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def reduceRight[B >: This.EdgeT](op: (This.EdgeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  132. def reduceRightOption[B >: This.EdgeT](op: (This.EdgeT, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def remove(edge: This.EdgeT): Boolean
    Definition Classes
    EdgeSet → EdgeSet → SetLike
  134. def removeWithNodes(edge: This.EdgeT): Boolean
    Definition Classes
    EdgeSet → EdgeSet → EdgeSet
  135. def repr: Set[This.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  136. def result(): Set[This.EdgeT]
    Definition Classes
    SetLike → Builder
  137. def retain(p: (This.EdgeT) ⇒ Boolean): Unit
    Definition Classes
    SetLike
  138. def reversed: List[This.EdgeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  139. def sameElements[B >: This.EdgeT](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  140. 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
  141. def scanLeft[B, That](z: B)(op: (B, This.EdgeT) ⇒ B)(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  142. 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.

  143. def seq: Set[This.EdgeT]
    Definition Classes
    Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  144. def size: Int
    Definition Classes
    EdgeSet → GenTraversableLike → TraversableOnce → GenTraversableOnce
  145. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  146. def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  147. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  148. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  149. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  150. def slice(from: Int, until: Int): Set[This.EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  151. def sliding(size: Int, step: Int): Iterator[Set[This.EdgeT]]
    Definition Classes
    IterableLike
  152. def sliding(size: Int): Iterator[Set[This.EdgeT]]
    Definition Classes
    IterableLike
  153. def span(p: (This.EdgeT) ⇒ Boolean): (Set[This.EdgeT], Set[This.EdgeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  154. def splitAt(n: Int): (Set[This.EdgeT], Set[This.EdgeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  155. final def statistics(edge: This.EdgeT, plus: Boolean): Boolean
    Attributes
    protected
    Definition Classes
    EdgeSet
  156. def stringPrefix: String
    Definition Classes
    EdgeSet → SetLike → TraversableLike → GenTraversableLike
  157. def subsetOf(that: GenSet[This.EdgeT]): Boolean
    Definition Classes
    GenSetLike
  158. def subsets(): Iterator[Set[This.EdgeT]]
    Definition Classes
    SetLike
  159. def subsets(len: Int): Iterator[Set[This.EdgeT]]
    Definition Classes
    SetLike
  160. def sum[B >: This.EdgeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  161. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  162. def tail: Set[This.EdgeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  163. def tails: Iterator[Set[This.EdgeT]]
    Definition Classes
    TraversableLike
  164. def take(n: Int): Set[This.EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  165. def takeRight(n: Int): Set[This.EdgeT]
    Definition Classes
    IterableLike
  166. def takeWhile(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  167. def thisCollection: Iterable[This.EdgeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  168. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, This.EdgeT, Col[This.EdgeT]]): Col[This.EdgeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  169. def toArray[B >: This.EdgeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  170. def toBuffer[A1 >: This.EdgeT]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  171. def toCollection(repr: Set[This.EdgeT]): Iterable[This.EdgeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  172. 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
  173. def toIndexedSeq: IndexedSeq[This.EdgeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  174. def toIterable: Iterable[This.EdgeT]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  175. def toIterator: Iterator[This.EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  176. def toList: List[This.EdgeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  177. def toMap[T, U](implicit ev: <:<[This.EdgeT, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  178. def toOuter: Set[E[N]]
    Definition Classes
    EdgeSet
  179. 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
  180. 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
  181. 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
  182. def toSeq: Seq[This.EdgeT]
    Definition Classes
    SetLike → SetLike → TraversableOnce → GenTraversableOnce
  183. def toSet[B >: This.EdgeT]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  184. def toSortedString(separator: String)(implicit ord: This.EdgeOrdering): String
    Definition Classes
    EdgeSet
  185. def toStream: Stream[This.EdgeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  186. def toString(): String
    Definition Classes
    SetLike → Function1 → TraversableLike → AnyRef → Any
  187. def toTraversable: Traversable[This.EdgeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  188. def toVector: Vector[This.EdgeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  189. 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.

  190. def union(that: GenSet[This.EdgeT]): Set[This.EdgeT]
    Definition Classes
    SetLike → GenSetLike
  191. def unzip[A1, A2](implicit asPair: (This.EdgeT) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  192. def unzip3[A1, A2, A3](implicit asTriple: (This.EdgeT) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  193. def update(elem: This.EdgeT, included: Boolean): Unit
    Definition Classes
    SetLike
  194. def upsert(edge: This.EdgeT): Boolean
    Definition Classes
    EdgeSet → EdgeSet
  195. 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
    OuterNode → NodeParam
  196. def view(from: Int, until: Int): IterableView[This.EdgeT, Set[This.EdgeT]]
    Definition Classes
    IterableLike → TraversableLike
  197. def view: IterableView[This.EdgeT, Set[This.EdgeT]]
    Definition Classes
    IterableLike → TraversableLike
  198. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  199. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  200. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  201. def withFilter(p: (This.EdgeT) ⇒ Boolean): FilterMonadic[This.EdgeT, Set[This.EdgeT]]
    Definition Classes
    TraversableLike → FilterMonadic
  202. def withSetFilter(p: (This.EdgeT) ⇒ Boolean): FilteredSet[This.EdgeT]
    Definition Classes
    ExtSetMethods
  203. def zip[A1 >: This.EdgeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  204. 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
  205. def zipWithIndex[A1 >: This.EdgeT, That](implicit bf: CanBuildFrom[Set[This.EdgeT], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  206. def |(that: GenSet[This.EdgeT]): Set[This.EdgeT]
    Definition Classes
    GenSetLike
  207. 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()
  208. 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()
  209. 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 <<(cmd: Message[This.EdgeT]): Unit
    Definition Classes
    SetLike → Scriptable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) scripting is deprecated

  2. 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 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 Cloneable[Set[This.EdgeT]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[This.EdgeT]

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

Inherited from Growable[This.EdgeT]

Inherited from Clearable

Inherited from Scriptable[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 (This.EdgeT) ⇒ Boolean

Inherited from Iterable[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 Mutable

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 AnyRef

Inherited from Any

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

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

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

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