scalaz.Divisible

DivisibleLaw

trait DivisibleLaw extends DivideLaw

Source
Divisible.scala
Linear Supertypes
Divisible.DivideLaw, Divisible.ContravariantLaw, Divisible.InvariantFunctorLaw, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. DivisibleLaw
  2. DivideLaw
  3. ContravariantLaw
  4. InvariantFunctorLaw
  5. AnyRef
  6. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. def composite[A, B, C](fa: F[A], f1: (B) ⇒ A, f2: (C) ⇒ B)(implicit FC: Equal[F[C]]): Boolean

    A series of contramaps may be freely rewritten as a single contramap on a composed function.

    A series of contramaps may be freely rewritten as a single contramap on a composed function.

    Definition Classes
    ContravariantLaw
  9. def composition[A](a1: F[A], a2: F[A], a3: F[A])(implicit E: Equal[F[A]]): Boolean

    Definition Classes
    DivideLaw
  10. def delta[A]: (A) ⇒ (A, A)

    Attributes
    protected[this]
    Definition Classes
    DivideLaw
  11. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  13. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  15. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  16. 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
    ContravariantLaw
  17. 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
  18. def invariantIdentity[A](fa: F[A])(implicit FA: Equal[F[A]]): Boolean

    Definition Classes
    InvariantFunctorLaw
  19. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  20. def leftIdentity[A](fa: F[A])(implicit E: Equal[F[A]]): Boolean

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

    Definition Classes
    AnyRef
  22. final def notify(): Unit

    Definition Classes
    AnyRef
  23. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  24. def rightIdentity[A](fa: F[A])(implicit E: Equal[F[A]]): Boolean

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

    Definition Classes
    AnyRef
  26. def toString(): String

    Definition Classes
    AnyRef → Any
  27. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  29. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Divisible.DivideLaw

Inherited from Divisible.ContravariantLaw

Inherited from Divisible.InvariantFunctorLaw

Inherited from AnyRef

Inherited from Any

Ungrouped