final class EqSet[K <: AnyRef] extends Set[K]
Wrapper class mimicking a scala.collection.immutable.Set
without copying the contents of the underlying EqHashMap
.
- Alphabetic
- By Inheritance
- EqSet
- Set
- Set
- SetLike
- Subtractable
- GenSet
- GenericSetTemplate
- GenSetLike
- Function1
- Iterable
- Iterable
- IterableLike
- Equals
- GenIterable
- GenIterableLike
- Traversable
- Immutable
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
- by CollectionsHaveToParArray
- by MonadOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- by alternateImplicit
- Hide All
- Show All
- Public
- All
Type Members
-
type
Self = Set[K]
- 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[K]): Set[K]
- Definition Classes
- GenSetLike
-
def
&~(that: GenSet[K]): Set[K]
- Definition Classes
- GenSetLike
-
def
+(elem: K): Set[K]
Creates a new
Set
as an O(N) operation unlesselem
is already contained.Creates a new
Set
as an O(N) operation unlesselem
is already contained.- Definition Classes
- EqSet → SetLike → GenSetLike
-
def
+(elem1: K, elem2: K, elems: K*): Set[K]
- Definition Classes
- SetLike
-
def
++(elems: GenTraversableOnce[K]): Set[K]
- Definition Classes
- SetLike
-
def
++[B >: K, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[K], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: K, That](that: Traversable[B])(implicit bf: CanBuildFrom[Set[K], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: K, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Set[K], B, That]): That
- Definition Classes
- TraversableLike
-
def
-(elem: K): Set[K]
Creates a new
Set
as an O(N) operation unlesselem
is not contained.Creates a new
Set
as an O(N) operation unlesselem
is not contained.- Definition Classes
- EqSet → SetLike → Subtractable → GenSetLike
-
def
-(elem1: K, elem2: K, elems: K*): Set[K]
- Definition Classes
- Subtractable
-
def
--(xs: GenTraversableOnce[K]): Set[K]
- Definition Classes
- Subtractable
- def ->[B](y: B): (EqSet[K], B)
-
def
/:[B](z: B)(op: (B, K) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:\[B](z: B)(op: (K, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
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
aggregate[B](z: ⇒ B)(seqop: (B, K) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
andThen[A](g: (Boolean) ⇒ A): (K) ⇒ A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
apply(elem: K): Boolean
- Definition Classes
- GenSetLike → Function1
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
canEqual(that: Any): Boolean
- Definition Classes
- IterableLike → Equals
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
collect[B, That](pf: PartialFunction[K, B])(implicit bf: CanBuildFrom[Set[K], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[K, 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) ⇒ K): (A) ⇒ Boolean
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
contains(key: K): Boolean
- Definition Classes
- EqSet → SetLike → GenSetLike
-
def
copyToArray[B >: K](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: K](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: K](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: K](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: (K) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
diff(that: GenSet[K]): Set[K]
- Definition Classes
- SetLike → GenSetLike
-
def
drop(n: Int): Set[K]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
dropRight(n: Int): Set[K]
- Definition Classes
- IterableLike
-
def
dropWhile(p: (K) ⇒ Boolean): Set[K]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
empty: Set[K]
- Definition Classes
- GenericSetTemplate
- def ensuring(cond: (EqSet[K]) ⇒ Boolean, msg: ⇒ Any): EqSet[K]
- def ensuring(cond: (EqSet[K]) ⇒ Boolean): EqSet[K]
- def ensuring(cond: Boolean, msg: ⇒ Any): EqSet[K]
- def ensuring(cond: Boolean): EqSet[K]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- GenSetLike → Equals → AnyRef → Any
-
def
exists(p: (K) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
filter(p: (K) ⇒ Boolean): Set[K]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: (K) ⇒ Boolean): Set[K]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: (K) ⇒ Boolean): Option[K]
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
flatMap[B, That](f: (K) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Set[K], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: (K) ⇒ GenTraversableOnce[B]): Set[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: K](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, K) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (K, B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
forall(p: (K) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: (K) ⇒ 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
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
groupBy[K](f: (K) ⇒ K): Map[K, Set[K]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
grouped(size: Int): Iterator[Set[K]]
- Definition Classes
- IterableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
hashCode(): Int
- Definition Classes
- GenSetLike → AnyRef → Any
-
def
head: K
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
headOption: Option[K]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
init: Set[K]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
inits: Iterator[Set[K]]
- Definition Classes
- TraversableLike
-
def
intersect(that: GenSet[K]): Set[K]
- Definition Classes
- GenSetLike
-
def
isEmpty: Boolean
- Definition Classes
- SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
iterator: Iterator[K]
- Definition Classes
- EqSet → GenSetLike → IterableLike → GenIterableLike
-
def
last: K
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[K]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
map[B, That](f: (K) ⇒ B)(implicit bf: CanBuildFrom[Set[K], 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
max[B >: K](implicit cmp: Ordering[B]): K
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: (K) ⇒ B)(implicit cmp: Ordering[B]): K
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: K](implicit cmp: Ordering[B]): K
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (K) ⇒ B)(implicit cmp: Ordering[B]): K
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
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
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[K, Set[K]]
- Attributes
- protected[this]
- Definition Classes
- 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[K]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[K, ParSet[K]]
- Attributes
- protected
- Definition Classes
- Set → SetLike → Iterable → TraversableLike → Parallelizable
-
def
partition(p: (K) ⇒ Boolean): (Set[K], Set[K])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
product[B >: K](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: K](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: K](op: (B, K) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: K](op: (B, K) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: K](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: K](op: (K, B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: K](op: (K, B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
repr: Set[K]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
reversed: List[K]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
sameElements[B >: K](that: GenIterable[B]): Boolean
- Definition Classes
- IterableLike → GenIterableLike
-
def
scan[B >: K, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Set[K], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, K) ⇒ B)(implicit bf: CanBuildFrom[Set[K], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: (K, B) ⇒ B)(implicit bf: CanBuildFrom[Set[K], 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.
-
def
seq: Set[K]
- Definition Classes
- Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
size: Int
- Definition Classes
- EqSet → GenTraversableLike → TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): Set[K]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
sliding(size: Int, step: Int): Iterator[Set[K]]
- Definition Classes
- IterableLike
-
def
sliding(size: Int): Iterator[Set[K]]
- Definition Classes
- IterableLike
-
def
span(p: (K) ⇒ Boolean): (Set[K], Set[K])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (Set[K], Set[K])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
stringPrefix: String
- Definition Classes
- SetLike → TraversableLike → GenTraversableLike
-
def
subsetOf(that: GenSet[K]): Boolean
- Definition Classes
- GenSetLike
-
def
subsets(): Iterator[Set[K]]
- Definition Classes
- SetLike
-
def
subsets(len: Int): Iterator[Set[K]]
- Definition Classes
- SetLike
-
def
sum[B >: K](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: Set[K]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[Set[K]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): Set[K]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
takeRight(n: Int): Set[K]
- Definition Classes
- IterableLike
-
def
takeWhile(p: (K) ⇒ Boolean): Set[K]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
thisCollection: Iterable[K]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, K, Col[K]]): Col[K]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: K](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[A1 >: K]: Buffer[A1]
- Definition Classes
- SetLike → TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: Set[K]): Iterable[K]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
def
toIndexedSeq: IndexedSeq[K]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[K]
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[K]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toList: List[K]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[K, (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toParArray: ParArray[T]
- Implicit
- This member is added by an implicit conversion from EqSet[K] to CollectionsHaveToParArray[EqSet[K], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (EqSet[K]) ⇒ GenTraversableOnce[T] is in scope.
- Definition Classes
- CollectionsHaveToParArray
-
def
toSeq: Seq[K]
- Definition Classes
- SetLike → TraversableOnce → GenTraversableOnce
-
def
toSet[B >: K]: Set[B]
- Definition Classes
- Set → TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[K]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- SetLike → Function1 → TraversableLike → AnyRef → Any
-
def
toTraversable: Traversable[K]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[K]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transpose[B](implicit asTraversable: (K) ⇒ GenTraversableOnce[B]): Set[Set[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transpose
throws anIllegalArgumentException
if collections are not uniformly sized.
-
def
union(that: GenSet[K]): Set[K]
- Definition Classes
- SetLike → GenSetLike
-
def
unzip[A1, A2](implicit asPair: (K) ⇒ (A1, A2)): (Set[A1], Set[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: (K) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
- Definition Classes
- GenericTraversableTemplate
-
def
view(from: Int, until: Int): IterableView[K, Set[K]]
- Definition Classes
- IterableLike → TraversableLike
-
def
view: IterableView[K, Set[K]]
- 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: (K) ⇒ Boolean): FilterMonadic[K, Set[K]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
zip[A1 >: K, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Set[K], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipAll[B, A1 >: K, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Set[K], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipWithIndex[A1 >: K, That](implicit bf: CanBuildFrom[Set[K], (A1, Int), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
|(that: GenSet[K]): Set[K]
- Definition Classes
- GenSetLike
- def →[B](y: B): (EqSet[K], B)
Shadowed Implicit Value Members
-
def
+(other: String): String
- Implicit
- This member is added by an implicit conversion from EqSet[K] to any2stringadd[EqSet[K]] 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:(eqSet: any2stringadd[EqSet[K]]).+(other)
- Definition Classes
- any2stringadd
-
def
filter(p: (K) ⇒ Boolean): TraversableOnce[K]
- Implicit
- This member is added by an implicit conversion from EqSet[K] to MonadOps[K] 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:(eqSet: MonadOps[K]).filter(p)
- Definition Classes
- MonadOps
-
def
flatMap[B](f: (K) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from EqSet[K] to MonadOps[K] 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:(eqSet: MonadOps[K]).flatMap(f)
- Definition Classes
- MonadOps
-
def
map[B](f: (K) ⇒ B): TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from EqSet[K] to MonadOps[K] 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:(eqSet: MonadOps[K]).map(f)
- Definition Classes
- MonadOps
-
def
withFilter(p: (K) ⇒ Boolean): Iterator[K]
- Implicit
- This member is added by an implicit conversion from EqSet[K] to MonadOps[K] 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:(eqSet: MonadOps[K]).withFilter(p)
- Definition Classes
- MonadOps
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graph
mutable.Graph
and its inner nodes.GraphEdge
objectedge
packageGraphPredef
object andImplicits
object.GraphTraversal
andTraverserInnerNode
.RandomGraph
.GraphGen
.