object Set extends Serializable
- Alphabetic
- By Inheritance
- Set
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
apply[A](as: A*)(implicit arg0: ClassTag[A]): Set[A]
Build a Set instance from the provided values.
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
implicit
def
cmonoid[A](implicit arg0: ClassTag[A]): CMonoid[Set[A]]
Provide a CMonoid[Set[A]] instance.
Provide a CMonoid[Set[A]] instance.
Since element order is irrelevant, union is a commutative operation. The empty set is the identity element.
-
def
empty[A](implicit arg0: ClassTag[A]): Set[A]
Allocate an empty Set.
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
implicit
def
eqv[A]: Eq[Set[A]]
Provide a Eq[Set[A]] instance.
Provide a Eq[Set[A]] instance.
Since Sets are so reliant on equality, and use hash codes internally, the default equality is used to compare elements.
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
fromArray[A](as: Array[A])(implicit arg0: ClassTag[A]): Set[A]
Build a Set from the provided array.
Build a Set from the provided array.
The advantage of using this method is that, unlike apply() or fromIterable(), the values will not be boxed prior to the set being built.
-
def
fromIterable[A](as: Iterable[A])(implicit arg0: ClassTag[A]): Set[A]
Build a Set from the provided iterable object.
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
ofSize[A](n: Int)(implicit arg0: ClassTag[A]): Set[A]
Allocate an empty Set, capable of holding n items without resizing itself.
Allocate an empty Set, capable of holding n items without resizing itself.
This method is useful if you know you'll be adding a large number of elements in advance and you want to save a few resizes.
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
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( ... )