class NodeSet extends DefaultGraphImpl.NodeSet with DefaultGraphImpl.NodeSet
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- NodeSet
- NodeSet
- NodeSet
- NodeSet
- NodeSet
- NodeSet
- NodeSet
- NodeSet
- ExtSetMethods
- Set
- SetLike
- Cloneable
- Cloneable
- Cloneable
- Shrinkable
- Builder
- Growable
- Clearable
- Scriptable
- Set
- SetLike
- Subtractable
- GenSet
- GenericSetTemplate
- GenSetLike
- Function1
- Iterable
- Iterable
- IterableLike
- Equals
- GenIterable
- GenIterableLike
- Traversable
- Mutable
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
Implicitly
- by anyToNode
- by MonadOps
- by CollectionsHaveToParArray
- by flattenTraversableOnce
- by EdgeAssoc
- by predicateToNodePredicate
- by TraversableEnrichments
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- by alternateImplicit
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new NodeSet()
Type Members
-
type
Self = Set[NodeT]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
class
WithFilter extends FilterMonadic[A, Repr]
- Definition Classes
- TraversableLike
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
&(that: GenSet[NodeT]): Set[NodeT]
- Definition Classes
- GenSetLike
-
def
&~(that: GenSet[NodeT]): Set[NodeT]
- Definition Classes
- GenSetLike
-
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.
-
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.
-
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.
-
def
++[B >: NodeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: NodeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: NodeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
- Definition Classes
- TraversableLike
-
def
++=(xs: TraversableOnce[NodeT]): NodeSet.this.type
- Definition Classes
- Growable
-
def
+=(edge: DefaultGraphImpl.EdgeT): NodeSet.this.type
- Attributes
- protected[scalax.collection]
- Definition Classes
- NodeSet → NodeSet
-
final
def
+=(node: NodeT): NodeSet.this.type
- Definition Classes
- NodeSet → SetLike → Builder → Growable
- Annotations
- @inline()
-
def
+=(elem1: NodeT, elem2: NodeT, elems: NodeT*): NodeSet.this.type
- Definition Classes
- Growable
-
final
def
-(node: NodeT): DefaultGraphImpl.NodeSetT
- Definition Classes
- NodeSet → SetLike → Subtractable → GenSetLike
-
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.
-
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.
-
def
--=(xs: TraversableOnce[NodeT]): NodeSet.this.type
- Definition Classes
- Shrinkable
-
def
-=(edge: DefaultGraphImpl.EdgeT): NodeSet.this.type
- Attributes
- protected[scalax.collection]
- Definition Classes
- NodeSet
-
final
def
-=(node: NodeT): NodeSet.this.type
- Definition Classes
- NodeSet → SetLike → Shrinkable
- Annotations
- @inline()
-
def
-=(elem1: NodeT, elem2: NodeT, elems: NodeT*): NodeSet.this.type
- Definition Classes
- Shrinkable
- def ->[B](y: B): (NodeSet, B)
-
final
def
-?(node: NodeT): DefaultGraphImpl.NodeSetT
- Definition Classes
- NodeSet
- Annotations
- @inline()
-
final
def
-?=(node: NodeT): NodeSet.this.type
- Definition Classes
- NodeSet
- Annotations
- @inline()
-
def
/:[B](z: B)(op: (B, NodeT) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:\[B](z: B)(op: (NodeT, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
add(node: NodeT): Boolean
- Definition Classes
- NodeSet → NodeSet → SetLike
-
def
add(edge: DefaultGraphImpl.EdgeT): Boolean
- Attributes
- protected[scalax.collection]
- Definition Classes
- NodeSet
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
adjacencyListsToString: String
- Definition Classes
- NodeSet
-
def
aggregate[B](z: ⇒ B)(seqop: (B, NodeT) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
andThen[A](g: (Boolean) ⇒ A): (NodeT) ⇒ A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
apply(elem: NodeT): Boolean
- Definition Classes
- GenSetLike → Function1
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
asSortedString(separator: String)(implicit ord: DefaultGraphImpl.NodeOrdering): String
- Definition Classes
- NodeSet
-
def
canEqual(that: Any): Boolean
- Definition Classes
- IterableLike → Equals
-
def
checkedRemove(node: NodeT, ripple: Boolean): Boolean
generic constrained subtraction
generic constrained subtraction
- Attributes
- protected
- Definition Classes
- NodeSet
-
def
clear(): Unit
- Definition Classes
- SetLike → Builder → Growable → Clearable
-
def
clone(): Set[NodeT]
- Definition Classes
- SetLike → Cloneable → AnyRef
-
val
coll: ExtHashSet[NodeT]
- Attributes
- protected
- Definition Classes
- NodeSet
-
def
collect[B, That](pf: PartialFunction[NodeT, B])(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[NodeT, B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
companion: GenericCompanion[Set]
- Definition Classes
- Set → Set → GenSet → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
-
def
compose[A](g: (A) ⇒ NodeT): (A) ⇒ Boolean
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
final
def
contains(node: NodeT): Boolean
- Definition Classes
- NodeSet → SetLike → GenSetLike
- Annotations
- @inline()
-
def
copy: DefaultGraphImpl.NodeSetT
- Attributes
- protected
- Definition Classes
- NodeSet → NodeSet
-
def
copyToArray[B >: NodeT](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: NodeT](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: NodeT](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: NodeT](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: (NodeT) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
diff(that: GenSet[NodeT]): Set[NodeT]
- Definition Classes
- SetLike → GenSetLike
-
final
def
draw(random: Random): NodeT
- Definition Classes
- NodeSet → NodeSet → ExtSetMethods
- Annotations
- @inline()
-
def
drop(n: Int): Set[NodeT]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
dropRight(n: Int): Set[NodeT]
- Definition Classes
- IterableLike
-
def
dropWhile(p: (NodeT) ⇒ Boolean): Set[NodeT]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
empty: Set[NodeT]
- Definition Classes
- GenericSetTemplate
- def ensuring(cond: (NodeSet) ⇒ Boolean, msg: ⇒ Any): NodeSet
- def ensuring(cond: (NodeSet) ⇒ Boolean): NodeSet
- def ensuring(cond: Boolean, msg: ⇒ Any): NodeSet
- def ensuring(cond: Boolean): NodeSet
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- GenSetLike → Equals → AnyRef → Any
-
def
exists(p: (NodeT) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
filter(p: (NodeT) ⇒ Boolean): Set[NodeT]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: (NodeT) ⇒ Boolean): Set[NodeT]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
find(elem: N): Option[NodeT]
- Definition Classes
- NodeSet → NodeSet
- Annotations
- @inline()
-
def
find(p: (NodeT) ⇒ Boolean): Option[NodeT]
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
findElem[B](toMatch: B, correspond: (NodeT, B) ⇒ Boolean): NodeT
- Definition Classes
- NodeSet → ExtSetMethods
- Annotations
- @inline()
-
def
flatMap[B, That](f: (NodeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Set[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, NodeT) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (NodeT, B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
forall(p: (NodeT) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: (NodeT) ⇒ U): Unit
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
- def formatted(fmtstr: String): String
-
def
genericBuilder[B]: Builder[B, Set[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
get(outer: N): NodeT
- Definition Classes
- NodeSet → NodeSet
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
groupBy[K](f: (NodeT) ⇒ K): Map[K, Set[NodeT]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
grouped(size: Int): Iterator[Set[NodeT]]
- Definition Classes
- IterableLike
-
def
handleNotGentlyRemovable: Boolean
- Attributes
- protected
- Definition Classes
- NodeSet
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
hashCode(): Int
- Definition Classes
- GenSetLike → AnyRef → Any
-
def
head: NodeT
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
headOption: Option[NodeT]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
init: Set[NodeT]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
initialize(nodes: Traversable[N], edges: Traversable[E[N]]): Unit
- Attributes
- protected[scalax.collection]
- Definition Classes
- NodeSet → NodeSet
-
def
inits: Iterator[Set[NodeT]]
- Definition Classes
- TraversableLike
-
def
intersect(that: GenSet[NodeT]): Set[NodeT]
- Definition Classes
- GenSetLike
- def isDefined: Boolean
- final def isEdge: Boolean
-
def
isEmpty: Boolean
- Definition Classes
- SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
- def isIn: Boolean
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isNode: Boolean
- final def isOut: Boolean
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
final
def
iterator: Iterator[NodeT]
- Definition Classes
- NodeSet → GenSetLike → IterableLike → GenIterableLike
- Annotations
- @inline()
-
def
last: NodeT
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[NodeT]
- Definition Classes
- TraversableLike → GenTraversableLike
-
final
def
lookup(elem: N): NodeT
- Definition Classes
- NodeSet → NodeSet
-
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.
-
def
mapResult[NewTo](f: (Set[NodeT]) ⇒ NewTo): Builder[NodeT, NewTo]
- Definition Classes
- Builder
-
def
max[B >: NodeT](implicit cmp: Ordering[B]): NodeT
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: NodeT](implicit cmp: Ordering[B]): NodeT
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minus(node: NodeT): Unit
- Attributes
- protected
- Definition Classes
- NodeSet → NodeSet
-
def
minusEdges(node: NodeT): Unit
- Attributes
- protected
- Definition Classes
- NodeSet → NodeSet
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
- val n1: NodeSet
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[NodeT, Set[NodeT]]
- Attributes
- protected[this]
- Definition Classes
- SetLike → SetLike → TraversableLike → HasNewBuilder
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
par: ParSet[NodeT]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[NodeT, ParSet[NodeT]]
- Attributes
- protected[this]
- Definition Classes
- SetLike → SetLike → TraversableLike → Parallelizable
-
def
partition(p: (NodeT) ⇒ Boolean): (Set[NodeT], Set[NodeT])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
product[B >: NodeT](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: NodeT](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: NodeT](op: (B, NodeT) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: NodeT](op: (B, NodeT) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: NodeT](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: NodeT](op: (NodeT, B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: NodeT](op: (NodeT, B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
remove(node: NodeT): Boolean
- Definition Classes
- NodeSet → NodeSet → SetLike
-
def
remove(edge: DefaultGraphImpl.EdgeT): Boolean
- Attributes
- protected[scalax.collection]
- Definition Classes
- NodeSet
-
def
removeGently(node: NodeT): Boolean
- Definition Classes
- NodeSet → NodeSet
-
def
repr: Set[NodeT]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
result(): Set[NodeT]
- Definition Classes
- SetLike → Builder
-
def
retain(p: (NodeT) ⇒ Boolean): Unit
- Definition Classes
- SetLike
-
def
reversed: List[NodeT]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
sameElements[B >: NodeT](that: GenIterable[B]): Boolean
- Definition Classes
- IterableLike → GenIterableLike
-
def
scan[B >: NodeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Set[NodeT], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, NodeT) ⇒ B)(implicit bf: CanBuildFrom[Set[NodeT], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
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
scanRighthas changed. The previous behavior can be reproduced with scanRight.reverse.
-
def
seq: Set[NodeT]
- Definition Classes
- Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
final
def
size: Int
- Definition Classes
- NodeSet → GenTraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @inline()
-
def
sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
- Definition Classes
- Builder
-
def
sizeHint(coll: TraversableLike[_, _]): Unit
- Definition Classes
- Builder
-
def
sizeHint(size: Int): Unit
- Definition Classes
- Builder
-
def
sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
- Definition Classes
- Builder
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): Set[NodeT]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
sliding(size: Int, step: Int): Iterator[Set[NodeT]]
- Definition Classes
- IterableLike
-
def
sliding(size: Int): Iterator[Set[NodeT]]
- Definition Classes
- IterableLike
-
def
span(p: (NodeT) ⇒ Boolean): (Set[NodeT], Set[NodeT])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (Set[NodeT], Set[NodeT])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
stringPrefix: String
- Definition Classes
- NodeSet → SetLike → TraversableLike → GenTraversableLike
-
def
subsetOf(that: GenSet[NodeT]): Boolean
- Definition Classes
- GenSetLike
-
def
subsets(): Iterator[Set[NodeT]]
- Definition Classes
- SetLike
-
def
subsets(len: Int): Iterator[Set[NodeT]]
- Definition Classes
- SetLike
-
final
def
subtract(node: NodeT, rippleDelete: Boolean, minusNode: (NodeT) ⇒ Unit, minusEdges: (NodeT) ⇒ Unit): Boolean
- Attributes
- protected[scalax.collection]
- Definition Classes
- NodeSet
-
def
sum[B >: NodeT](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- val t: Set[NodeT]
-
def
tail: Set[NodeT]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[Set[NodeT]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): Set[NodeT]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
takeRight(n: Int): Set[NodeT]
- Definition Classes
- IterableLike
-
def
takeWhile(p: (NodeT) ⇒ Boolean): Set[NodeT]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
thisCollection: Iterable[NodeT]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, NodeT, Col[NodeT]]): Col[NodeT]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: NodeT](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[A1 >: NodeT]: Buffer[A1]
- Definition Classes
- SetLike → TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: Set[NodeT]): Iterable[NodeT]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
def
toIndexedSeq: IndexedSeq[NodeT]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[NodeT]
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[NodeT]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toList: List[NodeT]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[NodeT, (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toOuter: Set[N]
- Definition Classes
- NodeSet
- def toOuterNodes[E[X <: N] <: EdgeLike[X]]: Seq[InParam[NodeT, E]]
-
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
-
def
toSeq: Seq[NodeT]
- Definition Classes
- SetLike → SetLike → TraversableOnce → GenTraversableOnce
-
def
toSet[B >: NodeT]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSortedString(separator: String)(implicit ord: DefaultGraphImpl.NodeOrdering): String
- Definition Classes
- NodeSet
-
def
toStream: Stream[NodeT]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- SetLike → Function1 → TraversableLike → AnyRef → Any
-
def
toTraversable: Traversable[NodeT]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[NodeT]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transpose[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Set[Set[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transposethrows anIllegalArgumentExceptionif collections are not uniformly sized.
-
def
union(that: GenSet[NodeT]): Set[NodeT]
- Definition Classes
- SetLike → GenSetLike
-
def
unzip[A1, A2](implicit asPair: (NodeT) ⇒ (A1, A2)): (Set[A1], Set[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: (NodeT) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
- Definition Classes
- GenericTraversableTemplate
-
def
update(elem: NodeT, included: Boolean): Unit
- Definition Classes
- SetLike
-
def
upsert(edge: DefaultGraphImpl.EdgeT): Boolean
- Attributes
- protected[scalax.collection]
- Definition Classes
- NodeSet
- val value: NodeSet
-
def
view(from: Int, until: Int): IterableView[NodeT, Set[NodeT]]
- Definition Classes
- IterableLike → TraversableLike
-
def
view: IterableView[NodeT, Set[NodeT]]
- Definition Classes
- IterableLike → TraversableLike
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
withFilter(p: (NodeT) ⇒ Boolean): FilterMonadic[NodeT, Set[NodeT]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
withSetFilter(p: (NodeT) ⇒ Boolean): FilteredSet[NodeT]
- Definition Classes
- ExtSetMethods
-
def
zip[A1 >: NodeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[NodeT], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
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
-
def
zipWithIndex[A1 >: NodeT, That](implicit bf: CanBuildFrom[Set[NodeT], (A1, Int), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
|(that: GenSet[NodeT]): Set[NodeT]
- Definition Classes
- GenSetLike
- def ~[N >: N1](n2: N): UnDiEdge[N]
- def ~>[N >: N1](n2: N): DiEdge[N]
- def →[B](y: B): (NodeSet, B)
Shadowed Implicit Value Members
-
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
-
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()
-
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
-
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()
-
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
-
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
-
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
-
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
-
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
-
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
-
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
-
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