IsomorphismIsEmpty

trait IsomorphismIsEmpty[F[_], G[_]] extends IsEmpty[F] with IsomorphismPlusEmpty[F, G]
trait IsomorphismPlus[F, G]
trait IsEmpty[F]
trait PlusEmpty[F]
trait Plus[F]
class Object
trait Matchable
class Any

Type members

Inherited classlikes

trait EmptyLaw
Inherited from
PlusEmpty
Inherited from
IsEmpty
trait PlusLaw
Inherited from
Plus

Value members

Concrete methods

def isEmpty[A](fa: F[A]): Boolean

Inherited methods

override
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
Inherited from
PlusEmpty
def empty[A]: F[A]
Inherited from
IsomorphismPlusEmpty
Inherited from
IsEmpty
def iso: IsoFunctor[F, G]
Inherited from
IsomorphismPlus
def monoid[A]: Monoid[F[A]]
Inherited from
PlusEmpty
def plus[A](a: F[A], b: => F[A]): F[A]
Inherited from
IsomorphismPlus
Inherited from
PlusEmpty
Inherited from
Plus
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

Inherited from
Plus
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

Inherited from
PlusEmpty
def semigroup[A]: Semigroup[F[A]]
Inherited from
Plus
def unfoldlPsum[S, A](seed: S)(f: S => Maybe[(S, F[A])]): F[A]
Inherited from
PlusEmpty
def unfoldlPsumOpt[S, A](seed: S)(f: S => Maybe[(S, F[A])]): Maybe[F[A]]

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.

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.

Inherited from
Plus
def unfoldrPsum[S, A](seed: S)(f: S => Maybe[(F[A], S)]): F[A]
Inherited from
PlusEmpty
def unfoldrPsumOpt[S, A](seed: S)(f: S => Maybe[(F[A], S)]): Maybe[F[A]]

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.

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.

Inherited from
Plus

Inherited fields

Inherited from
IsEmpty
Inherited from
Plus

Implicits

Implicits

implicit
def G: IsEmpty[G]