cats-docs
2.10.0
API
Generated with
cats-docs/cats/cats.laws/TraverseLaws

TraverseLaws

cats.laws.TraverseLaws
See theTraverseLaws companion object
trait TraverseLaws[F[_]] extends FunctorLaws[F], FoldableLaws[F], UnorderedTraverseLaws[F]

Attributes

Companion
object
Source
TraverseLaws.scala
Graph
Supertypes
trait FoldableLaws[F]
trait FunctorLaws[F]
trait InvariantLaws[F]
class Object
trait Matchable
class Any
Show all
Known subtypes

Members list

Value members

Concrete methods

def foldMapDerived[A, B](fa: F[A], f: A => B)(implicit B: Monoid[B]): IsEq[B]

Attributes

Source
TraverseLaws.scala
def mapAccumulateRef[S, A, B](init: S, fa: F[A], f: (S, A) => (S, B)): IsEq[(S, F[B])]

Attributes

Source
TraverseLaws.scala
def mapWithIndexRef[A, B](fa: F[A], f: (A, Int) => B): IsEq[F[B]]

Attributes

Source
TraverseLaws.scala
def mapWithLongIndexRef[A, B](fa: F[A], f: (A, Long) => B): IsEq[F[B]]

Attributes

Source
TraverseLaws.scala
def traverseIdentity[A, B](fa: F[A], f: A => B): IsEq[F[B]]

Attributes

Source
TraverseLaws.scala
def traverseOrderConsistent[A](fa: F[A]): IsEq[Option[A]]

Attributes

Source
TraverseLaws.scala
def traverseParallelComposition[A, B, M[_], N[_]](fa: F[A], f: A => M[B], g: A => N[B])(implicit N: Applicative[N], M: Applicative[M]): IsEq[(M[F[B]], N[F[B]])]

Attributes

Source
TraverseLaws.scala
def traverseSequentialComposition[A, B, C, M[_], N[_]](fa: F[A], f: A => M[B], g: B => N[C])(implicit N: Applicative[N], M: Applicative[M]): IsEq[Nested[M, N, F[C]]]

Attributes

Source
TraverseLaws.scala
def traverseTap[A, B, G[_]](fa: F[A], f: A => G[B])(implicit G: Applicative[G]): IsEq[G[F[A]]]

Attributes

Source
TraverseLaws.scala
def traverseWithIndexMRef[G[_], A, B](fa: F[A], f: (A, Int) => G[B])(implicit G: Monad[G]): IsEq[G[F[B]]]

Attributes

Source
TraverseLaws.scala
def traverseWithLongIndexMRef[G[_], A, B](fa: F[A], f: (A, Long) => G[B])(implicit G: Monad[G]): IsEq[G[F[B]]]

Attributes

Source
TraverseLaws.scala
def updatedRef[A, B >: A](fa: F[A], idx: Long, b: B): IsEq[Option[F[B]]]

Attributes

Source
TraverseLaws.scala
def zipWithIndexRef[A, B](fa: F[A], f: ((A, Int)) => B): IsEq[F[B]]

Attributes

Source
TraverseLaws.scala
def zipWithLongIndexRef[A, B](fa: F[A], f: ((A, Long)) => B): IsEq[F[B]]

Attributes

Source
TraverseLaws.scala

Inherited methods

def collectFirstSome_Ref[A, B](fa: F[A], f: A => Option[B]): IsEq[Option[B]]

Attributes

Inherited from:
FoldableLaws
Source
FoldableLaws.scala
def collectFirst_Ref[A, B](fa: F[A], pf: PartialFunction[A, B]): IsEq[Option[B]]

Attributes

Inherited from:
FoldableLaws
Source
FoldableLaws.scala
def containsAllElementsFromItself[A](fa: F[A])(implicit eq: Eq[A]): Boolean

Attributes

Inherited from:
UnorderedFoldableLaws
Source
UnorderedFoldableLaws.scala
def containsConsistentWithExists[A](fa: F[A], v: A)(implicit eq: Eq[A]): IsEq[Boolean]

Attributes

Inherited from:
UnorderedFoldableLaws
Source
UnorderedFoldableLaws.scala
def containsConsistentWithForall[A](fa: F[A], v: A)(implicit eq: Eq[A]): IsEq[Boolean]

Attributes

Inherited from:
UnorderedFoldableLaws
Source
UnorderedFoldableLaws.scala
def covariantComposition[A, B, C](fa: F[A], f: A => B, g: B => C): IsEq[F[C]]

Attributes

Inherited from:
FunctorLaws
Source
FunctorLaws.scala
def covariantIdentity[A](fa: F[A]): IsEq[F[A]]

Attributes

Inherited from:
FunctorLaws
Source
FunctorLaws.scala
def dropWhile_Ref[A](fa: F[A], p: A => Boolean): IsEq[List[A]]

Attributes

Inherited from:
FoldableLaws
Source
FoldableLaws.scala
def existsConsistentWithFind[A](fa: F[A], p: A => Boolean): Boolean

Attributes

Inherited from:
FoldableLaws
Source
FoldableLaws.scala
def existsLazy[A](fa: F[A]): Boolean

Attributes

Inherited from:
UnorderedFoldableLaws
Source
UnorderedFoldableLaws.scala
def filter_Ref[A](fa: F[A], p: A => Boolean): IsEq[List[A]]

Attributes

Inherited from:
FoldableLaws
Source
FoldableLaws.scala
def foldMIdentity[A, B](fa: F[A], b: B, f: (B, A) => B): IsEq[B]

Monadic folding with identity monad is analogous to foldLeft.

Monadic folding with identity monad is analogous to foldLeft.

Attributes

Inherited from:
FoldableLaws
Source
FoldableLaws.scala
def foldRef[A](fa: F[A])(implicit A: Monoid[A]): IsEq[A]

Attributes

Inherited from:
FoldableLaws
Source
FoldableLaws.scala
def foldRightDeferConsistentWithFoldRight[A, B](fa: F[A], f: (B, A) => B)(implicit M: Monoid[B]): IsEq[B]

Attributes

Inherited from:
FoldableLaws
Source
FoldableLaws.scala
def forallConsistentWithExists[A](fa: F[A], p: A => Boolean): Boolean

Attributes

Inherited from:
UnorderedFoldableLaws
Source
UnorderedFoldableLaws.scala
def forallEmpty[A](fa: F[A], p: A => Boolean): Boolean

If F[A] is empty, forall must return true.

If F[A] is empty, forall must return true.

Attributes

Inherited from:
UnorderedFoldableLaws
Source
UnorderedFoldableLaws.scala
def forallLazy[A](fa: F[A]): Boolean

Attributes

Inherited from:
UnorderedFoldableLaws
Source
UnorderedFoldableLaws.scala
def getRef[A](fa: F[A], idx: Long): IsEq[Option[A]]

Attributes

Inherited from:
FoldableLaws
Source
FoldableLaws.scala
def invariantComposition[A, B, C](fa: F[A], f1: A => B, f2: B => A, g1: B => C, g2: C => B): IsEq[F[C]]

Attributes

Inherited from:
InvariantLaws
Source
InvariantLaws.scala
def invariantIdentity[A](fa: F[A]): IsEq[F[A]]

Attributes

Inherited from:
InvariantLaws
Source
InvariantLaws.scala
def leftFoldConsistentWithFoldMap[A, B](fa: F[A], f: A => B)(implicit M: Monoid[B]): IsEq[B]

Attributes

Inherited from:
FoldableLaws
Source
FoldableLaws.scala
def nonEmptyRef[A](fa: F[A]): IsEq[Boolean]

Attributes

Inherited from:
UnorderedFoldableLaws
Source
UnorderedFoldableLaws.scala
def orderedConsistency[A : Eq](x: F[A], y: F[A])(implicit evidence$1: Eq[A], ev: Eq[F[A]]): IsEq[List[A]]

Attributes

Inherited from:
FoldableLaws
Source
FoldableLaws.scala
def reduceLeftOptionConsistentWithReduceLeftToOption[A](fa: F[A], f: (A, A) => A): IsEq[Option[A]]

reduceLeftOption consistent with reduceLeftToOption

reduceLeftOption consistent with reduceLeftToOption

Attributes

Inherited from:
FoldableLaws
Source
FoldableLaws.scala
def reduceRightOptionConsistentWithReduceRightToOption[A](fa: F[A], f: (A, A) => A): IsEq[Option[A]]

reduceRightOption consistent with reduceRightToOption

reduceRightOption consistent with reduceRightToOption

Attributes

Inherited from:
FoldableLaws
Source
FoldableLaws.scala
def rightFoldConsistentWithFoldMap[A, B](fa: F[A], f: A => B)(implicit M: Monoid[B]): IsEq[B]

Attributes

Inherited from:
FoldableLaws
Source
FoldableLaws.scala
def takeWhile_Ref[A](fa: F[A], p: A => Boolean): IsEq[List[A]]

Attributes

Inherited from:
FoldableLaws
Source
FoldableLaws.scala
def toListRef[A](fa: F[A]): IsEq[List[A]]

Attributes

Inherited from:
FoldableLaws
Source
FoldableLaws.scala
def unorderedSequenceConsistent[A, G[_] : CommutativeApplicative](fga: F[G[A]]): IsEq[G[F[A]]]

Attributes

Inherited from:
UnorderedTraverseLaws
Source
UnorderedTraverseLaws.scala
def unorderedTraverseIdentity[A, B](fa: F[A])(f: A => B)(implicit ev: Functor[F]): IsEq[F[B]]

Attributes

Inherited from:
UnorderedTraverseLaws
Source
UnorderedTraverseLaws.scala
def unorderedTraverseParallelComposition[A, B, M[_], N[_]](fa: F[A], f: A => M[B], g: A => N[B])(implicit N: CommutativeApplicative[N], M: CommutativeApplicative[M]): IsEq[(M[F[B]], N[F[B]])]

Attributes

Inherited from:
UnorderedTraverseLaws
Source
UnorderedTraverseLaws.scala
def unorderedTraverseSequentialComposition[A, B, C, M[_], N[_]](fa: F[A], f: A => M[B], g: B => N[C])(implicit N: CommutativeApplicative[N], M: CommutativeApplicative[M]): IsEq[Nested[M, N, F[C]]]

Attributes

Inherited from:
UnorderedTraverseLaws
Source
UnorderedTraverseLaws.scala

Implicits

Implicits

implicit override def F: Traverse[F]
Generated with