ApplyBinOpLazy

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. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

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

8. final def eq(arg0: AnyRef): Boolean

   

   Definition Classes

   AnyRef

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

10. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

11. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

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

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

14. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

15. val lhs: Scalan.Ref[A]

    

16. def mirror(t: Scalan.Transformer): Scalan.Ref[R]

    

    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

17. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

18. 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()

19. final def notify(): Unit

    

    Definition Classes

    AnyRef

20. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

21. val op: Scalan.BinOp[A, R]

    

22. implicit val resultType: Scalan.Elem[R]

    

    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

    BaseDef → Def

23. val rhs: Scalan.Ref[Scalan.Thunk[A]]

    

24. final def self: Scalan.Ref[R]

    

    Reference to this definition created lazily on demand.

    Reference to this definition created lazily on demand.

    Definition Classes

    Def

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

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

    

    Definition Classes

    AnyRef

27. def toString(): String

    

    User readable string representation of this definition.

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

    Definition Classes

    ApplyBinOpLazy → Node → AnyRef → Any

28. def transform(t: Scalan.Transformer): Scalan.Def[R]

    

    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

    ApplyBinOpLazy → Def

29. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

31. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )