LazyEitherT

Value Members

1. final def !=(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

2. final def !=(arg0: Any): Boolean

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. def ?[X](left: ⇒ X, right: ⇒ X)(implicit F: Functor[F]): F[X]

7. def app[C](f: ⇒ LazyEitherT[F, A, (B) ⇒ C])(implicit F: Apply[F]): LazyEitherT[F, A, 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 when f's \/ fails, it is not consistent with ap.

8. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

9. def bimap[C, D](f: (⇒ A) ⇒ C, g: (⇒ B) ⇒ D)(implicit F: Functor[F]): LazyEitherT[F, C, D]

10. 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]]

11. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

12. final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

13. def exists(f: (⇒ B) ⇒ Boolean)(implicit F: Functor[F]): F[Boolean]

14. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

15. def flatMap[C](f: (⇒ B) ⇒ LazyEitherT[F, A, C])(implicit M: Monad[F]): LazyEitherT[F, A, C]

16. def foldRight[Z](z: ⇒ Z)(f: (B, ⇒ Z) ⇒ Z)(implicit F: Foldable[F]): Z

17. def forall(f: (⇒ B) ⇒ Boolean)(implicit F: Functor[F]): F[Boolean]

18. final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

19. def getOrElse(default: ⇒ B)(implicit F: Functor[F]): F[B]

20. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

21. def isLeft(implicit F: Functor[F]): F[Boolean]

22. def isRight(implicit F: Functor[F]): F[Boolean]

23. def left: LeftProjectionT[F, A, B]

24. def leftMap[C](f: (⇒ A) ⇒ C)(implicit F: Functor[F]): LazyEitherT[F, C, B]

    Run the given function on the left value.

25. def map[C](f: (⇒ B) ⇒ C)(implicit F: Functor[F]): LazyEitherT[F, A, C]

26. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

27. final def notify(): Unit

    Definition Classes

    AnyRef

28. final def notifyAll(): Unit

    Definition Classes

    AnyRef

29. def orElse(x: ⇒ LazyEitherT[F, A, B])(implicit m: Bind[F]): LazyEitherT[F, A, B]

30. val run: F[LazyEither[A, B]]

31. def swap(implicit F: Functor[F]): F[LazyEither[B, A]]

32. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

33. def toLazyOption(implicit F: Functor[F]): LazyOptionT[F, B]

34. def toList(implicit F: Functor[F]): F[List[B]]

35. def toMaybe(implicit F: Functor[F]): MaybeT[F, B]

36. def toOption(implicit F: Functor[F]): OptionT[F, B]

37. def toStream(implicit F: Functor[F]): F[Stream[B]]

38. def traverse[G[_], C](f: (B) ⇒ G[C])(implicit F: Traverse[F], G: Applicative[G]): G[LazyEitherT[F, A, C]]

39. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

40. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

41. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

42. def |(default: ⇒ B)(implicit F: Functor[F]): F[B]

    Return the right value of this disjunction or the given default if left.

    Return the right value of this disjunction or the given default if left. Alias for getOrElse

43. def |||(x: ⇒ LazyEitherT[F, A, B])(implicit F: Bind[F]): LazyEitherT[F, A, B]

    Return this if it is a right, otherwise, return the given value.

    Return this if it is a right, otherwise, return the given value. Alias for orElse