final case class Coproduct[F[_], G[_], A](run: \/[F[A], G[A]]) extends Product with Serializable
F
on the left, and G
on the right, of scalaz.\/.
- run
The underlying scalaz.\/.
- Source
- Coproduct.scala
- Alphabetic
- By Inheritance
- Coproduct
- Serializable
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
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 cobind[B](f: (Coproduct[F, G, A]) ⇒ B)(implicit F: Cobind[F], G: Cobind[G]): Coproduct[F, G, B]
- def contramap[B](f: (B) ⇒ A)(implicit F: Contravariant[F], G: Contravariant[G]): Coproduct[F, G, B]
- def copoint(implicit F: Comonad[F], G: Comonad[G]): A
- def duplicate(implicit F: Cobind[F], G: Cobind[G]): Coproduct[F, G, Coproduct[F, G, A]]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def fold[H[_]](f: ~>[F, H], g: ~>[G, H]): H[A]
- def foldMap[B](f: (A) ⇒ B)(implicit F: Foldable[F], G: Foldable[G], M: Monoid[B]): B
- def foldMap1[B](f: (A) ⇒ B)(implicit F: Foldable1[F], G: Foldable1[G], M: Semigroup[B]): B
- def foldMapRight1[B](z: (A) ⇒ B)(f: (A, ⇒ B) ⇒ B)(implicit F: Foldable1[F], G: Foldable1[G]): B
- def foldRight[Z](z: ⇒ Z)(f: (A, ⇒ Z) ⇒ Z)(implicit F: Foldable[F], G: Foldable[G]): Z
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isLeft: Boolean
- def isRight: Boolean
- def map[B](f: (A) ⇒ B)(implicit F: Functor[F], G: Functor[G]): Coproduct[F, G, B]
-
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()
- val run: \/[F[A], G[A]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- def traverse[X[_], B](g: (A) ⇒ X[B])(implicit F: Traverse[F], G: Traverse[G], A: Applicative[X]): X[Coproduct[F, G, B]]
- def traverse1[X[_], B](g: (A) ⇒ X[B])(implicit F: Traverse1[F], G: Traverse1[G], A: Apply[X]): X[Coproduct[F, G, B]]
- def unary_~: Coproduct[G, F, A]
- def validation: Validation[F[A], G[A]]
-
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( ... )