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