trait
Foldable[F[_]] extends AnyRef
Abstract Value Members
-
abstract
def
foldMap[A, B](fa: F[A])(f: (A) ⇒ B)(implicit F: Monoid[B]): B
-
abstract
def
foldRight[A, B](fa: F[A], z: ⇒ B)(f: (A, ⇒ B) ⇒ B): B
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
all[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean
-
def
allM[G[_], A](fa: F[A])(p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]
-
def
any[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean
-
def
anyM[G[_], A](fa: F[A])(p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]
-
final
def
asInstanceOf[T0]: T0
-
def
bicompose[G[_, _]](implicit arg0: Bifoldable[G]): Bifoldable[[a, b]F[G[a, b]]]
-
def
clone(): AnyRef
-
def
collapse[X[_], A](x: F[A])(implicit F: Foldable[F], A: ApplicativePlus[X]): X[A]
-
def
collapse2[G[_], X[_], A](x: F[G[A]])(implicit F: Foldable[F], G: Foldable[G], A: ApplicativePlus[X]): X[A]
-
def
collapse3[G[_], H[_], X[_], A](x: F[G[H[A]]])(implicit F: Foldable[F], G: Foldable[G], H: Foldable[H], A: ApplicativePlus[X]): X[A]
-
def
collapse4[G[_], H[_], I[_], X[_], A](x: F[G[H[I[A]]]])(implicit F: Foldable[F], G: Foldable[G], H: Foldable[H], I: Foldable[I], A: ApplicativePlus[X]): X[A]
-
def
collapse5[G[_], H[_], I[_], J[_], X[_], A](x: F[G[H[I[J[A]]]]])(implicit F: Foldable[F], G: Foldable[G], H: Foldable[H], I: Foldable[I], J: Foldable[J], A: ApplicativePlus[X]): X[A]
-
def
collapse6[G[_], H[_], I[_], J[_], K[_], X[_], A](x: F[G[H[I[J[K[A]]]]]])(implicit F: Foldable[F], G: Foldable[G], H: Foldable[H], I: Foldable[I], J: Foldable[J], K: Foldable[K], A: ApplicativePlus[X]): X[A]
-
def
collapse7[G[_], H[_], I[_], J[_], K[_], L[_], X[_], A](x: F[G[H[I[J[K[L[A]]]]]]])(implicit F: Foldable[F], G: Foldable[G], H: Foldable[H], I: Foldable[I], J: Foldable[J], K: Foldable[K], L: Foldable[L], A: ApplicativePlus[X]): X[A]
-
def
compose[G[_]](implicit G0: Foldable[G]): Foldable[[α]F[G[α]]]
-
final
def
count[A](fa: F[A]): Int
-
def
element[A](fa: F[A], a: A)(implicit arg0: Equal[A]): Boolean
-
def
empty[A](fa: F[A]): Boolean
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
fold[M](t: F[M])(implicit arg0: Monoid[M]): M
-
def
foldLeft[A, B](fa: F[A], z: B)(f: (B, A) ⇒ B): B
-
def
foldLeft1Opt[A](fa: F[A])(f: (A, A) ⇒ A): Option[A]
-
def
foldLeftM[G[_], A, B](fa: F[A], z: B)(f: (B, A) ⇒ G[B])(implicit M: Monad[G]): G[B]
-
def
foldMap1Opt[A, B](fa: F[A])(f: (A) ⇒ B)(implicit F: Semigroup[B]): Option[B]
-
def
foldMapLeft1Opt[A, B](fa: F[A])(z: (A) ⇒ B)(f: (B, A) ⇒ B): Option[B]
-
def
foldMapRight1Opt[A, B](fa: F[A])(z: (A) ⇒ B)(f: (A, ⇒ B) ⇒ B): Option[B]
-
def
foldRight1Opt[A](fa: F[A])(f: (A, ⇒ A) ⇒ A): Option[A]
-
def
foldRightM[G[_], A, B](fa: F[A], z: ⇒ B)(f: (A, ⇒ B) ⇒ G[B])(implicit M: Monad[G]): G[B]
-
-
-
final
def
foldl[A, B](fa: F[A], z: B)(f: (B) ⇒ (A) ⇒ B): B
-
def
foldl1Opt[A](fa: F[A])(f: (A) ⇒ (A) ⇒ A): Option[A]
-
final
def
foldlM[G[_], A, B](fa: F[A], z: ⇒ B)(f: (B) ⇒ (A) ⇒ G[B])(implicit M: Monad[G]): G[B]
-
final
def
foldr[A, B](fa: F[A], z: ⇒ B)(f: (A) ⇒ (⇒ B) ⇒ B): B
-
def
foldr1Opt[A](fa: F[A])(f: (A) ⇒ (⇒ A) ⇒ A): Option[A]
-
final
def
foldrM[G[_], A, B](fa: F[A], z: ⇒ B)(f: (A) ⇒ (⇒ B) ⇒ G[B])(implicit M: Monad[G]): G[B]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
index[A](fa: F[A], i: Int): Option[A]
-
def
indexOr[A](fa: F[A], default: ⇒ A, i: Int): A
-
def
intercalate[A](fa: F[A], a: A)(implicit A: Monoid[A]): A
-
final
def
isInstanceOf[T0]: Boolean
-
def
length[A](fa: F[A]): Int
-
def
longDigits[A](fa: F[A])(implicit d: <:<[A, Digit]): Long
-
def
maximum[A](fa: F[A])(implicit arg0: Order[A]): Option[A]
-
def
maximumBy[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[A]
-
def
maximumOf[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[B]
-
def
minimum[A](fa: F[A])(implicit arg0: Order[A]): Option[A]
-
def
minimumBy[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[A]
-
def
minimumOf[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[B]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
product[G[_]](implicit G0: Foldable[G]): Foldable[[α](F[α], G[α])]
-
def
product0[G[_]](implicit G0: Foldable1[G]): Foldable1[[α](F[α], G[α])]
-
def
selectSplit[A](fa: F[A])(p: (A) ⇒ Boolean): List[NonEmptyList[A]]
-
def
sequenceF_[M[_], A](ffa: F[Free[M, A]]): Free[M, Unit]
-
def
sequenceS_[S, A](fga: F[State[S, A]]): State[S, Unit]
-
def
sequence_[M[_], A](fa: F[M[A]])(implicit a: Applicative[M]): M[Unit]
-
def
splitWith[A](fa: F[A])(p: (A) ⇒ Boolean): List[NonEmptyList[A]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
to[A, G[_]](fa: F[A])(implicit c: CanBuildFrom[Nothing, A, G[A]]): G[A]
-
def
toIndexedSeq[A](fa: F[A]): IndexedSeq[A]
-
def
toList[A](fa: F[A]): List[A]
-
def
toSet[A](fa: F[A]): Set[A]
-
def
toStream[A](fa: F[A]): Stream[A]
-
def
toString(): String
-
def
traverseS_[S, A, B](fa: F[A])(f: (A) ⇒ State[S, B]): State[S, Unit]
-
final
def
traverseU_[A, GB](fa: F[A])(f: (A) ⇒ GB)(implicit G: Unapply[Applicative, GB]): M[Unit]
-
def
traverse_[M[_], A, B](fa: F[A])(f: (A) ⇒ M[B])(implicit a: Applicative[M]): M[Unit]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Deprecated Value Members
-
def
foldMapIdentity[A](fa: F[A])(implicit F: Monoid[A]): A
Inherited from AnyRef
Inherited from Any
A type parameter implying the ability to extract zero or more values of that type.