pureharm-effects-cats/busymachines.pureharm.effects.aliases/CatsAliases

CatsAliases

trait CatsAliases
class Object
trait Matchable
class Any

Type members

Types

final type Always[A] = Always[A]
final type Applicative[F[_]] = Applicative[F]
final type ApplicativeError[F[_], E] = ApplicativeError[F, E]
final type ApplicativeThrow[F[_]] = ApplicativeThrow[F]
final type Apply[F[_]] = Apply[F]
final type Bitraverse[F[_, _]] = Bitraverse[F]
final type Chain[+A] = Chain[A]
final type CoflatMap[F[_]] = CoflatMap[F]
final type Comparison = Comparison
final type EitherT[F[_], L, R] = EitherT[F, L, R]
final type Endo[T] = () => T
final type Eq[A] = Eq[A]
final type Eval[+A] = Eval[A]
final type FlatMap[F[_]] = FlatMap[F]
final type Functor[F[_]] = Functor[F]
final type Group[A] = Group[A]
final type Hash[A] = Hash[A]
final type Kleisli[F[_], A, B] = Kleisli[F, A, B]
final type Later[A] = Later[A]
final type Monad[F[_]] = Monad[F]
final type MonadError[F[_], E] = MonadError[F, E]
final type MonadThrow[F[_]] = MonadThrow[F]
final type Monoid[A] = Monoid[A]
final type NEChain[+A] = Type[A]
final type NEList[+A] = NonEmptyList[A]
final type NEMap[K, +A] = Type[K, A]
final type NESet[A] = Type[A]
final type NonEmptyChain[+A] = Type[A]
final type NonEmptyList[+A] = NonEmptyList[A]
final type NonEmptyMap[K, +A] = Type[K, A]
final type NonEmptyParallel[F[_]] = NonEmptyParallel[F]
final type NonEmptySet[A] = Type[A]
final type NonEmptyTraverse[F[_]] = NonEmptyTraverse[F]
final type Now[A] = Now[A]
final type OptionT[F[_], A] = OptionT[F, A]
final type Order[A] = Order[A]
final type Parallel[F[_]] = Parallel[F]
final type PartialOrder[A] = PartialOrder[A]
final type Reader[A, B] = Reader[A, B]
final type ReaderT[F[_], A, B] = Kleisli[F, A, B]
final type Semigroupal[F[_]] = Semigroupal[F]
final type Show[T] = Show[T]
final type Traverse[F[_]] = Traverse[F]
final type TraverseFilter[F[_]] = TraverseFilter[F]
final type UnorderedTraverse[F[_]] = UnorderedTraverse[F]

Value members

Concrete fields

final val Always: Always
final val Applicative: Applicative
final val ApplicativeError: ApplicativeError
final val ApplicativeThrow: ApplicativeThrow
final val Apply: Apply
final val Bitraverse: Bitraverse
final val Chain: Chain
final val CoflatMap: CoflatMap
final val Comparison: Comparison
final val EitherT: EitherT
final val Eq: Eq
final val Eval: Eval
final val FlatMap: FlatMap
final val Functor: Functor
final val Group: Group
final val Hash: Hash
final val Kleisli: Kleisli
final val Later: Later
final val Monad: Monad
final val MonadError: MonadError
final val MonadThrow: MonadThrow
final val Monoid: Monoid
final val NEChain: NonEmptyChainImpl
final val NEList: NonEmptyList
final val NEMap: NonEmptyMapImpl
final val NESet: NonEmptySetImpl
final val NonEmptyChain: NonEmptyChainImpl
final val NonEmptyList: NonEmptyList
final val NonEmptyMap: NonEmptyMapImpl
final val NonEmptyParallel: NonEmptyParallel
final val NonEmptySet: NonEmptySetImpl
final val NonEmptyTraverse: NonEmptyTraverse
final val Now: Now
final val OptionT: OptionT
final val Order: Order
final val Parallel: Parallel
final val PartialOrder: PartialOrder
final val Reader: Reader
final val ReaderT: Kleisli
final val Semigroupal: Semigroupal
final val Show: Show
final val Traverse: Traverse
final val TraverseFilter: TraverseFilter
final val UnorderedTraverse: UnorderedTraverse