Proptics law/proptics.law/ChoiceLaws

ChoiceLaws

trait ChoiceLaws[F[_, _]] extends ProfunctorLaws[F]
Companion:
object
class Object
trait Matchable
class Any

Value members

Concrete methods

def leftComposeLeftDimapConsistent[A, B, C](fab: F[A, B]): IsEq[F[Either[Either[A, C], B], Either[Either[B, C], B]]]
def leftRightConsistent[A, B, C](fab: F[A, B]): IsEq[F[Either[A, C], Either[B, C]]]
def leftRmapLmapConsistent[A, B, C](fab: F[A, B]): IsEq[F[A, Either[B, C]]]
def rightComposeRightDimapConsistent[A, B, C](fab: F[A, B]): IsEq[F[Either[B, Either[C, A]], Either[B, Either[C, B]]]]
def rightLeftConsistent[A, B, C](fab: F[A, B]): IsEq[F[Either[C, A], Either[C, B]]]
def rightLmapRmapConsistent[A, B, C](fab: F[A, B]): IsEq[F[A, Either[C, B]]]

Inherited methods

def profunctorComposition[A2, A1, A0, B0, B1, B2](fab: F[A0, B0], f2: A2 => A1, f1: A1 => A0, g1: B0 => B1, g2: B1 => B2): IsEq[F[A2, B2]]
Inherited from:
ProfunctorLaws
def profunctorIdentity[A, B](fab: F[A, B]): IsEq[F[A, B]]
Inherited from:
ProfunctorLaws
def profunctorLmapComposition[A2, A1, A0, B](fab: F[A0, B], f: A2 => A1, g: A1 => A0): IsEq[F[A2, B]]
Inherited from:
ProfunctorLaws
def profunctorLmapIdentity[A, B](fab: F[A, B]): IsEq[F[A, B]]
Inherited from:
ProfunctorLaws
def profunctorRmapComposition[A, B2, B1, B0](fab: F[A, B0], f: B0 => B1, g: B1 => B2): IsEq[F[A, B2]]
Inherited from:
ProfunctorLaws
def profunctorRmapIdentity[A, B](fab: F[A, B]): IsEq[F[A, B]]
Inherited from:
ProfunctorLaws

Implicits

Implicits

implicit def F: Choice[F]