Instance Constructors
-
new
EqHashSet(other: EqHashSet[A])
-
new
EqHashSet(_sizeHint: Int = EqHash.defCapacity)
Value Members
-
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
-
def
+(elem1: A, elem2: A, elems: A*): EqHashSet[A]
-
def
+(elem: A): EqHashSet[A]
-
-
-
def
++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[EqHashSet[A], B, That]): That
-
-
-
def
+=(elem: A): EqHashSet.this.type
-
def
+=(elem1: A, elem2: A, elems: A*): EqHashSet.this.type
-
def
-(elem1: A, elem2: A, elems: A*): EqHashSet[A]
-
def
-(elem: A): EqHashSet[A]
-
-
-
def
-=(elem: A): EqHashSet.this.type
-
def
-=(elem1: A, elem2: A, elems: A*): EqHashSet.this.type
-
def
->[B](y: B): (EqHashSet[A], B)
-
def
/:[B](z: B)(op: (B, A) ⇒ B): B
-
def
:\[B](z: B)(op: (A, B) ⇒ B): B
-
def
<<(cmd: Message[A]): Unit
-
-
final
def
==(arg0: Any): Boolean
-
var
_size: Int
-
def
add(elem: A): Boolean
-
-
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
aggregate[B](z: B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
-
def
andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A
-
def
apply(elem: A): Boolean
-
final
def
asInstanceOf[T0]: T0
-
-
def
asParSeq: ParSeq[A]
-
def
canEqual(other: Any): Boolean
-
def
clear: Unit
-
-
final
def
closeDeletion(index: Int): Unit
-
-
-
-
def
compose[A](g: (A) ⇒ A): (A) ⇒ Boolean
-
final
def
contains(elem: A): Boolean
-
def
containsElem(elem: A): Boolean
-
def
copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: A](xs: Array[B]): Unit
-
def
copyToArray[B >: A](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: A](dest: Buffer[B]): Unit
-
def
count(p: (A) ⇒ Boolean): Int
-
-
-
-
-
-
-
-
-
-
-
-
def
equals(other: Any): Boolean
-
-
-
-
def
finalize(): Unit
-
-
-
def
flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Set[B]
-
def
fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, A) ⇒ B): B
-
def
foldRight[B](z: B)(op: (A, B) ⇒ B): B
-
-
def
foreach[U](f: (A) ⇒ U): Unit
-
def
formatted(fmtstr: String): String
-
-
def
genericBuilder[B]: Builder[B, Set[B]]
-
final
def
getClass(): Class[_]
-
def
groupBy[K](f: (A) ⇒ K): Map[K, EqHashSet[A]]
-
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
def
head: A
-
def
headOption: Option[A]
-
def
ifParSeq[R](isbody: (ParSeq[A]) ⇒ R): (TraversableOps[A])#Otherwise[R]
-
final
def
index(key: AnyRef): Int
-
def
index(maskedKey: AnyRef, keyHash: Int, tabLength: Int): Int
-
-
-
-
-
final
def
isInstanceOf[T0]: Boolean
-
def
isParIterable: Boolean
-
-
def
isParallel: Boolean
-
final
def
isTraversableAgain: Boolean
-
def
iterator: Iterator[A]
-
def
last: A
-
def
lastOption: Option[A]
-
def
map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[EqHashSet[A], B, That]): That
-
def
mapResult[NewTo](f: (EqHashSet[A]) ⇒ NewTo): Builder[A, NewTo]
-
final
def
maskNull(key: AnyRef): AnyRef
-
def
max[B >: A](implicit cmp: Ordering[B]): A
-
def
maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
-
final
def
maxCapacity: Int
-
def
min[B >: A](implicit cmp: Ordering[B]): A
-
def
minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
-
-
-
final
def
nextKeyIndex(i: Int, len: Int): Int
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
def
parCombiner: Combiner[A, ParSet[A]]
-
-
def
product[B >: A](implicit num: Numeric[B]): B
-
def
reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: A](op: (B, A) ⇒ B): B
-
def
reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
-
def
reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: A](op: (A, B) ⇒ B): B
-
def
reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
-
def
remove(elem: A): Boolean
-
-
def
resize: Unit
-
-
def
retain(p: (A) ⇒ Boolean): Unit
-
def
reversed: List[A]
-
def
sameElements[B >: A](that: GenIterable[B]): Boolean
-
def
scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[EqHashSet[A], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[EqHashSet[A], B, That]): That
-
def
scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[EqHashSet[A], B, That]): That
-
def
seq: Set[A]
-
final
def
size: Int
-
final
def
sizeHint: Int
-
-
-
def
sizeHint(size: Int): Unit
-
def
sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
-
def
slice(from: Int, until: Int): EqHashSet[A]
-
-
-
-
-
final
def
step: Int
-
def
stringPrefix: String
-
-
-
-
def
sum[B >: A](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
-
-
-
-
def
thisCollection: Iterable[A]
-
var
threshold: Int
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]
-
def
toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[A1 >: A]: Buffer[A1]
-
-
def
toIndexedSeq: IndexedSeq[A]
-
def
toIterable: Iterable[A]
-
def
toIterator: Iterator[A]
-
def
toList: List[A]
-
def
toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]
-
def
toParArray: ParArray[A]
-
def
toSeq: Seq[A]
-
def
toSet[B >: A]: Set[B]
-
def
toStream: Stream[A]
-
def
toString(): String
-
-
def
toVector: Vector[A]
-
def
transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): Set[Set[B]]
-
-
final
def
unmaskNull(key: AnyRef): AnyRef
-
def
unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (Set[A1], Set[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
-
def
update(elem: A, included: Boolean): Unit
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
def
zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[EqHashSet[A], (A1, B), That]): That
-
def
zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[EqHashSet[A], (A1, B), That]): That
-
def
zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[EqHashSet[A], (A1, Int), That]): That
-
-
def
→[B](y: B): (EqHashSet[A], B)
Shadowed Implicit Value Members
-
def
+(other: String): String
-
-
-
-
val
self: Any
-
val
self: Any
-
Deprecated Value Members
-
def
/:\[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
-
-
Inherited from Set[A]
Inherited from Cloneable
Inherited by implicit conversion MonadOps from
EqHashSet[A] to MonadOps[A]
Inherited by implicit conversion any2ArrowAssoc from
EqHashSet[A] to ArrowAssoc[EqHashSet[A]]
Inherited by implicit conversion alternateImplicit from
EqHashSet[A] to ForceImplicitAmbiguity
