Abstract Value Members
-
abstract
def
foldRight[A, B](fa: F[A], lb: Eval[B])(f: (A, Eval[B]) ⇒ Eval[B]): Eval[B]
-
abstract
def
safeFoldLeft[A, B](fa: F[A], b: B)(f: (B, A) ⇒ Eval[B]): Eval[B]
-
abstract
def
safeTraverse[G[_], A, B](fa: F[A])(f: (A) ⇒ Eval[G[B]])(implicit arg0: Applicative[G]): Eval[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
-
def
collectFirst[A, B](fa: F[A])(pf: PartialFunction[A, B]): Option[B]
-
def
collectFirstSome[A, B](fa: F[A])(f: (A) ⇒ Option[B]): Option[B]
-
def
combineAll[A](fa: F[A])(implicit arg0: Monoid[A]): A
-
def
compose[G[_]](implicit arg0: Traverse[G]): Traverse[[α]F[G[α]]]
-
def
compose[G[_]](implicit arg0: Foldable[G]): Foldable[[α]F[G[α]]]
-
def
compose[G[_]](implicit arg0: Functor[G]): Functor[[α]F[G[α]]]
-
def
compose[G[_]](implicit arg0: Invariant[G]): Invariant[[α]F[G[α]]]
-
def
composeContravariant[G[_]](implicit arg0: Contravariant[G]): Contravariant[[α]F[G[α]]]
-
def
composeFunctor[G[_]](implicit arg0: Functor[G]): Invariant[[α]F[G[α]]]
-
def
dropWhile_[A](fa: F[A])(p: (A) ⇒ Boolean): List[A]
-
-
-
def
exists[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean
-
def
existsM[G[_], A](fa: F[A])(p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]
-
def
filter_[A](fa: F[A])(p: (A) ⇒ Boolean): List[A]
-
def
finalize(): Unit
-
def
find[A](fa: F[A])(f: (A) ⇒ Boolean): Option[A]
-
def
flatSequence[G[_], A](fgfa: F[G[F[A]]])(implicit G: Applicative[G], F: FlatMap[F]): G[F[A]]
-
def
flatTraverse[G[_], A, B](fa: F[A])(f: (A) ⇒ G[F[B]])(implicit G: Applicative[G], F: FlatMap[F]): G[F[B]]
-
final
def
fmap[A, B](fa: F[A])(f: (A) ⇒ B): F[B]
-
def
fold[A](fa: F[A])(implicit A: Monoid[A]): A
-
def
foldK[G[_], A](fga: F[G[A]])(implicit G: MonoidK[G]): G[A]
-
def
foldLeft[A, B](fa: F[A], b: B)(f: (B, A) ⇒ B): B
-
final
def
foldLeftM[G[_], A, B](fa: F[A], z: B)(f: (B, A) ⇒ G[B])(implicit G: Monad[G]): G[B]
-
def
foldM[G[_], A, B](fa: F[A], z: B)(f: (B, A) ⇒ G[B])(implicit G: Monad[G]): G[B]
-
def
foldMap[A, B](fa: F[A])(f: (A) ⇒ B)(implicit B: Monoid[B]): B
-
def
foldMapM[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit G: Monad[G], B: Monoid[B]): G[B]
-
def
forall[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean
-
def
forallM[G[_], A](fa: F[A])(p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]
-
def
fproduct[A, B](fa: F[A])(f: (A) ⇒ B): F[(A, B)]
-
def
get[A](fa: F[A])(idx: Long): Option[A]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
imap[A, B](fa: F[A])(f: (A) ⇒ B)(g: (B) ⇒ A): F[B]
-
def
intercalate[A](fa: F[A], a: A)(implicit A: Monoid[A]): A
-
def
intersperseList[A](xs: List[A], x: A): List[A]
-
def
isEmpty[A](fa: F[A]): Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
lift[A, B](f: (A) ⇒ B): (F[A]) ⇒ F[B]
-
def
map[A, B](fa: F[A])(f: (A) ⇒ B): F[B]
-
def
mapWithIndex[A, B](fa: F[A])(f: (A, Int) ⇒ B): F[B]
-
def
maximumOption[A](fa: F[A])(implicit A: Order[A]): Option[A]
-
def
minimumOption[A](fa: F[A])(implicit A: Order[A]): Option[A]
-
-
def
nonEmpty[A](fa: F[A]): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
partitionEither[A, B, C](fa: F[A])(f: (A) ⇒ Either[B, C])(implicit A: Alternative[F]): (F[B], F[C])
-
def
reduceLeftOption[A](fa: F[A])(f: (A, A) ⇒ A): Option[A]
-
def
reduceLeftToOption[A, B](fa: F[A])(f: (A) ⇒ B)(g: (B, A) ⇒ B): Option[B]
-
def
reduceRightOption[A](fa: F[A])(f: (A, Eval[A]) ⇒ Eval[A]): Eval[Option[A]]
-
def
reduceRightToOption[A, B](fa: F[A])(f: (A) ⇒ B)(g: (A, Eval[B]) ⇒ Eval[B]): Eval[Option[B]]
-
def
sequence[G[_], A](fga: F[G[A]])(implicit arg0: Applicative[G]): G[F[A]]
-
def
sequence_[G[_], A](fga: F[G[A]])(implicit arg0: Applicative[G]): G[Unit]
-
def
size[A](fa: F[A]): Long
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
takeWhile_[A](fa: F[A])(p: (A) ⇒ Boolean): List[A]
-
def
toList[A](fa: F[A]): List[A]
-
def
toString(): String
-
def
traverse[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): G[F[B]]
-
def
traverseWithIndexM[G[_], A, B](fa: F[A])(f: (A, Int) ⇒ G[B])(implicit G: Monad[G]): G[F[B]]
-
def
traverse_[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit G: Applicative[G]): G[Unit]
-
def
tupleLeft[A, B](fa: F[A], b: B): F[(B, A)]
-
def
tupleRight[A, B](fa: F[A], b: B): F[(A, B)]
-
def
unorderedFold[A](fa: F[A])(implicit arg0: CommutativeMonoid[A]): A
-
def
unorderedFoldMap[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: CommutativeMonoid[B]): B
-
def
unorderedSequence[G[_], A](fga: F[G[A]])(implicit arg0: CommutativeApplicative[G]): G[F[A]]
-
def
unorderedTraverse[G[_], A, B](sa: F[A])(f: (A) ⇒ G[B])(implicit arg0: CommutativeApplicative[G]): 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
widen[A, B >: A](fa: F[A]): F[B]
-
def
zipWithIndex[A](fa: F[A]): F[(A, Int)]
Inherited from Serializable
Based on the
MkFoldableimplementation.