CoreDSL
Attributes
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Known subtypes
Members list
Type members
Classlikes
Attributes
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Known subtypes
- trait FunExprOps
Attributes
- Companion:
- object
- Graph
- Supertypes
Attributes
- Companion:
- trait
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Self type
- Cosemigroup.type
Attributes
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Known subtypes
- trait LambdaOpsWithClosures
Types
Libretto arrow, also called a ''component'' or a ''linear function''.
Libretto arrow, also called a ''component'' or a ''linear function''.
┏━━━━━━━━━━┓
┞───┐ ┞───┐
╎ A │ ╎ B │
┟───┘ ┟───┘
┗━━━━━━━━━━┛
In A -⚬ B
, we say that the ''in-port'' is of type A
and the ''out-port'' is of type B
.
Note that the distinction between the in-port and the out-port is only formal. Information or resources
may flow in and out through both the in-port and the out-port.
"Linear" means that each input is ''consumed'' exactly once, in particular, it cannot be ignored or used twice.
Attributes
Signal that travels in the direction of -⚬, i.e. the positive direction. It may signal completion of a (potentially effectful) computation. It cannot be ignored. (If this signal was the only handle to an (effectful) computation, ignoring it would mean losing track of that computation, which is considered to be a resource leak.)
Signal that travels in the direction of -⚬, i.e. the positive direction. It may signal completion of a (potentially effectful) computation. It cannot be ignored. (If this signal was the only handle to an (effectful) computation, ignoring it would mean losing track of that computation, which is considered to be a resource leak.)
Attributes
Signal that travels in the direction opposite to -⚬, i.e. the negative direction. It may signal completion of a (potentially effectful) computation. It cannot be ignored. (If this signal was the only handle to an (effectful) computation, ignoring it would mean losing track of that computation, which is considered to be a resource leak.)
Signal that travels in the direction opposite to -⚬, i.e. the negative direction. It may signal completion of a (potentially effectful) computation. It cannot be ignored. (If this signal was the only handle to an (effectful) computation, ignoring it would mean losing track of that computation, which is considered to be a resource leak.)
Attributes
Signal that travels in the direction opposite to -⚬, i.e. the negative direction. Unlike Need, it cannot be the only handle to an effectful computation. As such, it can be ignored, e.g. as the losing contestant in selectPair.
Signal that travels in the direction opposite to -⚬, i.e. the negative direction. Unlike Need, it cannot be the only handle to an effectful computation. As such, it can be ignored, e.g. as the losing contestant in selectPair.
Attributes
Choice between A
and B
.
The consumer chooses whether to get A
or B
(but can get only one of them).
The producer has to be ready to provide either of them.
Choice between A
and B
.
The consumer chooses whether to get A
or B
(but can get only one of them).
The producer has to be ready to provide either of them.
Attributes
Concurrent pair. Also called a ''tensor product'' or simply ''times''.
Concurrent pair. Also called a ''tensor product'' or simply ''times''.
Attributes
Either A
or B
. Analogous to scala.Either.
Whether it is going to be A
or B
is decided by the producer.
The consumer has to be ready to handle either of the two cases.
Either A
or B
. Analogous to scala.Either.
Whether it is going to be A
or B
is decided by the producer.
The consumer has to be ready to handle either of the two cases.
Attributes
Value members
Abstract methods
Signals (in the negative direction) when it is known which side of the choice (A |&| B
) has been chosen.
Signals (in the negative direction) when it is known which side of the choice (A |&| B
) has been chosen.
Attributes
Signals when it is decided whether A |+| B
actually contains the left side or the right side.
Signals when it is decided whether A |+| B
actually contains the left side or the right side.
Attributes
Hides one level of a recursive type definition.
Hides one level of a recursive type definition.
Attributes
Races the two Ping signals. Produces left if the first signal wins and right if the second signal wins. It is biased to the left: if both signals have arrived by the time of inquiry, returns left.
Races the two Ping signals. Produces left if the first signal wins and right if the second signal wins. It is biased to the left: if both signals have arrived by the time of inquiry, returns left.
Attributes
Races the two Pong signals (traveling from right to left). Chooses left if the first signal wins and right if the second signal wins. It is biased to the left: if both signals have arrived by the time of inquiry, chooses left.
Races the two Pong signals (traveling from right to left). Chooses left if the first signal wins and right if the second signal wins. It is biased to the left: if both signals have arrived by the time of inquiry, chooses left.
Attributes
Concrete methods
Factor out the factor A
on the left of both summands.
Factor out the factor A
on the left of both summands.
Attributes
Factor out the factor C
on the right of both summands.
Factor out the factor C
on the right of both summands.