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

ReducibleLaws

cats.laws.ReducibleLaws
See theReducibleLaws companion object
trait ReducibleLaws[F[_]] extends FoldableLaws[F]

Attributes

Companion
object
Source
ReducibleLaws.scala
Graph
Supertypes
trait FoldableLaws[F]
class Object
trait Matchable
class Any
Known subtypes

Members list

Value members

Concrete methods

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

Attributes

Source
ReducibleLaws.scala
def reduceReduceLeftConsistent[B](fa: F[B])(implicit B: Semigroup[B]): IsEq[B]

Attributes

Source
ReducibleLaws.scala
def reduceRightConsistentWithReduceRightOption[A](fa: F[A], f: (A, A) => A): IsEq[Option[A]]

Attributes

Source
ReducibleLaws.scala
def reduceRightToConsistentWithReduceMap[A, B](fa: F[A], f: A => B)(implicit B: Semigroup[B]): IsEq[B]

Attributes

Source
ReducibleLaws.scala
def reduceRightToConsistentWithReduceRightToOption[A, B](fa: F[A], f: A => B)(implicit B: Semigroup[B]): IsEq[Option[B]]

Attributes

Source
ReducibleLaws.scala
def sequenceConsistent[G[_] : Applicative, A](fa: F[G[A]]): IsEq[G[Unit]]

Attributes

Source
ReducibleLaws.scala
def sizeConsistent[A](fa: F[A]): IsEq[Long]

Attributes

Source
ReducibleLaws.scala
def traverseConsistent[G[_] : Applicative, A, B](fa: F[A], f: A => G[B]): IsEq[G[Unit]]

Attributes

Source
ReducibleLaws.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 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 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

Implicits

Implicits

implicit def F: Reducible[F]

Attributes

Source
ReducibleLaws.scala
Generated with