Class/Object

sigma.ast

ValNode

Related Docs: object ValNode | package ast

Permalink

case class ValNode(name: String, givenType: SType, body: SValue) extends Value[SType] with Val with Product with Serializable

Linear Supertypes
Serializable, Serializable, Val, Value[SType], SigmaNode, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ValNode
  2. Serializable
  3. Serializable
  4. Val
  5. Value
  6. SigmaNode
  7. Product
  8. Equals
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ValNode(name: String, givenType: SType, body: SValue)

    Permalink

Value Members

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def addCost[R](costKind: TypeBasedCost, tpe: SType)(block: () ⇒ R)(implicit E: ErgoTreeEvaluator): R

    Permalink

    Add the cost given by the descriptor to the accumulator and associate it with this operation node.

    Add the cost given by the descriptor to the accumulator and associate it with this operation node.

    Definition Classes
    Value
    Annotations
    @inline()
  5. final def addCost(costKind: FixedCost)(implicit E: ErgoTreeEvaluator): Unit

    Permalink

    Add the cost given by the kind to the accumulator and associate it with this operation node.

    Add the cost given by the kind to the accumulator and associate it with this operation node.

    Definition Classes
    Value
    Annotations
    @inline()
  6. final def addSeqCost[R](costKind: PerItemCost, nItems: Int)(block: () ⇒ R)(implicit E: ErgoTreeEvaluator): R

    Permalink

    Add the cost of a repeated operation to the accumulator and associate it with this operation.

    Add the cost of a repeated operation to the accumulator and associate it with this operation. The number of items (loop iterations) is known in advance (like in Coll.map operation)

    R

    result type of the operation

    costKind

    cost descriptor of the operation

    nItems

    number of operations known in advance (before loop execution)

    block

    operation executed under the given cost

    Definition Classes
    Value
    Annotations
    @inline()
  7. final def addSeqCostNoOp(costKind: PerItemCost, nItems: Int)(implicit E: ErgoTreeEvaluator): Unit

    Permalink

    Add the cost of a repeated operation to the accumulator and associate it with this operation.

    Add the cost of a repeated operation to the accumulator and associate it with this operation. The number of items (loop iterations) is known in advance (like in Coll.map operation)

    costKind

    cost descriptor of the operation

    nItems

    number of operations known in advance (before loop execution)

    Definition Classes
    Value
    Annotations
    @inline()
  8. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  9. val body: SValue

    Permalink
    Definition Classes
    ValNodeVal
  10. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. def companion: ValNode.type

    Permalink

    The companion node descriptor with opCode, cost and other metadata.

    The companion node descriptor with opCode, cost and other metadata.

    Definition Classes
    ValNodeValue
  12. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  13. def eval(env: DataEnv)(implicit E: ErgoTreeEvaluator): Any

    Permalink

    Defines an evaluation semantics of this tree node (aka Value or expression) in the given data environment.

    Defines an evaluation semantics of this tree node (aka Value or expression) in the given data environment. Should be implemented by all the ErgoTree nodes (aka operations). Thus, the ErgoTree interpreter implementation consists of combined implementations of this method. NOTE, this method shouldn't be called directly, instead use evalTo method.

    env

    immutable map, which binds variables (given by ids) to the values

    E

    Evaluator which defines evaluation context, cost accumulator, settings etc.

    returns

    the data value which is the result of evaluation

    Attributes
    protected
    Definition Classes
    Value
  14. final def evalTo[T](env: DataEnv)(implicit E: ErgoTreeEvaluator): T

    Permalink

    Evaluates this node to the value of the given expected type.

    Evaluates this node to the value of the given expected type. This method should called from all eval implementations.

    T

    expected type of the resulting value

    env

    immutable map, which binds variables (given by ids) to the values

    E

    Evaluator which defines evaluation context, cost accumulator, settings etc.

    returns

    the data value which is the result of evaluation

    Definition Classes
    Value
    Annotations
    @inline()
  15. def finalize(): Unit

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

    Permalink
    Definition Classes
    AnyRef → Any
  17. val givenType: SType

    Permalink
    Definition Classes
    ValNodeVal
  18. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  19. val name: String

    Permalink
    Definition Classes
    ValNodeVal
  20. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  21. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  22. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  23. def opCode: OpCode

    Permalink

    Unique id of the node class used in serialization of ErgoTree.

    Unique id of the node class used in serialization of ErgoTree.

    Definition Classes
    Value
  24. def opName: String

    Permalink

    Name of the operation.

    Name of the operation.

    Definition Classes
    Value
  25. def opType: SFunc

    Permalink

    This is not used as operation, but rather to form a program structure

    This is not used as operation, but rather to form a program structure

    Definition Classes
    ValNodeValue
  26. def sourceContext: Nullable[SourceContext]

    Permalink
    Definition Classes
    Value
  27. def sourceContext_=(srcCtx: Nullable[SourceContext]): Unit

    Permalink
    Definition Classes
    Value
  28. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  29. def toSigmaProp: SigmaPropValue

    Permalink

    Transforms this expression to SigmaProp expression or throws an exception.

    Transforms this expression to SigmaProp expression or throws an exception.

    Definition Classes
    Value
  30. def tpe: SType

    Permalink

    The type of the value represented by this node.

    The type of the value represented by this node. If the value is an operation it is the type of operation result.

    Definition Classes
    ValNodeValue
  31. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Val

Inherited from Value[SType]

Inherited from SigmaNode

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped