higherkindness
.
droste
.
util
DefaultTraverse
Related Doc:
package util
trait
DefaultTraverse
[
F
[
_
]
]
extends
Traverse
[
F
]
Linear Supertypes
Traverse
[
F
],
UnorderedTraverse
[
F
],
Foldable
[
F
],
UnorderedFoldable
[
F
],
Functor
[
F
],
Invariant
[
F
],
Serializable
,
Serializable
,
AnyRef
,
Any
Ordering
Alphabetic
By Inheritance
Inherited
DefaultTraverse
Traverse
UnorderedTraverse
Foldable
UnorderedFoldable
Functor
Invariant
Serializable
Serializable
AnyRef
Any
Hide All
Show All
Visibility
Public
All
Abstract Value Members
abstract
def
traverse
[
G
[
_
]
,
A
,
B
]
(
fa:
F
[
A
]
)
(
f: (
A
) ⇒
G
[
B
]
)
(
implicit
arg0:
Applicative
[
G
]
)
:
G
[
F
[
B
]]
Definition Classes
Traverse
Concrete 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
as
[
A
,
B
]
(
fa:
F
[
A
]
,
b:
B
)
:
F
[
B
]
Definition Classes
Functor
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
def
clone
()
:
AnyRef
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
...
)
def
collectFirst
[
A
,
B
]
(
fa:
F
[
A
]
)
(
pf:
PartialFunction
[
A
,
B
]
)
:
Option
[
B
]
Definition Classes
Foldable
def
collectFirstSome
[
A
,
B
]
(
fa:
F
[
A
]
)
(
f: (
A
) ⇒
Option
[
B
]
)
:
Option
[
B
]
Definition Classes
Foldable
def
combineAll
[
A
]
(
fa:
F
[
A
]
)
(
implicit
arg0:
Monoid
[
A
]
)
:
A
Definition Classes
Foldable
def
compose
[
G
[
_
]
]
(
implicit
arg0:
Traverse
[
G
]
)
:
Traverse
[[α]
F
[
G
[
α
]]]
Definition Classes
Traverse
def
compose
[
G
[
_
]
]
(
implicit
arg0:
Foldable
[
G
]
)
:
Foldable
[[α]
F
[
G
[
α
]]]
Definition Classes
Foldable
def
compose
[
G
[
_
]
]
(
implicit
arg0:
Functor
[
G
]
)
:
Functor
[[α]
F
[
G
[
α
]]]
Definition Classes
Functor
def
compose
[
G
[
_
]
]
(
implicit
arg0:
Invariant
[
G
]
)
:
Invariant
[[α]
F
[
G
[
α
]]]
Definition Classes
Invariant
def
composeContravariant
[
G
[
_
]
]
(
implicit
arg0:
Contravariant
[
G
]
)
:
Contravariant
[[α]
F
[
G
[
α
]]]
Definition Classes
Functor → Invariant
def
composeFunctor
[
G
[
_
]
]
(
implicit
arg0:
Functor
[
G
]
)
:
Invariant
[[α]
F
[
G
[
α
]]]
Definition Classes
Invariant
def
dropWhile_
[
A
]
(
fa:
F
[
A
]
)
(
p: (
A
) ⇒
Boolean
)
:
List
[
A
]
Definition Classes
Foldable
final
def
eq
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
def
equals
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
def
exists
[
A
]
(
fa:
F
[
A
]
)
(
p: (
A
) ⇒
Boolean
)
:
Boolean
Definition Classes
Foldable → UnorderedFoldable
def
existsM
[
G
[
_
]
,
A
]
(
fa:
F
[
A
]
)
(
p: (
A
) ⇒
G
[
Boolean
]
)
(
implicit
G:
Monad
[
G
]
)
:
G
[
Boolean
]
Definition Classes
Foldable
def
filter_
[
A
]
(
fa:
F
[
A
]
)
(
p: (
A
) ⇒
Boolean
)
:
List
[
A
]
Definition Classes
Foldable
def
finalize
()
:
Unit
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
classOf[java.lang.Throwable]
)
def
find
[
A
]
(
fa:
F
[
A
]
)
(
f: (
A
) ⇒
Boolean
)
:
Option
[
A
]
Definition Classes
Foldable
def
flatSequence
[
G
[
_
]
,
A
]
(
fgfa:
F
[
G
[
F
[
A
]]]
)
(
implicit
G:
Applicative
[
G
]
,
F:
FlatMap
[
F
]
)
:
G
[
F
[
A
]]
Definition Classes
Traverse
def
flatTraverse
[
G
[
_
]
,
A
,
B
]
(
fa:
F
[
A
]
)
(
f: (
A
) ⇒
G
[
F
[
B
]]
)
(
implicit
G:
Applicative
[
G
]
,
F:
FlatMap
[
F
]
)
:
G
[
F
[
B
]]
Definition Classes
Traverse
final
def
fmap
[
A
,
B
]
(
fa:
F
[
A
]
)
(
f: (
A
) ⇒
B
)
:
F
[
B
]
Definition Classes
Functor
def
fold
[
A
]
(
fa:
F
[
A
]
)
(
implicit
A:
Monoid
[
A
]
)
:
A
Definition Classes
Foldable
def
foldK
[
G
[
_
]
,
A
]
(
fga:
F
[
G
[
A
]]
)
(
implicit
G:
MonoidK
[
G
]
)
:
G
[
A
]
Definition Classes
Foldable
def
foldLeft
[
A
,
B
]
(
fa:
F
[
A
]
,
b:
B
)
(
f: (
B
,
A
) ⇒
B
)
:
B
Definition Classes
DefaultTraverse
→ Foldable
final
def
foldLeftM
[
G
[
_
]
,
A
,
B
]
(
fa:
F
[
A
]
,
z:
B
)
(
f: (
B
,
A
) ⇒
G
[
B
]
)
(
implicit
G:
Monad
[
G
]
)
:
G
[
B
]
Definition Classes
Foldable
def
foldM
[
G
[
_
]
,
A
,
B
]
(
fa:
F
[
A
]
,
z:
B
)
(
f: (
B
,
A
) ⇒
G
[
B
]
)
(
implicit
G:
Monad
[
G
]
)
:
G
[
B
]
Definition Classes
Foldable
def
foldMap
[
A
,
B
]
(
fa:
F
[
A
]
)
(
f: (
A
) ⇒
B
)
(
implicit
arg0:
Monoid
[
B
]
)
:
B
Definition Classes
DefaultTraverse
→ Foldable
def
foldMapM
[
G
[
_
]
,
A
,
B
]
(
fa:
F
[
A
]
)
(
f: (
A
) ⇒
G
[
B
]
)
(
implicit
G:
Monad
[
G
]
,
B:
Monoid
[
B
]
)
:
G
[
B
]
Definition Classes
Foldable
def
foldRight
[
A
,
B
]
(
fa:
F
[
A
]
,
lb:
Eval
[
B
]
)
(
f: (
A
,
Eval
[
B
]) ⇒
Eval
[
B
]
)
:
Eval
[
B
]
Definition Classes
DefaultTraverse
→ Foldable
def
forall
[
A
]
(
fa:
F
[
A
]
)
(
p: (
A
) ⇒
Boolean
)
:
Boolean
Definition Classes
Foldable → UnorderedFoldable
def
forallM
[
G
[
_
]
,
A
]
(
fa:
F
[
A
]
)
(
p: (
A
) ⇒
G
[
Boolean
]
)
(
implicit
G:
Monad
[
G
]
)
:
G
[
Boolean
]
Definition Classes
Foldable
def
fproduct
[
A
,
B
]
(
fa:
F
[
A
]
)
(
f: (
A
) ⇒
B
)
:
F
[(
A
,
B
)]
Definition Classes
Functor
def
get
[
A
]
(
fa:
F
[
A
]
)
(
idx:
Long
)
:
Option
[
A
]
Definition Classes
Foldable
final
def
getClass
()
:
Class
[_]
Definition Classes
AnyRef → Any
def
hashCode
()
:
Int
Definition Classes
AnyRef → Any
def
imap
[
A
,
B
]
(
fa:
F
[
A
]
)
(
f: (
A
) ⇒
B
)
(
g: (
B
) ⇒
A
)
:
F
[
B
]
Definition Classes
Functor → Invariant
def
intercalate
[
A
]
(
fa:
F
[
A
]
,
a:
A
)
(
implicit
A:
Monoid
[
A
]
)
:
A
Definition Classes
Foldable
def
intersperseList
[
A
]
(
xs:
List
[
A
]
,
x:
A
)
:
List
[
A
]
Attributes
protected
Definition Classes
Foldable
def
isEmpty
[
A
]
(
fa:
F
[
A
]
)
:
Boolean
Definition Classes
Foldable → UnorderedFoldable
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
def
lift
[
A
,
B
]
(
f: (
A
) ⇒
B
)
: (
F
[
A
]) ⇒
F
[
B
]
Definition Classes
Functor
def
map
[
A
,
B
]
(
fa:
F
[
A
]
)
(
f: (
A
) ⇒
B
)
:
F
[
B
]
Definition Classes
Traverse → Functor
def
mapWithIndex
[
A
,
B
]
(
fa:
F
[
A
]
)
(
f: (
A
,
Int
) ⇒
B
)
:
F
[
B
]
Definition Classes
Traverse
def
maximumOption
[
A
]
(
fa:
F
[
A
]
)
(
implicit
A:
Order
[
A
]
)
:
Option
[
A
]
Definition Classes
Foldable
def
minimumOption
[
A
]
(
fa:
F
[
A
]
)
(
implicit
A:
Order
[
A
]
)
:
Option
[
A
]
Definition Classes
Foldable
final
def
ne
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
def
nonEmpty
[
A
]
(
fa:
F
[
A
]
)
:
Boolean
Definition Classes
Foldable → UnorderedFoldable
final
def
notify
()
:
Unit
Definition Classes
AnyRef
final
def
notifyAll
()
:
Unit
Definition Classes
AnyRef
def
partitionEither
[
A
,
B
,
C
]
(
fa:
F
[
A
]
)
(
f: (
A
) ⇒
Either
[
B
,
C
]
)
(
implicit
A:
Alternative
[
F
]
)
: (
F
[
B
],
F
[
C
])
Definition Classes
Foldable
def
reduceLeftOption
[
A
]
(
fa:
F
[
A
]
)
(
f: (
A
,
A
) ⇒
A
)
:
Option
[
A
]
Definition Classes
Foldable
def
reduceLeftToOption
[
A
,
B
]
(
fa:
F
[
A
]
)
(
f: (
A
) ⇒
B
)
(
g: (
B
,
A
) ⇒
B
)
:
Option
[
B
]
Definition Classes
Foldable
def
reduceRightOption
[
A
]
(
fa:
F
[
A
]
)
(
f: (
A
,
Eval
[
A
]) ⇒
Eval
[
A
]
)
:
Eval
[
Option
[
A
]]
Definition Classes
Foldable
def
reduceRightToOption
[
A
,
B
]
(
fa:
F
[
A
]
)
(
f: (
A
) ⇒
B
)
(
g: (
A
,
Eval
[
B
]) ⇒
Eval
[
B
]
)
:
Eval
[
Option
[
B
]]
Definition Classes
Foldable
def
sequence
[
G
[
_
]
,
A
]
(
fga:
F
[
G
[
A
]]
)
(
implicit
arg0:
Applicative
[
G
]
)
:
G
[
F
[
A
]]
Definition Classes
Traverse
def
sequence_
[
G
[
_
]
,
A
]
(
fga:
F
[
G
[
A
]]
)
(
implicit
arg0:
Applicative
[
G
]
)
:
G
[
Unit
]
Definition Classes
Foldable
def
size
[
A
]
(
fa:
F
[
A
]
)
:
Long
Definition Classes
UnorderedFoldable
final
def
synchronized
[
T0
]
(
arg0: ⇒
T0
)
:
T0
Definition Classes
AnyRef
def
takeWhile_
[
A
]
(
fa:
F
[
A
]
)
(
p: (
A
) ⇒
Boolean
)
:
List
[
A
]
Definition Classes
Foldable
def
toList
[
A
]
(
fa:
F
[
A
]
)
:
List
[
A
]
Definition Classes
Foldable
def
toString
()
:
String
Definition Classes
AnyRef → Any
def
traverseWithIndexM
[
G
[
_
]
,
A
,
B
]
(
fa:
F
[
A
]
)
(
f: (
A
,
Int
) ⇒
G
[
B
]
)
(
implicit
G:
Monad
[
G
]
)
:
G
[
F
[
B
]]
Definition Classes
Traverse
def
traverse_
[
G
[
_
]
,
A
,
B
]
(
fa:
F
[
A
]
)
(
f: (
A
) ⇒
G
[
B
]
)
(
implicit
G:
Applicative
[
G
]
)
:
G
[
Unit
]
Definition Classes
Foldable
def
tupleLeft
[
A
,
B
]
(
fa:
F
[
A
]
,
b:
B
)
:
F
[(
B
,
A
)]
Definition Classes
Functor
def
tupleRight
[
A
,
B
]
(
fa:
F
[
A
]
,
b:
B
)
:
F
[(
A
,
B
)]
Definition Classes
Functor
def
unorderedFold
[
A
]
(
fa:
F
[
A
]
)
(
implicit
arg0:
CommutativeMonoid
[
A
]
)
:
A
Definition Classes
Foldable → UnorderedFoldable
def
unorderedFoldMap
[
A
,
B
]
(
fa:
F
[
A
]
)
(
f: (
A
) ⇒
B
)
(
implicit
arg0:
CommutativeMonoid
[
B
]
)
:
B
Definition Classes
Foldable → UnorderedFoldable
def
unorderedSequence
[
G
[
_
]
,
A
]
(
fga:
F
[
G
[
A
]]
)
(
implicit
arg0:
CommutativeApplicative
[
G
]
)
:
G
[
F
[
A
]]
Definition Classes
Traverse → UnorderedTraverse
def
unorderedTraverse
[
G
[
_
]
,
A
,
B
]
(
sa:
F
[
A
]
)
(
f: (
A
) ⇒
G
[
B
]
)
(
implicit
arg0:
CommutativeApplicative
[
G
]
)
:
G
[
F
[
B
]]
Definition Classes
Traverse → UnorderedTraverse
def
void
[
A
]
(
fa:
F
[
A
]
)
:
F
[
Unit
]
Definition Classes
Functor
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
@throws
(
...
)
def
widen
[
A
,
B >:
A
]
(
fa:
F
[
A
]
)
:
F
[
B
]
Definition Classes
Functor
def
zipWithIndex
[
A
]
(
fa:
F
[
A
]
)
:
F
[(
A
,
Int
)]
Definition Classes
Traverse
Inherited from
Traverse
[
F
]
Inherited from
UnorderedTraverse
[
F
]
Inherited from
Foldable
[
F
]
Inherited from
UnorderedFoldable
[
F
]
Inherited from
Functor
[
F
]
Inherited from
Invariant
[
F
]
Inherited from
Serializable
Inherited from
Serializable
Inherited from
AnyRef
Inherited from
Any
Ungrouped