CostTable

Type Members

type ExpressionCost = Int

Value Members

final def !=(arg0: Any): Boolean

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

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

Definition Classes
AnyRef → Any
val DefaultCosts: CostTable
val MinimalCost: Int
val OptionOp: Int
val accessBox: Int
val accessRegister: Int
final def asInstanceOf[T0]: T0

Definition Classes
Any
val avlTreeOp: Int
val castOp: Int
val castOpBigInt: Int
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
val collAccess: Int
val collByIndex: Int
val collLength: Int
val collToColl: Int
val comparisonBigInt: Int
val comparisonCost: Int
val comparisonPerKbCost: Int
val concreteCollectionItemCost: Int
val constCost: Int
val costFactorDecrease: Int
val costFactorIncrease: Int

Scaling factors to be applied to estimated cost (totalCost = cost * costFactorIncrease / costFactorDecrease
val decodePointCost: Int
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
val expCost: Int
val extractCost: Int
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def fromSeq(items: Seq[(String, String, Int)]): CostTable
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
val getVarCost: Int
val groupElementConst: Int
def hashCode(): Int

Definition Classes
AnyRef → Any
val hashPerKb: Int
val interpreterInitCost: Int
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val lambdaCost: Int
val lambdaInvoke: Int
val logicCost: Int
val multiply: Int
val multiplyBigInt: Int
val multiplyGroup: Int
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
val negateGroup: Int
val newAvlTreeCost: Int
val newBigIntPerItem: Int
val newCollValueCost: Int
val newOptionValueCost: Int
val newPairValueCost: Int
val newPrimValueCost: Int

Cost of creating new instances (kind of memory allocation cost).
Cost of creating new instances (kind of memory allocation cost). When the instance already exists them the corresponding Access/Extract cost should be added.
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val perGraphNodeCost: Int
val plusMinus: Int
val plusMinusBigInt: Int
val proveDHTupleEvalCost: Int
val proveDlogEvalCost: Int
val selectField: Int
val sigmaAndCost: Int
val sigmaOrCost: Int
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
val treeOp: Int
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Docs: class CostTable | package utxo

object CostTable extends Serializable

Type Members

type ExpressionCost = Int

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val DefaultCosts: CostTable

val MinimalCost: Int

val OptionOp: Int

val accessBox: Int

val accessRegister: Int

final def asInstanceOf[T0]: T0

val avlTreeOp: Int

val castOp: Int

val castOpBigInt: Int

def clone(): AnyRef

val collAccess: Int

val collByIndex: Int

val collLength: Int

val collToColl: Int

val comparisonBigInt: Int

val comparisonCost: Int

val comparisonPerKbCost: Int

val concreteCollectionItemCost: Int

val constCost: Int

val costFactorDecrease: Int

val costFactorIncrease: Int

val decodePointCost: Int

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

val expCost: Int

val extractCost: Int

def finalize(): Unit

def fromSeq(items: Seq[(String, String, Int)]): CostTable

final def getClass(): Class[_]

val getVarCost: Int

val groupElementConst: Int

def hashCode(): Int

val hashPerKb: Int

val interpreterInitCost: Int

final def isInstanceOf[T0]: Boolean

val lambdaCost: Int

val lambdaInvoke: Int

val logicCost: Int

val multiply: Int

val multiplyBigInt: Int

val multiplyGroup: Int

final def ne(arg0: AnyRef): Boolean

val negateGroup: Int

val newAvlTreeCost: Int

val newBigIntPerItem: Int

val newCollValueCost: Int

val newOptionValueCost: Int

val newPairValueCost: Int

val newPrimValueCost: Int

final def notify(): Unit

final def notifyAll(): Unit

val perGraphNodeCost: Int

val plusMinus: Int

val plusMinusBigInt: Int

val proveDHTupleEvalCost: Int

val proveDlogEvalCost: Int

val selectField: Int

val sigmaAndCost: Int

val sigmaOrCost: Int

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

def toString(): String

val treeOp: Int

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped