basis
.
collections
.
sequential
GeneralMapOps
Related Doc:
package sequential
final
class
GeneralMapOps
[
+A
,
+T
]
extends
AnyVal
Source
GeneralMapOps.scala
Linear Supertypes
AnyVal
,
Any
Type Hierarchy
Learn more about scaladoc diagrams
GeneralMapOps[A, T]
14 classes/traits
implicitly
AnyVal
Ordering
Alphabetic
By inheritance
Inherited
GeneralMapOps
AnyVal
Any
Hide All
Show all
Visibility
Public
All
Instance Constructors
new
GeneralMapOps
(
__:
Map
[
A
,
T
]
)
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
__
:
Map
[
A
,
T
]
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
macro
def
choose
[
B
]
(
q:
PartialFunction
[(
A
,
T
),
B
]
)
:
Maybe
[
B
]
macro
def
count
(
p: ((
A
,
T
)) ⇒
Boolean
)
:
Int
macro
def
eagerly
:
StrictMapOps
[
A
,
T
,
Map
[_, _]]
macro
def
exists
(
p: ((
A
,
T
)) ⇒
Boolean
)
:
Boolean
macro
def
find
(
p: ((
A
,
T
)) ⇒
Boolean
)
:
Maybe
[(
A
,
T
)]
macro
def
fold
[
B >: (
A
,
T
)
]
(
z:
B
)
(
op: (
B
,
B
) ⇒
B
)
:
B
macro
def
foldLeft
[
B
]
(
z:
B
)
(
op: (
B
, (
A
,
T
)) ⇒
B
)
:
B
macro
def
forall
(
p: ((
A
,
T
)) ⇒
Boolean
)
:
Boolean
macro
def
foreach
[
U
]
(
f: ((
A
,
T
)) ⇒
U
)
:
Unit
def
getClass
()
:
Class
[_ <:
AnyVal
]
Definition Classes
AnyVal → Any
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
macro
def
lazily
:
NonStrictMapOps
[
A
,
T
]
macro
def
mayReduce
[
B >: (
A
,
T
)
]
(
op: (
B
,
B
) ⇒
B
)
:
Maybe
[
B
]
macro
def
mayReduceLeft
[
B >: (
A
,
T
)
]
(
op: (
B
, (
A
,
T
)) ⇒
B
)
:
Maybe
[
B
]
macro
def
reduce
[
B >: (
A
,
T
)
]
(
op: (
B
,
B
) ⇒
B
)
:
B
macro
def
reduceLeft
[
B >: (
A
,
T
)
]
(
op: (
B
, (
A
,
T
)) ⇒
B
)
:
B
def
toString
()
:
String
Definition Classes
Any
Inherited from
AnyVal
Inherited from
Any
Ungrouped
