io.atlassian.aws

AwsActionMonad

class AwsActionMonad[R, W] extends Monad[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]] with MonadReader[[α, γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], α, γ], R] with MonadListen[[β, γ]Kleisli[[γ]EitherT[[β]WriterT[Future, β, β], Invalid, γ], R, γ], W] with MonadPlus[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]] with MonadError[[γ, δ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], γ, γ], R, δ], Invalid]

Linear Supertypes
MonadError[[γ, δ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], γ, γ], R, δ], Invalid], MonadPlus[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]], ApplicativePlus[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]], PlusEmpty[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]], Plus[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]], MonadListen[[β, γ]Kleisli[[γ]EitherT[[β]WriterT[Future, β, β], Invalid, γ], R, γ], W], MonadTell[[β, γ]Kleisli[[γ]EitherT[[β]WriterT[Future, β, β], Invalid, γ], R, γ], W], MonadReader[[α, γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], α, γ], R], Monad[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]], Bind[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]], Applicative[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]], Apply[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]], Functor[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]], InvariantFunctor[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. AwsActionMonad
  2. MonadError
  3. MonadPlus
  4. ApplicativePlus
  5. PlusEmpty
  6. Plus
  7. MonadListen
  8. MonadTell
  9. MonadReader
  10. Monad
  11. Bind
  12. Applicative
  13. Apply
  14. Functor
  15. InvariantFunctor
  16. AnyRef
  17. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new AwsActionMonad()(implicit arg0: Monoid[W])

Type Members

  1. trait ApplicativeLaw extends scalaz.Applicative.ApplyLaw

    Definition Classes
    Applicative

  2. trait ApplyLaw extends scalaz.Apply.FunctorLaw

    Definition Classes
    Apply

  3. trait BindLaw extends scalaz.Bind.ApplyLaw

    Definition Classes
    Bind

  4. trait EmptyLaw extends scalaz.PlusEmpty.PlusLaw

    Definition Classes
    PlusEmpty

  5. trait FunctorLaw extends scalaz.Functor.InvariantFunctorLaw

    Definition Classes
    Functor

  6. trait InvariantFunctorLaw extends AnyRef

    Definition Classes
    InvariantFunctor

  7. trait MonadErrorLaw extends AnyRef

    Definition Classes
    MonadError

  8. trait MonadLaw extends scalaz.Monad.ApplicativeLaw with scalaz.Monad.BindLaw

    Definition Classes
    Monad

  9. trait MonadPlusLaw extends scalaz.MonadPlus.EmptyLaw with scalaz.MonadPlus.MonadLaw

    Definition Classes
    MonadPlus

  10. trait PlusLaw extends AnyRef

    Definition Classes
    Plus

  11. trait StrongMonadPlusLaw extends MonadPlusLaw

    Definition Classes
    MonadPlus

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 ap[A, B](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A])(f: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A) ⇒ B]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B]

    Definition Classes
    Bind → Apply

  7. def ap2[A, B, C](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B])(f: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A, B) ⇒ C]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C]

    Definition Classes
    Apply

  8. def ap3[A, B, C, D](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C])(f: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A, B, C) ⇒ D]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D]

    Definition Classes
    Apply

  9. def ap4[A, B, C, D, E](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], fd: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D])(f: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A, B, C, D) ⇒ E]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E]

    Definition Classes
    Apply

  10. def ap5[A, B, C, D, E, R](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], fd: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], fe: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E])(f: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A, B, C, D, E) ⇒ R]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  11. def ap6[A, B, C, D, E, FF, R](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], fd: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], fe: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E], ff: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, FF])(f: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A, B, C, D, E, FF) ⇒ R]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  12. def ap7[A, B, C, D, E, FF, G, R](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], fd: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], fe: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E], ff: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, FF], fg: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G])(f: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A, B, C, D, E, FF, G) ⇒ R]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  13. def ap8[A, B, C, D, E, FF, G, H, R](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], fd: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], fe: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E], ff: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, FF], fg: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G], fh: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, H])(f: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A, B, C, D, E, FF, G, H) ⇒ R]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  14. def apF[A, B](f: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A) ⇒ B]): (Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]) ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B]

    Definition Classes
    Apply

  15. def applicativeLaw: ApplicativeLaw

    Definition Classes
    Applicative

  16. val applicativePlusSyntax: ApplicativePlusSyntax[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

    Definition Classes
    ApplicativePlus

  17. val applicativeSyntax: ApplicativeSyntax[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

    Definition Classes
    Applicative

  18. def apply[A, B](fa: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A])(f: (A) ⇒ B): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B]

    Definition Classes
    Functor

  19. def apply10[A, B, C, D, E, FF, G, H, I, J, R](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], fd: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], fe: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E], ff: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, FF], fg: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G], fh: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, H], fi: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, I], fj: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, J])(f: (A, B, C, D, E, FF, G, H, I, J) ⇒ R): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  20. def apply11[A, B, C, D, E, FF, G, H, I, J, K, R](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], fd: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], fe: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E], ff: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, FF], fg: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G], fh: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, H], fi: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, I], fj: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, J], fk: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, K])(f: (A, B, C, D, E, FF, G, H, I, J, K) ⇒ R): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  21. def apply12[A, B, C, D, E, FF, G, H, I, J, K, L, R](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], fd: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], fe: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E], ff: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, FF], fg: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G], fh: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, H], fi: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, I], fj: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, J], fk: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, K], fl: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, L])(f: (A, B, C, D, E, FF, G, H, I, J, K, L) ⇒ R): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  22. def apply2[A, B, C](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B])(f: (A, B) ⇒ C): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C]

    Definition Classes
    Applicative → Apply

  23. def apply3[A, B, C, D](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C])(f: (A, B, C) ⇒ D): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D]

    Definition Classes
    Apply

  24. def apply4[A, B, C, D, E](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], fd: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D])(f: (A, B, C, D) ⇒ E): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E]

    Definition Classes
    Apply

  25. def apply5[A, B, C, D, E, R](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], fd: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], fe: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E])(f: (A, B, C, D, E) ⇒ R): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  26. def apply6[A, B, C, D, E, FF, R](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], fd: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], fe: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E], ff: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, FF])(f: (A, B, C, D, E, FF) ⇒ R): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  27. def apply7[A, B, C, D, E, FF, G, R](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], fd: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], fe: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E], ff: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, FF], fg: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G])(f: (A, B, C, D, E, FF, G) ⇒ R): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  28. def apply8[A, B, C, D, E, FF, G, H, R](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], fd: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], fe: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E], ff: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, FF], fg: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G], fh: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, H])(f: (A, B, C, D, E, FF, G, H) ⇒ R): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  29. def apply9[A, B, C, D, E, FF, G, H, I, R](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], fd: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], fe: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E], ff: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, FF], fg: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G], fh: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, H], fi: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, I])(f: (A, B, C, D, E, FF, G, H, I) ⇒ R): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  30. def applyApplicative: Applicative[[α]\/[Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, α], α]]

    Definition Classes
    Apply

  31. def applyLaw: ApplyLaw

    Definition Classes
    Apply

  32. val applySyntax: ApplySyntax[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

    Definition Classes
    Apply

  33. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  34. def ask: AwsAction[R, W, R]

    Definition Classes
    AwsActionMonad → MonadReader

  35. def asks[A](f: (R) ⇒ A): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]

    Definition Classes
    MonadReader

  36. def bicompose[G[_, _]](implicit arg0: Bifunctor[G]): Bifunctor[[α, β]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G[α, β]]]

    Definition Classes
    Functor

  37. def bind[A, B](fa: AwsAction[R, W, A])(f: (A) ⇒ AwsAction[R, W, B]): AwsAction[R, W, B]

    Definition Classes
    AwsActionMonad → Bind

  38. def bindLaw: BindLaw

    Definition Classes
    Bind

  39. val bindSyntax: BindSyntax[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

    Definition Classes
    Bind

  40. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  41. def compose[G[_]](implicit G0: ApplicativePlus[G]): ApplicativePlus[[α]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G[α]]]

    Definition Classes
    ApplicativePlus

  42. def compose[G[_]](implicit G0: PlusEmpty[G]): PlusEmpty[[α]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G[α]]]

    Definition Classes
    PlusEmpty

  43. def compose[G[_]](implicit G0: Plus[G]): Plus[[α]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G[α]]]

    Definition Classes
    Plus

  44. def compose[G[_]](implicit G0: Applicative[G]): Applicative[[α]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G[α]]]

    Definition Classes
    Applicative

  45. def compose[G[_]](implicit G0: Apply[G]): Apply[[α]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G[α]]]

    Definition Classes
    Apply

  46. def compose[G[_]](implicit G0: Functor[G]): Functor[[α]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G[α]]]

    Definition Classes
    Functor

  47. def counzip[A, B](a: \/[Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B]]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, \/[A, B]]

    Definition Classes
    Functor

  48. def empty[A]: AwsAction[R, W, A]

    Definition Classes
    AwsActionMonad → PlusEmpty

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

    Definition Classes
    AnyRef

  50. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  51. def filter[A](fa: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A])(f: (A) ⇒ Boolean): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]

    Definition Classes
    MonadPlus

  52. def filterM[A](l: List[A])(f: (A) ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, Boolean]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, List[A]]

    Definition Classes
    Applicative

  53. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  54. def flip: Applicative[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

    Definition Classes
    Applicative

  55. def forever[A, B](fa: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B]

    Definition Classes
    Bind

  56. def fpair[A](fa: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A, A)]

    Definition Classes
    Functor

  57. def fproduct[A, B](fa: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A])(f: (A) ⇒ B): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A, B)]

    Definition Classes
    Functor

  58. def functorLaw: FunctorLaw

    Definition Classes
    Functor

  59. val functorSyntax: FunctorSyntax[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

    Definition Classes
    Functor

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

    Definition Classes
    AnyRef → Any

  61. def handleError[A](fa: AwsAction[R, W, A])(f: (Invalid) ⇒ AwsAction[R, W, A]): AwsAction[R, W, A]

    Definition Classes
    AwsActionMonad → MonadError

  62. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  63. def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G[α]]]

    Definition Classes
    Functor

  64. def ifM[B](value: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, Boolean], ifTrue: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], ifFalse: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B]

    Definition Classes
    Bind

  65. def invariantFunctorLaw: InvariantFunctorLaw

    Definition Classes
    InvariantFunctor

  66. val invariantFunctorSyntax: InvariantFunctorSyntax[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

    Definition Classes
    InvariantFunctor

  67. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  68. def iterateUntil[A](f: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A])(p: (A) ⇒ Boolean): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]

    Definition Classes
    Monad

  69. def iterateWhile[A](f: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A])(p: (A) ⇒ Boolean): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]

    Definition Classes
    Monad

  70. def join[A](ffa: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]

    Definition Classes
    Bind

  71. def lift[A, B](f: (A) ⇒ B): (Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]) ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B]

    Definition Classes
    Functor

  72. def lift10[A, B, C, D, E, FF, G, H, I, J, R](f: (A, B, C, D, E, FF, G, H, I, J) ⇒ R): (Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, FF], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, H], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, I], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, J]) ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  73. def lift11[A, B, C, D, E, FF, G, H, I, J, K, R](f: (A, B, C, D, E, FF, G, H, I, J, K) ⇒ R): (Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, FF], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, H], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, I], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, J], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, K]) ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  74. def lift12[A, B, C, D, E, FF, G, H, I, J, K, L, R](f: (A, B, C, D, E, FF, G, H, I, J, K, L) ⇒ R): (Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, FF], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, H], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, I], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, J], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, K], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, L]) ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  75. def lift2[A, B, C](f: (A, B) ⇒ C): (Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B]) ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C]

    Definition Classes
    Apply

  76. def lift3[A, B, C, D](f: (A, B, C) ⇒ D): (Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C]) ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D]

    Definition Classes
    Apply

  77. def lift4[A, B, C, D, E](f: (A, B, C, D) ⇒ E): (Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D]) ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E]

    Definition Classes
    Apply

  78. def lift5[A, B, C, D, E, R](f: (A, B, C, D, E) ⇒ R): (Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E]) ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  79. def lift6[A, B, C, D, E, FF, R](f: (A, B, C, D, E, FF) ⇒ R): (Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, FF]) ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  80. def lift7[A, B, C, D, E, FF, G, R](f: (A, B, C, D, E, FF, G) ⇒ R): (Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, FF], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G]) ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  81. def lift8[A, B, C, D, E, FF, G, H, R](f: (A, B, C, D, E, FF, G, H) ⇒ R): (Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, FF], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, H]) ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  82. def lift9[A, B, C, D, E, FF, G, H, I, R](f: (A, B, C, D, E, FF, G, H, I) ⇒ R): (Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, FF], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, H], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, I]) ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, R]

    Definition Classes
    Apply

  83. def listen[A](fa: AwsAction[R, W, A]): AwsAction[R, W, (A, W)]

    Definition Classes
    AwsActionMonad → MonadListen

  84. def local[A](f: (R) ⇒ R)(fa: AwsAction[R, W, A]): AwsAction[R, W, A]

    Definition Classes
    AwsActionMonad → MonadReader

  85. def many[A](a: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, List[A]]

    Definition Classes
    ApplicativePlus

  86. def map[A, B](fa: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A])(f: (A) ⇒ B): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B]

    Definition Classes
    Monad → Applicative → Functor

  87. def mapply[A, B](a: A)(f: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A) ⇒ B]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B]

    Definition Classes
    Functor

  88. def monadErrorLaw: MonadErrorLaw

    Definition Classes
    MonadError

  89. val monadErrorSyntax: MonadErrorSyntax[[γ, δ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], γ, γ], R, δ], Invalid]

    Definition Classes
    MonadError

  90. def monadLaw: MonadLaw

    Definition Classes
    Monad

  91. val monadListenSyntax: MonadListenSyntax[[β, γ]Kleisli[[γ]EitherT[[β]WriterT[Future, β, β], Invalid, γ], R, γ], W]

    Definition Classes
    MonadListen

  92. def monadPlusLaw: MonadPlusLaw

    Definition Classes
    MonadPlus

  93. val monadPlusSyntax: MonadPlusSyntax[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

    Definition Classes
    MonadPlus

  94. val monadSyntax: MonadSyntax[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

    Definition Classes
    Monad

  95. val monadTellSyntax: MonadTellSyntax[[β, γ]Kleisli[[γ]EitherT[[β]WriterT[Future, β, β], Invalid, γ], R, γ], W]

    Definition Classes
    MonadTell

  96. def monoid[A]: Monoid[Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]]

    Definition Classes
    PlusEmpty

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

    Definition Classes
    AnyRef

  98. final def notify(): Unit

    Definition Classes
    AnyRef

  99. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  100. def pass[A](ma: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A, (W) ⇒ W)]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]

    Definition Classes
    MonadListen

  101. def plus[A](f1: AwsAction[R, W, A], f2: ⇒ AwsAction[R, W, A]): AwsAction[R, W, A]

    Definition Classes
    AwsActionMonad → Plus

  102. def plusEmptyLaw: EmptyLaw

    Definition Classes
    PlusEmpty

  103. val plusEmptySyntax: PlusEmptySyntax[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

    Definition Classes
    PlusEmpty

  104. def plusLaw: PlusLaw

    Definition Classes
    Plus

  105. val plusSyntax: PlusSyntax[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

    Definition Classes
    Plus

  106. def point[A](a: ⇒ A): AwsAction[R, W, A]

    Definition Classes
    AwsActionMonad → Applicative

  107. def product[G[_]](implicit G0: ApplicativePlus[G]): ApplicativePlus[[α](Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, α], G[α])]

    Definition Classes
    ApplicativePlus

  108. def product[G[_]](implicit G0: PlusEmpty[G]): PlusEmpty[[α](Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, α], G[α])]

    Definition Classes
    PlusEmpty

  109. def product[G[_]](implicit G0: Plus[G]): Plus[[α](Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, α], G[α])]

    Definition Classes
    Plus

  110. def product[G[_]](implicit G0: Applicative[G]): Applicative[[α](Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, α], G[α])]

    Definition Classes
    Applicative

  111. def product[G[_]](implicit G0: Apply[G]): Apply[[α](Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, α], G[α])]

    Definition Classes
    Apply

  112. def product[G[_]](implicit G0: Functor[G]): Functor[[α](Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, α], G[α])]

    Definition Classes
    Functor

  113. final def pure[A](a: ⇒ A): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]

    Definition Classes
    Applicative

  114. def raiseError[A](e: Invalid): AwsAction[R, W, A]

    Definition Classes
    AwsActionMonad → MonadError

  115. def replicateM[A](n: Int, fa: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, List[A]]

    Definition Classes
    Applicative

  116. def replicateM_[A](n: Int, fa: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, Unit]

    Definition Classes
    Applicative

  117. def scope[A](k: R)(fa: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]

    Definition Classes
    MonadReader

  118. def semigroup[A]: Semigroup[Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]]

    Definition Classes
    Plus

  119. def separate[G[_, _], A, B](value: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G[A, B]])(implicit G: Bifoldable[G]): (Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B])

    Definition Classes
    MonadPlus

  120. def sequence[A, G[_]](as: G[Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]])(implicit arg0: Traverse[G]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G[A]]

    Definition Classes
    Applicative

  121. def sequence1[A, G[_]](as: G[Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]])(implicit arg0: Traverse1[G]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G[A]]

    Definition Classes
    Apply

  122. def some[A](a: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, List[A]]

    Definition Classes
    ApplicativePlus

  123. def strengthL[A, B](a: A, f: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A, B)]

    Definition Classes
    Functor

  124. def strengthR[A, B](f: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], b: B): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A, B)]

    Definition Classes
    Functor

  125. def strongMonadPlusLaw: StrongMonadPlusLaw

    Definition Classes
    MonadPlus

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

    Definition Classes
    AnyRef

  127. def tell(w: W): AwsAction[R, W, Unit]

    Definition Classes
    AwsActionMonad → MonadTell

  128. def toString(): String

    Definition Classes
    AnyRef → Any

  129. def traverse[A, G[_], B](value: G[A])(f: (A) ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B])(implicit G: Traverse[G]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G[B]]

    Definition Classes
    Applicative

  130. def traverse1[A, G[_], B](value: G[A])(f: (A) ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B])(implicit G: Traverse1[G]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G[B]]

    Definition Classes
    Apply

  131. def tuple2[A, B](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A, B)]

    Definition Classes
    Apply

  132. def tuple3[A, B, C](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A, B, C)]

    Definition Classes
    Apply

  133. def tuple4[A, B, C, D](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], fd: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A, B, C, D)]

    Definition Classes
    Apply

  134. def tuple5[A, B, C, D, E](fa: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], fb: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B], fc: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, C], fd: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, D], fe: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, E]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, (A, B, C, D, E)]

    Definition Classes
    Apply

  135. def unite[T[_], A](value: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, T[A]])(implicit T: Foldable[T]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]

    Definition Classes
    MonadPlus

  136. final def uniteU[T](value: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, T])(implicit T: Unapply[Foldable, T]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]

    Definition Classes
    MonadPlus

  137. def unlessM[A](cond: Boolean)(f: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, Unit]

    Definition Classes
    Applicative

  138. def untilM[G[_], A](f: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], cond: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, Boolean])(implicit G: MonadPlus[G]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G[A]]

    Definition Classes
    Monad

  139. def untilM_[A](f: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], cond: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, Boolean]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, Unit]

    Definition Classes
    Monad

  140. def void[A](fa: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, Unit]

    Definition Classes
    Functor

  141. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  144. def whenM[A](cond: Boolean)(f: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, Unit]

    Definition Classes
    Applicative

  145. def whileM[G[_], A](p: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, Boolean], body: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A])(implicit G: MonadPlus[G]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, G[A]]

    Definition Classes
    Monad

  146. def whileM_[A](p: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, Boolean], body: ⇒ Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, Unit]

    Definition Classes
    Monad

  147. def writer[A](w: W, v: A): AwsAction[R, W, A]

    Definition Classes
    AwsActionMonad → MonadTell

  148. def xmap[A, B](fa: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A], f: (A) ⇒ B, g: (B) ⇒ A): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B]

    Definition Classes
    Functor → InvariantFunctor

  149. def xmapb[A, B](ma: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A])(b: scalaz.BijectionT.Bijection[A, B]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B]

    Definition Classes
    InvariantFunctor

  150. def xmapi[A, B](ma: Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, A])(iso: scalaz.Isomorphism.<=>[A, B]): Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, B]

    Definition Classes
    InvariantFunctor

Deprecated Value Members

  1. def zip: Zip[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

    Definition Classes
    Apply
    Annotations
    @deprecated
    Deprecated

    (Since version 7.1.0) Apply#zip produces unlawful instances

Inherited from MonadError[[γ, δ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], γ, γ], R, δ], Invalid]

Inherited from MonadPlus[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

Inherited from ApplicativePlus[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

Inherited from PlusEmpty[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

Inherited from Plus[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

Inherited from MonadListen[[β, γ]Kleisli[[γ]EitherT[[β]WriterT[Future, β, β], Invalid, γ], R, γ], W]

Inherited from MonadTell[[β, γ]Kleisli[[γ]EitherT[[β]WriterT[Future, β, β], Invalid, γ], R, γ], W]

Inherited from MonadReader[[α, γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], α, γ], R]

Inherited from Monad[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

Inherited from Bind[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

Inherited from Applicative[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

Inherited from Apply[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

Inherited from Functor[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

Inherited from InvariantFunctor[[γ]Kleisli[[γ]EitherT[[β]WriterT[Future, W, β], Invalid, γ], R, γ]]

Inherited from AnyRef

Inherited from Any

Ungrouped