class CalcMBitraverse[F[+_, +_], S] extends CalcMBifoldable[F, S] with Bitraverse[[ε$26$, ζ$27$]CalcM[F, Any, Any, S, ε$26$, ζ$27$]]
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- CalcMBitraverse
- Bitraverse
- Bifunctor
- CalcMBifoldable
- Bifoldable
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new CalcMBitraverse()(implicit F: Bitraverse[F])
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
bifold[A, B](fab: CalcM[F, Any, Any, S, A, B])(implicit A: Monoid[A], B: Monoid[B]): (A, B)
- Definition Classes
- Bifoldable
-
def
bifoldLeft[A, B, C](fab: CalcM[F, Any, Any, S, A, B], c: C)(f: (C, A) ⇒ C, g: (C, B) ⇒ C): C
- Definition Classes
- CalcMBifoldable → Bifoldable
-
def
bifoldLeft1[E, A, B](c: StepResult[F, S, E, A], b: B, depth: Int)(f: (B, E) ⇒ B, g: (B, A) ⇒ B): B
- Definition Classes
- CalcMBifoldable
-
def
bifoldLeft1Slow[E, A, B](c: StepResult[F, S, E, A], b: Eval[B])(f: (Eval[B], E) ⇒ Eval[B], g: (Eval[B], A) ⇒ Eval[B]): Eval[B]
- Definition Classes
- CalcMBifoldable
-
def
bifoldMap[A, B, C](fab: CalcM[F, Any, Any, S, A, B])(f: (A) ⇒ C, g: (B) ⇒ C)(implicit C: Monoid[C]): C
- Definition Classes
- Bifoldable
-
def
bifoldRight[A, B, C](fab: CalcM[F, Any, Any, S, A, B], c: Eval[C])(f: (A, Eval[C]) ⇒ Eval[C], g: (B, Eval[C]) ⇒ Eval[C]): Eval[C]
- Definition Classes
- CalcMBifoldable → Bifoldable
-
def
bifoldRight1[E, A, B](c: StepResult[F, S, E, A], b: Eval[B])(f: (E, Eval[B]) ⇒ Eval[B], g: (A, Eval[B]) ⇒ Eval[B]): Eval[B]
- Definition Classes
- CalcMBifoldable
-
def
bimap[A, B, C, D](fab: CalcM[F, Any, Any, S, A, B])(f: (A) ⇒ C, g: (B) ⇒ D): CalcM[F, Any, Any, S, C, D]
- Definition Classes
- Bitraverse → Bifunctor
-
def
bisequence[G[_], A, B](fab: CalcM[F, Any, Any, S, G[A], G[B]])(implicit arg0: Applicative[G]): G[CalcM[F, Any, Any, S, A, B]]
- Definition Classes
- Bitraverse
-
def
bitraverse[G[_], A, B, C, D](fab: CalcM[F, Any, Any, S, A, B])(f: (A) ⇒ G[C], g: (B) ⇒ G[D])(implicit arg0: Applicative[G]): G[CalcM[F, Any, Any, S, C, D]]
- Definition Classes
- CalcMBitraverse → Bitraverse
- def bitraverse1[G[_], A, B, C, D](fab: StepResult[F, S, A, B])(f: (A) ⇒ G[C], g: (B) ⇒ G[D])(implicit arg0: Applicative[G]): G[CalcM[F, Any, Any, S, C, D]]
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @IntrinsicCandidate()
-
def
compose[G[_, _]](implicit ev: Bitraverse[G]): Bitraverse[[α, β]CalcM[F, Any, Any, S, G[α, β], G[α, β]]]
- Definition Classes
- Bitraverse
-
def
compose[G[_, _]](implicit G0: Bifunctor[G]): Bifunctor[[α, β]CalcM[F, Any, Any, S, G[α, β], G[α, β]]]
- Definition Classes
- Bifunctor
-
def
compose[G[_, _]](implicit ev: Bifoldable[G]): Bifoldable[[α, β]CalcM[F, Any, Any, S, G[α, β], G[α, β]]]
- Definition Classes
- Bifoldable
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
leftFunctor[X]: Functor[[α$1$]CalcM[F, Any, Any, S, α$1$, X]]
- Definition Classes
- Bifunctor
-
def
leftLiftTo[A, B, C[_]](fab: CalcM[F, Any, Any, S, A, B])(implicit C: Applicative[C]): CalcM[F, Any, Any, S, C[A], B]
- Definition Classes
- Bifunctor
-
def
leftMap[A, B, C](fab: CalcM[F, Any, Any, S, A, B])(f: (A) ⇒ C): CalcM[F, Any, Any, S, C, B]
- Definition Classes
- Bifunctor
-
def
leftSequence[G[_], A, B](fgab: CalcM[F, Any, Any, S, G[A], B])(implicit G: Applicative[G]): G[CalcM[F, Any, Any, S, A, B]]
- Definition Classes
- Bitraverse
-
def
leftTraverse[G[_], A, B, C](fab: CalcM[F, Any, Any, S, A, B])(f: (A) ⇒ G[C])(implicit G: Applicative[G]): G[CalcM[F, Any, Any, S, C, B]]
- Definition Classes
- Bitraverse
-
def
leftWiden[A, B, AA >: A](fab: CalcM[F, Any, Any, S, A, B]): CalcM[F, Any, Any, S, AA, B]
- Definition Classes
- Bifunctor
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
-
def
rightFunctor[X]: Functor[[β$0$]CalcM[F, Any, Any, S, X, β$0$]]
- Definition Classes
- Bifunctor
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
Deprecated Value Members
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] ) @Deprecated
- Deprecated