Literal

Type Members

case class Binary[N[_], T1, T2, T3](arg1: Literal[N, T1], arg2: Literal[N, T2], fn: (N[T1], N[T2]) ⇒ N[T3]) extends Literal[N, T3] with Product with Serializable
case class Const[N[_], T](evaluate: N[T]) extends Literal[N, T] with Product with Serializable
case class Unary[N[_], T1, T2](arg: Literal[N, T1], fn: (N[T1]) ⇒ N[T2]) extends Literal[N, T2] with Product with Serializable
case class Variadic[N[_], T1, T2](args: List[Literal[N, T1]], fn: (List[N[T1]]) ⇒ N[T2]) extends Literal[N, T2] with Product with Serializable

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def evaluate[N[_], T](lit: Literal[N, T]): N[T]

This evaluates a literal formula back to what it represents being careful to handle diamonds by creating referentially equivalent structures (not just structurally equivalent)
def evaluateMemo[N[_]]: FunctionK[[β$0$]Literal[N, β$0$], N]

Memoized version of evaluation to handle diamonds
Memoized version of evaluation to handle diamonds
Each call to this creates a new internal memo.
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Docs: trait Literal | package dagon

object Literal extends Serializable

Type Members

case class Binary[N[_], T1, T2, T3](arg1: Literal[N, T1], arg2: Literal[N, T2], fn: (N[T1], N[T2]) ⇒ N[T3]) extends Literal[N, T3] with Product with Serializable

case class Const[N[_], T](evaluate: N[T]) extends Literal[N, T] with Product with Serializable

case class Unary[N[_], T1, T2](arg: Literal[N, T1], fn: (N[T1]) ⇒ N[T2]) extends Literal[N, T2] with Product with Serializable

case class Variadic[N[_], T1, T2](args: List[Literal[N, T1]], fn: (List[N[T1]]) ⇒ N[T2]) extends Literal[N, T2] with Product with Serializable

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def evaluate[N[_], T](lit: Literal[N, T]): N[T]

def evaluateMemo[N[_]]: FunctionK[[β$0$]Literal[N, β$0$], N]

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped