Class/Object

sigmastate

SubstConstants

Related Docs: object SubstConstants | package sigmastate

Permalink

case class SubstConstants[T <: SType](scriptBytes: Value[SByteArray], positions: Value[SIntArray], newValues: Value[SCollection[T]]) extends Value[SByteArray] with NotReadyValueByteArray with Product with Serializable

Transforms serialized bytes of ErgoTree with segregated constants by replacing constants at given positions with new values. This operation allow to use serialized scripts as pre-defined templates. The typical usage is "check that output box have proposition equal to given script bytes, where minerPk (constants(0)) is replaced with currentMinerPk". Each constant in original scriptBytes have SType serialized before actual data (see ConstantSerializer). During substitution each value from newValues is checked to be an instance of the corresponding type. This means, the constants during substitution cannot change their types.

scriptBytes

serialized ErgoTree with ConstantSegregationFlag set to 1.

positions

zero based indexes in ErgoTree.constants array which should be replaced with new values

newValues

new values to be injected into the corresponding positions in ErgoTree.constants array

returns

original scriptBytes array where only specified constants are replaced and all other bytes remain exactly the same

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

Instance Constructors

  1. new SubstConstants(scriptBytes: Value[SByteArray], positions: Value[SIntArray], newValues: Value[SCollection[T]])

    Permalink

    scriptBytes

    serialized ErgoTree with ConstantSegregationFlag set to 1.

    positions

    zero based indexes in ErgoTree.constants array which should be replaced with new values

    newValues

    new values to be injected into the corresponding positions in ErgoTree.constants array

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. def clone(): AnyRef

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

    Permalink

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

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

    Definition Classes
    SubstConstantsValue
  11. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  12. final 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
    SubstConstantsValue
  13. 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()
  14. def finalize(): Unit

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

    Permalink
    Definition Classes
    AnyRef → Any
  16. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  17. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  18. val newValues: Value[SCollection[T]]

    Permalink

    new values to be injected into the corresponding positions in ErgoTree.constants array

  19. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  21. 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
  22. def opName: String

    Permalink

    Name of the operation.

    Name of the operation.

    Definition Classes
    Value
  23. val opType: SFunc

    Permalink

    Every value represents an operation and that operation can be associated with a function type, describing functional meaning of the operation, kind of operation signature.

    Every value represents an operation and that operation can be associated with a function type, describing functional meaning of the operation, kind of operation signature. Thus, we can obtain global operation identifiers by combining Value.opName with Value.opType, so that if (v1.opName == v2.opName) && (v1.opType == v2.opType) then v1 and v2 are functionally point-wise equivalent. This in particular means that if two _different_ ops have the same opType they _should_ have different opNames. Thus defined op ids are used in a v4.x Cost Model - a table of all existing primitives coupled with performance parameters.

    Definition Classes
    SubstConstantsValue
  24. val positions: Value[SIntArray]

    Permalink

    zero based indexes in ErgoTree.constants array which should be replaced with new values

  25. val scriptBytes: Value[SByteArray]

    Permalink

    serialized ErgoTree with ConstantSegregationFlag set to 1.

  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: SCollection[SByte.type]

    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
    NotReadyValueByteArrayValue
  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 NotReadyValueByteArray

Inherited from NotReadyValue[SByteArray]

Inherited from Value[SByteArray]

Inherited from SigmaNode

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped