Packages

case class BoxConst(constValue: SBox) extends scalan.SigmaLibrary.Node with LiftedConst[SBox, scalan.SigmaLibrary.Box] with scalan.SigmaLibrary.Box with scalan.SigmaLibrary.Def[scalan.SigmaLibrary.Box] with BoxConstMethods with Product with Serializable

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BoxConst
  2. Serializable
  3. Serializable
  4. BoxConstMethods
  5. Box
  6. LiftedConst
  7. Def
  8. Node
  9. Product
  10. Equals
  11. AnyRef
  12. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BoxConst(constValue: SBox)

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. def R0[T](implicit cT: scalan.SigmaLibrary.Elem[T]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.WOption[T]]
    Definition Classes
    Box
  5. def R1[T](implicit cT: scalan.SigmaLibrary.Elem[T]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.WOption[T]]
    Definition Classes
    Box
  6. def R2[T](implicit cT: scalan.SigmaLibrary.Elem[T]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.WOption[T]]
    Definition Classes
    Box
  7. def R3[T](implicit cT: scalan.SigmaLibrary.Elem[T]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.WOption[T]]
    Definition Classes
    Box
  8. def R4[T](implicit cT: scalan.SigmaLibrary.Elem[T]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.WOption[T]]
    Definition Classes
    Box
  9. def R5[T](implicit cT: scalan.SigmaLibrary.Elem[T]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.WOption[T]]
    Definition Classes
    Box
  10. def R6[T](implicit cT: scalan.SigmaLibrary.Elem[T]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.WOption[T]]
    Definition Classes
    Box
  11. def R7[T](implicit cT: scalan.SigmaLibrary.Elem[T]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.WOption[T]]
    Definition Classes
    Box
  12. def R8[T](implicit cT: scalan.SigmaLibrary.Elem[T]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.WOption[T]]
    Definition Classes
    Box
  13. def R9[T](implicit cT: scalan.SigmaLibrary.Elem[T]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.WOption[T]]
    Definition Classes
    Box
  14. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  15. def bytes: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[Byte]]
    Definition Classes
    BoxConstMethodsBox
  16. def bytesWithoutRef: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[Byte]]
    Definition Classes
    BoxConstMethodsBox
  17. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  18. val constValue: SBox

    Value of the source type embedded in this graph node.

    Value of the source type embedded in this graph node.

    Definition Classes
    BoxConstLiftedConst
  19. def creationInfo: scalan.SigmaLibrary.Ref[(Int, scalan.SigmaLibrary.Coll[Byte])]
    Definition Classes
    BoxConstMethodsBox
  20. final def deps: Array[scalan.SigmaLibrary.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
  21. 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.

  22. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  23. 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
  24. def executeFromRegister[T](regId: scalan.SigmaLibrary.Ref[Byte])(implicit cT: scalan.SigmaLibrary.Elem[T]): scalan.SigmaLibrary.Ref[T]
    Definition Classes
    BoxConstMethodsBox
  25. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  26. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  27. def getDeps: Array[scalan.SigmaLibrary.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
  28. def getReg[T](i: scalan.SigmaLibrary.Ref[Int])(implicit cT: scalan.SigmaLibrary.Elem[T]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.WOption[T]]
    Definition Classes
    BoxConstMethodsBox
  29. 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
  30. def id: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[Byte]]
    Definition Classes
    BoxConstMethodsBox
  31. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  32. val liftable: Liftable[SBox, scalan.SigmaLibrary.Box]

    Evidence that constValue can be lifted to T

    Evidence that constValue can be lifted to T

    Definition Classes
    BoxConstLiftedConst
  33. def mirror(t: scalan.SigmaLibrary.Transformer): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Box]

    This default implementation assumes there is no symbols in this node.

    This default implementation assumes there is no symbols in this node. Can be overriden if it is not true for some ST.

    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
    LiftedConstDef
  34. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  35. 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()
  36. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  37. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  38. def propositionBytes: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[Byte]]
    Definition Classes
    BoxConstMethodsBox
  39. def registers: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[scalan.SigmaLibrary.AnyValue]]
    Definition Classes
    BoxConstMethodsBox
  40. val resultType: scalan.SigmaLibrary.Elem[scalan.SigmaLibrary.Box]

    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
    BoxConstDef
  41. final def self: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Box]

    Reference to this definition created lazily on demand.

    Reference to this definition created lazily on demand.

    Definition Classes
    Def
  42. final def syms: Array[scalan.SigmaLibrary.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
  43. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  44. def toString(): String

    User readable string representation of this definition.

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

    Definition Classes
    Node → AnyRef → Any
  45. def tokens: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[(scalan.SigmaLibrary.Coll[Byte], Long)]]
    Definition Classes
    BoxConstMethodsBox
  46. def transform(t: scalan.SigmaLibrary.Transformer): scalan.SigmaLibrary.Def[scalan.SigmaLibrary.Box]

    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
  47. def value: scalan.SigmaLibrary.Ref[Long]
    Definition Classes
    BoxConstMethodsBox
  48. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  49. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  50. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from Serializable

Inherited from Serializable

Inherited from BoxConstMethods

Inherited from scalan.SigmaLibrary.Box

Inherited from scalan.SigmaLibrary.Node

Inherited from Product

Inherited from scala.Equals

Inherited from AnyRef

Inherited from Any

Ungrouped