trait IsomorphismEmpty[F[_], G[_]] extends PlusEmpty[F] with IsomorphismPlus[F, G]
Ordering
- Alphabetic
- By Inheritance
Inherited
- IsomorphismEmpty
- IsomorphismPlus
- PlusEmpty
- Plus
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
Abstract Value Members
-
implicit abstract
def
G: PlusEmpty[G]
- Definition Classes
- IsomorphismEmpty → IsomorphismPlus
-
abstract
def
iso: Isomorphism.<~>[F, G]
- Definition Classes
- IsomorphismPlus
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
compose[G[_]]: PlusEmpty[[α]F[G[α]]]
The composition of PlusEmpty
FandG,[x]F[G[x]], is a PlusEmpty -
def
empty[A]: F[A]
- Definition Classes
- IsomorphismEmpty → PlusEmpty
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
monoid[A]: Monoid[F[A]]
- Definition Classes
- PlusEmpty
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
plus[A](a: F[A], b: ⇒ F[A]): F[A]
- Definition Classes
- IsomorphismPlus → Plus
-
def
plusEmptyLaw: EmptyLaw
- Definition Classes
- PlusEmpty
-
val
plusEmptySyntax: PlusEmptySyntax[F]
- Definition Classes
- PlusEmpty
-
def
plusLaw: PlusLaw
- Definition Classes
- Plus
-
val
plusSyntax: PlusSyntax[F]
- Definition Classes
- Plus
-
def
product[G[_]](implicit G0: PlusEmpty[G]): PlusEmpty[[α](F[α], G[α])]
The product of PlusEmpty
FandG,[x](F[x], G[x]]), is a PlusEmptyThe product of PlusEmpty
FandG,[x](F[x], G[x]]), is a PlusEmpty- Definition Classes
- PlusEmpty
-
def
product[G[_]](implicit G0: Plus[G]): Plus[[α](F[α], G[α])]
The product of Plus
FandG,[x](F[x], G[x]]), is a PlusThe product of Plus
FandG,[x](F[x], G[x]]), is a Plus- Definition Classes
- Plus
-
def
semigroup[A]: Semigroup[F[A]]
- Definition Classes
- Plus
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
unfoldlPsum[S, A](seed: S)(f: (S) ⇒ Maybe[(S, F[A])]): F[A]
- Definition Classes
- PlusEmpty
-
def
unfoldlPsumOpt[S, A](seed: S)(f: (S) ⇒ Maybe[(S, F[A])]): Maybe[F[A]]
Unfold
seedto the left and sum using #plus. -
def
unfoldrPsum[S, A](seed: S)(f: (S) ⇒ Maybe[(F[A], S)]): F[A]
- Definition Classes
- PlusEmpty
-
def
unfoldrPsumOpt[S, A](seed: S)(f: (S) ⇒ Maybe[(F[A], S)]): Maybe[F[A]]
Unfold
seedto the right and sum using #plus. -
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )