basis
.
collections
.
sequential
GeneralSetOps
final
class
GeneralSetOps
[
+A
]
extends
AnyVal
Source
GeneralSetOps.scala
Linear Supertypes
AnyVal
,
Any
Type Hierarchy
Learn more about scaladoc diagrams
GeneralSetOps[A]
Set[A]
implicitly
Subset[A]
HashTrieSet[A]
BsonSet
FormSet
JsonSet
SetForm
ProtoSet
BaseSet
AnyVal
Ordering
Alphabetic
By inheritance
Inherited
GeneralSetOps
AnyVal
Any
Hide All
Show all
Learn more about member selection
Visibility
Public
All
Instance Constructors
new
GeneralSetOps
(
__:
Set
[
A
]
)
Value Members
final
def
!=
(
arg0:
Any
)
:
Boolean
Definition Classes
Any
final
def
##
()
:
Int
Definition Classes
Any
final
def
==
(
arg0:
Any
)
:
Boolean
Definition Classes
Any
val
__
:
Set
[
A
]
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
macro
def
choose
[
B
]
(
q:
PartialFunction
[
A
,
B
]
)
:
Maybe
[
B
]
macro
def
count
(
p: (
A
) ⇒
Boolean
)
:
Int
macro
def
eagerly
:
StrictSetOps
[
A
,
Set
[_]]
macro
def
exists
(
p: (
A
) ⇒
Boolean
)
:
Boolean
macro
def
find
(
p: (
A
) ⇒
Boolean
)
:
Maybe
[
A
]
macro
def
fold
[
B >:
A
]
(
z:
B
)
(
op: (
B
,
B
) ⇒
B
)
:
B
macro
def
foldLeft
[
B
]
(
z:
B
)
(
op: (
B
,
A
) ⇒
B
)
:
B
macro
def
forall
(
p: (
A
) ⇒
Boolean
)
:
Boolean
macro
def
foreach
[
U
]
(
f: (
A
) ⇒
U
)
:
Unit
def
getClass
()
:
Class
[_ <:
AnyVal
]
Definition Classes
AnyVal → Any
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
macro
def
lazily
:
NonStrictSetOps
[
A
]
macro
def
mayReduce
[
B >:
A
]
(
op: (
B
,
B
) ⇒
B
)
:
Maybe
[
B
]
macro
def
mayReduceLeft
[
B >:
A
]
(
op: (
B
,
A
) ⇒
B
)
:
Maybe
[
B
]
macro
def
reduce
[
B >:
A
]
(
op: (
B
,
B
) ⇒
B
)
:
B
macro
def
reduceLeft
[
B >:
A
]
(
op: (
B
,
A
) ⇒
B
)
:
B
def
toString
()
:
String
Definition Classes
Any
Inherited from
AnyVal
Inherited from
Any
Ungrouped