Value Members

1.  final def !=(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

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

   Definition Classes

   AstGraph

5.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

6.  def boundVars: Nil.type

   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

   ProgramGraph → AstGraph

7.  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

8.  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

9.  def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... ) @native()

10.  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

11.  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

12.  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.

13.  final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

14.  def equals(other: Any): Boolean

    Default equality of definitions.

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

    Definition Classes

    Node → Equals → AnyRef → Any

15.  val filterNode: Nullable[(Scalan.Sym) ⇒ Boolean]
16.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

17.  lazy val flatSchedule: Scalan.Schedule

    Definition Classes

    AstGraph

18.  def freeVars: WrappedArray[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

    ProgramGraph → AstGraph

19.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

20.  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

    Node

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

    Definition Classes

    AstGraph

22.  def hasManyUsages(s: Scalan.Sym): Boolean

    Definition Classes

    AstGraph

23.  def hasManyUsagesGlobal(s: Scalan.Sym): Boolean

    Definition Classes

    AstGraph

24.  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

    Node → AnyRef → Any

25.  def isBoundVar(s: Scalan.Sym): Boolean

    Checks the symbol is lambda bound.

    Checks the symbol is lambda bound.

    Definition Classes

    AstGraph

    Annotations

    @inline()

26.  def isIdentity: Boolean

    Whether this graph represents identity function.

    Whether this graph represents identity function.

    Definition Classes

    ProgramGraph → AstGraph

27.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Definition Classes

    AstGraph

    Annotations

    @inline()

29.  final def isLocalDefId(id: Int): Boolean

    Definition Classes

    AstGraph

    Annotations

    @inline()

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

    Definition Classes

    AstGraph

    Annotations

    @inline()

31.  val mapping: Nullable[Scalan.Transformer]
32.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

33.  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()

34.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

35.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

36.  lazy val rootIds: Buffer[Int]

    Extract identifies out of roots.

    Extract identifies out of roots.

    Definition Classes

    ProgramGraph → AstGraph

37.  val roots: Seq[Scalan.Sym]

    Terminal nodes of the graph.

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

    Definition Classes

    ProgramGraph → AstGraph

38.  lazy val schedule: Scalan.Schedule

    Sequence of node references forming a schedule.

    Sequence of node references forming a schedule.

    Definition Classes

    AstGraph

39.  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

    ProgramGraph → AstGraph

    See also

    Lambda, ThunkDef

40.  def show(config: GraphVizConfig): Unit

    Definition Classes

    AstGraph

41.  def show(emitMetadata: Boolean): Unit

    Definition Classes

    AstGraph

42.  def show(): Unit

    Definition Classes

    AstGraph

43.  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

44.  final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

45.  def toString(): String

    User readable string representation of this definition.

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

    Definition Classes

    ProgramGraph → Node → AnyRef → Any

46.  def transform(m: Scalan.Mirror, rw: Scalan.Rewriter, t: Scalan.Transformer): Scalan.ProgramGraph

    Mirror all the nodes of this graph applying transformer and performing rewriting.

    Mirror all the nodes of this graph applying transformer and performing rewriting.

    m

    mirror instance to be used for mirroring of nodes

    rw

    rewriter to be tried for each new created mirrored node

    t

    transformer of symbols, to be used for substitution of symbols in the new nodes.

    returns

    new graph which is not necessary clone of this graph, but should be semantically equivalent to this graph (provided all rw rules preserve equivalence). If rw is identity, then the resulting graph is alpha-equivalent to this graph as long as t is bijection.

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

    Symbol Usage information for this graph

    Symbol Usage information for this graph

    Definition Classes

    AstGraph

48.  def usagesOf(id: Int): Buffer[Int]
    Definition Classes

    AstGraph

49.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

51.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... ) @native()

52.  def withoutContext: Scalan.ProgramGraph

    Remove transformer component of the graph.