sealed trait LazyEitherT[F[+_], +A, +B] extends AnyRef
- Source
- LazyEitherT.scala
- Alphabetic
- By Inheritance
- LazyEitherT
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
- abstract def run: F[LazyEither[A, B]]
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
- def ?[X](left: ⇒ X, right: ⇒ X)(implicit F: Functor[F]): F[X]
-
def
app[AA >: A, C](f: ⇒ LazyEitherT[F, AA, (B) ⇒ C])(implicit F: Apply[F]): LazyEitherT[F, AA, C]
Apply a function in the environment of the right of this disjunction.
Apply a function in the environment of the right of this disjunction. Because it runs my
F
even whenf
's\/
fails, it is not consistent withap
. -
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- def bimap[C, D](f: (⇒ A) ⇒ C, g: (⇒ B) ⇒ D)(implicit F: Functor[F]): LazyEitherT[F, C, D]
- def bitraverse[G[_], C, D](f: (A) ⇒ G[C], g: (B) ⇒ G[D])(implicit F: Traverse[F], G: Applicative[G]): G[LazyEitherT[F, C, D]]
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def exists(f: (⇒ B) ⇒ Boolean)(implicit F: Functor[F]): F[Boolean]
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def flatMap[AA >: A, C](f: (⇒ B) ⇒ LazyEitherT[F, AA, C])(implicit M: Monad[F]): LazyEitherT[F, AA, C]
- def foldRight[Z](z: ⇒ Z)(f: (B, ⇒ Z) ⇒ Z)(implicit F: Foldable[F]): Z
- def forall(f: (⇒ B) ⇒ Boolean)(implicit F: Functor[F]): F[Boolean]
- def foreach(f: (⇒ B) ⇒ Unit)(implicit e: Each[F]): Unit
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- def getOrElse[BB >: B](default: ⇒ BB)(implicit F: Functor[F]): F[BB]
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isLeft(implicit F: Functor[F]): F[Boolean]
- def isRight(implicit F: Functor[F]): F[Boolean]
- def left: LeftProjectionT[F, A, B]
-
def
leftMap[C](f: (⇒ A) ⇒ C)(implicit F: Functor[F]): LazyEitherT[F, C, B]
Run the given function on the left value.
- def map[C](f: (⇒ B) ⇒ C)(implicit F: Functor[F]): LazyEitherT[F, A, C]
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- def orElse[AA >: A, BB >: B](x: ⇒ LazyEitherT[F, AA, BB])(implicit m: Bind[F]): LazyEitherT[F, AA, BB]
- def swap(implicit F: Functor[F]): F[LazyEither[B, A]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- def toLazyOption(implicit F: Functor[F]): LazyOptionT[F, B]
- def toList(implicit F: Functor[F]): F[List[B]]
- def toOption(implicit F: Functor[F]): OptionT[F, B]
- def toStream(implicit F: Functor[F]): F[Stream[B]]
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- def traverse[G[_], AA >: A, C](f: (B) ⇒ G[C])(implicit F: Traverse[F], G: Applicative[G]): G[LazyEitherT[F, AA, C]]
-
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
- @throws( ... )