Class/Object

io.atlassian.aws

AwsActionMonad

Related Docs: object AwsActionMonad | package aws

Permalink

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
Visibility
  1. Public
  2. All

Instance Constructors

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

    Permalink

Type Members

  1. trait ApplicativeLaw extends scalaz.Applicative.ApplyLaw

    Permalink
    Definition Classes
    Applicative

  2. trait ApplyLaw extends scalaz.Apply.FunctorLaw

    Permalink
    Definition Classes
    Apply

  3. trait BindLaw extends scalaz.Bind.ApplyLaw

    Permalink
    Definition Classes
    Bind

  4. trait EmptyLaw extends scalaz.PlusEmpty.PlusLaw

    Permalink
    Definition Classes
    PlusEmpty

  5. trait FunctorLaw extends scalaz.Functor.InvariantFunctorLaw

    Permalink
    Definition Classes
    Functor

  6. trait InvariantFunctorLaw extends AnyRef

    Permalink
    Definition Classes
    InvariantFunctor

  7. trait MonadErrorLaw extends AnyRef

    Permalink
    Definition Classes
    MonadError

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    MonadPlus

  10. trait PlusLaw extends AnyRef

    Permalink
    Definition Classes
    Plus

  11. trait StrongMonadPlusLaw extends MonadPlusLaw

    Permalink
    Definition Classes
    MonadPlus

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    Bind → Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

  13. def applicativeLaw: ApplicativeLaw

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    ApplicativePlus

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Applicative → Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

  29. def applyLaw: ApplyLaw

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

  31. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AwsActionMonad → MonadReader

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

    Permalink
    Definition Classes
    MonadReader

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    AwsActionMonad → Bind

  36. def bindLaw: BindLaw

    Permalink
    Definition Classes
    Bind

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

    Permalink
    Definition Classes
    Bind

  38. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    ApplicativePlus

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

    Permalink
    Definition Classes
    PlusEmpty

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

    Permalink
    Definition Classes
    Plus

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    AwsActionMonad → PlusEmpty

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

    Permalink
    Definition Classes
    AnyRef

  48. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    MonadPlus

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

    Permalink
    Definition Classes
    Applicative

  51. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Bind

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

    Permalink
    Definition Classes
    Functor

  55. 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)]

    Permalink
    Definition Classes
    Functor

  56. def functorLaw: FunctorLaw

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AwsActionMonad → MonadError

  60. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Bind

  63. def invariantFunctorLaw: InvariantFunctorLaw

    Permalink
    Definition Classes
    InvariantFunctor

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

    Permalink
    Definition Classes
    InvariantFunctor

  65. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Bind

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    AwsActionMonad → MonadListen

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

    Permalink
    Definition Classes
    AwsActionMonad → MonadReader

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

    Permalink
    Definition Classes
    ApplicativePlus

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

    Permalink
    Definition Classes
    Monad → Applicative → Functor

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

    Permalink
    Definition Classes
    Functor

  86. def monadErrorLaw: MonadErrorLaw

    Permalink
    Definition Classes
    MonadError

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

    Permalink
    Definition Classes
    MonadError

  88. def monadLaw: MonadLaw

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    MonadListen

  90. def monadPlusLaw: MonadPlusLaw

    Permalink
    Definition Classes
    MonadPlus

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

    Permalink
    Definition Classes
    MonadPlus

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    MonadTell

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

    Permalink
    Definition Classes
    PlusEmpty

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

    Permalink
    Definition Classes
    AnyRef

  96. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  97. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    MonadListen

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

    Permalink
    Definition Classes
    AwsActionMonad → Plus

  100. def plusEmptyLaw: EmptyLaw

    Permalink
    Definition Classes
    PlusEmpty

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

    Permalink
    Definition Classes
    PlusEmpty

  102. def plusLaw: PlusLaw

    Permalink
    Definition Classes
    Plus

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

    Permalink
    Definition Classes
    Plus

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

    Permalink
    Definition Classes
    AwsActionMonad → Applicative

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

    Permalink
    Definition Classes
    ApplicativePlus

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

    Permalink
    Definition Classes
    PlusEmpty

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

    Permalink
    Definition Classes
    Plus

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    AwsActionMonad → MonadError

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    MonadReader

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

    Permalink
    Definition Classes
    Plus

  117. 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])

    Permalink
    Definition Classes
    MonadPlus

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    ApplicativePlus

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

    Permalink
    Definition Classes
    Functor

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

    Permalink
    Definition Classes
    Functor

  123. def strongMonadPlusLaw: StrongMonadPlusLaw

    Permalink
    Definition Classes
    MonadPlus

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

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AwsActionMonad → MonadTell

  126. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Apply

  129. 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)]

    Permalink
    Definition Classes
    Apply

  130. 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)]

    Permalink
    Definition Classes
    Apply

  131. 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)]

    Permalink
    Definition Classes
    Apply

  132. 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)]

    Permalink
    Definition Classes
    Apply

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

    Permalink
    Definition Classes
    MonadPlus

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

    Permalink
    Definition Classes
    MonadPlus

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Functor

  139. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    Applicative

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    Monad

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

    Permalink
    Definition Classes
    AwsActionMonad → MonadTell

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

    Permalink
    Definition Classes
    Functor → InvariantFunctor

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

    Permalink
    Definition Classes
    InvariantFunctor

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

    Permalink
    Definition Classes
    InvariantFunctor

Deprecated Value Members

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

    Permalink
    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