cats-docs
2.11.0
API
Generated with
cats-docs/cats/cats.laws/ApplicativeErrorLaws

ApplicativeErrorLaws

cats.laws.ApplicativeErrorLaws
See theApplicativeErrorLaws companion object
trait ApplicativeErrorLaws[F[_], E] extends ApplicativeLaws[F]

Attributes

Companion
object
Source
ApplicativeErrorLaws.scala
Graph
Supertypes
trait ApplicativeLaws[F]
trait ApplyLaws[F]
trait SemigroupalLaws[F]
trait FunctorLaws[F]
trait InvariantLaws[F]
class Object
trait Matchable
class Any
Show all
Known subtypes
trait MonadErrorLaws[F, E]

Members list

Value members

Concrete methods

def adaptErrorPure[A](a: A, f: E => E): IsEq[F[A]]

Attributes

Source
ApplicativeErrorLaws.scala
def adaptErrorRaise[A](e: E, f: E => E): IsEq[F[A]]

Attributes

Source
ApplicativeErrorLaws.scala
def applicativeErrorHandle[A](e: E, f: E => A): IsEq[F[A]]

Attributes

Source
ApplicativeErrorLaws.scala
def applicativeErrorHandleWith[A](e: E, f: E => F[A]): IsEq[F[A]]

Attributes

Source
ApplicativeErrorLaws.scala
def attemptConsistentWithAttemptT[A](fa: F[A]): IsEq[EitherT[F, E, A]]

Attributes

Source
ApplicativeErrorLaws.scala
def handleErrorConsistentWithRecover[A](fa: F[A], f: E => A): IsEq[F[A]]

Attributes

Source
ApplicativeErrorLaws.scala
def handleErrorPure[A](a: A, f: E => A): IsEq[F[A]]

Attributes

Source
ApplicativeErrorLaws.scala
def handleErrorWithConsistentWithRecoverWith[A](fa: F[A], f: E => F[A]): IsEq[F[A]]

Attributes

Source
ApplicativeErrorLaws.scala
def handleErrorWithPure[A](a: A, f: E => F[A]): IsEq[F[A]]

Attributes

Source
ApplicativeErrorLaws.scala
def onErrorPure[A](a: A, f: E => F[Unit]): IsEq[F[A]]

Attributes

Source
ApplicativeErrorLaws.scala
def onErrorRaise[A](fa: F[A], e: E, fb: F[Unit]): IsEq[F[A]]

Attributes

Source
ApplicativeErrorLaws.scala
def pureAttempt[A](a: A): IsEq[F[Either[E, A]]]

Attributes

Source
ApplicativeErrorLaws.scala
def raiseErrorAttempt(e: E): IsEq[F[Either[E, Unit]]]

Attributes

Source
ApplicativeErrorLaws.scala
def raiseErrorDistributesOverApLeft[A](h: E => F[A], e: E): IsEq[F[A]]

Attributes

Source
ApplicativeErrorLaws.scala
def raiseErrorDistributesOverApRight[A](h: E => F[A], e: E): IsEq[F[A]]

Attributes

Source
ApplicativeErrorLaws.scala
def redeemDerivedFromAttemptMap[A, B](fa: F[A], fe: E => B, fs: A => B): IsEq[F[B]]

Attributes

Source
ApplicativeErrorLaws.scala

Inherited methods

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

Attributes

Inherited from:
ApplicativeLaws
Source
ApplicativeLaws.scala
def applicativeComposition[A, B, C](fa: F[A], fab: F[A => B], fbc: F[B => C]): IsEq[F[C]]

This law is applyComposition stated in terms of pure.

This law is applyComposition stated in terms of pure. It is a combination of applyComposition and applicativeMap and hence not strictly necessary.

Attributes

Inherited from:
ApplicativeLaws
Source
ApplicativeLaws.scala
def applicativeHomomorphism[A, B](a: A, f: A => B): IsEq[F[B]]

Attributes

Inherited from:
ApplicativeLaws
Source
ApplicativeLaws.scala
def applicativeIdentity[A](fa: F[A]): IsEq[F[A]]

Attributes

Inherited from:
ApplicativeLaws
Source
ApplicativeLaws.scala
def applicativeInterchange[A, B](a: A, ff: F[A => B]): IsEq[F[B]]

Attributes

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

Attributes

Inherited from:
ApplicativeLaws
Source
ApplicativeLaws.scala
def applicativeUnit[A](a: A): IsEq[F[A]]

Attributes

Inherited from:
ApplicativeLaws
Source
ApplicativeLaws.scala
def applyComposition[A, B, C](fa: F[A], fab: F[A => B], fbc: F[B => C]): IsEq[F[C]]

Attributes

Inherited from:
ApplyLaws
Source
ApplyLaws.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 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 map2EvalConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) => C): IsEq[F[C]]

Attributes

Inherited from:
ApplyLaws
Source
ApplyLaws.scala
def map2ProductConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) => C): IsEq[F[C]]

Attributes

Inherited from:
ApplyLaws
Source
ApplyLaws.scala
def mapOrKeepToMapEquivalence[A, A1 >: A](fa: F[A], pf: PartialFunction[A, A1]): IsEq[F[A1]]

Attributes

Inherited from:
FunctorLaws
Source
FunctorLaws.scala
def monoidalLeftIdentity[A](fa: F[A]): (F[(Unit, A)], F[A])

Attributes

Inherited from:
ApplicativeLaws
Source
ApplicativeLaws.scala
def monoidalRightIdentity[A](fa: F[A]): (F[(A, Unit)], F[A])

Attributes

Inherited from:
ApplicativeLaws
Source
ApplicativeLaws.scala
def productLConsistency[A, B](fa: F[A], fb: F[B]): IsEq[F[A]]

Attributes

Inherited from:
ApplyLaws
Source
ApplyLaws.scala
def productRConsistency[A, B](fa: F[A], fb: F[B]): IsEq[F[B]]

Attributes

Inherited from:
ApplyLaws
Source
ApplyLaws.scala
def replicateAVoidReplicateA_Consistent[A](n: Int, fa: F[A]): IsEq[F[Unit]]

Attributes

Inherited from:
ApplicativeLaws
Source
ApplicativeLaws.scala
def semigroupalAssociativity[A, B, C](fa: F[A], fb: F[B], fc: F[C]): (F[(A, (B, C))], F[((A, B), C)])

Attributes

Inherited from:
SemigroupalLaws
Source
SemigroupalLaws.scala

Implicits

Implicits

implicit override def F: ApplicativeError[F, E]
Generated with