Proptics law/proptics.law/ClosedLaws

ClosedLaws

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

Value members

Concrete methods

def closedComposeClosedDimapConsistent[A, B](fab: F[A, B]): IsEq[F[A => A => A, A => A => B]]
def dimapConstIdentityConsistent[A, B](fab: F[A, B]): IsEq[F[A, B]]
def lmapClosedRmapClosedConsistent[A](fab: F[A, A]): IsEq[F[A => A, A => A]]

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: Closed[F]