Positive

libretto.CoreLib.SignalingJunction$.Positive$
See thePositive companion trait
object Positive

Attributes

Companion:
trait
Graph
Supertypes
class Object
trait Matchable
class Any
Self type

Members list

Concise view

Value members

Concrete methods

def both[A, B](implicit A: Positive[A], B: Positive[B]): Positive[A |*| B]
def byFst[A, B](implicit A: Positive[A]): Positive[A |*| B]
def bySnd[A, B](implicit B: Positive[B]): Positive[A |*| B]
def eitherNeg[A, B](implicit A: Negative[A], B: Negative[B]): Positive[A |+| B]

Signals when the |+| is decided, awaiting delays (the publication of) the decision and then is delegated to the respective side, which awaits an inversion of the original signal.

Signals when the |+| is decided, awaiting delays (the publication of) the decision and then is delegated to the respective side, which awaits an inversion of the original signal.

Attributes

def eitherPos[A, B](implicit A: Positive[A], B: Positive[B]): Positive[A |+| B]

Signals when the |+| is decided, awaiting delays (the publication of) the decision and thed is delegated to the respective side.

Signals when the |+| is decided, awaiting delays (the publication of) the decision and thed is delegated to the respective side.

Attributes

def from[A](s: Positive[A], j: Positive[A]): Positive[A]
def rec[F[_]](implicit F: Positive[F[Rec[F]]]): Positive[Rec[F]]
def rec[F[_]](implicit F: ForAll[[x] =>> Positive[F[x]]]): Positive[Rec[F]]
def rec[F[_]](f: Positive[Rec[F]] => Positive[F[Rec[F]]], g: Positive[Rec[F]] => Positive[F[Rec[F]]]): Positive[Rec[F]]

Implicits