class
Nodes extends Set[Node] with SetLike[Node, Nodes]
Instance Constructors
-
new
Nodes(self: LinkedHashSet[Node] = mutable.LinkedHashSet.empty[Node])
Type Members
-
type
Self = Nodes
-
class
WithFilter extends FilterMonadic[A, Repr]
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
&(that: GenSet[Node]): Nodes
-
def
&~(that: GenSet[Node]): Nodes
-
def
+(elem1: Node, elem2: Node, elems: Node*): Nodes
-
-
def
++(xs: GenTraversableOnce[Node]): Nodes
-
def
++[B >: Node, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Nodes, B, That]): That
-
def
++:[B >: Node, That](that: Traversable[B])(implicit bf: CanBuildFrom[Nodes, B, That]): That
-
def
++:[B >: Node, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Nodes, B, That]): That
-
def
++=(xs: TraversableOnce[Node]): Nodes.this.type
-
def
+=(node: Node): Nodes.this.type
-
def
+=(elem1: Node, elem2: Node, elems: Node*): Nodes.this.type
-
def
-(elem1: Node, elem2: Node, elems: Node*): Nodes
-
-
def
--(xs: GenTraversableOnce[Node]): Nodes
-
def
--=(xs: TraversableOnce[Node]): Nodes.this.type
-
def
-=(node: Node): Nodes.this.type
-
def
-=(elem1: Node, elem2: Node, elems: Node*): Nodes.this.type
-
def
/:[B](z: B)(op: (B, Node) ⇒ B): B
-
def
:\[B](z: B)(op: (Node, B) ⇒ B): B
-
final
def
==(arg0: Any): Boolean
-
def
add(elem: Node): Boolean
-
def
addString(b: StringBuilder): StringBuilder
-
def
addString(b: StringBuilder, sep: String): StringBuilder
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
aggregate[B](z: ⇒ B)(seqop: (B, Node) ⇒ B, combop: (B, B) ⇒ B): B
-
def
andThen[A](g: (Boolean) ⇒ A): (Node) ⇒ A
-
def
apply(elem: Node): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clear(): Unit
-
def
clone(): Nodes
-
def
collect[B, That](pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[Nodes, B, That]): That
-
def
collectFirst[B](pf: PartialFunction[Node, B]): Option[B]
-
def
companion: GenericCompanion[Set]
-
def
compose[A](g: (A) ⇒ Node): (A) ⇒ Boolean
-
def
contains(node: Node): Boolean
-
def
copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: Node](xs: Array[B]): Unit
-
def
copyToArray[B >: Node](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: Node](dest: Buffer[B]): Unit
-
def
count(p: (Node) ⇒ Boolean): Int
-
def
diff(that: GenSet[Node]): Nodes
-
def
drop(n: Int): Nodes
-
def
dropRight(n: Int): Nodes
-
def
dropWhile(p: (Node) ⇒ Boolean): Nodes
-
def
empty: Nodes
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(that: Any): Boolean
-
def
exists(p: (Node) ⇒ Boolean): Boolean
-
def
filter(p: (Node) ⇒ Boolean): Nodes
-
def
filterNot(p: (Node) ⇒ Boolean): Nodes
-
def
finalize(): Unit
-
def
find(p: (Node) ⇒ Boolean): Option[Node]
-
def
flatMap[B, That](f: (Node) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Nodes, B, That]): That
-
def
flatten[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): Set[B]
-
def
fold[A1 >: Node](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, Node) ⇒ B): B
-
def
foldRight[B](z: B)(op: (Node, B) ⇒ B): B
-
def
forall(p: (Node) ⇒ Boolean): Boolean
-
def
foreach[U](f: (Node) ⇒ U): Unit
-
def
genericBuilder[B]: Builder[B, Set[B]]
-
final
def
getClass(): Class[_]
-
def
groupBy[K](f: (Node) ⇒ K): Map[K, Nodes]
-
def
grouped(size: Int): Iterator[Nodes]
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
def
head: Node
-
def
headOption: Option[Node]
-
-
def
inits: Iterator[Nodes]
-
def
intersect(that: GenSet[Node]): Nodes
-
def
isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
def
iterator: Iterator[Node]
-
def
last: Node
-
def
lastOption: Option[Node]
-
def
map[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[Nodes, B, That]): That
-
def
mapResult[NewTo](f: (Nodes) ⇒ NewTo): Builder[Node, NewTo]
-
def
max[B >: Node](implicit cmp: Ordering[B]): Node
-
def
maxBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node
-
def
min[B >: Node](implicit cmp: Ordering[B]): Node
-
def
minBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
final
def
ne(arg0: AnyRef): Boolean
-
def
newBuilder: Builder[Node, Nodes]
-
def
nonEmpty: Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
par: ParSet[Node]
-
def
parCombiner: Combiner[Node, ParSet[Node]]
-
def
partition(p: (Node) ⇒ Boolean): (Nodes, Nodes)
-
def
product[B >: Node](implicit num: Numeric[B]): B
-
def
reduce[A1 >: Node](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: Node](op: (B, Node) ⇒ B): B
-
def
reduceLeftOption[B >: Node](op: (B, Node) ⇒ B): Option[B]
-
def
reduceOption[A1 >: Node](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: Node](op: (Node, B) ⇒ B): B
-
def
reduceRightOption[B >: Node](op: (Node, B) ⇒ B): Option[B]
-
def
remove(elem: Node): Boolean
-
-
def
result(): Nodes
-
def
retain(p: (Node) ⇒ Boolean): Unit
-
def
reversed: List[Node]
-
def
sameElements[B >: Node](that: GenIterable[B]): Boolean
-
def
scan[B >: Node, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Nodes, B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, Node) ⇒ B)(implicit bf: CanBuildFrom[Nodes, B, That]): That
-
def
scanRight[B, That](z: B)(op: (Node, B) ⇒ B)(implicit bf: CanBuildFrom[Nodes, B, That]): That
-
def
seq: Set[Node]
-
def
size: Int
-
def
sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
-
def
sizeHint(coll: TraversableLike[_, _]): Unit
-
def
sizeHint(size: Int): Unit
-
def
sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
-
def
slice(from: Int, until: Int): Nodes
-
def
sliding(size: Int, step: Int): Iterator[Nodes]
-
def
sliding(size: Int): Iterator[Nodes]
-
def
span(p: (Node) ⇒ Boolean): (Nodes, Nodes)
-
def
splitAt(n: Int): (Nodes, Nodes)
-
def
stringPrefix: String
-
def
subsetOf(that: GenSet[Node]): Boolean
-
def
subsets(): Iterator[Nodes]
-
def
subsets(len: Int): Iterator[Nodes]
-
def
sum[B >: Node](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
def
tails: Iterator[Nodes]
-
def
take(n: Int): Nodes
-
def
takeRight(n: Int): Nodes
-
def
takeWhile(p: (Node) ⇒ Boolean): Nodes
-
def
thisCollection: Iterable[Node]
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Node, Col[Node]]): Col[Node]
-
def
toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[A1 >: Node]: Buffer[A1]
-
def
toCollection(repr: Nodes): Iterable[Node]
-
def
toIndexedSeq: IndexedSeq[Node]
-
def
toIterable: Iterable[Node]
-
def
toIterator: Iterator[Node]
-
def
toList: List[Node]
-
def
toMap[T, U](implicit ev: <:<[Node, (T, U)]): Map[T, U]
-
def
toSeq: Seq[Node]
-
def
toSet[B >: Node]: Set[B]
-
def
toStream: Stream[Node]
-
def
toString(): String
-
def
toTraversable: Traversable[Node]
-
def
toVector: Vector[Node]
-
def
transpose[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): Set[Set[B]]
-
def
union(that: GenSet[Node]): Nodes
-
def
unzip[A1, A2](implicit asPair: (Node) ⇒ (A1, A2)): (Set[A1], Set[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: (Node) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
-
def
update(elem: Node, included: Boolean): Unit
-
def
view(from: Int, until: Int): IterableView[Node, Nodes]
-
def
view: IterableView[Node, Nodes]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
withFilter(p: (Node) ⇒ Boolean): FilterMonadic[Node, Nodes]
-
def
zip[A1 >: Node, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Nodes, (A1, B), That]): That
-
def
zipAll[B, A1 >: Node, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Nodes, (A1, B), That]): That
-
def
zipWithIndex[A1 >: Node, That](implicit bf: CanBuildFrom[Nodes, (A1, Int), That]): That
-
def
|(that: GenSet[Node]): Nodes
Deprecated Value Members
-
def
<<(cmd: Message[Node]): Unit
Inherited from Cloneable[Set[Node]]
Inherited from Cloneable
Inherited from Cloneable
Inherited from Shrinkable[Node]
Inherited from Growable[Node]
Inherited from Clearable
Inherited from Scriptable[Node]
Inherited from GenSet[Node]
Inherited from GenericSetTemplate[Node, Set]
Inherited from (Node) ⇒ Boolean
Inherited from Iterable[Node]
Inherited from Iterable[Node]
Inherited from Equals
Inherited from GenIterable[Node]
Inherited from Traversable[Node]
Inherited from Mutable
Inherited from Traversable[Node]
Inherited from GenTraversable[Node]
Inherited from GenericTraversableTemplate[Node, Set]
Inherited from GenTraversableLike[Node, Nodes]
Inherited from Parallelizable[Node, ParSet[Node]]
Inherited from TraversableOnce[Node]
Inherited from GenTraversableOnce[Node]
Inherited from AnyRef
Inherited from Any