trait StrongLaws[F[_, _]] extends ProfunctorLaws[F]
Laws that must be obeyed by any cats.functor.Strong
.
Linear Supertypes
Known Subclasses
Ordering
- Alphabetic
- By Inheritance
Inherited
- StrongLaws
- ProfunctorLaws
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Abstract Value Members
-
implicit abstract
def
F: Strong[F]
- Definition Classes
- StrongLaws → ProfunctorLaws
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
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
-
def
profunctorIdentity[A, B](fab: F[A, B]): IsEq[F[A, B]]
- Definition Classes
- ProfunctorLaws
-
def
profunctorLmapComposition[A2, A1, A0, B](fab: F[A0, B], f: (A2) ⇒ A1, g: (A1) ⇒ A0): IsEq[F[A2, B]]
- Definition Classes
- ProfunctorLaws
-
def
profunctorLmapIdentity[A, B](fab: F[A, B]): IsEq[F[A, B]]
- Definition Classes
- ProfunctorLaws
-
def
profunctorRmapComposition[A, B2, B1, B0](fab: F[A, B0], f: (B0) ⇒ B1, g: (B1) ⇒ B2): IsEq[F[A, B2]]
- Definition Classes
- ProfunctorLaws
-
def
profunctorRmapIdentity[A, B](fab: F[A, B]): IsEq[F[A, B]]
- Definition Classes
- ProfunctorLaws
- def strongFirstDistributivity[A0, A1, B1, B2, C](fab: F[A1, B1], f: (A0) ⇒ A1, g: (B1) ⇒ B2): IsEq[F[(A0, C), (B2, C)]]
- def strongSecondDistributivity[A0, A1, B1, B2, C](fab: F[A1, B1], f: (A0) ⇒ A1, g: (B1) ⇒ B2): IsEq[F[(C, A0), (C, B2)]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )