Trait/Object

scalaz

Foldable1

Related Docs: object Foldable1 | package scalaz

Permalink

trait Foldable1[F[_]] extends Foldable[F]

A scalaz.Foldable where foldMap is total over semigroups. That is, toList cannot return an empty list.

Self Type
Foldable1[F]
Source
Foldable1.scala
Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Foldable1
  2. Foldable
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. trait Foldable1Law extends FoldableLaw

    Permalink
  2. trait FoldableLaw extends AnyRef

    Permalink
    Definition Classes
    Foldable

Abstract Value Members

  1. abstract def foldMap1[A, B](fa: F[A])(f: (A) ⇒ B)(implicit F: Semigroup[B]): B

    Permalink

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

  2. abstract def foldMapRight1[A, B](fa: F[A])(z: (A) ⇒ B)(f: (A, ⇒ B) ⇒ B): B

    Permalink

    Right-associative fold of a structure.

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def all[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean

    Permalink

    Whether all As in fa yield true from p.

    Whether all As in fa yield true from p.

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

    Permalink

    all with monadic traversal.

    all with monadic traversal.

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

    Permalink

    Whether any As in fa yield true from p.

    Whether any As in fa yield true from p.

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

    Permalink

    any with monadic traversal.

    any with monadic traversal.

    Definition Classes
    Foldable
  8. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  9. def bicompose[G[_, _]](implicit arg0: Bifoldable[G]): Bifoldable[[a, b]F[G[a, b]]]

    Permalink

    The composition of Foldable F and Bifoldable G, [x, y]F[G[x, y]], is a Bifoldable

    The composition of Foldable F and Bifoldable G, [x, y]F[G[x, y]], is a Bifoldable

    Definition Classes
    Foldable
  10. def clone(): AnyRef

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

    Permalink
    Definition Classes
    Foldable
  12. def compose[G[_]](implicit arg0: Foldable1[G]): Foldable1[[α]F[G[α]]]

    Permalink

    The composition of Foldable1 F and G, [x]F[G[x]], is a Foldable1

  13. def compose[G[_]](implicit G0: Foldable[G]): Foldable[[α]F[G[α]]]

    Permalink

    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
  14. final def count[A](fa: F[A]): Int

    Permalink

    Alias for length.

    Alias for length.

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

    Permalink

    Whether a is an element of fa.

    Whether a is an element of fa.

    Definition Classes
    Foldable
  16. final def empty[A](fa: F[A]): Boolean

    Permalink

    always return false

    always return false

    Definition Classes
    Foldable1Foldable
  17. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  18. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  19. def finalize(): Unit

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

    Permalink

    Combine the elements of a structure using a monoid.

    Combine the elements of a structure using a monoid.

    Definition Classes
    Foldable
  21. def fold1[M](t: F[M])(implicit arg0: Semigroup[M]): M

    Permalink
  22. def foldLeft[A, B](fa: F[A], z: B)(f: (B, A) ⇒ B): B

    Permalink

    Left-associative fold of a structure.

    Left-associative fold of a structure.

    Definition Classes
    Foldable
  23. def foldLeft1[A](fa: F[A])(f: (A, A) ⇒ A): A

    Permalink

    Left-associative fold of a structure.

  24. def foldLeft1Opt[A](fa: F[A])(f: (A, A) ⇒ A): Option[A]

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

    Permalink

    Left-associative, monadic fold of a structure.

    Left-associative, monadic fold of a structure.

    Definition Classes
    Foldable
  26. def foldMap[A, B](fa: F[A])(f: (A) ⇒ B)(implicit F: Monoid[B]): B

    Permalink

    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
    Foldable1Foldable
  27. def foldMap1Opt[A, B](fa: F[A])(f: (A) ⇒ B)(implicit F: Semigroup[B]): Option[B]

    Permalink

    As foldMap but returning None if the foldable is empty and Some otherwise

    As foldMap but returning None if the foldable is empty and Some otherwise

    Definition Classes
    Foldable1Foldable
  28. def foldMapLeft1[A, B](fa: F[A])(z: (A) ⇒ B)(f: (B, A) ⇒ B): B

    Permalink

    Left-associative fold of a structure.

  29. def foldMapLeft1Opt[A, B](fa: F[A])(z: (A) ⇒ B)(f: (B, A) ⇒ B): Option[B]

    Permalink
    Definition Classes
    Foldable1Foldable
  30. def foldMapM[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit B: Monoid[B], G: Monad[G]): G[B]

    Permalink

    Specialization of foldRightM when B has a Monoid.

    Specialization of foldRightM when B has a Monoid.

    Definition Classes
    Foldable
  31. def foldMapRight1Opt[A, B](fa: F[A])(z: (A) ⇒ B)(f: (A, ⇒ B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    Foldable1Foldable
  32. def foldRight[A, B](fa: F[A], z: ⇒ B)(f: (A, ⇒ B) ⇒ B): B

    Permalink

    Right-associative fold of a structure.

    Right-associative fold of a structure.

    Definition Classes
    Foldable1Foldable
  33. def foldRight1[A](fa: F[A])(f: (A, ⇒ A) ⇒ A): A

    Permalink

    Right-associative fold of a structure.

  34. def foldRight1Opt[A](fa: F[A])(f: (A, ⇒ A) ⇒ A): Option[A]

    Permalink
    Definition Classes
    Foldable
  35. def foldRightM[G[_], A, B](fa: F[A], z: ⇒ B)(f: (A, ⇒ B) ⇒ G[B])(implicit M: Monad[G]): G[B]

    Permalink

    Right-associative, monadic fold of a structure.

    Right-associative, monadic fold of a structure.

    Definition Classes
    Foldable
  36. def foldable1Law: Foldable1Law

    Permalink
  37. val foldable1Syntax: Foldable1Syntax[F]

    Permalink
  38. def foldableLaw: FoldableLaw

    Permalink
    Definition Classes
    Foldable
  39. val foldableSyntax: FoldableSyntax[F]

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

    Permalink

    Curried version of foldLeft

    Curried version of foldLeft

    Definition Classes
    Foldable
  41. final def foldl1[A](fa: F[A])(f: (A) ⇒ (A) ⇒ A): A

    Permalink

    Curried foldLeft1.

  42. def foldl1Opt[A](fa: F[A])(f: (A) ⇒ (A) ⇒ A): Option[A]

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

    Permalink

    Curried version of foldLeftM

    Curried version of foldLeftM

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

    Permalink

    Curried version of foldRight

    Curried version of foldRight

    Definition Classes
    Foldable
  45. final def foldr1[A](fa: F[A])(f: (A) ⇒ (⇒ A) ⇒ A): A

    Permalink

    Curried foldRight1.

  46. def foldr1Opt[A](fa: F[A])(f: (A) ⇒ (⇒ A) ⇒ A): Option[A]

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

    Permalink

    Curried version of foldRightM

    Curried version of foldRightM

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

    Permalink
    Definition Classes
    AnyRef → Any
  49. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  50. def index[A](fa: F[A], i: Int): Option[A]

    Permalink

    returns

    the element at index i in a Some, or None if the given index falls outside of the range

    Definition Classes
    Foldable
  51. def indexOr[A](fa: F[A], default: ⇒ A, i: Int): A

    Permalink

    returns

    the element at index i, or default if the given index falls outside of the range

    Definition Classes
    Foldable
  52. def intercalate[A](fa: F[A], a: A)(implicit arg0: Monoid[A]): A

    Permalink

    Insert an A between every A, yielding the sum.

    Insert an A between every A, yielding the sum.

    Definition Classes
    Foldable1Foldable
  53. def intercalate1[A](fa: F[A], a: A)(implicit A: Semigroup[A]): A

    Permalink

    Insert an A between every A, yielding the sum.

  54. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  55. def length[A](fa: F[A]): Int

    Permalink

    Deforested alias for toStream(fa).size.

    Deforested alias for toStream(fa).size.

    Definition Classes
    Foldable
  56. def longDigits[A](fa: F[A])(implicit d: <:<[A, Digit]): Long

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

    Permalink

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

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

    Definition Classes
    Foldable1Foldable
  58. def maximum1[A](fa: F[A])(implicit arg0: Order[A]): A

    Permalink

    The greatest element of fa.

  59. def maximumBy[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[A]

    Permalink

    The element a of fa which yields the greatest value of f(a), or None if fa is empty.

    The element a of fa which yields the greatest value of f(a), or None if fa is empty.

    Definition Classes
    Foldable1Foldable
  60. def maximumBy1[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): A

    Permalink

    The element a of fa which yield the greatest value of f(a).

  61. def maximumOf[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[B]

    Permalink

    The greatest value of f(a) for each element a of fa, or None if fa is empty.

    The greatest value of f(a) for each element a of fa, or None if fa is empty.

    Definition Classes
    Foldable1Foldable
  62. def maximumOf1[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): B

    Permalink

    The greatest value of f(a) for each element a of fa.

  63. def minimum[A](fa: F[A])(implicit arg0: Order[A]): Option[A]

    Permalink

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

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

    Definition Classes
    Foldable1Foldable
  64. def minimum1[A](fa: F[A])(implicit arg0: Order[A]): A

    Permalink

    The smallest element of fa.

  65. def minimumBy[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[A]

    Permalink

    The element a of fa which yields the smallest value of f(a), or None if fa is empty.

    The element a of fa which yields the smallest value of f(a), or None if fa is empty.

    Definition Classes
    Foldable1Foldable
  66. def minimumBy1[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): A

    Permalink

    The element a of fa which yield the smallest value of f(a).

  67. def minimumOf[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[B]

    Permalink

    The smallest value of f(a) for each element a of fa, or None if fa is empty.

    The smallest value of f(a) for each element a of fa, or None if fa is empty.

    Definition Classes
    Foldable1Foldable
  68. def minimumOf1[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): B

    Permalink

    The smallest value of f(a) for each element a of fa.

  69. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  70. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  71. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  72. def product[G[_]](implicit G0: Foldable1[G]): Foldable1[[α](F[α], G[α])]

    Permalink

    The product of Foldable1 F and G, [x](F[x], G[x]]), is a Foldable1

  73. def product[G[_]](implicit G0: Foldable[G]): Foldable[[α](F[α], G[α])]

    Permalink

    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
  74. def product0[G[_]](implicit G0: Foldable[G]): Foldable1[[α](F[α], G[α])]

    Permalink

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

  75. def product0[G[_]](implicit G0: Foldable1[G]): Foldable1[[α](F[α], G[α])]

    Permalink

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

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

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

    Permalink

    Selects groups of elements that satisfy p and discards others.

    Selects groups of elements that satisfy p and discards others.

    Definition Classes
    Foldable
  77. def sequence1_[M[_], A](fa: F[M[A]])(implicit a: Apply[M], x: Semigroup[M[A]]): M[Unit]

    Permalink
  78. def sequenceF_[M[_], A](ffa: F[Free[M, A]]): Free[M, Unit]

    Permalink

    sequence_ for Free.

    sequence_ for Free. collapses into a single Free *

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

    Permalink

    sequence_ specialized to State *

    sequence_ specialized to State *

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

    Permalink

    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
  81. def splitWith[A](fa: F[A])(p: (A) ⇒ Boolean): List[NonEmptyList[A]]

    Permalink

    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
  82. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  83. def to[A, G[_]](fa: F[A])(implicit c: CanBuildFrom[Nothing, A, G[A]]): G[A]

    Permalink
    Definition Classes
    Foldable
  84. def toEphemeralStream[A](fa: F[A]): EphemeralStream[A]

    Permalink
    Definition Classes
    Foldable
  85. def toIList[A](fa: F[A]): IList[A]

    Permalink
    Definition Classes
    Foldable
  86. def toIndexedSeq[A](fa: F[A]): IndexedSeq[A]

    Permalink
    Definition Classes
    Foldable
  87. def toList[A](fa: F[A]): List[A]

    Permalink
    Definition Classes
    Foldable
  88. def toSet[A](fa: F[A]): Set[A]

    Permalink
    Definition Classes
    Foldable
  89. def toStream[A](fa: F[A]): Stream[A]

    Permalink
    Definition Classes
    Foldable
  90. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  91. def traverse1_[M[_], A, B](fa: F[A])(f: (A) ⇒ M[B])(implicit a: Apply[M], x: Semigroup[M[B]]): M[Unit]

    Permalink
  92. def traverseS_[S, A, B](fa: F[A])(f: (A) ⇒ State[S, B]): State[S, Unit]

    Permalink

    traverse_ specialized to State *

    traverse_ specialized to State *

    Definition Classes
    Foldable
  93. final def traverseU_[A, GB](fa: F[A])(f: (A) ⇒ GB)(implicit G: Unapply[Applicative, GB]): M[Unit]

    Permalink

    A version of traverse_ that infers the type constructor M.

    A version of traverse_ that infers the type constructor M.

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

    Permalink

    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
  95. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Deprecated Value Members

  1. def foldMapIdentity[A](fa: F[A])(implicit F: Monoid[A]): A

    Permalink

    Unbiased sum of monoidal values.

    Unbiased sum of monoidal values.

    Definition Classes
    Foldable
    Annotations
    @deprecated
    Deprecated

    (Since version 7.1) use fold, it has the exact same signature and implementation

Inherited from Foldable[F]

Inherited from AnyRef

Inherited from Any

Ungrouped