Packages

trait NodeSet extends AnySet[NodeT] with ExtSetMethods[NodeT]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeSet
  2. ExtSetMethods
  3. Set
  4. SetLike
  5. Subtractable
  6. GenSet
  7. GenericSetTemplate
  8. GenSetLike
  9. Iterable
  10. IterableLike
  11. Equals
  12. GenIterable
  13. GenIterableLike
  14. Traversable
  15. GenTraversable
  16. GenericTraversableTemplate
  17. TraversableLike
  18. GenTraversableLike
  19. Parallelizable
  20. TraversableOnce
  21. GenTraversableOnce
  22. FilterMonadic
  23. HasNewBuilder
  24. Function1
  25. AnyRef
  26. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by flattenTraversableOnce
  5. by EdgeAssoc
  6. by predicateToNodePredicate
  7. by any2stringadd
  8. by StringFormat
  9. by Ensuring
  10. by ArrowAssoc
  11. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

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

Abstract Value Members

  1. abstract def +(elem: NodeT): Set[NodeT]
    Definition Classes
    SetLike → GenSetLike
  2. abstract def -(elem: NodeT): Set[NodeT]
    Definition Classes
    SetLike → Subtractable → GenSetLike
  3. abstract def contains(elem: NodeT): Boolean
    Definition Classes
    SetLike → GenSetLike
  4. abstract def draw(random: Random): NodeT

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

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

    random

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

    Definition Classes
    NodeSet → ExtSetMethods
  5. abstract def find(outerNode: N): Option[NodeT]

    Finds the inner node corresponding to outerNode.

    Finds the inner node corresponding to outerNode.

    returns

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

  6. abstract def findElem[B](toMatch: B, correspond: (NodeT, B) ⇒ Boolean): NodeT

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

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

    toMatch

    a value not necessarily of type A; the entry to be searched for must have the same hashCode and be equal to this argument

    correspond

    function returning whether a given entry corresponds to other

    returns

    the entry corresponding to toMatch or null if not contained

    Definition Classes
    ExtSetMethods
  7. abstract def get(outerNode: N): NodeT

    Finds the inner node corresponding to outerNode.

    Finds the inner node corresponding to outerNode.

    returns

    the inner node if found, otherwise NoSuchElementException is thrown.

  8. abstract def initialize(nodes: Traversable[N], edges: Traversable[E[N]]): Unit

    This method is called by the primary constructor.

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

    nodes

    The isolated (and optionally any other) outer nodes that the node set of this graph is to be populated with.

    edges

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

    Attributes
    protected[scalax.collection]
  9. abstract def iterator: Iterator[NodeT]
    Definition Classes
    GenSetLike → GenIterableLike
  10. abstract def lookup(outerNode: N): NodeT

    Finds the inner node corresponding to outerNode.

    Finds the inner node corresponding to outerNode.

    returns

    the inner node if found, otherwise null.

Concrete 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
  6. def ++(elems: GenTraversableOnce[NodeT]): Set[NodeT]
    Definition Classes
    SetLike
  7. def ++[B >: NodeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  8. def ++:[B >: NodeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
    Definition Classes
    TraversableLike
  9. def ++:[B >: NodeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
    Definition Classes
    TraversableLike
  10. def -(elem1: NodeT, elem2: NodeT, elems: NodeT*): Set[NodeT]
    Definition Classes
    Subtractable
  11. def --(xs: GenTraversableOnce[NodeT]): Set[NodeT]
    Definition Classes
    Subtractable
  12. 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()
  13. def /:[B](z: B)(op: (B, NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  14. def :\[B](z: B)(op: (NodeT, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  15. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  16. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  17. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  18. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  19. def adjacencyListsToString: String
  20. def aggregate[B](z: ⇒ B)(seqop: (B, NodeT) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  21. def andThen[A](g: (Boolean) ⇒ A): (NodeT) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  22. def apply(elem: NodeT): Boolean
    Definition Classes
    GenSetLike → Function1
  23. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  24. def asSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: NodeOrdering = defaultNodeOrdering): String

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

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

    separator

    to separate nodes by.

    ord

    custom ordering.

    returns

    sorted and concatenated string representation of this node set.

  25. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  26. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  27. def collect[B, That](pf: PartialFunction[NodeT, B])(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  28. def collectFirst[B](pf: PartialFunction[NodeT, B]): Option[B]
    Definition Classes
    TraversableOnce
  29. def companion: GenericCompanion[Set]
    Definition Classes
    Set → GenSet → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  30. def compose[A](g: (A) ⇒ NodeT): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  31. def copyToArray[B >: NodeT](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: NodeT](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToArray[B >: NodeT](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  34. def copyToBuffer[B >: NodeT](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  35. def count(p: (NodeT) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  36. def diff(that: GenSet[NodeT]): Set[NodeT]
    Definition Classes
    SetLike → GenSetLike
  37. def drop(n: Int): Set[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  38. def dropRight(n: Int): Set[NodeT]
    Definition Classes
    IterableLike
  39. def dropWhile(p: (NodeT) ⇒ Boolean): Set[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  40. def empty: Set[NodeT]
    Definition Classes
    GenericSetTemplate
  41. 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
  42. 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
  43. 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
  44. 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
  45. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  46. def equals(that: Any): Boolean
    Definition Classes
    GenSetLike → Equals → AnyRef → Any
  47. def exists(p: (NodeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  48. def filter(p: (NodeT) ⇒ Boolean): Set[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  49. def filterNot(p: (NodeT) ⇒ Boolean): Set[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  50. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  51. def find(p: (NodeT) ⇒ Boolean): Option[NodeT]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  52. def flatMap[B, That](f: (NodeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  53. def flatten[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  54. def fold[A1 >: NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  55. def foldLeft[B](z: B)(op: (B, NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  56. def foldRight[B](z: B)(op: (NodeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  57. def forall(p: (NodeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  58. def foreach[U](f: (NodeT) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  59. 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()
  60. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  61. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  62. def groupBy[K](f: (NodeT) ⇒ K): Map[K, Set[NodeT]]
    Definition Classes
    TraversableLike → GenTraversableLike
  63. def grouped(size: Int): Iterator[Set[NodeT]]
    Definition Classes
    IterableLike
  64. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  65. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  66. def head: NodeT
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  67. def headOption: Option[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  68. def init: Set[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  69. def inits: Iterator[Set[NodeT]]
    Definition Classes
    TraversableLike
  70. def intersect(that: GenSet[NodeT]): Set[NodeT]
    Definition Classes
    GenSetLike
  71. 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
  72. 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
  73. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  74. 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
  75. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  76. 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
  77. 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
  78. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  79. def last: NodeT
    Definition Classes
    TraversableLike → GenTraversableLike
  80. def lastOption: Option[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  81. 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.

  82. def max[B >: NodeT](implicit cmp: Ordering[B]): NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  83. def maxBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. def min[B >: NodeT](implicit cmp: Ordering[B]): NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. def minBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT
    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. 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
  90. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  91. def newBuilder: Builder[NodeT, Set[NodeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → HasNewBuilder
  92. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  94. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  95. def par: ParSet[NodeT]
    Definition Classes
    Parallelizable
  96. def parCombiner: Combiner[NodeT, ParSet[NodeT]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → Parallelizable
  97. def partition(p: (NodeT) ⇒ Boolean): (Set[NodeT], Set[NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  98. def product[B >: NodeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def reduce[A1 >: NodeT](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def reduceLeft[B >: NodeT](op: (B, NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce
  101. def reduceLeftOption[B >: NodeT](op: (B, NodeT) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def reduceOption[A1 >: NodeT](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def reduceRight[B >: NodeT](op: (NodeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  104. def reduceRightOption[B >: NodeT](op: (NodeT, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def repr: Set[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  106. def reversed: List[NodeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  107. def sameElements[B >: NodeT](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  108. def scan[B >: NodeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Set[NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  109. def scanLeft[B, That](z: B)(op: (B, NodeT) ⇒ B)(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  110. 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.

  111. def seq: Set[NodeT]
    Definition Classes
    Set → GenSet → GenSetLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  112. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  114. def slice(from: Int, until: Int): Set[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  115. def sliding(size: Int, step: Int): Iterator[Set[NodeT]]
    Definition Classes
    IterableLike
  116. def sliding(size: Int): Iterator[Set[NodeT]]
    Definition Classes
    IterableLike
  117. def span(p: (NodeT) ⇒ Boolean): (Set[NodeT], Set[NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  118. def splitAt(n: Int): (Set[NodeT], Set[NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  119. def stringPrefix: String
    Definition Classes
    NodeSet → SetLike → TraversableLike → GenTraversableLike
  120. def subsetOf(that: GenSet[NodeT]): Boolean
    Definition Classes
    GenSetLike
  121. def subsets(): Iterator[Set[NodeT]]
    Definition Classes
    SetLike
  122. def subsets(len: Int): Iterator[Set[NodeT]]
    Definition Classes
    SetLike
  123. def sum[B >: NodeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  124. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  125. def tail: Set[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  126. def tails: Iterator[Set[NodeT]]
    Definition Classes
    TraversableLike
  127. def take(n: Int): Set[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  128. def takeRight(n: Int): Set[NodeT]
    Definition Classes
    IterableLike
  129. def takeWhile(p: (NodeT) ⇒ Boolean): Set[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  130. def thisCollection: Iterable[NodeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  131. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, NodeT, Col[NodeT]]): Col[NodeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  132. def toArray[B >: NodeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def toBuffer[A1 >: NodeT]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  134. def toCollection(repr: Set[NodeT]): Iterable[NodeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  135. def toIndexedSeq: IndexedSeq[NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def toIterable: Iterable[NodeT]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  137. def toIterator: Iterator[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  138. def toList: List[NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. def toMap[T, U](implicit ev: <:<[NodeT, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. def toOuter: Set[N]

    Converts this node set to a set of outer nodes.

  141. 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
  142. def toSeq: Seq[NodeT]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  143. def toSet[B >: NodeT]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. def toSortedString(separator: String = GraphBase.defaultSeparator)(implicit ord: NodeOrdering = defaultNodeOrdering): String

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

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

    separator

    to separate nodes by.

    ord

    custom ordering.

    returns

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

  145. def toStream: Stream[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  146. def toString(): String
    Definition Classes
    SetLike → Function1 → TraversableLike → AnyRef → Any
  147. def toTraversable: Traversable[NodeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  148. def toVector: Vector[NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  149. 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.

  150. def union(that: GenSet[NodeT]): Set[NodeT]
    Definition Classes
    SetLike → GenSetLike
  151. def unzip[A1, A2](implicit asPair: (NodeT) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  152. def unzip3[A1, A2, A3](implicit asTriple: (NodeT) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  153. 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
  154. def view(from: Int, until: Int): IterableView[NodeT, Set[NodeT]]
    Definition Classes
    IterableLike → TraversableLike
  155. def view: IterableView[NodeT, Set[NodeT]]
    Definition Classes
    IterableLike → TraversableLike
  156. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  157. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  158. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  159. def withFilter(p: (NodeT) ⇒ Boolean): FilterMonadic[NodeT, Set[NodeT]]
    Definition Classes
    TraversableLike → FilterMonadic
  160. def withSetFilter(p: (NodeT) ⇒ Boolean): FilteredSet[NodeT]

    Returns a lazily filtered immutable Set.

    Returns a lazily filtered immutable Set.

    Definition Classes
    ExtSetMethods
  161. def zip[A1 >: NodeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[NodeT], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  162. 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
  163. def zipWithIndex[A1 >: NodeT, That](implicit bf: CanBuildFrom[Set[NodeT], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  164. def |(that: GenSet[NodeT]): Set[NodeT]
    Definition Classes
    GenSetLike
  165. 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()
  166. 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()
  167. 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 toNodeInSet: Set[N]
    Annotations
    @deprecated
    Deprecated

    (Since version 1.8.0) Use toOuter instead

Inherited from ExtSetMethods[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 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 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, scala.collection.Set[GraphBase.this.NodeT] @scala.annotation.unchecked.uncheckedVariance]

Inherited from (NodeT) ⇒ Boolean

Inherited from AnyRef

Inherited from Any

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

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

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

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