trait
Traverse[F[_]] extends Functor[F]
Type Members
-
class
Traversal[G[_]] extends AnyRef
Abstract Value Members
-
abstract
def
map[A, B](fa: F[A])(f: (A) ⇒ B): F[B]
-
abstract
def
traverseImpl[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): G[F[B]]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
as[A, B](fa: F[A])(b: ⇒ B): F[B]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
sequence[G[_], A](fga: F[G[A]])(implicit arg0: Applicative[G]): G[F[A]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
traversal[G[_]](implicit arg0: Applicative[G]): Traversal[G]
-
def
traverse[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): G[F[B]]
-
final
def
traverseM[A, G[_], B](fa: F[A])(f: (A) ⇒ G[F[B]])(implicit G: Applicative[G], F: Monad[F]): G[F[B]]
-
def
void[A](fa: F[A]): F[Unit]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
xmap[A, B](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ A): F[B]
Inherited from AnyRef
Inherited from Any
Inspired from the scalaz (https://github.com/scalaz/scalaz) project