 # FromFoldMap

#### trait FromFoldMap[F[_]] extends Foldable[F]

Template trait to define `Foldable` in terms of `foldMap`.

Example:

```new Foldable[Option] with Foldable.FromFoldMap[Option] {
def foldMap[A, B](fa: Option[A])(f: A => B)(implicit F: Monoid[B]) = fa match {
case Some(a) => f(a)
case None    => F.zero
}
}```
Source
Foldable.scala
Linear Supertypes
Foldable[F], AnyRef, Any
Ordering
1. Alphabetic
2. By inheritance
Inherited
1. FromFoldMap
2. Foldable
3. AnyRef
4. Any
1. Hide All
2. Show all
Learn more about member selection
Visibility
1. Public
2. All

### Abstract Value Members

1. #### abstract def foldMap[A, B](fa: F[A])(f: (A) ⇒ B)(implicit F: Monoid[B]): B

Map each element of the structure to a scalaz.Monoid, and combine the results.

Map each element of the structure to a scalaz.Monoid, and combine the results.

Definition Classes
Foldable

### Concrete Value Members

1. #### final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
2. #### final def !=(arg0: Any): Boolean

Definition Classes
Any
3. #### final def ##(): Int

Definition Classes
AnyRef → Any
4. #### final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
5. #### final def ==(arg0: Any): Boolean

Definition Classes
Any
6. #### def all[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean

Whether all `A`s in `fa` yield true from `p`.

Whether all `A`s in `fa` yield true from `p`.

Definition Classes
Foldable
7. #### def allM[G[_], A](fa: F[A])(p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]

`all` with monadic traversal.

`all` with monadic traversal.

Definition Classes
Foldable
8. #### def any[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean

Whether any `A`s in `fa` yield true from `p`.

Whether any `A`s in `fa` yield true from `p`.

Definition Classes
Foldable
9. #### def anyM[G[_], A](fa: F[A])(p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]

`any` with monadic traversal.

`any` with monadic traversal.

Definition Classes
Foldable
10. #### final def asInstanceOf[T0]: T0

Definition Classes
Any
11. #### def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
12. #### def collapse[X[_], A](x: F[A])(implicit F: Foldable[F], A: ApplicativePlus[X]): X[A]

Definition Classes
Foldable
13. #### def collapse2[G[_], X[_], A](x: F[G[A]])(implicit F: Foldable[F], G: Foldable[G], A: ApplicativePlus[X]): X[A]

Definition Classes
Foldable
14. #### 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]

Definition Classes
Foldable
15. #### 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]

Definition Classes
Foldable
16. #### 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]

Definition Classes
Foldable
17. #### 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]

Definition Classes
Foldable
18. #### 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]

Definition Classes
Foldable
19. #### def compose[G[_]](implicit G0: Foldable[G]): Foldable[[α]F[G[α]]]

The composition of Foldables `F` and `G`, `[x]F[G[x]]`, is a Foldable

The composition of Foldables `F` and `G`, `[x]F[G[x]]`, is a Foldable

Definition Classes
Foldable
20. #### def count[A](fa: F[A]): Int

Deforested alias for `toStream(fa).size`.

Deforested alias for `toStream(fa).size`.

Definition Classes
Foldable
21. #### def element[A](fa: F[A], a: A)(implicit arg0: Equal[A]): Boolean

Whether `a` is an element of `fa`.

Whether `a` is an element of `fa`.

Definition Classes
Foldable
22. #### def empty[A](fa: F[A]): Boolean

Deforested alias for `toStream(fa).isEmpty`.

Deforested alias for `toStream(fa).isEmpty`.

Definition Classes
Foldable
23. #### final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
24. #### def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
25. #### def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
26. #### def fold[M](t: F[M])(implicit arg0: Monoid[M]): M

Combine the elements of a structure using a monoid.

Combine the elements of a structure using a monoid.

Definition Classes
Foldable
27. #### def foldLeft[A, B](fa: F[A], z: B)(f: (B, A) ⇒ B): B

Left-associative fold of a structure.

Left-associative fold of a structure.

Definition Classes
Foldable
28. #### def foldLeftM[G[_], A, B](fa: F[A], z: B)(f: (B, A) ⇒ G[B])(implicit M: Monad[G]): G[B]

Left-associative, monadic fold of a structure.

Left-associative, monadic fold of a structure.

Definition Classes
Foldable
29. #### def foldMapIdentity[A, B](fa: F[A])(implicit F: Monoid[A]): A

Unbiased sum of monoidal values.

Unbiased sum of monoidal values.

Definition Classes
Foldable
30. #### def foldRight[A, B](fa: F[A], z: ⇒ B)(f: (A, ⇒ B) ⇒ B): B

Right-associative fold of a structure.

Right-associative fold of a structure.

Definition Classes
FromFoldMapFoldable
31. #### def foldRightM[G[_], A, B](fa: F[A], z: ⇒ B)(f: (A, ⇒ B) ⇒ G[B])(implicit M: Monad[G]): G[B]

Right-associative, monadic fold of a structure.

Right-associative, monadic fold of a structure.

Definition Classes
Foldable
32. #### val foldableSyntax: FoldableSyntax[F]

Definition Classes
Foldable
33. #### final def foldl[A, B](fa: F[A], z: B)(f: (B) ⇒ (A) ⇒ B): B

Curred version of `foldLeft`

Curred version of `foldLeft`

Definition Classes
Foldable
34. #### final def foldlM[G[_], A, B](fa: F[A], z: ⇒ B)(f: (B) ⇒ (A) ⇒ G[B])(implicit M: Monad[G]): G[B]

Curried version of `foldLeftM`

Curried version of `foldLeftM`

Definition Classes
Foldable
35. #### final def foldr[A, B](fa: F[A], z: ⇒ B)(f: (A) ⇒ (⇒ B) ⇒ B): B

Curried version of `foldRight`

Curried version of `foldRight`

Definition Classes
Foldable
36. #### final def foldrM[G[_], A, B](fa: F[A], z: ⇒ B)(f: (A) ⇒ (⇒ B) ⇒ G[B])(implicit M: Monad[G]): G[B]

Curried version of `foldRightM`

Curried version of `foldRightM`

Definition Classes
Foldable
37. #### final def getClass(): Class[_]

Definition Classes
AnyRef → Any
38. #### def hashCode(): Int

Definition Classes
AnyRef → Any
39. #### def intercalate[A](fa: F[A], a: A)(implicit A: Monoid[A]): A

Insert an `A` between every A, yielding the sum.

Insert an `A` between every A, yielding the sum.

Definition Classes
Foldable
40. #### final def isInstanceOf[T0]: Boolean

Definition Classes
Any
41. #### def longDigits[A](fa: F[A])(implicit d: <:<[A, Digit]): Long

Definition Classes
Foldable
42. #### def maximum[A](fa: F[A])(implicit arg0: Order[A]): Option[A]

The greatest element of `fa`, or None if `fa` is empty.

The greatest element of `fa`, or None if `fa` is empty.

Definition Classes
Foldable
43. #### def minimum[A](fa: F[A])(implicit arg0: Order[A]): Option[A]

The smallest element of `fa`, or None if `fa` is empty.

The smallest element of `fa`, or None if `fa` is empty.

Definition Classes
Foldable
44. #### final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
45. #### final def notify(): Unit

Definition Classes
AnyRef
46. #### final def notifyAll(): Unit

Definition Classes
AnyRef
47. #### def product[G[_]](implicit G0: Foldable[G]): Foldable[[α](F[α], G[α])]

The product of Foldables `F` and `G`, `[x](F[x], G[x]])`, is a Foldable

The product of Foldables `F` and `G`, `[x](F[x], G[x]])`, is a Foldable

Definition Classes
Foldable
48. #### def selectSplit[A](fa: F[A])(p: (A) ⇒ Boolean): List[List[A]]

Selects groups of elements that satisfy p and discards others.

Selects groups of elements that satisfy p and discards others.

Definition Classes
Foldable
49. #### def sequenceS_[S, A](fga: F[State[S, A]]): State[S, Unit]

`sequence_` specialized to `State` *

`sequence_` specialized to `State` *

Definition Classes
Foldable
50. #### def sequence_[M[_], A, B](fa: F[M[A]])(implicit a: Applicative[M]): M[Unit]

Strict sequencing in an applicative functor `M` that ignores the value in `fa`.

Strict sequencing in an applicative functor `M` that ignores the value in `fa`.

Definition Classes
Foldable
51. #### def splitWith[A](fa: F[A])(p: (A) ⇒ Boolean): List[List[A]]

Splits the elements into groups that alternatively satisfy and don't satisfy the predicate p.

Splits the elements into groups that alternatively satisfy and don't satisfy the predicate p.

Definition Classes
Foldable
52. #### final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
53. #### def toIndexedSeq[A](fa: F[A]): IndexedSeq[A]

Definition Classes
Foldable
54. #### def toList[A](fa: F[A]): List[A]

Definition Classes
Foldable
55. #### def toSet[A](fa: F[A]): Set[A]

Definition Classes
Foldable
56. #### def toStream[A](fa: F[A]): Stream[A]

Definition Classes
Foldable
57. #### def toString(): String

Definition Classes
AnyRef → Any
58. #### def traverseS_[S, A, B](fa: F[A])(f: (A) ⇒ State[S, B]): State[S, Unit]

`traverse_` specialized to `State` *

`traverse_` specialized to `State` *

Definition Classes
Foldable
59. #### def traverse_[M[_], A, B](fa: F[A])(f: (A) ⇒ M[B])(implicit a: Applicative[M]): M[Unit]

Strict traversal in an applicative functor `M` that ignores the result of `f`.

Strict traversal in an applicative functor `M` that ignores the result of `f`.

Definition Classes
Foldable
60. #### final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
61. #### final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
62. #### final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )