FreeScaletto

libretto.scaletto.impl.FreeScaletto$
See theFreeScaletto companion class
object FreeScaletto extends FreeScaletto with Scaletto

Attributes

Companion:
class
Graph
Supertypes
trait Scaletto
trait InvertDSL
trait ClosedDSL
trait CrashDSL
trait TimerDSL
trait CoreDSL
class Object
trait Matchable
class Any
Self type

Members list

Concise view

Type members

Classlikes

override class NotLinearException(msg: String) extends Exception

Attributes

Graph
Supertypes
class Exception
class Throwable
trait Serializable
class Object
trait Matchable
class Any
override class UnboundVariablesException(vs: Set[Var[VarOrigin, _]]) extends Exception

Attributes

Graph
Supertypes
class Exception
class Throwable
trait Serializable
class Object
trait Matchable
class Any

Inherited classlikes

trait $Ops

Attributes

Inherited from:
CoreDSL
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
final class -[A]

Attributes

Inherited from:
FreeScaletto
Graph
Supertypes
class Object
trait Matchable
class Any
object -⚬

Attributes

Inherited from:
FreeScaletto
Graph
Supertypes
trait Sum
trait Mirror
class Object
trait Matchable
class Any
sealed trait -⚬[A, B]

Attributes

Inherited from:
FreeScaletto
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class Acquire[A, R, B]
class AndThen[A, B, C]
class AssocLR[A, B, C]
class AssocRL[A, B, C]
class Backvert[A]
class Blocking[A, B]
class Choice[A, B, C]
class ChooseL[A, B]
class ChooseLOnPong[A, B]
class ChooseR[A, B]
class CoDistributeL[A, B, C]
class ConstNeg[A]
class ConstVal[A]
class CrashWhenDone[A, B]
class Delay
class DistributeL[A, B, C]
class EffectAsync[R, A, B]
class EffectWrAsync[R, A]
class EitherF[A, B, C]
class ElimFst[B]
class ElimSnd[A]
class FactorOutInversion[A, B]
class Forevert[A]
class Fork
class ForkNeed
class ForkPing
class ForkPong
class Id[A]
class InjectL[A, B]
class InjectLOnPing[A, B]
class InjectR[A, B]
class IntroFst[B]
class IntroSnd[A]
class Join
class JoinNeed
class JoinPing
class JoinPong
class LiftEither[A, B]
class LiftPair[A, B]
class MapVal[A, B]
class Neglect[A]
class NotifyChoice[A, B]
class NotifyEither[A, B]
class NotifyNeg[A]
class NotifyVal[A]
class Pack[F]
class Par[A, B, C, D]
class PingF
class PongF
class RacePair
class RecF[A, B]
class Release[R]
class ReleaseAsync[R, A, B]
class Swap[A, B]
class TryAcquireAsync[A, R, B, E]
class TrySplitResourceAsync[R, A, S, T, B, E]
class TryTransformResourceAsync[R, A, S, B, E]
class UnliftPair[A, B]
class Unpack[F]
object Affine

Attributes

Inherited from:
CoreDSL
Graph
Supertypes
class Object
trait Matchable
class Any
trait Affine[A]

Attributes

Inherited from:
CoreDSL
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait Comonoid[A]

Attributes

Inherited from:
ClosedDSL
Graph
Supertypes
class Object
trait Matchable
class Any
object Comonoid

Attributes

Inherited from:
CoreDSL
Graph
Supertypes
class Object
trait Matchable
class Any
trait Comonoid[A] extends Cosemigroup[A] with Affine[A]

Attributes

Inherited from:
CoreDSL
Graph
Supertypes
trait Affine[A]
trait Cosemigroup[A]
class Object
trait Matchable
class Any

Attributes

Inherited from:
CoreDSL
Graph
Supertypes
class Object
trait Matchable
class Any
trait Cosemigroup[A]

Attributes

Inherited from:
CoreDSL
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait Comonoid[A]
trait NComonoid[A]
trait PComonoid[A]
implicit class DemandExprOps[B](expr: $[-[B]])

Attributes

Inherited from:
InvertDSL
Graph
Supertypes
class Object
trait Matchable
class Any
final class Done

Attributes

Inherited from:
FreeScaletto
Graph
Supertypes
class Object
trait Matchable
class Any
trait FunExprOps extends $Ops

Attributes

Inherited from:
ClosedDSL
Graph
Supertypes
trait $Ops
class Object
trait Matchable
class Any
final class LTerminus

Attributes

Inherited from:
FreeScaletto
Graph
Supertypes
class Object
trait Matchable
class Any
trait LambdaOps

Attributes

Inherited from:
CoreDSL
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes

Attributes

Inherited from:
ClosedDSL
Graph
Supertypes
trait LambdaOps
class Object
trait Matchable
class Any
final class Need

Attributes

Inherited from:
FreeScaletto
Graph
Supertypes
class Object
trait Matchable
class Any
final class One

Attributes

Inherited from:
FreeScaletto
Graph
Supertypes
class Object
trait Matchable
class Any
final class Ping

Attributes

Inherited from:
FreeScaletto
Graph
Supertypes
class Object
trait Matchable
class Any
final class Pong

Attributes

Inherited from:
FreeScaletto
Graph
Supertypes
class Object
trait Matchable
class Any
final class RTerminus

Attributes

Inherited from:
FreeScaletto
Graph
Supertypes
class Object
trait Matchable
class Any
final class Rec[F[_]]

Attributes

Inherited from:
FreeScaletto
Graph
Supertypes
class Object
trait Matchable
class Any
final class Res[A]

Attributes

Inherited from:
FreeScaletto
Graph
Supertypes
class Object
trait Matchable
class Any
final class Val[A]

Attributes

Inherited from:
FreeScaletto
Graph
Supertypes
class Object
trait Matchable
class Any
final class |&|[A, B]

Attributes

Inherited from:
FreeScaletto
Graph
Supertypes
class Object
trait Matchable
class Any
final class |*|[A, B]

Attributes

Inherited from:
FreeScaletto
Graph
Supertypes
class Object
trait Matchable
class Any
final class |+|[A, B]

Attributes

Inherited from:
FreeScaletto
Graph
Supertypes
class Object
trait Matchable
class Any

Types

override type $[A] = Expr[A]

The type of auxiliary placeholder variables used in construction of λ-expressions.

The type of auxiliary placeholder variables used in construction of λ-expressions.

Attributes

override type ->[A, B] = A -⚬ B

Type of nested arrows.

Type of nested arrows.

Attributes

type Var[A] = Var[VarOrigin, A]

Inherited types

override type =⚬[A, B] = -[A] |*| B

Linear function as data, that is, one that can be part of an input or output of a linear function (-⚬). While A -⚬ B is a morphism in a category, A =⚬ B is an object called the internal hom of A and B in a closed monoidal category.

Linear function as data, that is, one that can be part of an input or output of a linear function (-⚬). While A -⚬ B is a morphism in a category, A =⚬ B is an object called the internal hom of A and B in a closed monoidal category.

Attributes

Inherited from:
InvertDSL
type Neg[A] = -[Val[A]]

Demand for a Scala value of type A.

Demand for a Scala value of type A.

Somewhat analogous to scala.concurrent.Promise

Attributes

Inherited from:
Scaletto
type NoCaptureException <: Throwable

Attributes

Inherited from:
ClosedDSL
type Zero

Impossible resource. Analogous to Nothing. It is the identity element for |+|.

Impossible resource. Analogous to Nothing. It is the identity element for |+|.

Attributes

Inherited from:
CoreDSL
type [A, B] = A |+| B

Alias for |+|.

Alias for |+|.

Attributes

Inherited from:
CoreDSL
type [A, B] = A |*| B

Alias for |*|.

Alias for |*|.

Attributes

Inherited from:
CoreDSL

Value members

Concrete methods

override def acquire[A, R, B](acquire: A => (R, B), release: Option[R => Unit]): Val[A] -⚬ Res[R] |*| Val[B]

Acquires a resource of type R.

Acquires a resource of type R.

Attributes

A

parameters of the acquire function

B

additional data produced by acquiring the resource

R

type of the resource

release

called to release the resource in case of a crash. None means no cleanup is needed

Definition Classes
override def andThen[A, B, C](f: A -⚬ B, g: B -⚬ C): A -⚬ C

Attributes

Definition Classes
override def assocLR[A, B, C]: A |*| B |*| C -⚬ A |*| B |*| C

Attributes

Definition Classes
override def assocRL[A, B, C]: A |*| B |*| C -⚬ A |*| B |*| C

Attributes

Definition Classes
override def backvert[A]: A |*| -[A] -⚬ One
 ┏━━━━━━━━━━━┓
 ┞────┐      ┃
 ╎  A │┄┄┐   ┃
 ┟────┘  ┆   ┃
 ┃       ┆   ┃
 ┞────┐  ┆   ┃
 ╎-[A]│←┄┘   ┃
 ┟────┘      ┃
 ┗━━━━━━━━━━━┛

Attributes

Definition Classes
override def blocking[A, B](f: A => B): Val[A] -⚬ Val[B]

Executes a potentially blocking operation. The implementation must ensure that the blocking operation does not impede any of the concurrently happening non-blocking computations.

Executes a potentially blocking operation. The implementation must ensure that the blocking operation does not impede any of the concurrently happening non-blocking computations.

Attributes

Definition Classes
override def choice[A, B, C](f: A -⚬ B, g: A -⚬ C): A -⚬ B |&| C

Attributes

Definition Classes
override def chooseL[A, B]: A |&| B -⚬ A

Attributes

Definition Classes
override def chooseLOnPong[A, B]: A |&| B -⚬ Pong |*| A

Attributes

Definition Classes
override def chooseR[A, B]: A |&| B -⚬ B

Attributes

Definition Classes
override def coDistributeL[A, B, C]: A |*| B |&| A |*| C -⚬ A |*| B |&| C

Inverse of coFactorL.

Inverse of coFactorL.

Attributes

Definition Classes
override def constNeg[A](a: A): Neg[A] -⚬ Need

Attributes

Definition Classes
override def constVal[A](a: A): Done -⚬ Val[A]

Attributes

Definition Classes
override def crashWhenDone[A, B](msg: String): Done |*| A -⚬ B

Starts propagating an error downstream (which might be through both the in-port and the out-port).

Starts propagating an error downstream (which might be through both the in-port and the out-port).

Use only for irrecoverable errors. Recoverable errors should be expressed in function signature and handled appropriately.

Done on the in-port is the trigger to crash. A on the in-port allows to consume any unhandled resources. B on the out-port allows to fulfill any obligation to produce resources.

Attributes

Definition Classes
override def debugPrint(msg: String): Ping -⚬ One

Prints the given message to the console, without creating an obligation to await.

Prints the given message to the console, without creating an obligation to await.

Attributes

Definition Classes
override def delay: Val[FiniteDuration] -⚬ Done

Attributes

Definition Classes

Attributes

Definition Classes
override def distributeInversion[A, B]: -[A |*| B] -⚬ -[A] |*| -[B]
 ┏━━━━━━━━━━━┓
 ┃           ┞────┐
 ┞────┐      ╎-[A]│
 ╎ ⎡A⎤│      ┟────┘
 ╎-⎢⊗⎥│      ┃
 ╎ ⎣B⎦│      ┞────┐
 ┟────┘      ╎-[B]│
 ┃           ┟────┘
 ┗━━━━━━━━━━━┛

Attributes

Definition Classes
override def distributeL[A, B, C]: A |*| B |+| C -⚬ A |*| B |+| A |*| C

Distribute the factor on the left into the summands on the right. Inverse of factorL.

Distribute the factor on the left into the summands on the right. Inverse of factorL.

Attributes

Definition Classes
override def effectAsync[R, A, B](f: (R, A) => Async[B]): Res[R] |*| Val[A] -⚬ Res[R] |*| Val[B]

Attributes

Definition Classes
override def effectWrAsync[R, A](f: (R, A) => Async[Unit]): Res[R] |*| Val[A] -⚬ Res[R]

Attributes

Definition Classes
override def either[A, B, C](f: A -⚬ C, g: B -⚬ C): A |+| B -⚬ C

Attributes

Definition Classes
override def elimFst[B]: One |*| B -⚬ B

Attributes

Definition Classes
override def elimSnd[A]: A |*| One -⚬ A

Attributes

Definition Classes
override def factorOutInversion[A, B]: -[A] |*| -[B] -⚬ -[A |*| B]
 ┏━━━━━━━━━━━┓
 ┞────┐      ┃
 ╎-[A]│      ┞────┐
 ┟────┘      ╎ ⎡A⎤│
 ┃           ╎-⎢⊗⎥│
 ┞────┐      ╎ ⎣B⎦│
 ╎-[B]│      ┟────┘
 ┟────┘      ┃
 ┗━━━━━━━━━━━┛

Attributes

Definition Classes
override def forevert[A]: One -⚬ -[A] |*| A
 ┏━━━━━━┓
 ┃      ┞────┐
 ┃   ┌┄┄╎-[A]│
 ┃   ┆  ┟────┘
 ┃   ┆  ┃
 ┃   ┆  ┞────┐
 ┃   └┄→╎  A │
 ┃      ┟────┘
 ┗━━━━━━┛

Attributes

Definition Classes
override def fork: Done -⚬ Done |*| Done

Attributes

Definition Classes
override def forkNeed: Need |*| Need -⚬ Need

Attributes

Definition Classes
override def forkPing: Ping -⚬ Ping |*| Ping

Attributes

Definition Classes
override def forkPong: Pong |*| Pong -⚬ Pong

Attributes

Definition Classes
override def id[A]: A -⚬ A

Attributes

Definition Classes
override def injectL[A, B]: A -⚬ A |+| B

Attributes

Definition Classes
override def injectLOnPing[A, B]: Ping |*| A -⚬ A |+| B

Attributes

Definition Classes
override def injectR[A, B]: B -⚬ A |+| B

Attributes

Definition Classes
override def introFst[B]: B -⚬ One |*| B

Attributes

Definition Classes
override def introSnd[A]: A -⚬ A |*| One

Attributes

Definition Classes
override def join: Done |*| Done -⚬ Done

Attributes

Definition Classes

Attributes

Definition Classes
override def joinNeed: Need -⚬ Need |*| Need

Attributes

Definition Classes
override def joinPing: Ping |*| Ping -⚬ Ping

Attributes

Definition Classes
override def joinPong: Pong -⚬ Pong |*| Pong

Attributes

Definition Classes

Attributes

Definition Classes

Attributes

Definition Classes

Reverses the Need signal (flowing in the negative direciton, i.e. against the -⚬ arrow) into a Done signal (flowing in the positive direction, i.e. along the -⚬ arrow).

Reverses the Need signal (flowing in the negative direciton, i.e. against the -⚬ arrow) into a Done signal (flowing in the positive direction, i.e. along the -⚬ arrow).

 ┏━━━━━━┓
 ┃      ┞────┐
 ┃   ┌┄┄╎Need│
 ┃   ┆  ┟────┘
 ┃   ┆  ┃
 ┃   ┆  ┞────┐
 ┃   └┄→╎Done│
 ┃      ┟────┘
 ┗━━━━━━┛

Attributes

Definition Classes

Attributes

Definition Classes
override def liftEither[A, B]: Val[Either[A, B]] -⚬ Val[A] |+| Val[B]

Attributes

Definition Classes
override def liftPair[A, B]: Val[(A, B)] -⚬ Val[A] |*| Val[B]

Attributes

Definition Classes
override def mapVal[A, B](f: A => B): Val[A] -⚬ Val[B]

Lifts an ordinary Scala function to a linear function on Vals.

Lifts an ordinary Scala function to a linear function on Vals.

Attributes

Definition Classes
override def neglect[A]: Val[A] -⚬ Done

Attributes

Definition Classes
override def notifyChoice[A, B]: Pong |*| A |&| B -⚬ A |&| B

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

Definition Classes

Attributes

Definition Classes
override def notifyEither[A, B]: A |+| B -⚬ Ping |*| A |+| B

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

Definition Classes

Attributes

Definition Classes
override def notifyNeg[A]: Pong |*| Neg[A] -⚬ Neg[A]

Attributes

Definition Classes
override def notifyVal[A]: Val[A] -⚬ Ping |*| Val[A]

Attributes

Definition Classes
override def pack[F[_]]: F[Rec[F]] -⚬ Rec[F]

Hides one level of a recursive type definition.

Hides one level of a recursive type definition.

Attributes

Definition Classes
override def par[A, B, C, D](f: A -⚬ B, g: C -⚬ D): A |*| C -⚬ B |*| D

Attributes

Definition Classes
override def ping: One -⚬ Ping

Attributes

Definition Classes
override def pong: Pong -⚬ One

Attributes

Definition Classes

Attributes

Definition Classes

Reverses the Done signal (flowing in the positive direction, i.e. along the -⚬ arrow) into a Need signal (flowing in the negative direciton, i.e. against the -⚬ arrow).

Reverses the Done signal (flowing in the positive direction, i.e. along the -⚬ arrow) into a Need signal (flowing in the negative direciton, i.e. against the -⚬ arrow).

 ┏━━━━━━━━━━━┓
 ┞────┐      ┃
 ╎Done│┄┄┐   ┃
 ┟────┘  ┆   ┃
 ┃       ┆   ┃
 ┞────┐  ┆   ┃
 ╎Need│←┄┘   ┃
 ┟────┘      ┃
 ┗━━━━━━━━━━━┛

Attributes

Definition Classes

Attributes

Definition Classes

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

Definition Classes
override def rec[A, B](f: A -⚬ B => A -⚬ B): A -⚬ B

Attributes

Definition Classes

Attributes

Definition Classes
override def release[R]: Res[R] -⚬ Done

Releases a resource using the release function registered during resource acquisition.

Releases a resource using the release function registered during resource acquisition.

Attributes

Definition Classes
override def releaseAsync[R, A, B](f: (R, A) => Async[B]): Res[R] |*| Val[A] -⚬ Val[B]

Attributes

Definition Classes

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

Definition Classes

Attributes

Definition Classes

Attributes

Definition Classes
override def swap[A, B]: A |*| B -⚬ B |*| A

Attributes

Definition Classes
override def tryAcquireAsync[A, R, B, E](acquire: A => Async[Either[E, (R, B)]], release: Option[R => Async[Unit]]): Val[A] -⚬ Val[E] |+| Res[R] |*| Val[B]

Attributes

Definition Classes
override def trySplitResourceAsync[R, A, S, T, B, E](f: (R, A) => Async[Either[E, (S, T, B)]], release1: Option[S => Async[Unit]], release2: Option[T => Async[Unit]]): Res[R] |*| Val[A] -⚬ Val[E] |+| Res[S] |*| Res[T] |*| Val[B]

Attributes

Definition Classes
override def tryTransformResourceAsync[R, A, S, B, E](f: (R, A) => Async[Either[E, (S, B)]], release: Option[S => Async[Unit]]): Res[R] |*| Val[A] -⚬ Val[E] |+| Res[S] |*| Val[B]

Attributes

Definition Classes
override def unliftPair[A, B]: Val[A] |*| Val[B] -⚬ Val[(A, B)]

Attributes

Definition Classes
override def unpack[F[_]]: Rec[F] -⚬ F[Rec[F]]

Unpacks one level of a recursive type definition.

Unpacks one level of a recursive type definition.

Attributes

Definition Classes

Inherited methods

def acquireAsync[A, R, B](acquire: A => Async[(R, B)], release: Option[R => Async[Unit]]): Val[A] -⚬ Res[R] |*| Val[B]

Attributes

Inherited from:
Scaletto
def chooseROnPong[A, B]: A |&| B -⚬ Pong |*| B

Attributes

Inherited from:
CoreDSL
def coDistributeR[A, B, C]: A |*| C |&| B |*| C -⚬ A |&| B |*| C

Inverse of coFactorR.

Inverse of coFactorR.

Attributes

Inherited from:
CoreDSL
def coFactorL[A, B, C]: A |*| B |&| C -⚬ A |*| B |&| A |*| C

Attributes

Inherited from:
CoreDSL
def coFactorR[A, B, C]: A |&| B |*| C -⚬ A |*| C |&| B |*| C

Attributes

Inherited from:
CoreDSL
def contramapNeg[A, B](f: A => B): Neg[B] -⚬ Neg[A]

Lifts an ordinary Scala function to a linear function on demands, in opposite direction.

Lifts an ordinary Scala function to a linear function on demands, in opposite direction.

Attributes

Inherited from:
Scaletto
def contrapositive[A, B](f: A -⚬ B): -[B] -⚬ -[A]

Attributes

Inherited from:
InvertDSL
def crashNow[A, B](msg: String): A -⚬ B

Attributes

Inherited from:
CrashDSL
def crashWhenNeed[A, B](msg: String): A -⚬ Need |*| B

Attributes

Inherited from:
CrashDSL
def crashd(msg: String): Done -⚬ Done

Attributes

Inherited from:
CrashDSL
def crashn(msg: String): Need -⚬ Need

Attributes

Inherited from:
CrashDSL
override def curry[A, B, C](f: A |*| B -⚬ C): A -⚬ B =⚬ C

Attributes

Definition Classes
Inherited from:
InvertDSL
override def delay(d: FiniteDuration): Done -⚬ Done

Attributes

Definition Classes
Inherited from:
Scaletto
def delayNeed: Need -⚬ Neg[FiniteDuration]

Attributes

Inherited from:
Scaletto
def delayNeed(d: FiniteDuration): Need -⚬ Need

Attributes

Inherited from:
TimerDSL
def demand[A]: One -⚬ -[A] |*| A

Creates a demand on the first out-port, channeling the provided resource to the second out-port. Alias for forevert.

Creates a demand on the first out-port, channeling the provided resource to the second out-port. Alias for forevert.

Attributes

Inherited from:
InvertDSL
def demandChoice[A, B]: -[A] |+| -[B] -⚬ -[A |&| B]

Converts an obligation to handle either demand to an obligation to supply a choice. Alias for factorInversionOutOf_|+|.

Converts an obligation to handle either demand to an obligation to supply a choice. Alias for factorInversionOutOf_|+|.

Attributes

Inherited from:
InvertDSL
def demandChosen[A, B]: -[A |&| B] -⚬ -[A] |+| -[B]

Converts a demand for choice to a demand of the chosen side. Alias for distributeInversionInto_|&amp;|.

Converts a demand for choice to a demand of the chosen side. Alias for distributeInversionInto_|&amp;|.

Attributes

Inherited from:
InvertDSL
def demandEither[A, B]: -[A] |&| -[B] -⚬ -[A |+| B]

Converts choice of demands to demand of either. Alias for factorInversionOutOf_|&amp;|.

Converts choice of demands to demand of either. Alias for factorInversionOutOf_|&amp;|.

Attributes

Inherited from:
InvertDSL
def demandSeparately[A, B]: -[A |*| B] -⚬ -[A] |*| -[B]

Attributes

Inherited from:
InvertDSL
def demandTogether[A, B]: -[A] |*| -[B] -⚬ -[A |*| B]

Alias for factorOutInversion.

Alias for factorOutInversion.

Attributes

Inherited from:
InvertDSL
def die[A]: -[-[A]] -⚬ A

Double-inversion elimination.

Double-inversion elimination.

Attributes

Inherited from:
InvertDSL
def dii[A]: A -⚬ -[-[A]]

Double-inversion introduction.

Double-inversion introduction.

Attributes

Inherited from:
InvertDSL

Attributes

Inherited from:
CoreDSL

Attributes

Inherited from:
CoreDSL
def distributeInversionInto_|&|[A, B]: -[A |&| B] -⚬ -[A] |+| -[B]

Attributes

Inherited from:
InvertDSL
def distributeInversionInto_|+|[A, B]: -[A |+| B] -⚬ -[A] |&| -[B]

Attributes

Inherited from:
InvertDSL
def distributeR[A, B, C]: A |+| B |*| C -⚬ A |*| C |+| B |*| C

Distribute the factor on the right into the summands on the left. Inverse of factorR.

Distribute the factor on the right into the summands on the left. Inverse of factorR.

Attributes

Inherited from:
CoreDSL

Attributes

Inherited from:
CoreDSL

Attributes

Inherited from:
InvertDSL

Alias for die.

Alias for die.

Attributes

Inherited from:
InvertDSL

Alias for dii.

Alias for dii.

Attributes

Inherited from:
InvertDSL
def dup[A]: Val[A] -⚬ Val[A] |*| Val[A]

Attributes

Inherited from:
Scaletto
def dupNeg[A]: Neg[A] |*| Neg[A] -⚬ Neg[A]

Attributes

Inherited from:
Scaletto
def effect[R, A, B](f: (R, A) => B): Res[R] |*| Val[A] -⚬ Res[R] |*| Val[B]

Performs a (potentially) effectful operation on a resource, producing some output.

Performs a (potentially) effectful operation on a resource, producing some output.

Attributes

A

additional parameter of the operation

B

additional output of the operation

R

type of the resource

f

the effectful operation

Inherited from:
Scaletto
def effectWr[R, A](f: (R, A) => Unit): Res[R] |*| Val[A] -⚬ Res[R]

Variant of effect that does not produce output in addition to performing the effect. Can be viewed as ''wr''iting an A into the resource.

Variant of effect that does not produce output in addition to performing the effect. Can be viewed as ''wr''iting an A into the resource.

Attributes

Inherited from:
Scaletto
def elimFst[A, B](f: A -⚬ One): A |*| B -⚬ B

Attributes

Inherited from:
CoreDSL
def elimSnd[A, B](f: B -⚬ One): A |*| B -⚬ A

Attributes

Inherited from:
CoreDSL
override def eval[A, B]: A =⚬ B |*| A -⚬ B

Attributes

Definition Classes
Inherited from:
InvertDSL
def factorInversionOutOf_|&|[A, B]: -[A] |&| -[B] -⚬ -[A |+| B]

Attributes

Inherited from:
InvertDSL
def factorInversionOutOf_|+|[A, B]: -[A] |+| -[B] -⚬ -[A |&| B]

Attributes

Inherited from:
InvertDSL
def factorL[A, B, C]: A |*| B |+| A |*| C -⚬ A |*| B |+| C

Factor out the factor A on the left of both summands.

Factor out the factor A on the left of both summands.

Attributes

Inherited from:
CoreDSL
def factorR[A, B, C]: A |*| C |+| B |*| C -⚬ A |+| B |*| C

Factor out the factor C on the right of both summands.

Factor out the factor C on the right of both summands.

Attributes

Inherited from:
CoreDSL
def forkMap[A, B](f: Done -⚬ A, g: Done -⚬ B): Done -⚬ A |*| B

Attributes

Inherited from:
CoreDSL
def forkMapNeed[A, B](f: A -⚬ Need, g: B -⚬ Need): A |*| B -⚬ Need

Attributes

Inherited from:
CoreDSL
def fst[A, B, C](f: A -⚬ B): A |*| C -⚬ B |*| C

Attributes

Inherited from:
CoreDSL
def fulfill[A]: Val[A] |*| Neg[A] -⚬ One

Uses the value (eventually) produced by Val to satisfy the demand of Neg.

Uses the value (eventually) produced by Val to satisfy the demand of Neg.

Attributes

Inherited from:
Scaletto
def inflate[A]: Need -⚬ Neg[A]

Attributes

Inherited from:
Scaletto
def injectROnPing[A, B]: Ping |*| B -⚬ A |+| B

Attributes

Inherited from:
CoreDSL
def introFst[A, X](f: One -⚬ X): A -⚬ X |*| A

Attributes

Inherited from:
CoreDSL
def introSnd[A, X](f: One -⚬ X): A -⚬ A |*| X

Attributes

Inherited from:
CoreDSL
def invertClosure[A, B]: -[A =⚬ B] -⚬ B =⚬ A

Attributes

Inherited from:
InvertDSL

Attributes

Inherited from:
InvertDSL

Attributes

Inherited from:
InvertDSL

Attributes

Inherited from:
InvertDSL

Attributes

Inherited from:
InvertDSL
def joinMap[A, B](f: A -⚬ Done, g: B -⚬ Done): A |*| B -⚬ Done

Attributes

Inherited from:
CoreDSL
def joinMapNeed[A, B](f: Need -⚬ A, g: Need -⚬ B): Need -⚬ A |*| B

Attributes

Inherited from:
CoreDSL
def liftNegPair[A, B]: Neg[(A, B)] -⚬ Neg[A] |*| Neg[B]

Attributes

Inherited from:
Scaletto

Attributes

Inherited from:
CoreDSL

Attributes

Inherited from:
InvertDSL

Attributes

Inherited from:
CoreDSL

Attributes

Inherited from:
CoreDSL
def obj[A, B](f: A -⚬ B): One -⚬ A =⚬ B

Turn a function into a function object.

Turn a function into a function object.

Attributes

Inherited from:
ClosedDSL
override def out[A, B, C](f: B -⚬ C): A =⚬ B -⚬ A =⚬ C

Map the output of a function object.

Map the output of a function object.

Attributes

Definition Classes
Inherited from:
InvertDSL
def packDemand[F[_]]: -[F[Rec[F]]] -⚬ -[Rec[F]]

Attributes

Inherited from:
InvertDSL

Attributes

Inherited from:
InvertDSL

Attributes

Inherited from:
InvertDSL
def promise[A]: One -⚬ Neg[A] |*| Val[A]

Creates an entangled pair of demand (Neg) and supply (Val) such that when the demand is fulfilled with a value, that value will be produced by the supply.

Creates an entangled pair of demand (Neg) and supply (Val) such that when the demand is fulfilled with a value, that value will be produced by the supply.

Attributes

Inherited from:
Scaletto
def release[R, A, B](f: (R, A) => B): Res[R] |*| Val[A] -⚬ Val[B]

Releases a resource using the given function. The release function previously registered during resource acquisition is not used.

Releases a resource using the given function. The release function previously registered during resource acquisition is not used.

Attributes

A

additional parameter of the release function

B

additional data produced by the release function

R

type of the resource

f

the release function

Inherited from:
Scaletto
def snd[A, B, C](f: B -⚬ C): A |*| B -⚬ A |*| C

Attributes

Inherited from:
CoreDSL
def splitResource[R, A, S, T, B](f: (R, A) => (S, T, B), release1: Option[S => Unit], release2: Option[T => Unit]): Res[R] |*| Val[A] -⚬ Res[S] |*| Res[T] |*| Val[B]

Attributes

Inherited from:
Scaletto
def splitResourceAsync[R, A, S, T, B](f: (R, A) => Async[(S, T, B)], release1: Option[S => Async[Unit]], release2: Option[T => Async[Unit]]): Res[R] |*| Val[A] -⚬ Res[S] |*| Res[T] |*| Val[B]

Attributes

Inherited from:
Scaletto
def supply[A]: A |*| -[A] -⚬ One

Uses the resource from the first in-port to satisfy the demand from the second in-port. Alias for backvert.

Uses the resource from the first in-port to satisfy the demand from the second in-port. Alias for backvert.

Attributes

Inherited from:
InvertDSL
def toChoiceOfDemands[A, B]: -[A |+| B] -⚬ -[A] |&| -[B]

Converts demand for either to a choice of which side to supply. Alias for distributeInversionInto_|+|.

Converts demand for either to a choice of which side to supply. Alias for distributeInversionInto_|+|.

Attributes

Inherited from:
InvertDSL
def transformResource[R, A, S, B](f: (R, A) => (S, B), release: Option[S => Unit]): Res[R] |*| Val[A] -⚬ Res[S] |*| Val[B]

Transforms a resource into a resource of (possibly) different type.

Transforms a resource into a resource of (possibly) different type.

Attributes

A

additional parameter of the transformation

B

additional output of the transformation

R

type of the input resource

S

type of the output resource

f

the transformation function. It receives the input resource and additional input of type A. It returns the new resource and additional output of type B.

release

called to release the new resource in case of a crash. None means no cleanup is needed

Inherited from:
Scaletto
def transformResourceAsync[R, A, S, B](f: (R, A) => Async[(S, B)], release: Option[S => Async[Unit]]): Res[R] |*| Val[A] -⚬ Res[S] |*| Val[B]

Attributes

Inherited from:
Scaletto
def tryAcquire[A, R, B, E](acquire: A => Either[E, (R, B)], release: Option[R => Unit]): Val[A] -⚬ Val[E] |+| Res[R] |*| Val[B]

Acquires a resource of type R. Might fail with an error of type E.

Acquires a resource of type R. Might fail with an error of type E.

Attributes

A

parameters of the acquire function

B

additional data produced by acquiring the resource

E

type of the error

R

type of the resource

release

called to release the resource in case of a crash. None means no cleanup is needed

Inherited from:
Scaletto
def trySplitResource[R, A, S, T, B, E](f: (R, A) => Either[E, (S, T, B)], release1: Option[S => Unit], release2: Option[T => Unit]): Res[R] |*| Val[A] -⚬ Val[E] |+| Res[S] |*| Res[T] |*| Val[B]

Attributes

Inherited from:
Scaletto
def tryTransformResource[R, A, S, B, E](f: (R, A) => Either[E, (S, B)], release: Option[S => Unit]): Res[R] |*| Val[A] -⚬ Val[E] |+| Res[S] |*| Val[B]

Transforms a resource into a resource of (possibly) different type. Might fail with an error of type E.

Transforms a resource into a resource of (possibly) different type. Might fail with an error of type E.

Attributes

A

additional parameter of the transformation

B

additional output of the transformation

E

type of the error

R

type of the input resource

S

type of the output resource

f

the transformation function. It receives the input resource and additional input of type A. It returns either an error of type E or the new resource and additional output of type B. In case the transformation results in an error, the original resource is ''not'' released automatically— the passing of the original resource R to the transformation function f indicates transfer of responsibility for the resource to the function f.

release

called to release the new resource in case of a crash. None means no cleanup is needed

Inherited from:
Scaletto
def unContrapositive[A, B](f: -[A] -⚬ -[B]): B -⚬ A

Attributes

Inherited from:
InvertDSL
def unInvertClosure[A, B]: A =⚬ B -⚬ -[B =⚬ A]

Attributes

Inherited from:
InvertDSL
def uncurry[A, B, C](f: A -⚬ B =⚬ C): A |*| B -⚬ C

Attributes

Inherited from:
ClosedDSL
def unliftEither[A, B]: Val[A] |+| Val[B] -⚬ Val[Either[A, B]]

Attributes

Inherited from:
Scaletto
def unliftNegPair[A, B]: Neg[A] |*| Neg[B] -⚬ Neg[(A, B)]

Attributes

Inherited from:
Scaletto
def unpackDemand[F[_]]: -[Rec[F]] -⚬ -[F[Rec[F]]]

Attributes

Inherited from:
InvertDSL
def Λ[A, B](using SourcePos)(f: Expr[A] => Expr[B]): $[A =⚬ B]

Alias for λ.closure.apply.

Alias for λ.closure.apply.

Attributes

Inherited from:
ClosedDSL

Concrete fields

override val $: FunExprOps

Implicits

Inherited implicits

final implicit def DemandExprOps[B](expr: Expr[-[B]]): DemandExprOps[B]

Attributes

Inherited from:
InvertDSL

Attributes

Inherited from:
FreeScaletto