Trait/Object

scalaz

Traverse1

Related Docs: object Traverse1 | package scalaz

Permalink

trait Traverse1[F[_]] extends Traverse[F] with Foldable1[F]

A scalaz.Traverse where traverse is total over scalaz.Applys. That is, toList cannot return an empty list.

Self Type
Traverse1[F]
Source
Traverse1.scala
Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Traverse1
  2. Foldable1
  3. Traverse
  4. Foldable
  5. Functor
  6. InvariantFunctor
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. trait Foldable1Law extends FoldableLaw

    Permalink
    Definition Classes
    Foldable1
  2. trait FoldableLaw extends AnyRef

    Permalink
    Definition Classes
    Foldable
  3. trait FunctorLaw extends InvariantFunctorLaw

    Permalink
    Definition Classes
    Functor
  4. trait InvariantFunctorLaw extends AnyRef

    Permalink
    Definition Classes
    InvariantFunctor
  5. class Traversal[G[_]] extends AnyRef

    Permalink
    Definition Classes
    Traverse
  6. trait Traverse1Law extends TraverseLaw

    Permalink
  7. trait TraverseLaw extends FunctorLaw

    Permalink
    Definition Classes
    Traverse

Abstract Value Members

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

    Permalink

    Right-associative fold of a structure.

    Right-associative fold of a structure.

    Definition Classes
    Foldable1
  2. abstract def traverse1Impl[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit arg0: Apply[G]): G[F[B]]

    Permalink

    Transform fa using f, collecting all the Gs with ap.

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. def apply[A, B](fa: F[A])(f: (A) ⇒ B): F[B]

    Permalink

    Alias for map.

    Alias for map.

    Definition Classes
    Functor
  9. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  10. final def asum[G[_], A](fa: F[G[A]])(implicit G: PlusEmpty[G]): G[A]

    Permalink

    Alias for psum.

    Alias for psum. asum is the name used in Haskell.

    Definition Classes
    Foldable
  11. def bicompose[G[_, _]](implicit arg0: Bitraverse[G]): Bitraverse[[α, β]F[G[α, β]]]

    Permalink

    The composition of Traverse F and Bitraverse G, [x, y]F[G[x, y]], is a Bitraverse

    The composition of Traverse F and Bitraverse G, [x, y]F[G[x, y]], is a Bitraverse

    Definition Classes
    Traverse
  12. def bicompose[G[_, _]](implicit arg0: Bifoldable[G]): Bifoldable[[α, β]F[G[α, β]]]

    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
  13. def bicompose[G[_, _]](implicit arg0: Bifunctor[G]): Bifunctor[[α, β]F[G[α, β]]]

    Permalink

    The composition of Functor F and Bifunctor G, [x, y]F[G[x, y]], is a Bifunctor

    The composition of Functor F and Bifunctor G, [x, y]F[G[x, y]], is a Bifunctor

    Definition Classes
    Functor
  14. def clone(): AnyRef

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

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

    Permalink

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

  17. 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

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

    Definition Classes
    Foldable1
  18. def compose[G[_]](implicit G0: Traverse[G]): Traverse[[α]F[G[α]]]

    Permalink

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

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

    Definition Classes
    Traverse
  19. 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
  20. def compose[G[_]](implicit G0: Functor[G]): Functor[[α]F[G[α]]]

    Permalink

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

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

    Definition Classes
    Functor
  21. final def count[A](fa: F[A]): Int

    Permalink

    Alias for length.

    Alias for length.

    Definition Classes
    Foldable
  22. def counzip[A, B](a: \/[F[A], F[B]]): F[\/[A, B]]

    Permalink
    Definition Classes
    Functor
  23. def distinct[A](fa: F[A])(implicit A: Order[A]): IList[A]

    Permalink

    O(n log n) complexity

    O(n log n) complexity

    Definition Classes
    Foldable
  24. def distinct1[A](fa: F[A])(implicit A: Order[A]): NonEmptyList[A]

    Permalink

    O(n log n) complexity

    O(n log n) complexity

    Definition Classes
    Foldable1
  25. def distinctBy[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Equal[B]): IList[A]

    Permalink
    Definition Classes
    Foldable
  26. def distinctE[A](fa: F[A])(implicit A: Equal[A]): IList[A]

    Permalink

    O(n2) complexity

    O(n2) complexity

    Definition Classes
    Foldable
  27. def distinctE1[A](fa: F[A])(implicit A: Equal[A]): NonEmptyList[A]

    Permalink

    O(n2) complexity

    O(n2) complexity

    Definition Classes
    Foldable1
  28. 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
  29. final def empty[A](fa: F[A]): Boolean

    Permalink

    always return false

    always return false

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  32. def extrema[A](fa: F[A])(implicit arg0: Order[A]): Option[(A, A)]

    Permalink

    The smallest and largest elements of fa or None if fa is empty

    The smallest and largest elements of fa or None if fa is empty

    Definition Classes
    Foldable
  33. def extremaBy[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[(A, A)]

    Permalink

    The elements (amin, amax) of fa which yield the smallest and largest values of f(a), respectively, or None if fa is empty

    The elements (amin, amax) of fa which yield the smallest and largest values of f(a), respectively, or None if fa is empty

    Definition Classes
    Foldable
  34. def extremaOf[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Order[B]): Option[(B, B)]

    Permalink

    The smallest and largest values of f(a) for each element a of fa , or None if fa is empty

    The smallest and largest values of f(a) for each element a of fa , or None if fa is empty

    Definition Classes
    Foldable
  35. def filterLength[A](fa: F[A])(f: (A) ⇒ Boolean): Int

    Permalink
    Definition Classes
    Foldable
  36. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  37. def findLeft[A](fa: F[A])(f: (A) ⇒ Boolean): Option[A]

    Permalink
    Definition Classes
    Foldable
  38. final def findMapM[M[_], A, B](fa: F[A])(f: (A) ⇒ M[Option[B]])(implicit arg0: Monad[M]): M[Option[B]]

    Permalink

    map elements in a Foldable with a monadic function and return the first element that is mapped successfully

    map elements in a Foldable with a monadic function and return the first element that is mapped successfully

    Definition Classes
    Foldable
  39. def findRight[A](fa: F[A])(f: (A) ⇒ Boolean): Option[A]

    Permalink
    Definition Classes
    Foldable
  40. 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
  41. def fold1[M](t: F[M])(implicit arg0: Semigroup[M]): M

    Permalink
    Definition Classes
    Foldable1
  42. def fold1Opt[A](fa: F[A])(implicit arg0: Semigroup[A]): Option[A]

    Permalink

    Like fold but returning None if the foldable is empty and Some otherwise

    Like fold but returning None if the foldable is empty and Some otherwise

    Definition Classes
    Foldable
  43. def foldLShape[A, B](fa: F[A], z: B)(f: (B, A) ⇒ B): (B, F[Unit])

    Permalink
    Definition Classes
    Traverse
  44. 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
    TraverseFoldable
  45. def foldLeft1[A](fa: F[A])(f: (A, A) ⇒ A): A

    Permalink

    Left-associative fold of a structure.

    Left-associative fold of a structure.

    Definition Classes
    Foldable1
  46. def foldLeft1Opt[A](fa: F[A])(f: (A, A) ⇒ A): Option[A]

    Permalink
    Definition Classes
    Foldable
  47. 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
  48. def foldLeftM1[G[_], A, B](fa: F[A])(z: (A) ⇒ B)(f: (B, A) ⇒ G[B])(implicit G: Monad[G]): G[B]

    Permalink
    Definition Classes
    Foldable1
  49. 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
  50. 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.

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

    Definition Classes
    Traverse1Foldable1
  51. 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
  52. def foldMapLeft1[A, B](fa: F[A])(z: (A) ⇒ B)(f: (B, A) ⇒ B): B

    Permalink

    Left-associative fold of a structure.

    Left-associative fold of a structure.

    Definition Classes
    Foldable1
  53. def foldMapLeft1Opt[A, B](fa: F[A])(z: (A) ⇒ B)(f: (B, A) ⇒ B): Option[B]

    Permalink
    Definition Classes
    Foldable1Foldable
  54. 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
  55. def foldMapRight1Opt[A, B](fa: F[A])(z: (A) ⇒ B)(f: (A, ⇒ B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    Foldable1Foldable
  56. 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
  57. def foldRight1[A](fa: F[A])(f: (A, ⇒ A) ⇒ A): A

    Permalink

    Right-associative fold of a structure.

    Right-associative fold of a structure.

    Definition Classes
    Foldable1
  58. def foldRight1Opt[A](fa: F[A])(f: (A, ⇒ A) ⇒ A): Option[A]

    Permalink
    Definition Classes
    Foldable
  59. 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
  60. def foldRightM1[G[_], A, B](fa: F[A])(z: (A) ⇒ B)(f: (A, ⇒ B) ⇒ G[B])(implicit G: Monad[G]): G[B]

    Permalink
    Definition Classes
    Foldable1
  61. def foldable1Law: Foldable1Law

    Permalink
    Definition Classes
    Foldable1
  62. val foldable1Syntax: Foldable1Syntax[F]

    Permalink
    Definition Classes
    Foldable1
  63. def foldableLaw: FoldableLaw

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

    Permalink
    Definition Classes
    Foldable
  65. 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
  66. final def foldl1[A](fa: F[A])(f: (A) ⇒ (A) ⇒ A): A

    Permalink

    Curried foldLeft1.

    Curried foldLeft1.

    Definition Classes
    Foldable1
  67. def foldl1Opt[A](fa: F[A])(f: (A) ⇒ (A) ⇒ A): Option[A]

    Permalink
    Definition Classes
    Foldable1Foldable
  68. 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
  69. final def foldlM1[G[_], A, B](fa: F[A])(z: (A) ⇒ B)(f: (B) ⇒ (A) ⇒ G[B])(implicit arg0: Monad[G]): G[B]

    Permalink

    Curried version of foldLeftM1

    Curried version of foldLeftM1

    Definition Classes
    Foldable1
  70. 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
  71. final def foldr1[A](fa: F[A])(f: (A) ⇒ (⇒ A) ⇒ A): A

    Permalink

    Curried foldRight1.

    Curried foldRight1.

    Definition Classes
    Foldable1
  72. def foldr1Opt[A](fa: F[A])(f: (A) ⇒ (⇒ A) ⇒ A): Option[A]

    Permalink
    Definition Classes
    Foldable1Foldable
  73. 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
  74. final def foldrM1[G[_], A, B](fa: F[A])(z: (A) ⇒ B)(f: (A) ⇒ (⇒ B) ⇒ G[B])(implicit arg0: Monad[G]): G[B]

    Permalink

    Curried version of foldRightM1

    Curried version of foldRightM1

    Definition Classes
    Foldable1
  75. def fpair[A](fa: F[A]): F[(A, A)]

    Permalink

    Twin all As in fa.

    Twin all As in fa.

    Definition Classes
    Functor
  76. def fproduct[A, B](fa: F[A])(f: (A) ⇒ B): F[(A, B)]

    Permalink

    Pair all As in fa with the result of function application.

    Pair all As in fa with the result of function application.

    Definition Classes
    Functor
  77. def functorLaw: FunctorLaw

    Permalink
    Definition Classes
    Functor
  78. val functorSyntax: FunctorSyntax[F]

    Permalink
    Definition Classes
    Functor
  79. final def getClass(): Class[_]

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

    Permalink
    Definition Classes
    AnyRef → Any
  81. def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]F[G[α]]]

    Permalink

    The composition of Functor F and Contravariant G, [x]F[G[x]], is contravariant.

    The composition of Functor F and Contravariant G, [x]F[G[x]], is contravariant.

    Definition Classes
    Functor
  82. 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
  83. 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
  84. def indexed[A](fa: F[A]): F[(Int, A)]

    Permalink
    Definition Classes
    Traverse
  85. 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
  86. def intercalate1[A](fa: F[A], a: A)(implicit A: Semigroup[A]): A

    Permalink

    Insert an A between every A, yielding the sum.

    Insert an A between every A, yielding the sum.

    Definition Classes
    Foldable1
  87. def invariantFunctorLaw: InvariantFunctorLaw

    Permalink
    Definition Classes
    InvariantFunctor
  88. val invariantFunctorSyntax: InvariantFunctorSyntax[F]

    Permalink
    Definition Classes
    InvariantFunctor
  89. final def isInstanceOf[T0]: Boolean

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

    Permalink

    Deforested alias for toStream(fa).size.

    Deforested alias for toStream(fa).size.

    Definition Classes
    Foldable
  91. def lift[A, B](f: (A) ⇒ B): (F[A]) ⇒ F[B]

    Permalink

    Lift f into F.

    Lift f into F.

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

    Permalink
    Definition Classes
    Foldable
  93. def map[A, B](fa: F[A])(f: (A) ⇒ B): F[B]

    Permalink

    Lift f into F and apply to F[A].

    Lift f into F and apply to F[A].

    Definition Classes
    TraverseFunctor
  94. def mapAccumL[S, A, B](fa: F[A], z: S)(f: (S, A) ⇒ (S, B)): (S, F[B])

    Permalink
    Definition Classes
    Traverse
  95. def mapAccumR[S, A, B](fa: F[A], z: S)(f: (S, A) ⇒ (S, B)): (S, F[B])

    Permalink
    Definition Classes
    Traverse
  96. def mapply[A, B](a: A)(f: F[(A) ⇒ B]): F[B]

    Permalink

    Lift apply(a), and apply the result to f.

    Lift apply(a), and apply the result to f.

    Definition Classes
    Functor
  97. 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
  98. def maximum1[A](fa: F[A])(implicit arg0: Order[A]): A

    Permalink

    The greatest element of fa.

    The greatest element of fa.

    Definition Classes
    Foldable1
  99. 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
  100. 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).

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

    Definition Classes
    Foldable1
  101. 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
  102. 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.

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

    Definition Classes
    Foldable1
  103. 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
  104. def minimum1[A](fa: F[A])(implicit arg0: Order[A]): A

    Permalink

    The smallest element of fa.

    The smallest element of fa.

    Definition Classes
    Foldable1
  105. 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
  106. 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).

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

    Definition Classes
    Foldable1
  107. 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
  108. 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.

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

    Definition Classes
    Foldable1
  109. def msuml1[G[_], A](fa: F[G[A]])(implicit G: Plus[G]): G[A]

    Permalink
    Definition Classes
    Foldable1
  110. final def ne(arg0: AnyRef): Boolean

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

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

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

    Permalink

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

  114. 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

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

    Definition Classes
    Foldable1
  115. def product[G[_]](implicit G0: Traverse[G]): Traverse[[α](F[α], G[α])]

    Permalink

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

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

    Definition Classes
    Traverse
  116. 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
  117. def product[G[_]](implicit G0: Functor[G]): Functor[[α](F[α], G[α])]

    Permalink

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

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

    Definition Classes
    Functor
  118. def product0[G[_]](implicit G0: Traverse[G]): Traverse1[[α](F[α], G[α])]

    Permalink

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

  119. 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

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

    Definition Classes
    Foldable1
  120. def product0[G[_]](implicit G0: Traverse1[G]): Traverse1[[α](F[α], G[α])]

    Permalink

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

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

    Definition Classes
    Traverse
  121. 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
  122. def psum[G[_], A](fa: F[G[A]])(implicit G: PlusEmpty[G]): G[A]

    Permalink

    Sum using a polymorphic monoid (PlusEmpty).

    Sum using a polymorphic monoid (PlusEmpty). Should support early termination, i.e. summing no more elements than is needed to determine the result.

    Definition Classes
    Foldable
  123. def psum1[G[_], A](fa: F[G[A]])(implicit G: Plus[G]): G[A]

    Permalink
    Definition Classes
    Foldable1
  124. def psumMap[A, B, G[_]](fa: F[A])(f: (A) ⇒ G[B])(implicit G: PlusEmpty[G]): G[B]

    Permalink

    Map elements to G[B] and sum using a polymorphic monoid (PlusEmpty).

    Map elements to G[B] and sum using a polymorphic monoid (PlusEmpty). Should support early termination, i.e. mapping and summing no more elements than is needed to determine the result.

    Definition Classes
    Foldable
  125. def psumMap1[A, B, G[_]](fa: F[A])(f: (A) ⇒ G[B])(implicit G: Plus[G]): G[B]

    Permalink
    Definition Classes
    Foldable1
  126. def reverse[A](fa: F[A]): F[A]

    Permalink
    Definition Classes
    Traverse
  127. def runTraverseS[S, A, B](fa: F[A], s: S)(f: (A) ⇒ State[S, B]): (S, F[B])

    Permalink
    Definition Classes
    Traverse
  128. def scanLeft1[A](fa: F[A])(f: (A, A) ⇒ A): NonEmptyList[A]

    Permalink
    Definition Classes
    Foldable1
  129. def scanRight1[A](fa: F[A])(f: (A, A) ⇒ A): NonEmptyList[A]

    Permalink
    Definition Classes
    Foldable1
  130. 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
  131. def sequence[G[_], A](fga: F[G[A]])(implicit arg0: Applicative[G]): G[F[A]]

    Permalink

    Traverse with the identity function.

    Traverse with the identity function.

    Definition Classes
    Traverse
  132. def sequence1[G[_], A](fga: F[G[A]])(implicit arg0: Apply[G]): G[F[A]]

    Permalink
  133. def sequence1M[A, G[_]](fgfa: F[G[F[A]]])(implicit G: Apply[G], F: Bind[F]): G[F[A]]

    Permalink

    A version of sequence1 where a subsequent monadic join is applied to the inner result

  134. final def sequence1U[GA](fga: F[GA])(implicit G: Unapply[Apply, GA]): M[F[A]]

    Permalink
  135. def sequence1_[M[_], A](fa: F[M[A]])(implicit a: Apply[M], x: Semigroup[M[A]]): M[Unit]

    Permalink
    Definition Classes
    Foldable1
  136. 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
  137. def sequenceM[A, G[_]](fgfa: F[G[F[A]]])(implicit G: Applicative[G], F: Bind[F]): G[F[A]]

    Permalink

    A version of sequence where a subsequent monadic join is applied to the inner result

    A version of sequence where a subsequent monadic join is applied to the inner result

    Definition Classes
    Traverse
  138. def sequenceS[S, A](fga: F[State[S, A]]): State[S, F[A]]

    Permalink

    Traverse with State.

    Traverse with State.

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

    Permalink

    sequence_ specialized to State *

    sequence_ specialized to State *

    Definition Classes
    Foldable
  140. final def sequenceU[A](self: F[A])(implicit G: Unapply[Applicative, A]): M[F[A]]

    Permalink

    A version of sequence that infers the nested type constructor.

    A version of sequence that infers the nested type constructor.

    Definition Classes
    Traverse
  141. 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
  142. def splitBy[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: Equal[B]): IList[(B, NonEmptyList[A])]

    Permalink

    Splits the elements into groups that produce the same result by a function f.

    Splits the elements into groups that produce the same result by a function f.

    Definition Classes
    Foldable
  143. def splitByRelation[A](fa: F[A])(r: (A, A) ⇒ Boolean): IList[NonEmptyList[A]]

    Permalink

    Splits into groups of elements that are transitively dependant by a relation r.

    Splits into groups of elements that are transitively dependant by a relation r.

    Definition Classes
    Foldable
  144. 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
  145. def strengthL[A, B](a: A, f: F[B]): F[(A, B)]

    Permalink

    Inject a to the left of Bs in f.

    Inject a to the left of Bs in f.

    Definition Classes
    Functor
  146. def strengthR[A, B](f: F[A], b: B): F[(A, B)]

    Permalink

    Inject b to the right of As in f.

    Inject b to the right of As in f.

    Definition Classes
    Functor
  147. def suml[A](fa: F[A])(implicit A: Monoid[A]): A

    Permalink
    Definition Classes
    Foldable
  148. def suml1[A](fa: F[A])(implicit A: Semigroup[A]): A

    Permalink
    Definition Classes
    Foldable1
  149. def suml1Opt[A](fa: F[A])(implicit A: Semigroup[A]): Option[A]

    Permalink
    Definition Classes
    Foldable
  150. def sumr[A](fa: F[A])(implicit A: Monoid[A]): A

    Permalink
    Definition Classes
    Foldable
  151. def sumr1[A](fa: F[A])(implicit A: Semigroup[A]): A

    Permalink
    Definition Classes
    Foldable1
  152. def sumr1Opt[A](fa: F[A])(implicit A: Semigroup[A]): Option[A]

    Permalink
    Definition Classes
    Foldable
  153. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  154. def toEphemeralStream[A](fa: F[A]): EphemeralStream[A]

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

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

    Permalink
    Definition Classes
    Foldable
  157. def toNel[A](fa: F[A]): NonEmptyList[A]

    Permalink
    Definition Classes
    Foldable1
  158. def toSet[A](fa: F[A]): Set[A]

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  161. def toVector[A](fa: F[A]): Vector[A]

    Permalink
    Definition Classes
    Foldable
  162. def traversal[G[_]](implicit arg0: Applicative[G]): Traversal[G]

    Permalink
    Definition Classes
    Traverse
  163. def traversalS[S]: Traversal[[β$0$]IndexedStateT[S, S, [X]X, β$0$]]

    Permalink
    Definition Classes
    Traverse
  164. def traverse[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): G[F[B]]

    Permalink
    Definition Classes
    Traverse
  165. def traverse1[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit a: Apply[G]): G[F[B]]

    Permalink
  166. def traverse1Law: Traverse1Law

    Permalink
  167. def traverse1M[A, G[_], B](fa: F[A])(f: (A) ⇒ G[F[B]])(implicit G: Apply[G], F: Bind[F]): G[F[B]]

    Permalink

    A version of traverse1 where a subsequent monadic join is applied to the inner result.

  168. val traverse1Syntax: Traverse1Syntax[F]

    Permalink
  169. final def traverse1U[A, GB](fa: F[A])(f: (A) ⇒ GB)(implicit G: Unapply[Apply, GB]): M[F[A]]

    Permalink
  170. def traverse1_[M[_], A, B](fa: F[A])(f: (A) ⇒ M[B])(implicit a: Apply[M], x: Semigroup[M[B]]): M[Unit]

    Permalink
    Definition Classes
    Foldable1
  171. def traverseImpl[G[_], A, B](fa: F[A])(f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): G[F[B]]

    Permalink

    Transform fa using f, collecting all the Gs with ap.

    Transform fa using f, collecting all the Gs with ap.

    Definition Classes
    Traverse1Traverse
  172. def traverseKTrampoline[S, G[_], A, B](fa: F[A])(f: (A) ⇒ Kleisli[G, S, B])(implicit arg0: Applicative[G]): Kleisli[G, S, F[B]]

    Permalink

    Traverse fa with a Kleisli[G, S, B], internally using a Trampoline to avoid stack overflow.

    Traverse fa with a Kleisli[G, S, B], internally using a Trampoline to avoid stack overflow.

    Definition Classes
    Traverse
  173. def traverseLaw: TraverseLaw

    Permalink
    Definition Classes
    Traverse
  174. final def traverseM[A, G[_], B](fa: F[A])(f: (A) ⇒ G[F[B]])(implicit G: Applicative[G], F: Bind[F]): G[F[B]]

    Permalink

    A version of traverse where a subsequent monadic join is applied to the inner result.

    A version of traverse where a subsequent monadic join is applied to the inner result.

    Definition Classes
    Traverse
  175. def traverseS[S, A, B](fa: F[A])(f: (A) ⇒ State[S, B]): State[S, F[B]]

    Permalink

    Traverse with State.

    Traverse with State.

    Definition Classes
    Traverse
  176. def traverseSTrampoline[S, G[_], A, B](fa: F[A])(f: (A) ⇒ State[S, G[B]])(implicit arg0: Applicative[G]): State[S, G[F[B]]]

    Permalink

    Traverse fa with a State[S, G[B]], internally using a Trampoline to avoid stack overflow.

    Traverse fa with a State[S, G[B]], internally using a Trampoline to avoid stack overflow.

    Definition Classes
    Traverse
  177. 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
  178. val traverseSyntax: TraverseSyntax[F]

    Permalink
    Definition Classes
    Traverse
  179. final def traverseU[A, GB](fa: F[A])(f: (A) ⇒ GB)(implicit G: Unapply[Applicative, GB]): M[F[A]]

    Permalink

    A version of traverse that infers the type constructor G.

    A version of traverse that infers the type constructor G.

    Definition Classes
    Traverse
  180. 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
  181. 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
  182. def void[A](fa: F[A]): F[Unit]

    Permalink

    Empty fa of meaningful pure values, preserving its structure.

    Empty fa of meaningful pure values, preserving its structure.

    Definition Classes
    Functor
  183. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  186. def widen[A, B](fa: F[A])(implicit ev: <~<[A, B]): F[B]

    Permalink

    Functors are covariant by nature, so we can treat an F[A] as an F[B] if A is a subtype of B.

    Functors are covariant by nature, so we can treat an F[A] as an F[B] if A is a subtype of B.

    Definition Classes
    Functor
  187. def xmap[A, B](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ A): F[B]

    Permalink

    Converts ma to a value of type F[B] using the provided functions f and g.

    Converts ma to a value of type F[B] using the provided functions f and g.

    Definition Classes
    FunctorInvariantFunctor
  188. def xmapb[A, B](ma: F[A])(b: Bijection[A, B]): F[B]

    Permalink

    Converts ma to a value of type F[B] using the provided bijection.

    Converts ma to a value of type F[B] using the provided bijection.

    Definition Classes
    InvariantFunctor
  189. def xmapi[A, B](ma: F[A])(iso: Isomorphism.<=>[A, B]): F[B]

    Permalink

    Converts ma to a value of type F[B] using the provided isomorphism.

    Converts ma to a value of type F[B] using the provided isomorphism.

    Definition Classes
    InvariantFunctor
  190. def zipL[A, B](fa: F[A], fb: F[B]): F[(A, Option[B])]

    Permalink
    Definition Classes
    Traverse
  191. def zipR[A, B](fa: F[A], fb: F[B]): F[(Option[A], B)]

    Permalink
    Definition Classes
    Traverse
  192. def zipWith[A, B, C](fa: F[A], fb: F[B])(f: (A, Option[B]) ⇒ C): (List[B], F[C])

    Permalink
    Definition Classes
    Traverse
  193. def zipWithL[A, B, C](fa: F[A], fb: F[B])(f: (A, Option[B]) ⇒ C): F[C]

    Permalink
    Definition Classes
    Traverse
  194. def zipWithR[A, B, C](fa: F[A], fb: F[B])(f: (Option[A], B) ⇒ C): F[C]

    Permalink
    Definition Classes
    Traverse

Deprecated Value Members

  1. def msuml[G[_], A](fa: F[G[A]])(implicit G: PlusEmpty[G]): G[A]

    Permalink
    Definition Classes
    Foldable
    Annotations
    @deprecated
    Deprecated

    (Since version 7.3.0) use psum

  2. def msumlU[GA](fa: F[GA])(implicit G: Unapply[PlusEmpty, GA]): M[A]

    Permalink
    Definition Classes
    Foldable
    Annotations
    @deprecated
    Deprecated

    (Since version 7.3.0) use psum

Inherited from Foldable1[F]

Inherited from Traverse[F]

Inherited from Foldable[F]

Inherited from Functor[F]

Inherited from InvariantFunctor[F]

Inherited from AnyRef

Inherited from Any

Ungrouped