Packages

class NodeSet extends DefaultGraphImpl.NodeSet with DefaultGraphImpl.NodeSet

Linear Supertypes
DefaultGraphImpl.NodeSet, DefaultGraphImpl.NodeSet, DefaultGraphImpl.NodeSet, DefaultGraphImpl.NodeSet, DefaultGraphImpl.NodeSet, DefaultGraphImpl.NodeSet, DefaultGraphImpl.NodeSet, ExtSetMethods[NodeT], Set[NodeT], SetLike[NodeT, Set[NodeT]], Cloneable[Set[NodeT]], Cloneable, Cloneable, Shrinkable[NodeT], Builder[NodeT, Set[NodeT]], Growable[NodeT], Clearable, Scriptable[NodeT], Set[NodeT], SetLike[NodeT, Set[NodeT]], Subtractable[NodeT, Set[NodeT]], GenSet[NodeT], GenericSetTemplate[NodeT, Set], GenSetLike[NodeT, Set[NodeT]], (NodeT) ⇒ Boolean, Iterable[NodeT], Iterable[NodeT], IterableLike[NodeT, Set[NodeT]], Equals, GenIterable[NodeT], GenIterableLike[NodeT, Set[NodeT]], Traversable[NodeT], Mutable, Traversable[NodeT], GenTraversable[NodeT], GenericTraversableTemplate[NodeT, Set], TraversableLike[NodeT, Set[NodeT]], GenTraversableLike[NodeT, Set[NodeT]], Parallelizable[NodeT, ParSet[NodeT]], TraversableOnce[NodeT], GenTraversableOnce[NodeT], FilterMonadic[NodeT, Set[NodeT]], HasNewBuilder[NodeT, Set[NodeT]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeSet
  2. NodeSet
  3. NodeSet
  4. NodeSet
  5. NodeSet
  6. NodeSet
  7. NodeSet
  8. NodeSet
  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 NodeSet()

Type Members

  1. type Self = Set[NodeT]
    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[NodeT]): Set[NodeT]
    Definition Classes
    GenSetLike
  4. def &~(that: GenSet[NodeT]): Set[NodeT]
    Definition Classes
    GenSetLike
  5. def +(elem1: NodeT, elem2: NodeT, elems: NodeT*): Set[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.

  6. def +(elem: NodeT): Set[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.

  7. def ++(xs: GenTraversableOnce[NodeT]): Set[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.

  8. def ++[B >: NodeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  9. def ++:[B >: NodeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
    Definition Classes
    TraversableLike
  10. def ++:[B >: NodeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
    Definition Classes
    TraversableLike
  11. def ++=(xs: TraversableOnce[NodeT]): NodeSet.this.type
    Definition Classes
    Growable
  12. def +=(edge: DefaultGraphImpl.EdgeT): NodeSet.this.type
    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeSet → NodeSet
  13. final def +=(node: NodeT): NodeSet.this.type
    Definition Classes
    NodeSet → SetLike → Builder → Growable
    Annotations
    @inline()
  14. def +=(elem1: NodeT, elem2: NodeT, elems: NodeT*): NodeSet.this.type
    Definition Classes
    Growable
  15. final def -(node: NodeT): DefaultGraphImpl.NodeSetT
    Definition Classes
    NodeSet → SetLike → Subtractable → GenSetLike
  16. def -(elem1: NodeT, elem2: NodeT, elems: NodeT*): Set[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.

  17. def --(xs: GenTraversableOnce[NodeT]): Set[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.

  18. def --=(xs: TraversableOnce[NodeT]): NodeSet.this.type
    Definition Classes
    Shrinkable
  19. def -=(edge: DefaultGraphImpl.EdgeT): NodeSet.this.type
    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeSet
  20. final def -=(node: NodeT): NodeSet.this.type
    Definition Classes
    NodeSet → SetLike → Shrinkable
    Annotations
    @inline()
  21. def -=(elem1: NodeT, elem2: NodeT, elems: NodeT*): NodeSet.this.type
    Definition Classes
    Shrinkable
  22. def ->[B](y: B): (NodeSet, B)
    Implicit
    This member is added by an implicit conversion from NodeSet to ArrowAssoc[NodeSet] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  23. final def -?(node: NodeT): DefaultGraphImpl.NodeSetT
    Definition Classes
    NodeSet
    Annotations
    @inline()
  24. final def -?=(node: NodeT): NodeSet.this.type
    Definition Classes
    NodeSet
    Annotations
    @inline()
  25. def /:[B](z: B)(op: (B, NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  26. def :\[B](z: B)(op: (NodeT, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  28. def add(node: NodeT): Boolean
    Definition Classes
    NodeSet → NodeSet → SetLike
  29. def add(edge: DefaultGraphImpl.EdgeT): Boolean
    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeSet
  30. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  31. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  32. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  33. def adjacencyListsToString: String
    Definition Classes
    NodeSet
  34. def aggregate[B](z: ⇒ B)(seqop: (B, NodeT) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  35. def andThen[A](g: (Boolean) ⇒ A): (NodeT) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  36. def apply(elem: NodeT): Boolean
    Definition Classes
    GenSetLike → Function1
  37. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  38. def asSortedString(separator: String)(implicit ord: DefaultGraphImpl.NodeOrdering): String
    Definition Classes
    NodeSet
  39. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  40. def checkedRemove(node: NodeT, ripple: Boolean): Boolean

    generic constrained subtraction

    generic constrained subtraction

    Attributes
    protected
    Definition Classes
    NodeSet
  41. def clear(): Unit
    Definition Classes
    SetLike → Builder → Growable → Clearable
  42. def clone(): Set[NodeT]
    Definition Classes
    SetLike → Cloneable → AnyRef
  43. val coll: ExtHashSet[NodeT]
    Attributes
    protected
    Definition Classes
    NodeSet
  44. def collect[B, That](pf: PartialFunction[NodeT, B])(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  45. def collectFirst[B](pf: PartialFunction[NodeT, B]): Option[B]
    Definition Classes
    TraversableOnce
  46. def companion: GenericCompanion[Set]
    Definition Classes
    Set → Set → GenSet → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  47. def compose[A](g: (A) ⇒ NodeT): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  48. final def contains(node: NodeT): Boolean
    Definition Classes
    NodeSet → SetLike → GenSetLike
    Annotations
    @inline()
  49. def copy: DefaultGraphImpl.NodeSetT
    Attributes
    protected
    Definition Classes
    NodeSet → NodeSet
  50. def copyToArray[B >: NodeT](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  51. def copyToArray[B >: NodeT](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  52. def copyToArray[B >: NodeT](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  53. def copyToBuffer[B >: NodeT](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  54. def count(p: (NodeT) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  55. def diff(that: GenSet[NodeT]): Set[NodeT]
    Definition Classes
    SetLike → GenSetLike
  56. final def draw(random: Random): NodeT
    Definition Classes
    NodeSet → NodeSet → ExtSetMethods
    Annotations
    @inline()
  57. def drop(n: Int): Set[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  58. def dropRight(n: Int): Set[NodeT]
    Definition Classes
    IterableLike
  59. def dropWhile(p: (NodeT) ⇒ Boolean): Set[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  60. def edgeParams: Traversable[EdgeParam]
    Implicit
    This member is added by an implicit conversion from NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  61. val elems: Traversable[Param[N, E]]
    Implicit
    This member is added by an implicit conversion from NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  62. def empty: Set[NodeT]
    Definition Classes
    GenericSetTemplate
  63. def ensuring(cond: (NodeSet) ⇒ Boolean, msg: ⇒ Any): NodeSet
    Implicit
    This member is added by an implicit conversion from NodeSet to Ensuring[NodeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  64. def ensuring(cond: (NodeSet) ⇒ Boolean): NodeSet
    Implicit
    This member is added by an implicit conversion from NodeSet to Ensuring[NodeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  65. def ensuring(cond: Boolean, msg: ⇒ Any): NodeSet
    Implicit
    This member is added by an implicit conversion from NodeSet to Ensuring[NodeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  66. def ensuring(cond: Boolean): NodeSet
    Implicit
    This member is added by an implicit conversion from NodeSet to Ensuring[NodeSet] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  67. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  68. def equals(that: Any): Boolean
    Definition Classes
    GenSetLike → Equals → AnyRef → Any
  69. def exists(p: (NodeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  70. def filter(p: (NodeT) ⇒ Boolean): Set[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  71. def filterNot(p: (NodeT) ⇒ Boolean): Set[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  72. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  73. final def find(elem: N): Option[NodeT]
    Definition Classes
    NodeSet → NodeSet
    Annotations
    @inline()
  74. def find(p: (NodeT) ⇒ Boolean): Option[NodeT]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  75. final def findEntry[B](toMatch: B, correspond: (NodeT, B) ⇒ Boolean): NodeT
    Definition Classes
    NodeSet → ExtSetMethods
    Annotations
    @inline()
  76. def flatMap[B, That](f: (NodeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  77. def flatten[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  78. def fold[A1 >: NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  79. def foldLeft[B](z: B)(op: (B, NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  80. def foldRight[B](z: B)(op: (NodeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  81. def forall(p: (NodeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  82. def foreach[U](f: (NodeT) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  83. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from NodeSet to StringFormat[NodeSet] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  84. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  85. final def get(outer: N): NodeT
    Definition Classes
    NodeSet → NodeSet
  86. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  87. def groupBy[K](f: (NodeT) ⇒ K): Map[K, Set[NodeT]]
    Definition Classes
    TraversableLike → GenTraversableLike
  88. def grouped(size: Int): Iterator[Set[NodeT]]
    Definition Classes
    IterableLike
  89. def handleNotGentlyRemovable: Boolean
    Attributes
    protected
    Definition Classes
    NodeSet
  90. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  91. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  92. def head: NodeT
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  93. def headOption: Option[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  94. def init: Set[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  95. def initialize(nodes: Traversable[N], edges: Traversable[E[N]]): Unit
    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeSet → NodeSet
  96. def inits: Iterator[Set[NodeT]]
    Definition Classes
    TraversableLike
  97. def intersect(that: GenSet[NodeT]): Set[NodeT]
    Definition Classes
    GenSetLike
  98. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from NodeSet to OuterNode[NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Param
  99. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from NodeSet to OuterNode[NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  100. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  101. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from NodeSet to OuterNode[NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  102. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  103. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from NodeSet to OuterNode[NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    NodeParam
  104. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from NodeSet to OuterNode[NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    InParam → Param
  105. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  106. final def iterator: Iterator[NodeT]
    Definition Classes
    NodeSet → GenSetLike → IterableLike → GenIterableLike
    Annotations
    @inline()
  107. def last: NodeT
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def lastOption: Option[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  109. final def lookup(elem: N): NodeT
    Definition Classes
    NodeSet → NodeSet
  110. def map[B, That](f: (NodeT) ⇒ B)(implicit bf: CanBuildFrom[Set[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.

  111. def mapResult[NewTo](f: (Set[NodeT]) ⇒ NewTo): Builder[NodeT, NewTo]
    Definition Classes
    Builder
  112. def max[B >: NodeT](implicit cmp: Ordering[B]): NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def maxBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def min[B >: NodeT](implicit cmp: Ordering[B]): NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def minBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def minus(node: NodeT): Unit
    Attributes
    protected
    Definition Classes
    NodeSet → NodeSet
  117. def minusEdges(node: NodeT): Unit
    Attributes
    protected
    Definition Classes
    NodeSet → NodeSet
  118. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. val n1: NodeSet
    Implicit
    This member is added by an implicit conversion from NodeSet to EdgeAssoc[NodeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  122. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  123. def newBuilder: Builder[NodeT, Set[NodeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → HasNewBuilder
  124. def nodeParams: Traversable[NodeParam[N]]
    Implicit
    This member is added by an implicit conversion from NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  125. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  126. final def notify(): Unit
    Definition Classes
    AnyRef
  127. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  128. def par: ParSet[NodeT]
    Definition Classes
    Parallelizable
  129. def parCombiner: Combiner[NodeT, ParSet[NodeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → SetLike → TraversableLike → Parallelizable
  130. def partition(p: (NodeT) ⇒ Boolean): (Set[NodeT], Set[NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  131. lazy val partitioned: (Traversable[Param[N, E]], Traversable[Param[N, E]])
    Implicit
    This member is added by an implicit conversion from NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  132. def product[B >: NodeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def reduce[A1 >: NodeT](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  134. def reduceLeft[B >: NodeT](op: (B, NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce
  135. def reduceLeftOption[B >: NodeT](op: (B, NodeT) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def reduceOption[A1 >: NodeT](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. def reduceRight[B >: NodeT](op: (NodeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  138. def reduceRightOption[B >: NodeT](op: (NodeT, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. def remove(node: NodeT): Boolean
    Definition Classes
    NodeSet → NodeSet → SetLike
  140. def remove(edge: DefaultGraphImpl.EdgeT): Boolean
    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeSet
  141. def removeGently(node: NodeT): Boolean
    Definition Classes
    NodeSet → NodeSet
  142. def repr: Set[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  143. def result(): Set[NodeT]
    Definition Classes
    SetLike → Builder
  144. def retain(p: (NodeT) ⇒ Boolean): Unit
    Definition Classes
    SetLike
  145. def reversed: List[NodeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  146. def sameElements[B >: NodeT](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  147. def scan[B >: NodeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Set[NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  148. def scanLeft[B, That](z: B)(op: (B, NodeT) ⇒ B)(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  149. def scanRight[B, That](z: B)(op: (NodeT, B) ⇒ B)(implicit bf: CanBuildFrom[Set[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.

  150. def seq: Set[NodeT]
    Definition Classes
    Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  151. final def size: Int
    Definition Classes
    NodeSet → GenTraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @inline()
  152. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  153. def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  154. def sizeHint(size: Int): Unit
    Definition Classes
    Builder
  155. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  156. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  157. def slice(from: Int, until: Int): Set[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  158. def sliding(size: Int, step: Int): Iterator[Set[NodeT]]
    Definition Classes
    IterableLike
  159. def sliding(size: Int): Iterator[Set[NodeT]]
    Definition Classes
    IterableLike
  160. def span(p: (NodeT) ⇒ Boolean): (Set[NodeT], Set[NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  161. def splitAt(n: Int): (Set[NodeT], Set[NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  162. def stringPrefix: String
    Definition Classes
    NodeSet → SetLike → TraversableLike → GenTraversableLike
  163. def subsetOf(that: GenSet[NodeT]): Boolean
    Definition Classes
    GenSetLike
  164. def subsets(): Iterator[Set[NodeT]]
    Definition Classes
    SetLike
  165. def subsets(len: Int): Iterator[Set[NodeT]]
    Definition Classes
    SetLike
  166. final def subtract(node: NodeT, rippleDelete: Boolean, minusNode: (NodeT) ⇒ Unit, minusEdges: (NodeT) ⇒ Unit): Boolean
    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeSet
  167. def sum[B >: NodeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  168. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  169. def tail: Set[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  170. def tails: Iterator[Set[NodeT]]
    Definition Classes
    TraversableLike
  171. def take(n: Int): Set[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  172. def takeRight(n: Int): Set[NodeT]
    Definition Classes
    IterableLike
  173. def takeWhile(p: (NodeT) ⇒ Boolean): Set[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  174. def thisCollection: Iterable[NodeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  175. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, NodeT, Col[NodeT]]): Col[NodeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  176. def toArray[B >: NodeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  177. def toBuffer[A1 >: NodeT]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  178. def toCollection(repr: Set[NodeT]): Iterable[NodeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  179. def toInParams: Traversable[InParam[N, E]]
    Implicit
    This member is added by an implicit conversion from NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  180. def toIndexedSeq: IndexedSeq[NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  181. def toIterable: Iterable[NodeT]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  182. def toIterator: Iterator[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  183. def toList: List[NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  184. def toMap[T, U](implicit ev: <:<[NodeT, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  185. def toOuter: Set[N]
    Definition Classes
    NodeSet
  186. def toOuterEdges: Traversable[E[N]]
    Implicit
    This member is added by an implicit conversion from NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  187. def toOuterNodes: Traversable[N]
    Implicit
    This member is added by an implicit conversion from NodeSet to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions
  188. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from NodeSet to CollectionsHaveToParArray[NodeSet, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (NodeSet) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  189. def toSeq: Seq[NodeT]
    Definition Classes
    SetLike → SetLike → TraversableOnce → GenTraversableOnce
  190. def toSet[B >: NodeT]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  191. def toSortedString(separator: String)(implicit ord: DefaultGraphImpl.NodeOrdering): String
    Definition Classes
    NodeSet
  192. def toStream: Stream[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  193. def toString(): String
    Definition Classes
    SetLike → Function1 → TraversableLike → AnyRef → Any
  194. def toTraversable: Traversable[NodeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  195. def toVector: Vector[NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  196. def transpose[B](implicit asTraversable: (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.

  197. def union(that: GenSet[NodeT]): Set[NodeT]
    Definition Classes
    SetLike → GenSetLike
  198. def unzip[A1, A2](implicit asPair: (NodeT) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  199. def unzip3[A1, A2, A3](implicit asTriple: (NodeT) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  200. def update(elem: NodeT, included: Boolean): Unit
    Definition Classes
    SetLike
  201. def upsert(edge: DefaultGraphImpl.EdgeT): Boolean
    Attributes
    protected[scalax.collection]
    Definition Classes
    NodeSet
  202. val value: NodeSet
    Implicit
    This member is added by an implicit conversion from NodeSet to OuterNode[NodeSet] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  203. def view(from: Int, until: Int): IterableView[NodeT, Set[NodeT]]
    Definition Classes
    IterableLike → TraversableLike
  204. def view: IterableView[NodeT, Set[NodeT]]
    Definition Classes
    IterableLike → TraversableLike
  205. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  206. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  207. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  208. def withFilter(p: (NodeT) ⇒ Boolean): FilterMonadic[NodeT, Set[NodeT]]
    Definition Classes
    TraversableLike → FilterMonadic
  209. def withSetFilter(p: (NodeT) ⇒ Boolean): FilteredSet[NodeT]
    Definition Classes
    ExtSetMethods
  210. def zip[A1 >: NodeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[NodeT], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  211. def zipAll[B, A1 >: NodeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Set[NodeT], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  212. def zipWithIndex[A1 >: NodeT, That](implicit bf: CanBuildFrom[Set[NodeT], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  213. def |(that: GenSet[NodeT]): Set[NodeT]
    Definition Classes
    GenSetLike
  214. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from NodeSet to EdgeAssoc[NodeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  215. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from NodeSet to EdgeAssoc[NodeSet] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  216. def [B](y: B): (NodeSet, B)
    Implicit
    This member is added by an implicit conversion from NodeSet to ArrowAssoc[NodeSet] 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 NodeSet to any2stringadd[NodeSet] 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:
    (nodeSet: any2stringadd[NodeSet]).+(other)
    Definition Classes
    any2stringadd
  2. def andThen[A](g: (Boolean) ⇒ A): (Param[NodeT, EI]) ⇒ A
    Implicit
    This member is added by an implicit conversion from NodeSet to (Param[NodeT, 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:
    (nodeSet: (Param[NodeT, EI]) ⇒ Boolean).andThen(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  3. def apply(v1: Param[NodeT, EI]): Boolean
    Implicit
    This member is added by an implicit conversion from NodeSet to (Param[NodeT, 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:
    (nodeSet: (Param[NodeT, EI]) ⇒ Boolean).apply(v1)
    Definition Classes
    Function1
  4. def compose[A](g: (A) ⇒ Param[NodeT, EI]): (A) ⇒ Boolean
    Implicit
    This member is added by an implicit conversion from NodeSet to (Param[NodeT, 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:
    (nodeSet: (Param[NodeT, EI]) ⇒ Boolean).compose(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  5. def filter(p: (NodeT) ⇒ Boolean): TraversableOnce[NodeT]
    Implicit
    This member is added by an implicit conversion from NodeSet to MonadOps[NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeSet: MonadOps[NodeT]).filter(p)
    Definition Classes
    MonadOps
  6. def flatMap[B](f: (NodeT) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from NodeSet to MonadOps[NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeSet: MonadOps[NodeT]).flatMap(f)
    Definition Classes
    MonadOps
  7. def flatten: Iterator[N]
    Implicit
    This member is added by an implicit conversion from NodeSet to FlattenOps[N] performed by method flattenTraversableOnce in scala.collection.TraversableOnce. This conversion will take place only if an implicit value of type (InnerNodeParam[N]) ⇒ TraversableOnce[N] is in scope.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeSet: FlattenOps[N]).flatten
    Definition Classes
    FlattenOps
  8. def map[B](f: (NodeT) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from NodeSet to MonadOps[NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeSet: MonadOps[NodeT]).map(f)
    Definition Classes
    MonadOps
  9. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from NodeSet to OuterNode[NodeSet] 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:
    (nodeSet: OuterNode[NodeSet]).stringPrefix
    Definition Classes
    NodeParam
  10. def toString(): String
    Implicit
    This member is added by an implicit conversion from NodeSet to OuterNode[NodeSet] 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:
    (nodeSet: OuterNode[NodeSet]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  11. def toString(): String
    Implicit
    This member is added by an implicit conversion from NodeSet to (Param[NodeT, 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:
    (nodeSet: (Param[NodeT, EI]) ⇒ Boolean).toString()
    Definition Classes
    Function1 → AnyRef → Any
  12. def withFilter(p: (NodeT) ⇒ Boolean): Iterator[NodeT]
    Implicit
    This member is added by an implicit conversion from NodeSet to MonadOps[NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeSet: MonadOps[NodeT]).withFilter(p)
    Definition Classes
    MonadOps

Deprecated Value Members

  1. def <<(cmd: Message[NodeT]): Unit
    Definition Classes
    SetLike → Scriptable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) scripting is deprecated

  2. def toNodeInSet: Set[N]
    Definition Classes
    NodeSet
    Annotations
    @deprecated
    Deprecated

    (Since version 1.8.0) Use toOuter instead

Inherited from DefaultGraphImpl.NodeSet

Inherited from DefaultGraphImpl.NodeSet

Inherited from DefaultGraphImpl.NodeSet

Inherited from DefaultGraphImpl.NodeSet

Inherited from DefaultGraphImpl.NodeSet

Inherited from DefaultGraphImpl.NodeSet

Inherited from DefaultGraphImpl.NodeSet

Inherited from ExtSetMethods[NodeT]

Inherited from Set[NodeT]

Inherited from SetLike[NodeT, Set[NodeT]]

Inherited from Cloneable[Set[NodeT]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[NodeT]

Inherited from Builder[NodeT, Set[NodeT]]

Inherited from Growable[NodeT]

Inherited from Clearable

Inherited from Scriptable[NodeT]

Inherited from Set[NodeT]

Inherited from SetLike[NodeT, Set[NodeT]]

Inherited from Subtractable[NodeT, Set[NodeT]]

Inherited from GenSet[NodeT]

Inherited from GenericSetTemplate[NodeT, Set]

Inherited from GenSetLike[NodeT, Set[NodeT]]

Inherited from (NodeT) ⇒ Boolean

Inherited from Iterable[NodeT]

Inherited from Iterable[NodeT]

Inherited from IterableLike[NodeT, Set[NodeT]]

Inherited from Equals

Inherited from GenIterable[NodeT]

Inherited from GenIterableLike[NodeT, Set[NodeT]]

Inherited from Traversable[NodeT]

Inherited from Mutable

Inherited from Traversable[NodeT]

Inherited from GenTraversable[NodeT]

Inherited from GenericTraversableTemplate[NodeT, Set]

Inherited from TraversableLike[NodeT, Set[NodeT]]

Inherited from GenTraversableLike[NodeT, Set[NodeT]]

Inherited from Parallelizable[NodeT, ParSet[NodeT]]

Inherited from TraversableOnce[NodeT]

Inherited from GenTraversableOnce[NodeT]

Inherited from FilterMonadic[NodeT, Set[NodeT]]

Inherited from HasNewBuilder[NodeT, Set[NodeT]]

Inherited from AnyRef

Inherited from Any

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

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

Inherited by implicit conversion CollectionsHaveToParArray from NodeSet to CollectionsHaveToParArray[NodeSet, T]

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

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

Inherited by implicit conversion predicateToNodePredicate from NodeSet to (Param[NodeT, EI]) ⇒ Boolean

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

Inherited by implicit conversion any2stringadd from NodeSet to any2stringadd[NodeSet]

Inherited by implicit conversion StringFormat from NodeSet to StringFormat[NodeSet]

Inherited by implicit conversion Ensuring from NodeSet to Ensuring[NodeSet]

Inherited by implicit conversion ArrowAssoc from NodeSet to ArrowAssoc[NodeSet]

Inherited by implicit conversion alternateImplicit from NodeSet to ForceImplicitAmbiguity

Ungrouped