Packages

t

scalaz

IsomorphismPlusEmpty

trait IsomorphismPlusEmpty[F[_], G[_]] extends PlusEmpty[F] with IsomorphismPlus[F, G]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IsomorphismPlusEmpty
  2. IsomorphismPlus
  3. PlusEmpty
  4. Plus
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. trait PlusLaw extends AnyRef
    Definition Classes
    Plus
  2. trait EmptyLaw extends PlusLaw
    Definition Classes
    PlusEmpty

Abstract Value Members

  1. implicit abstract def G: PlusEmpty[G]
    Definition Classes
    IsomorphismPlusEmptyIsomorphismPlus
  2. abstract def iso: Isomorphism.<~>[F, G]
    Definition Classes
    IsomorphismPlus

Concrete 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. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  6. def compose[G[_]]: PlusEmpty[[α]F[G[α]]]

    The composition of PlusEmpty F and G, [x]F[G[x]], is a PlusEmpty

    The composition of PlusEmpty F and G, [x]F[G[x]], is a PlusEmpty

    Definition Classes
    PlusEmptyPlus
  7. def empty[A]: F[A]
    Definition Classes
    IsomorphismPlusEmptyPlusEmpty
  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. def monoid[A]: Monoid[F[A]]
    Definition Classes
    PlusEmpty
  15. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  17. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  18. def plus[A](a: F[A], b: ⇒ F[A]): F[A]
    Definition Classes
    IsomorphismPlusPlus
  19. def plusEmptyLaw: EmptyLaw
    Definition Classes
    PlusEmpty
  20. val plusEmptySyntax: PlusEmptySyntax[F]
    Definition Classes
    PlusEmpty
  21. def plusLaw: PlusLaw
    Definition Classes
    Plus
  22. val plusSyntax: PlusSyntax[F]
    Definition Classes
    Plus
  23. def product[G[_]](implicit G0: PlusEmpty[G]): PlusEmpty[[α](F[α], G[α])]

    The product of PlusEmpty F and G, [x](F[x], G[x]]), is a PlusEmpty

    The product of PlusEmpty F and G, [x](F[x], G[x]]), is a PlusEmpty

    Definition Classes
    PlusEmpty
  24. def product[G[_]](implicit G0: Plus[G]): Plus[[α](F[α], G[α])]

    The product of Plus F and G, [x](F[x], G[x]]), is a Plus

    The product of Plus F and G, [x](F[x], G[x]]), is a Plus

    Definition Classes
    Plus
  25. def semigroup[A]: Semigroup[F[A]]
    Definition Classes
    Plus
  26. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  27. def toString(): String
    Definition Classes
    AnyRef → Any
  28. def unfoldlPsum[S, A](seed: S)(f: (S) ⇒ Maybe[(S, F[A])]): F[A]
    Definition Classes
    PlusEmpty
  29. def unfoldlPsumOpt[S, A](seed: S)(f: (S) ⇒ Maybe[(S, F[A])]): Maybe[F[A]]

    Unfold seed to the left and sum using #plus.

    Unfold seed to the left and sum using #plus. Plus instances with right absorbing elements may override this method to not unfold more than is necessary to determine the result.

    Definition Classes
    Plus
  30. def unfoldrPsum[S, A](seed: S)(f: (S) ⇒ Maybe[(F[A], S)]): F[A]
    Definition Classes
    PlusEmpty
  31. def unfoldrPsumOpt[S, A](seed: S)(f: (S) ⇒ Maybe[(F[A], S)]): Maybe[F[A]]

    Unfold seed to the right and sum using #plus.

    Unfold seed to the right and sum using #plus. Plus instances with left absorbing elements may override this method to not unfold more than is necessary to determine the result.

    Definition Classes
    Plus
  32. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from IsomorphismPlus[F, G]

Inherited from PlusEmpty[F]

Inherited from Plus[F]

Inherited from AnyRef

Inherited from Any

Ungrouped