CostTable

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val DefaultCosts: CostTable

val MaxExpressions: Int

val MinimalCost: Int

val OptionOp: Int

val ScriptLimit: 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

Scaling factors to be applied to estimated cost (totalCost = cost * costFactorIncrease / costFactorDecrease

val decodePointCost: Int

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

val expCost: Int

val extractCost: Int

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

Cost of creating new instances (kind of memory allocation cost).

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(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit