Lambda

Instance Constructors

new Lambda(f: Nullable[(Scalan.Ref[A]) ⇒ Scalan.Ref[B]], x: Scalan.Ref[A], y: Scalan.Ref[B], mayInline: Boolean, alphaEquality: Boolean = true)

f
optional function, which was used to compute y
x
lambda-bound variable
y
symbol representing result of lambda invocation
mayInline
whether this lambda can be inlined when applied
alphaEquality
whether to use alpha-equality in equals

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
lazy val allNodes: Map[Int, Scalan.GraphNode]

Definition Classes
AstGraph
val alphaEquality: Boolean

whether to use alpha-equality in equals
final def asInstanceOf[T0]: T0

Definition Classes
Any
val boundVarId: Int
val boundVars: Seq[Scalan.Sym]

If this graph represent Lambda abstraction, the boundVars is lambda bound symbols.
If this graph represent Lambda abstraction, the boundVars is lambda bound symbols. otherwise this is empty set.

Definition Classes
Lambda → AstGraph
final def buildFlatSchedule(schedule: Scalan.Schedule, flatBuf: Buffer[Scalan.Sym]): Unit

Flatten the given schedule into single sequence of non-AstGraph definitions.
Flatten the given schedule into single sequence of non-AstGraph definitions. All scope forming definitions like Lambda and ThunkDef are recursively unfolded in the given buffer flatBuf. NOTE: The symbols of AstGraph-like definitions are added to flatBuf AFTER the unfolded body.

Definition Classes
AstGraph
def buildUsageMap(schedule: Scalan.Schedule, usingDeps: Boolean): Map[Int, Scalan.GraphNode]

Build usage information induced by the given schedule.
Build usage information induced by the given schedule. For each symbol of the schedule a GraphNode is created and usages are collected.

Definition Classes
AstGraph
def canEqual(other: Any): Boolean

Definition Classes
Lambda → Equals
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate() @throws( ... )
final def deps: Array[Scalan.Sym]

Dependencies of this definition from other definitions.
Dependencies of this definition from other definitions. If definition is interpreted as an operation, then dependencies are arguments of the operation. If definition if compound (like Lambda of ThunkDef) then deps is equals to free variables used in the body of the compound definition. This array also refers to predecessors of this graph node, so it is used to build topological ordering (execution schedule) of operations.
returns
array of referencies to other definitions.

Definition Classes
Node
lazy val domain: Set[Int]

Set of symbol ids in the schedule.
Set of symbol ids in the schedule. Can be used to quickly recognize symbols belonging to the body of this definition.

Definition Classes
AstGraph
def eA: Scalan.Elem[A]
def eB: Scalan.Elem[B]
final def elements: Array[AnyRef]

All data elements of this graph node to be used in structural equality.
All data elements of this graph node to be used in structural equality.

Definition Classes
Node
See also
equals where elements are used.
final def eq(arg0: AnyRef): Boolean

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

Default equality of definitions.
Default equality of definitions. Two definitions are equal if they have same elements.

Definition Classes
Lambda → Node → Equals → AnyRef → Any
val f: Nullable[(Scalan.Ref[A]) ⇒ Scalan.Ref[B]]

optional function, which was used to compute y
lazy val flatSchedule: Scalan.Schedule

Definition Classes
AstGraph
lazy val freeVars: Seq[Scalan.Sym]

Collect a set of symbols used in the graph but which are not part of its schedule.
Collect a set of symbols used in the graph but which are not part of its schedule. If the graph represents a compound definition (Lambda, Thunk etc), then each item in freeVars is used in the body, but not part of it. Intersection of free vars with bound vars is empty.

Definition Classes
Lambda → AstGraph
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
def getDeps: Array[Scalan.Sym]

Override to redefine how dependencies are computed.
Override to redefine how dependencies are computed. For example, in core implementation this is overriden in Lambda and ThunkDef using freeVars.

Attributes
protected
Definition Classes
Lambda → Node
def globalUsagesOf(s: Scalan.Sym): Buffer[Scalan.Sym]

Definition Classes
AstGraph
def hasManyUsages(s: Scalan.Sym): Boolean

Definition Classes
AstGraph
def hasManyUsagesGlobal(s: Scalan.Sym): Boolean

Definition Classes
AstGraph
def hashCode(): Int

Computed once and saved to avoid repeated computations, which is not necessary because definitions are immutable by default.
Computed once and saved to avoid repeated computations, which is not necessary because definitions are immutable by default. If some definition require mutability, this method can be overriden accordingly.

Definition Classes
Lambda → Node → AnyRef → Any
def isBoundVar(s: Scalan.Sym): Boolean

Checks the symbol is lambda bound.
Checks the symbol is lambda bound.

Definition Classes
Lambda → AstGraph
Annotations
@inline()
def isIdentity: Boolean

Whether this graph represents identity function.
Whether this graph represents identity function.

Definition Classes
Lambda → AstGraph
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def isLocalDef(s: Scalan.Sym): Boolean

Definition Classes
AstGraph
Annotations
@inline()
final def isLocalDefId(id: Int): Boolean

Definition Classes
AstGraph
Annotations
@inline()
final def isRoot(s: Scalan.Sym): Boolean

Definition Classes
AstGraph
Annotations
@inline()
val mayInline: Boolean

whether this lambda can be inlined when applied
def mirror(t: Scalan.Transformer): Scalan.Ref[(A) ⇒ B]

Clone this definition transforming all symbols using t.
Clone this definition transforming all symbols using t. If new Def[A] is created, it is added to the graph with collapsing and rewriting. Can be overriden to implement node-specific mirroring (see MethodCall).
t
mapping of symbols to symbols (Ref[_] => Ref[_])
returns
symbol of the logical clone. If d don't contain symbols, then d.self is returned.

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

Definition Classes
AnyRef
final def nodeId: Int

Unique id of the graph node assigned for each new instance using freshId generator.
Unique id of the graph node assigned for each new instance using freshId generator. Doesn't participate in equality of this Def, thus definitions with different ids may still be structurally equal. Used to provide global Def numbering.

Definition Classes
Node
Annotations
@inline()
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
def productArity: Int

Definition Classes
Lambda → Product
def productElement(n: Int): Any

Definition Classes
Lambda → Product
def productIterator: Iterator[Any]

Definition Classes
Product
def productPrefix: String

Definition Classes
Product
def resultType: Scalan.Elem[(A) ⇒ B]

Type of a resulting value produced by the operation represented by this definition.
Type of a resulting value produced by the operation represented by this definition. For example, if this definition represents application of +: (Int, Int) => Int operation then the result type is Int and resultType should return IntElement.

Definition Classes
Lambda → Def
lazy val rootIds: Buffer[Int]

Extract identifies out of roots.
Extract identifies out of roots.

Definition Classes
Lambda → AstGraph
val roots: Seq[Scalan.Sym]

Terminal nodes of the graph.
Terminal nodes of the graph. There are incoming, but no outgoing edges.

Definition Classes
Lambda → AstGraph
lazy val schedule: Scalan.Schedule

Sequence of node references forming a schedule.
Sequence of node references forming a schedule.

Definition Classes
AstGraph
lazy val scheduleIds: Buffer[Int]

Schedule represents a body of compound definition - topologically ordered sequence of nodes of the graph.
Schedule represents a body of compound definition - topologically ordered sequence of nodes of the graph. It is implemented differently depending on node type.

Definition Classes
Lambda → AstGraph
See also
Lambda, ThunkDef
final def self: Scalan.Ref[(A) ⇒ B]

Reference to this definition created lazily on demand.
Reference to this definition created lazily on demand.

Definition Classes
Def
def show(config: GraphVizConfig): Unit

Definition Classes
AstGraph
def show(emitMetadata: Boolean): Unit

Definition Classes
AstGraph
def show(): Unit

Definition Classes
AstGraph
final def syms: Array[Scalan.Sym]

References to other nodes in this Def instance.
References to other nodes in this Def instance. Note: This is different form deps for compound definitions like Lambda and ThunkDef.

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

Definition Classes
AnyRef
def toString(): String

User readable string representation of this definition.
User readable string representation of this definition. (for debugging only)

Definition Classes
Lambda → Node → AnyRef → Any
def transform(t: Scalan.Transformer): Scalan.Def[(A) ⇒ B]

Create a copy of this definition applying the given transformer to all syms.
Create a copy of this definition applying the given transformer to all syms.

Definition Classes
Def
lazy val usageMap: Map[Int, Scalan.GraphNode]

Symbol Usage information for this graph
Symbol Usage information for this graph

Definition Classes
AstGraph
def usagesOf(id: Int): Buffer[Int]

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

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )
val x: Scalan.Ref[A]

lambda-bound variable
val y: Scalan.Ref[B]

symbol representing result of lambda invocation

Deprecated Value Members

def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
Deprecated
(Since version ) see corresponding Javadoc for more information.

Related Docs: object Lambda | package Functions

class Lambda[A, B] extends Scalan.AstGraph with Scalan.Def[(A) ⇒ B]

Instance Constructors

new Lambda(f: Nullable[(Scalan.Ref[A]) ⇒ Scalan.Ref[B]], x: Scalan.Ref[A], y: Scalan.Ref[B], mayInline: Boolean, alphaEquality: Boolean = true)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

lazy val allNodes: Map[Int, Scalan.GraphNode]

val alphaEquality: Boolean

final def asInstanceOf[T0]: T0

val boundVarId: Int

val boundVars: Seq[Scalan.Sym]

final def buildFlatSchedule(schedule: Scalan.Schedule, flatBuf: Buffer[Scalan.Sym]): Unit

def buildUsageMap(schedule: Scalan.Schedule, usingDeps: Boolean): Map[Int, Scalan.GraphNode]

def canEqual(other: Any): Boolean

def clone(): AnyRef

final def deps: Array[Scalan.Sym]

lazy val domain: Set[Int]

def eA: Scalan.Elem[A]

def eB: Scalan.Elem[B]

final def elements: Array[AnyRef]

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

val f: Nullable[(Scalan.Ref[A]) ⇒ Scalan.Ref[B]]

lazy val flatSchedule: Scalan.Schedule

lazy val freeVars: Seq[Scalan.Sym]

final def getClass(): Class[_]

def getDeps: Array[Scalan.Sym]

def globalUsagesOf(s: Scalan.Sym): Buffer[Scalan.Sym]

def hasManyUsages(s: Scalan.Sym): Boolean

def hasManyUsagesGlobal(s: Scalan.Sym): Boolean

def hashCode(): Int

def isBoundVar(s: Scalan.Sym): Boolean

def isIdentity: Boolean

final def isInstanceOf[T0]: Boolean

final def isLocalDef(s: Scalan.Sym): Boolean

final def isLocalDefId(id: Int): Boolean

final def isRoot(s: Scalan.Sym): Boolean

val mayInline: Boolean

def mirror(t: Scalan.Transformer): Scalan.Ref[(A) ⇒ B]

final def ne(arg0: AnyRef): Boolean

final def nodeId: Int

final def notify(): Unit

final def notifyAll(): Unit

def productArity: Int

def productElement(n: Int): Any

def productIterator: Iterator[Any]

def productPrefix: String

def resultType: Scalan.Elem[(A) ⇒ B]

lazy val rootIds: Buffer[Int]

val roots: Seq[Scalan.Sym]

lazy val schedule: Scalan.Schedule

lazy val scheduleIds: Buffer[Int]

final def self: Scalan.Ref[(A) ⇒ B]

def show(config: GraphVizConfig): Unit

def show(emitMetadata: Boolean): Unit

def show(): Unit

final def syms: Array[Scalan.Sym]

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

def toString(): String

def transform(t: Scalan.Transformer): Scalan.Def[(A) ⇒ B]

lazy val usageMap: Map[Int, Scalan.GraphNode]

def usagesOf(id: Int): Buffer[Int]

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

final def wait(arg0: Long): Unit

final def wait(): Unit

val x: Scalan.Ref[A]

val y: Scalan.Ref[B]

Deprecated Value Members

def finalize(): Unit

Inherited from Scalan.Def[(A) ⇒ B]

Inherited from Scalan.AstGraph

Inherited from Scalan.Node

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped