trait StrongLaws extends ProfunctorLaw
- Source
- Strong.scala
- Alphabetic
- By Inheritance
- StrongLaws
- ProfunctorLaw
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
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[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
def
composite[A, B, C, D, E, F](gad: =>:[A, D], fac: (C) ⇒ B, fba: (B) ⇒ A, fde: (D) ⇒ E, fef: (E) ⇒ F)(implicit E: Equal[=>:[C, F]]): Boolean
- Definition Classes
- ProfunctorLaw
-
def
dinaturalityFirst[A, B, C, D](fab: =>:[A, B], f: (C) ⇒ D)(implicit E: Equal[=>:[(A, C), (B, D)]], PF: Strong[Function1]): Boolean
lmap (second f) .
lmap (second f) . first == rmap (second f) . first
-
def
dinaturalitySecond[A, B, C, D](fab: =>:[A, B], f: (C) ⇒ D)(implicit E: Equal[=>:[(C, A), (D, B)]], PF: Strong[Function1]): Boolean
lmap (first f) .
lmap (first f) . second == rmap (first f) . second
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
firstFirstIsDimap[A, B, C, D](fab: =>:[A, B])(implicit E: Equal[=>:[((A, C), D), ((B, C), D)]]): Boolean
first' .
first' . first' == dimap assoc unassoc . first' where assoc ((a,b),c) = (a,(b,c)) unassoc (a,(b,c)) = ((a,b),c)
-
def
firstIsSwappedSecond[A, B, C](fab: =>:[A, B])(implicit E: Equal[=>:[(A, C), (B, C)]]): Boolean
first' == dimap swap swap .
first' == dimap swap swap . second'
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
identity[A, B](gab: =>:[A, B])(implicit E: Equal[=>:[A, B]]): Boolean
- Definition Classes
- ProfunctorLaw
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
mapfstEqualsFirstAndThenMapsnd[A, B, C](fab: =>:[A, B])(implicit E: Equal[=>:[(A, C), B]]): Boolean
lmap fst == rmap fst .
lmap fst == rmap fst . first'
-
def
mapfstEqualsSecondAndThenMapsnd[A, B, C](fab: =>:[A, B])(implicit E: Equal[=>:[(C, A), B]]): Boolean
lmap snd == rmap snd .
lmap snd == rmap snd . second'
-
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
secondIsSwappedFirst[A, B, C](fab: =>:[A, B])(implicit E: Equal[=>:[(C, A), (C, B)]]): Boolean
second' == dimap swap swap .
second' == dimap swap swap . first'
-
def
secondSecondIsDimap[A, B, C, D](fab: =>:[A, B])(implicit E: Equal[=>:[(D, (C, A)), (D, (C, B))]]): Boolean
second' .
second' . second' == dimap unassoc assoc . second' where assoc ((a,b),c) = (a,(b,c)) unassoc (a,(b,c)) = ((a,b),c)
-
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
- @throws( ... ) @native()