BindRecLaw

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. def apLikeDerived[A, B](fa: F[A], f: F[(A) ⇒ B])(implicit FB: Equal[F[B]]): Boolean

   

   ap is consistent with bind.

   ap is consistent with bind.

   Definition Classes

   BindLaw

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def associativeBind[A, B, C](fa: F[A], f: (A) ⇒ F[B], g: (B) ⇒ F[C])(implicit FC: Equal[F[C]]): Boolean

   

   As with semigroups, monadic effects only change when their order is changed, not when the order in which they're combined changes.

   As with semigroups, monadic effects only change when their order is changed, not when the order in which they're combined changes.

   Definition Classes

   BindLaw

7. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. def composite[A, B, C](fa: F[A], f1: (A) ⇒ B, f2: (B) ⇒ C)(implicit FC: Equal[F[C]]): Boolean

   

   A series of maps may be freely rewritten as a single map on a composed function.

   A series of maps may be freely rewritten as a single map on a composed function.

   Definition Classes

   FunctorLaw

9. def composition[A, B, C](fbc: F[(B) ⇒ C], fab: F[(A) ⇒ B], fa: F[A])(implicit FC: Equal[F[C]]): Boolean

   

   Lifted functions can be fused.

   Lifted functions can be fused.

   Definition Classes

   ApplyLaw

10. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

11. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

12. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

13. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

14. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

15. def identity[A](fa: F[A])(implicit FA: Equal[F[A]]): Boolean

    

    The identity function, lifted, is a no-op.

    The identity function, lifted, is a no-op.

    Definition Classes

    FunctorLaw

16. def invariantComposite[A, B, C](fa: F[A], f1: (A) ⇒ B, g1: (B) ⇒ A, f2: (B) ⇒ C, g2: (C) ⇒ B)(implicit FC: Equal[F[C]]): Boolean

    

    Definition Classes

    InvariantFunctorLaw

17. def invariantIdentity[A](fa: F[A])(implicit FA: Equal[F[A]]): Boolean

    

    Definition Classes

    InvariantFunctorLaw

18. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

19. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

20. final def notify(): Unit

    

    Definition Classes

    AnyRef

21. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

22. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

23. def tailrecBindConsistency[A](a: A, f: (A) ⇒ F[A])(implicit FA: Equal[F[A]]): Boolean

    

24. def toString(): String

    

    Definition Classes

    AnyRef → Any

25. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

26. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

27. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )