object CostTable extends Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- CostTable
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
- type ExpressionCost = Int
Value Members
- val DefaultCosts: CostTable
- val MaxExpressions: Int
- val MinimalCost: Int
- val OptionOp: Int
- val ScriptLimit: Int
- val accessBox: Int
- val accessRegister: Int
- val avlTreeOp: Int
- val castOp: Int
- val castOpBigInt: Int
- 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
- val expCost: Int
- val extractCost: Int
- def fromSeq(items: Seq[(String, String, Int)]): CostTable
- val getVarCost: Int
- val groupElementConst: Int
- val hashPerKb: Int
- val interpreterInitCost: Int
- val lambdaCost: Int
- val lambdaInvoke: Int
- val logicCost: Int
- val multiply: Int
- val multiplyBigInt: Int
- val multiplyGroup: Int
- 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.
- val perGraphNodeCost: Int
- val plusMinus: Int
- val plusMinusBigInt: Int
- val proveDHTupleEvalCost: Int
- val proveDlogEvalCost: Int
- val selectField: Int
- val sigmaAndCost: Int
- val sigmaOrCost: Int
- val treeOp: Int