Type Members
-
abstract
type
TypeClassType <: Traverse[F]
Abstract Value Members
-
abstract
def
self: F[C]
-
abstract
val
typeClassInstance: TypeClassType
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
as[B](b: B): F[B]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
-
def
collectFirstSome[B](f: (C) ⇒ Option[B]): Option[B]
-
def
combineAll(implicit arg0: Monoid[C]): C
-
def
dropWhile_(p: (C) ⇒ Boolean): List[C]
-
-
-
-
def
existsM[G[_]](p: (C) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]
-
def
filter_(p: (C) ⇒ Boolean): List[C]
-
def
finalize(): Unit
-
-
def
flatSequence[G[_], A](implicit arg0: <:<[C, G[F[A]]], G: Applicative[G], F: FlatMap[F]): G[F[A]]
-
def
flatTraverse[G[_], B](f: (C) ⇒ G[F[B]])(implicit G: Applicative[G], F: FlatMap[F]): G[F[B]]
-
def
fmap[B](f: (C) ⇒ B): F[B]
-
def
fold(implicit A: Monoid[C]): C
-
def
foldK[G[_], A](implicit arg0: <:<[C, G[A]], G: MonoidK[G]): G[A]
-
def
foldLeft[B](b: B)(f: (B, C) ⇒ B): B
-
def
foldLeftM[G[_], B](z: B)(f: (B, C) ⇒ G[B])(implicit G: Monad[G]): G[B]
-
def
foldM[G[_], B](z: B)(f: (B, C) ⇒ G[B])(implicit G: Monad[G]): G[B]
-
def
foldMap[B](f: (C) ⇒ B)(implicit B: Monoid[B]): B
-
def
foldMapM[G[_], B](f: (C) ⇒ G[B])(implicit G: Monad[G], B: Monoid[B]): G[B]
-
def
foldRight[B](lb: Eval[B])(f: (C, Eval[B]) ⇒ Eval[B]): Eval[B]
-
-
def
forallM[G[_]](p: (C) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]
-
def
fproduct[B](f: (C) ⇒ B): F[(C, B)]
-
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
imap[B](f: (C) ⇒ B)(g: (B) ⇒ C): F[B]
-
def
intercalate(a: C)(implicit A: Monoid[C]): C
-
-
final
def
isInstanceOf[T0]: Boolean
-
def
map[B](f: (C) ⇒ B): F[B]
-
def
mapWithIndex[B](f: (C, Int) ⇒ B): F[B]
-
def
maximumOption(implicit A: Order[C]): Option[C]
-
def
minimumOption(implicit A: Order[C]): Option[C]
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
partitionEither[B, C](f: (C) ⇒ Either[B, C])(implicit A: Alternative[F]): (F[B], F[C])
-
def
reduceLeftOption(f: (C, C) ⇒ C): Option[C]
-
def
reduceLeftToOption[B](f: (C) ⇒ B)(g: (B, C) ⇒ B): Option[B]
-
def
reduceRightOption(f: (C, Eval[C]) ⇒ Eval[C]): Eval[Option[C]]
-
def
reduceRightToOption[B](f: (C) ⇒ B)(g: (C, Eval[B]) ⇒ Eval[B]): Eval[Option[B]]
-
def
sequence[G[_], A](implicit arg0: <:<[C, G[A]], arg1: Applicative[G]): G[F[A]]
-
def
sequence_[G[_], A](implicit arg0: <:<[C, G[A]], arg1: Applicative[G]): G[Unit]
-
def
size: Long
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
takeWhile_(p: (C) ⇒ Boolean): List[C]
-
def
toList: List[C]
-
def
toString(): String
-
def
traverse[G[_], B](f: (C) ⇒ G[B])(implicit arg0: Applicative[G]): G[F[B]]
-
def
traverseWithIndexM[G[_], B](f: (C, Int) ⇒ G[B])(implicit G: Monad[G]): G[F[B]]
-
def
traverse_[G[_], B](f: (C) ⇒ G[B])(implicit G: Applicative[G]): G[Unit]
-
def
tupleLeft[B](b: B): F[(B, C)]
-
def
tupleRight[B](b: B): F[(C, B)]
-
def
unorderedFold(implicit arg0: CommutativeMonoid[C]): C
-
def
unorderedFoldMap[B](f: (C) ⇒ B)(implicit arg0: CommutativeMonoid[B]): B
-
def
unorderedSequence[G[_], A](implicit arg0: <:<[C, G[A]], arg1: CommutativeApplicative[G]): G[F[A]]
-
def
unorderedTraverse[G[_], B](f: (C) ⇒ G[B])(implicit arg0: CommutativeApplicative[G]): G[F[B]]
-
def
void: F[Unit]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
widen[B >: C]: F[B]
-
def
zipWithIndex: F[(C, Int)]
