scalax.collection.constrained.mutable.AdjacencyListGraph

NodeSet

class NodeSet extends This.NodeSet

Definition Classes
AdjacencyListGraph → AdjacencyListGraph → AdjacencyListBase → GraphLike → GraphLike → GraphLike → GraphBase
Annotations
@SerialVersionUID( 8083L )
Linear Supertypes
This.NodeSet, This.NodeSet, This.NodeSet, This.NodeSetAux, This.NodeSet, This.NodeSet, Serializable, Serializable, ExtSetMethods[This.NodeT], Set[This.NodeT], SetLike[This.NodeT, Set[This.NodeT]], Cloneable[Set[This.NodeT]], Cloneable, Cloneable, Shrinkable[This.NodeT], Builder[This.NodeT, Set[This.NodeT]], Growable[This.NodeT], Clearable, Scriptable[This.NodeT], Set[This.NodeT], SetLike[This.NodeT, Set[This.NodeT]], Subtractable[This.NodeT, Set[This.NodeT]], GenSet[This.NodeT], GenericSetTemplate[This.NodeT, Set], GenSetLike[This.NodeT, Set[This.NodeT]], (This.NodeT) ⇒ Boolean, Iterable[This.NodeT], Iterable[This.NodeT], IterableLike[This.NodeT, Set[This.NodeT]], Equals, GenIterable[This.NodeT], GenIterableLike[This.NodeT, Set[This.NodeT]], Traversable[This.NodeT], Mutable, Traversable[This.NodeT], GenTraversable[This.NodeT], GenericTraversableTemplate[This.NodeT, Set], TraversableLike[This.NodeT, Set[This.NodeT]], GenTraversableLike[This.NodeT, Set[This.NodeT]], Parallelizable[This.NodeT, ParSet[This.NodeT]], TraversableOnce[This.NodeT], GenTraversableOnce[This.NodeT], FilterMonadic[This.NodeT, Set[This.NodeT]], HasNewBuilder[This.NodeT, Set[This.NodeT]], AnyRef, Any
Known Subclasses
NodeSet
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. NodeSet
  2. NodeSet
  3. NodeSet
  4. NodeSet
  5. NodeSetAux
  6. NodeSet
  7. NodeSet
  8. Serializable
  9. Serializable
  10. ExtSetMethods
  11. Set
  12. SetLike
  13. Cloneable
  14. Cloneable
  15. Cloneable
  16. Shrinkable
  17. Builder
  18. Growable
  19. Clearable
  20. Scriptable
  21. Set
  22. SetLike
  23. Subtractable
  24. GenSet
  25. GenericSetTemplate
  26. GenSetLike
  27. Function1
  28. Iterable
  29. Iterable
  30. IterableLike
  31. Equals
  32. GenIterable
  33. GenIterableLike
  34. Traversable
  35. Mutable
  36. Traversable
  37. GenTraversable
  38. GenericTraversableTemplate
  39. TraversableLike
  40. GenTraversableLike
  41. Parallelizable
  42. TraversableOnce
  43. GenTraversableOnce
  44. FilterMonadic
  45. HasNewBuilder
  46. AnyRef
  47. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NodeSet()

Type Members

  1. type Self = Set[This.NodeT]

    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.NodeT]): Set[This.NodeT]

    Definition Classes
    GenSetLike

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

    Definition Classes
    GenSetLike

  6. def +(elem1: This.NodeT, elem2: This.NodeT, elems: This.NodeT*): Set[This.NodeT]

    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.

  7. def +(elem: This.NodeT): Set[This.NodeT]

    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.

  8. def ++(xs: GenTraversableOnce[This.NodeT]): Set[This.NodeT]

    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.

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike

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

    Definition Classes
    TraversableLike

  12. def ++=(xs: TraversableOnce[This.NodeT]): NodeSet.this.type

    Definition Classes
    Growable

  13. def +=(edge: This.EdgeT): NodeSet.this.type

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

  14. final def +=(node: This.NodeT): NodeSet.this.type

    Definition Classes
    NodeSet → SetLike → Builder → Growable
    Annotations
    @inline()

  15. def +=(elem1: This.NodeT, elem2: This.NodeT, elems: This.NodeT*): NodeSet.this.type

    Definition Classes
    Growable

  16. final def -(node: This.NodeT): This.NodeSetT

    Definition Classes
    NodeSet → SetLike → Subtractable → GenSetLike

  17. def -(elem1: This.NodeT, elem2: This.NodeT, elems: This.NodeT*): Set[This.NodeT]

    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.

  18. def --(xs: GenTraversableOnce[This.NodeT]): Set[This.NodeT]

    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.

  19. def --=(xs: TraversableOnce[This.NodeT]): NodeSet.this.type

    Definition Classes
    Shrinkable

  20. def -=(edge: This.EdgeT): NodeSet.this.type

    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeSet

  21. final def -=(node: This.NodeT): NodeSet.this.type

    Definition Classes
    NodeSet → SetLike → Shrinkable
    Annotations
    @inline()

  22. def -=(elem1: This.NodeT, elem2: This.NodeT, elems: This.NodeT*): NodeSet.this.type

    Definition Classes
    Shrinkable

  23. final def -?(node: This.NodeT): This.NodeSetT

    Definition Classes
    NodeSet
    Annotations
    @inline()

  24. final def -?=(node: This.NodeT): NodeSet.this.type

    Definition Classes
    NodeSet
    Annotations
    @inline()

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  27. def <<(cmd: Message[This.NodeT]): Unit

    Definition Classes
    SetLike → Scriptable

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  30. def add(node: This.NodeT): Boolean

    Definition Classes
    NodeSet → NodeSet → SetLike

  31. def add(edge: This.EdgeT): Boolean

    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeSet

  32. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

  35. def adjacencyListsToString: String

    Definition Classes
    NodeSet

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  37. def andThen[A](g: (Boolean) ⇒ A): (This.NodeT) ⇒ A

    Definition Classes
    Function1
    Annotations
    @unspecialized()

  38. def apply(elem: This.NodeT): Boolean

    Definition Classes
    GenSetLike → Function1

  39. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  40. def asSortedString(separator: String)(implicit ord: This.NodeOrdering): String

    Definition Classes
    NodeSet

  41. def canEqual(that: Any): Boolean

    Definition Classes
    IterableLike → Equals

  42. def clear(): Unit

    Definition Classes
    SetLike → Builder → Growable → Clearable

  43. def clone(): Set[This.NodeT]

    Definition Classes
    SetLike → Cloneable → AnyRef

  44. val coll: ExtHashSet[This.NodeT]

    Attributes
    protected
    Definition Classes
    NodeSet

  45. def collect[B, That](pf: PartialFunction[This.NodeT, B])(implicit bf: CanBuildFrom[Set[This.NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce

  47. def companion: GenericCompanion[Set]

    Definition Classes
    Set → Set → GenSet → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate

  48. def compose[A](g: (A) ⇒ This.NodeT): (A) ⇒ Boolean

    Definition Classes
    Function1
    Annotations
    @unspecialized()

  49. final def contains(node: This.NodeT): Boolean

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

  50. def copy: This.NodeSetT

    Definition Classes
    NodeSet → NodeSet

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

  55. def count(p: (This.NodeT) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  56. def diff(that: GenSet[This.NodeT]): Set[This.NodeT]

    Definition Classes
    SetLike → GenSetLike

  57. final def draw(random: Random): This.NodeT

    Definition Classes
    NodeSet → ExtSetMethods
    Annotations
    @inline()

  58. def drop(n: Int): Set[This.NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  59. def dropRight(n: Int): Set[This.NodeT]

    Definition Classes
    IterableLike

  60. def dropWhile(p: (This.NodeT) ⇒ Boolean): Set[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  61. def empty: Set[This.NodeT]

    Definition Classes
    GenericSetTemplate

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

    Definition Classes
    AnyRef

  63. def equals(that: Any): Boolean

    Definition Classes
    GenSetLike → Equals → AnyRef → Any

  64. def exists(p: (This.NodeT) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  65. def filter(p: (This.NodeT) ⇒ Boolean): Set[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  66. def filterNot(p: (This.NodeT) ⇒ Boolean): Set[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  67. def finalize(): Unit

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

  68. final def find(elem: N): Option[This.NodeT]

    Definition Classes
    NodeSet → NodeSet
    Annotations
    @inline()

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  70. final def findEntry[B](other: B, correspond: (This.NodeT, B) ⇒ Boolean): This.NodeT

    Definition Classes
    NodeSet → ExtSetMethods
    Annotations
    @inline()

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  72. def flatten[B](implicit asTraversable: (This.NodeT) ⇒ GenTraversableOnce[B]): Set[B]

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  76. def forall(p: (This.NodeT) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

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

  78. def from(that: AdjacencyListBase[N, E, This])(delNodes: Iterable[immutable.AdjacencyListBase.NodeT], delEdges: Iterable[immutable.AdjacencyListBase.EdgeT], ripple: Boolean, addNodes: Iterable[N], addEdges: Iterable[E[N]]): Unit

    Attributes
    protected[scalax.collection.immutable.AdjacencyListBase]
    Definition Classes
    NodeSet

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

    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeSet → NodeSetAux

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

    Definition Classes
    GenericTraversableTemplate

  81. final def get(outer: N): This.NodeT

    Definition Classes
    NodeSet → NodeSet

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

    Definition Classes
    AnyRef → Any

  83. def groupBy[K](f: (This.NodeT) ⇒ K): Map[K, Set[This.NodeT]]

    Definition Classes
    TraversableLike → GenTraversableLike

  84. def grouped(size: Int): Iterator[Set[This.NodeT]]

    Definition Classes
    IterableLike

  85. def handleNotGentlyRemovable: Boolean

    Attributes
    protected
    Definition Classes
    NodeSet

  86. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  87. def hashCode(): Int

    Definition Classes
    GenSetLike → AnyRef → Any

  88. def head: This.NodeT

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  89. def headOption: Option[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  90. def init: Set[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  91. def initialize(nodes: Iterable[N], edges: Iterable[E[N]]): Unit

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

  92. def inits: Iterator[Set[This.NodeT]]

    Definition Classes
    TraversableLike

  93. def intersect(that: GenSet[This.NodeT]): Set[This.NodeT]

    Definition Classes
    GenSetLike

  94. def isEmpty: Boolean

    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  95. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  96. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  97. final def iterator: Iterator[This.NodeT]

    Definition Classes
    NodeSet → GenSetLike → IterableLike → GenIterableLike
    Annotations
    @inline()

  98. def last: This.NodeT

    Definition Classes
    TraversableLike → GenTraversableLike

  99. def lastOption: Option[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  100. final def lookup(elem: N): This.NodeT

    Definition Classes
    NodeSet → NodeSet

  101. def map[B, That](f: (This.NodeT) ⇒ B)(implicit bf: CanBuildFrom[Set[This.NodeT], 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.

  102. def mapResult[NewTo](f: (Set[This.NodeT]) ⇒ NewTo): Builder[This.NodeT, NewTo]

    Definition Classes
    Builder

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  107. def minus(node: This.NodeT): Unit

    Attributes
    protected
    Definition Classes
    NodeSet → NodeSet

  108. def minusEdges(node: This.NodeT): Unit

    Attributes
    protected
    Definition Classes
    NodeSet → NodeSet

  109. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  110. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

  113. def newBuilder: Builder[This.NodeT, Set[This.NodeT]]

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

  114. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  115. final def notify(): Unit

    Definition Classes
    AnyRef

  116. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  117. def par: ParSet[This.NodeT]

    Definition Classes
    Parallelizable

  118. def parCombiner: Combiner[This.NodeT, ParSet[This.NodeT]]

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

  119. def partition(p: (This.NodeT) ⇒ Boolean): (Set[This.NodeT], Set[This.NodeT])

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  127. def remove(edge: This.EdgeT): Boolean

    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeSet

  128. def remove(node: This.NodeT): Boolean

    Definition Classes
    NodeSet → SetLike

  129. def removeGently(node: This.NodeT): Boolean

    Definition Classes
    NodeSet

  130. def repr: Set[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  131. def result(): Set[This.NodeT]

    Definition Classes
    SetLike → Builder

  132. def retain(p: (This.NodeT) ⇒ Boolean): Unit

    Definition Classes
    SetLike

  133. def reversed: List[This.NodeT]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

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

    Definition Classes
    IterableLike → GenIterableLike

  135. def scan[B >: This.NodeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Set[This.NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

  137. def scanRight[B, That](z: B)(op: (This.NodeT, B) ⇒ B)(implicit bf: CanBuildFrom[Set[This.NodeT], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

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

  138. def seq: Set[This.NodeT]

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

  139. def size: Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  140. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

    Definition Classes
    Builder

  141. def sizeHint(coll: TraversableLike[_, _]): Unit

    Definition Classes
    Builder

  142. def sizeHint(size: Int): Unit

    Definition Classes
    Builder

  143. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit

    Definition Classes
    Builder

  144. def slice(from: Int, until: Int): Set[This.NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  145. def sliding(size: Int, step: Int): Iterator[Set[This.NodeT]]

    Definition Classes
    IterableLike

  146. def sliding(size: Int): Iterator[Set[This.NodeT]]

    Definition Classes
    IterableLike

  147. def span(p: (This.NodeT) ⇒ Boolean): (Set[This.NodeT], Set[This.NodeT])

    Definition Classes
    TraversableLike → GenTraversableLike

  148. def splitAt(n: Int): (Set[This.NodeT], Set[This.NodeT])

    Definition Classes
    TraversableLike → GenTraversableLike

  149. def stringPrefix: String

    Definition Classes
    NodeSet → SetLike → TraversableLike → GenTraversableLike

  150. def subsetOf(that: GenSet[This.NodeT]): Boolean

    Definition Classes
    GenSetLike

  151. def subsets: Iterator[Set[This.NodeT]]

    Definition Classes
    SetLike

  152. def subsets(len: Int): Iterator[Set[This.NodeT]]

    Definition Classes
    SetLike

  153. final def subtract(node: This.NodeT, rippleDelete: Boolean, minusNode: (This.NodeT) ⇒ Unit, minusEdges: (This.NodeT) ⇒ Unit): Boolean

    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeSet

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

  156. def tail: Set[This.NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  157. def tails: Iterator[Set[This.NodeT]]

    Definition Classes
    TraversableLike

  158. def take(n: Int): Set[This.NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  159. def takeRight(n: Int): Set[This.NodeT]

    Definition Classes
    IterableLike

  160. def takeWhile(p: (This.NodeT) ⇒ Boolean): Set[This.NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  161. def thisCollection: Iterable[This.NodeT]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

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

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  164. def toBuffer[A1 >: This.NodeT]: Buffer[A1]

    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce

  165. def toCollection(repr: Set[This.NodeT]): Iterable[This.NodeT]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  166. def toIndexedSeq: IndexedSeq[This.NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  167. def toIterable: Iterable[This.NodeT]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  168. def toIterator: Iterator[This.NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  169. def toList: List[This.NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  171. def toNodeInSet: Set[N]

    Definition Classes
    NodeSet

  172. def toSeq: Seq[This.NodeT]

    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce

  173. def toSet[B >: This.NodeT]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  174. def toSortedString(separator: String)(implicit ord: This.NodeOrdering): String

    Definition Classes
    NodeSet

  175. def toStream: Stream[This.NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  176. def toString(): String

    Definition Classes
    SetLike → Function1 → TraversableLike → AnyRef → Any

  177. def toTraversable: Traversable[This.NodeT]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  178. def toVector: Vector[This.NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  179. def transpose[B](implicit asTraversable: (This.NodeT) ⇒ 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.

  180. def union(that: GenSet[This.NodeT]): Set[This.NodeT]

    Definition Classes
    SetLike → GenSetLike

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    GenericTraversableTemplate

  183. def update(elem: This.NodeT, included: Boolean): Unit

    Definition Classes
    SetLike

  184. def view(from: Int, until: Int): IterableView[This.NodeT, Set[This.NodeT]]

    Definition Classes
    IterableLike → TraversableLike

  185. def view: IterableView[This.NodeT, Set[This.NodeT]]

    Definition Classes
    IterableLike → TraversableLike

  186. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

  189. def withFilter(p: (This.NodeT) ⇒ Boolean): FilterMonadic[This.NodeT, Set[This.NodeT]]

    Definition Classes
    TraversableLike → FilterMonadic

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

    Definition Classes
    IterableLike → GenIterableLike

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

    Definition Classes
    IterableLike → GenIterableLike

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

    Definition Classes
    IterableLike → GenIterableLike

  193. def |(that: GenSet[This.NodeT]): Set[This.NodeT]

    Definition Classes
    GenSetLike

Deprecated Value Members

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

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

Inherited from This.NodeSet

Inherited from This.NodeSet

Inherited from This.NodeSet

Inherited from This.NodeSetAux

Inherited from This.NodeSet

Inherited from This.NodeSet

Inherited from Serializable

Inherited from Serializable

Inherited from ExtSetMethods[This.NodeT]

Inherited from Set[This.NodeT]

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

Inherited from Cloneable[Set[This.NodeT]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[This.NodeT]

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

Inherited from Growable[This.NodeT]

Inherited from Clearable

Inherited from Scriptable[This.NodeT]

Inherited from Set[This.NodeT]

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

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

Inherited from GenSet[This.NodeT]

Inherited from GenericSetTemplate[This.NodeT, Set]

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

Inherited from (This.NodeT) ⇒ Boolean

Inherited from Iterable[This.NodeT]

Inherited from Iterable[This.NodeT]

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

Inherited from Equals

Inherited from GenIterable[This.NodeT]

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

Inherited from Traversable[This.NodeT]

Inherited from Mutable

Inherited from Traversable[This.NodeT]

Inherited from GenTraversable[This.NodeT]

Inherited from GenericTraversableTemplate[This.NodeT, Set]

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

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

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

Inherited from TraversableOnce[This.NodeT]

Inherited from GenTraversableOnce[This.NodeT]

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped