trait ChoiceLaws[F[_, _]] extends ProfunctorLaws[F]

Source
ChoiceLaws.scala
Linear Supertypes
ProfunctorLaws[F], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ChoiceLaws
  2. ProfunctorLaws
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. implicit abstract def F: Choice[F]
    Definition Classes
    ChoiceLaws → ProfunctorLaws

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  9. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. def leftComposeLeftDimapConsistent[A, B, C](fab: F[A, B]): IsEq[F[Either[Either[A, C], B], Either[Either[B, C], B]]]
  13. def leftRightConsistent[A, B, C](fab: F[A, B]): IsEq[F[Either[A, C], Either[B, C]]]
  14. def leftRmapLmapConsistent[A, B, C](fab: F[A, B]): IsEq[F[A, Either[B, C]]]
  15. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  17. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  18. 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]]
    Definition Classes
    ProfunctorLaws
  19. def profunctorIdentity[A, B](fab: F[A, B]): IsEq[F[A, B]]
    Definition Classes
    ProfunctorLaws
  20. def profunctorLmapComposition[A2, A1, A0, B](fab: F[A0, B], f: (A2) => A1, g: (A1) => A0): IsEq[F[A2, B]]
    Definition Classes
    ProfunctorLaws
  21. def profunctorLmapIdentity[A, B](fab: F[A, B]): IsEq[F[A, B]]
    Definition Classes
    ProfunctorLaws
  22. def profunctorRmapComposition[A, B2, B1, B0](fab: F[A, B0], f: (B0) => B1, g: (B1) => B2): IsEq[F[A, B2]]
    Definition Classes
    ProfunctorLaws
  23. def profunctorRmapIdentity[A, B](fab: F[A, B]): IsEq[F[A, B]]
    Definition Classes
    ProfunctorLaws
  24. def rightComposeRightDimapConsistent[A, B, C](fab: F[A, B]): IsEq[F[Either[B, Either[C, A]], Either[B, Either[C, B]]]]
  25. def rightLeftConsistent[A, B, C](fab: F[A, B]): IsEq[F[Either[C, A], Either[C, B]]]
  26. def rightLmapRmapConsistent[A, B, C](fab: F[A, B]): IsEq[F[A, Either[C, B]]]
  27. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  28. def toString(): String
    Definition Classes
    AnyRef → Any
  29. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  30. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  31. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from ProfunctorLaws[F]

Inherited from AnyRef

Inherited from Any

Ungrouped