Type Members

1.  final type Axn[+A] = Rxn[Any, A]

   The description of an effect, which (when executed), results in a value of type A; during execution, it may update any number of Refs atomically (and it may also create new Refs).

   The description of an effect, which (when executed), results in a value of type A; during execution, it may update any number of Refs atomically (and it may also create new Refs).

   This type forms a Monad. However, when composing these kinds of effects, also consider using Rxn and >>> or *> instead of flatMap.

   The relation between Axn and Rxn is approximately Axn[A] ≡ Rxn[Any, A]; or, alternatively Rxn[A, B] ≡ (A => Axn[B]) (see toFunction).

2.  sealed trait Exchanger[A, B] extends AnyRef
3.  trait Reactive[F[_]] extends ~>[Axn, F]
4.  sealed abstract class RetryStrategy extends Product with Serializable
5.  sealed abstract class Rxn[-A, +B] extends AnyRef

   An effectful function from A to B; when executed, it may update any number of Refs atomically.

   An effectful function from A to B; when executed, it may update any number of Refs atomically. (It may also create new Refs.)

   These functions are composable (see below), and composition preserves their atomicity. That is, all affected Refs will be updated atomically.

   A Rxn forms an Arrow (more specifically, an ArrowChoice). It also forms a Monad in B; however, consider using the arrow combinators (when possible) instead of flatMap (since a static combination of Rxns may be more performant).

   The relation between Rxn and Axn is approximately Rxn[A, B] ≡ (A => Axn[B]); or, alternatively Axn[A] ≡ Rxn[Any, A].