scalax.collection.immutable.AdjacencyListGraph

EdgeSet

class EdgeSet extends This.EdgeSet with This.EdgeSetAux

Definition Classes
AdjacencyListGraph → GraphLike → GraphBase
Annotations
@SerialVersionUID( 7873L )
Linear Supertypes
This.EdgeSetAux, This.EdgeSet, This.EdgeSet, Serializable, Serializable, 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. EdgeSetAux
  3. EdgeSet
  4. EdgeSet
  5. Serializable
  6. Serializable
  7. Set
  8. SetLike
  9. Subtractable
  10. GenSet
  11. GenericSetTemplate
  12. GenSetLike
  13. Iterable
  14. IterableLike
  15. Equals
  16. GenIterable
  17. GenIterableLike
  18. Traversable
  19. GenTraversable
  20. GenericTraversableTemplate
  21. TraversableLike
  22. GenTraversableLike
  23. Parallelizable
  24. TraversableOnce
  25. GenTraversableOnce
  26. FilterMonadic
  27. HasNewBuilder
  28. Function1
  29. AnyRef
  30. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new EdgeSet()

Type Members

  1. type Self = Set[This.EdgeT]

    Attributes
    protected
    Definition Classes
    TraversableLike

  2. class WithFilter extends FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike

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 &(that: GenSet[This.EdgeT]): Set[This.EdgeT]

    Definition Classes
    GenSetLike

  5. def &~(that: GenSet[This.EdgeT]): Set[This.EdgeT]

    Definition Classes
    GenSetLike

  6. final def +(edge: This.EdgeT): Set[This.EdgeT]

    Definition Classes
    EdgeSet → SetLike → GenSetLike
    Annotations
    @inline()

  7. def +(elem1: This.EdgeT, elem2: This.EdgeT, elems: This.EdgeT*): Set[This.EdgeT]

    Definition Classes
    SetLike

  8. def ++(elems: GenTraversableOnce[This.EdgeT]): Set[This.EdgeT]

    Definition Classes
    SetLike

  9. def ++[B >: This.EdgeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  10. def ++:[B >: This.EdgeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That

    Definition Classes
    TraversableLike

  11. def ++:[B >: This.EdgeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That

    Definition Classes
    TraversableLike

  12. final def +=(edge: This.EdgeT): EdgeSet.this.type

    Attributes
    protected[scalax.collection.immutable.AdjacencyListGraph]
    Annotations
    @inline()

  13. final def -(edge: This.EdgeT): Set[This.EdgeT]

    Definition Classes
    EdgeSet → SetLike → Subtractable → GenSetLike
    Annotations
    @inline()

  14. def -(elem1: This.EdgeT, elem2: This.EdgeT, elems: This.EdgeT*): Set[This.EdgeT]

    Definition Classes
    Subtractable

  15. def --(xs: GenTraversableOnce[This.EdgeT]): Set[This.EdgeT]

    Definition Classes
    Subtractable

  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: AnyRef): Boolean

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  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
    EdgeSet → EdgeSet

  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. def drop(n: Int): Set[This.EdgeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  43. def dropRight(n: Int): Set[This.EdgeT]

    Definition Classes
    IterableLike

  44. def dropWhile(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  45. def empty: Set[This.EdgeT]

    Definition Classes
    GenericSetTemplate

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

    Definition Classes
    AnyRef

  47. def equals(that: Any): Boolean

    Definition Classes
    GenSetLike → Equals → AnyRef → Any

  48. def exists(p: (This.EdgeT) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  49. def filter(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  50. def filterNot(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  51. def finalize(): Unit

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

  52. final def find(elem: E[N]): Option[This.EdgeT]

    Definition Classes
    EdgeSet → EdgeSet

  53. def find(p: (This.EdgeT) ⇒ Boolean): Option[This.EdgeT]

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  54. def flatMap[B, That](f: (This.EdgeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  55. def flatten[B](implicit asTraversable: (This.EdgeT) ⇒ GenTraversableOnce[B]): Set[B]

    Definition Classes
    GenericTraversableTemplate

  56. def fold[A1 >: This.EdgeT](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  57. def foldLeft[B](z: B)(op: (B, This.EdgeT) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  58. def foldRight[B](z: B)(op: (This.EdgeT, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  59. def forall(p: (This.EdgeT) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  60. def foreach[U](f: (This.EdgeT) ⇒ U): Unit

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

  61. def from(nodeStreams: Iterable[NodeInputStream[N]], nodes: Iterable[N], edgeStreams: Iterable[GenEdgeInputStream[N, E]], edges: Iterable[E[N]]): Unit

    This method may be called by an auxiliary constructor.

    This method may be called by an auxiliary constructor. If so, it must be defined by the trait responsible for the implementation of the graph representation.

    The implementor is not allowed to reset any of the input streams so he must decide for each input stream whether it is to read by NodeSet.initialize or by EdgeSet.initialize, not both. Computing contained inner nodes/edges from input streams is facilitated by Node.NodeContStream/Edge.EdgeContStream respectively.

    For parameter descriptions see NodeAux.from.

    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeSet → EdgeSetAux

  62. def genericBuilder[B]: Builder[B, Set[B]]

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    AnyRef → Any

  64. def groupBy[K](f: (This.EdgeT) ⇒ K): Map[K, Set[This.EdgeT]]

    Definition Classes
    TraversableLike → GenTraversableLike

  65. def grouped(size: Int): Iterator[Set[This.EdgeT]]

    Definition Classes
    IterableLike

  66. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  67. def hashCode(): Int

    Definition Classes
    GenSetLike → AnyRef → Any

  68. def head: This.EdgeT

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  69. def headOption: Option[This.EdgeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  70. def init: Set[This.EdgeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  71. def initialize(edges: Iterable[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. This parameter is meant be used as an alternative or in addition to edgeStreams.

    Attributes
    protected[scalax.collection]
    Definition Classes
    EdgeSet → EdgeSet

  72. def inits: Iterator[Set[This.EdgeT]]

    Definition Classes
    TraversableLike

  73. def intersect(that: GenSet[This.EdgeT]): Set[This.EdgeT]

    Definition Classes
    GenSetLike

  74. def isEmpty: Boolean

    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  75. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  76. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  77. final def iterator: Iterator[This.EdgeT]

    Definition Classes
    EdgeSet → GenSetLike → IterableLike → GenIterableLike

  78. def last: This.EdgeT

    Definition Classes
    TraversableLike → GenTraversableLike

  79. def lastOption: Option[This.EdgeT]

    Definition Classes
    TraversableLike → GenTraversableLike

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

  81. def max[B >: This.EdgeT](implicit cmp: Ordering[B]): This.EdgeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  82. final lazy val maxArity: Int

    Definition Classes
    EdgeSet → EdgeSet

  83. def maxBy[B](f: (This.EdgeT) ⇒ B)(implicit cmp: Ordering[B]): This.EdgeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  84. def min[B >: This.EdgeT](implicit cmp: Ordering[B]): This.EdgeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  85. def minBy[B](f: (This.EdgeT) ⇒ B)(implicit cmp: Ordering[B]): This.EdgeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  86. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  87. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

  90. def newBuilder: Builder[This.EdgeT, Set[This.EdgeT]]

    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → HasNewBuilder

  91. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  92. final def notify(): Unit

    Definition Classes
    AnyRef

  93. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  94. def par: ParSet[This.EdgeT]

    Definition Classes
    Parallelizable

  95. def parCombiner: Combiner[This.EdgeT, ParSet[This.EdgeT]]

    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → Parallelizable

  96. def partition(p: (This.EdgeT) ⇒ Boolean): (Set[This.EdgeT], Set[This.EdgeT])

    Definition Classes
    TraversableLike → GenTraversableLike

  97. def product[B >: This.EdgeT](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  98. def reduce[A1 >: This.EdgeT](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  99. def reduceLeft[B >: This.EdgeT](op: (B, This.EdgeT) ⇒ B): B

    Definition Classes
    TraversableOnce

  100. def reduceLeftOption[B >: This.EdgeT](op: (B, This.EdgeT) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  101. def reduceOption[A1 >: This.EdgeT](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  102. def reduceRight[B >: This.EdgeT](op: (This.EdgeT, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  103. def reduceRightOption[B >: This.EdgeT](op: (This.EdgeT, B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  104. def repr: Set[This.EdgeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  105. def reversed: List[This.EdgeT]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  106. def sameElements[B >: This.EdgeT](that: GenIterable[B]): Boolean

    Definition Classes
    IterableLike → GenIterableLike

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

  108. def scanLeft[B, That](z: B)(op: (B, This.EdgeT) ⇒ B)(implicit bf: CanBuildFrom[Set[This.EdgeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

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

  110. def seq: Set[This.EdgeT]

    Definition Classes
    Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

  111. final lazy val size: Int

    Definition Classes
    EdgeSet → GenTraversableLike → TraversableOnce → GenTraversableOnce

  112. def slice(from: Int, until: Int): Set[This.EdgeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  113. def sliding(size: Int, step: Int): Iterator[Set[This.EdgeT]]

    Definition Classes
    IterableLike

  114. def sliding(size: Int): Iterator[Set[This.EdgeT]]

    Definition Classes
    IterableLike

  115. def span(p: (This.EdgeT) ⇒ Boolean): (Set[This.EdgeT], Set[This.EdgeT])

    Definition Classes
    TraversableLike → GenTraversableLike

  116. def splitAt(n: Int): (Set[This.EdgeT], Set[This.EdgeT])

    Definition Classes
    TraversableLike → GenTraversableLike

  117. def stringPrefix: String

    Definition Classes
    EdgeSet → SetLike → TraversableLike → GenTraversableLike

  118. def subsetOf(that: GenSet[This.EdgeT]): Boolean

    Definition Classes
    GenSetLike

  119. def subsets: Iterator[Set[This.EdgeT]]

    Definition Classes
    SetLike

  120. def subsets(len: Int): Iterator[Set[This.EdgeT]]

    Definition Classes
    SetLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

  123. def tail: Set[This.EdgeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  124. def tails: Iterator[Set[This.EdgeT]]

    Definition Classes
    TraversableLike

  125. def take(n: Int): Set[This.EdgeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  126. def takeRight(n: Int): Set[This.EdgeT]

    Definition Classes
    IterableLike

  127. def takeWhile(p: (This.EdgeT) ⇒ Boolean): Set[This.EdgeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  128. def thisCollection: Iterable[This.EdgeT]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  129. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, This.EdgeT, Col[This.EdgeT]]): Col[This.EdgeT]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  130. def toArray[B >: This.EdgeT](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  131. def toBuffer[A1 >: This.EdgeT]: Buffer[A1]

    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce

  132. def toCollection(repr: Set[This.EdgeT]): Iterable[This.EdgeT]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  133. def toEdgeInSet: Set[E[N]]

    Definition Classes
    EdgeSet

  134. def toIndexedSeq: IndexedSeq[This.EdgeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  135. def toIterable: Iterable[This.EdgeT]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  136. def toIterator: Iterator[This.EdgeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  137. def toList: List[This.EdgeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  138. def toMap[T, U](implicit ev: <:<[This.EdgeT, (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  139. def toSeq: Seq[This.EdgeT]

    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce

  140. def toSet[B >: This.EdgeT]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

  142. def toStream: Stream[This.EdgeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  143. def toString(): String

    Definition Classes
    SetLike → Function1 → TraversableLike → AnyRef → Any

  144. def toTraversable: Traversable[This.EdgeT]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  145. def toVector: Vector[This.EdgeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

  147. def union(that: GenSet[This.EdgeT]): Set[This.EdgeT]

    Definition Classes
    SetLike → GenSetLike

  148. def unzip[A1, A2](implicit asPair: (This.EdgeT) ⇒ (A1, A2)): (Set[A1], Set[A2])

    Definition Classes
    GenericTraversableTemplate

  149. def unzip3[A1, A2, A3](implicit asTriple: (This.EdgeT) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

    Definition Classes
    GenericTraversableTemplate

  150. def view(from: Int, until: Int): IterableView[This.EdgeT, Set[This.EdgeT]]

    Definition Classes
    IterableLike → TraversableLike

  151. def view: IterableView[This.EdgeT, Set[This.EdgeT]]

    Definition Classes
    IterableLike → TraversableLike

  152. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

  155. def withFilter(p: (This.EdgeT) ⇒ Boolean): FilterMonadic[This.EdgeT, Set[This.EdgeT]]

    Definition Classes
    TraversableLike → FilterMonadic

  156. def zip[A1 >: This.EdgeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[This.EdgeT], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike

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

  158. def zipWithIndex[A1 >: This.EdgeT, That](implicit bf: CanBuildFrom[Set[This.EdgeT], (A1, Int), That]): That

    Definition Classes
    IterableLike → GenIterableLike

  159. def |(that: GenSet[This.EdgeT]): Set[This.EdgeT]

    Definition Classes
    GenSetLike

Deprecated Value Members

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

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

Inherited from This.EdgeSetAux

Inherited from This.EdgeSet

Inherited from This.EdgeSet

Inherited from Serializable

Inherited from Serializable

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

Ungrouped