Trait

scalaz.Divisible

DivisibleLaw

Related Doc: package Divisible

Permalink

trait DivisibleLaw extends DivideLaw

Source
Divisible.scala
Linear Supertypes
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
Visibility
  1. Public
  2. All

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

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

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

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

    Permalink

    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
  7. def composition[A](a1: F[A], a2: F[A], a3: F[A])(implicit E: Equal[F[A]]): Boolean

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

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  14. def identity[A](fa: F[A])(implicit FA: Equal[F[A]]): Boolean

    Permalink

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

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

    Definition Classes
    ContravariantLaw
  15. 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

    Permalink
    Definition Classes
    InvariantFunctorLaw
  16. def invariantIdentity[A](fa: F[A])(implicit FA: Equal[F[A]]): Boolean

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

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

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

    Permalink
    Definition Classes
    AnyRef
  20. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  21. final def notifyAll(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
  24. def toString(): String

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

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Divisible.DivideLaw

Inherited from AnyRef

Inherited from Any

Ungrouped