c

sigmastate.eval

CompiletimeIRContext

class CompiletimeIRContext extends Scalan with IRContext with CompiletimeCosting

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. CompiletimeIRContext
  2. CompiletimeCosting
  3. IRContext
  4. TreeBuilding
  5. Evaluation
  6. RuntimeCosting
  7. CostingRules
  8. SigmaLibrary
  9. CostedObjectsModule
  10. CostedObjectsDefs
  11. CostedObjects
  12. SigmaDslModule
  13. SigmaDslDefs
  14. SigmaDsl
  15. WrappersModule
  16. Library
  17. CostedOptionsModule
  18. CostedOptionsDefs
  19. CostedOptions
  20. MonoidInstancesModule
  21. MonoidInstancesDefs
  22. MonoidInstances
  23. MonoidsModule
  24. MonoidsDefs
  25. Monoids
  26. ConcreteCostsModule
  27. ConcreteCostsDefs
  28. ConcreteCosts
  29. ConcreteSizesModule
  30. ConcreteSizesDefs
  31. ConcreteSizes
  32. CostsModule
  33. CostsDefs
  34. Costs
  35. SizesModule
  36. SizesDefs
  37. Sizes
  38. CollsModule
  39. CollsDefs
  40. Colls
  41. WrappersSpecModule
  42. WrappersSpecDefs
  43. WrappersSpec
  44. WrappersModule
  45. WRTypesModule
  46. WRTypesDefs
  47. WRTypes
  48. WOptionsModule
  49. WOptionsDefs
  50. WOptions
  51. WSpecialPredefsModule
  52. WSpecialPredefsDefs
  53. WSpecialPredefs
  54. Scalan
  55. DefRewriting
  56. Modules
  57. Entities
  58. Thunks
  59. IfThenElse
  60. Functions
  61. ProgramGraphs
  62. AstGraphs
  63. Transforming
  64. UniversalOps
  65. Equal
  66. OrderingOps
  67. LogicalOps
  68. UnBinOps
  69. NumericOps
  70. Tuples
  71. MethodCalls
  72. GraphVizExport
  73. TypeDescs
  74. Base
  75. AnyRef
  76. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new CompiletimeIRContext()

Type Members

  1. abstract class BaseDef[+T] extends Scalan.Node with Scalan.Def[T]

    Base class for most predefined operations.

    Base class for most predefined operations.

    Definition Classes
    Base
  2. abstract class CompanionDef[T] extends Scalan.Node with Scalan.Def[T]

    Base class for virtualized instances of type companions.

    Base class for virtualized instances of type companions. Each virtualized entity type (trait or class) may have virtualized companion class.

    Definition Classes
    Base
  3. case class Const[T](x: T)(implicit eT: Scalan.Elem[T]) extends Scalan.BaseDef[T] with Product with Serializable

    Default node type for embedding of literal values to graph IR.

    Default node type for embedding of literal values to graph IR. This can be used or those types T when Elem[T] is defined, but Liftable[_,T] is not, i.e. for non-liftable types.

    x

    literal value

    eT

    type descriptor of IR type T

    Definition Classes
    Base
  4. trait Def[+T] extends Scalan.Node

    Base type for all graph nodes (aka computable value definitions).

    Base type for all graph nodes (aka computable value definitions). Each graph node or definition represent one operation node of the data flow graph.

    Definition Classes
    Base
  5. class EntityObject extends AnyRef

    Base class for all objects generated for virtualized types to support staged evaluation machinery.

    Base class for all objects generated for virtualized types to support staged evaluation machinery. Each object contains definitions which can be imported when necessary. All that objects are registered in entityObjects hash map, which is done while IR cake is constructed.

    Definition Classes
    Base
  6. case class EntityObjectOwner(obj: Scalan.EntityObject) extends Scalan.OwnerKind with Product with Serializable
    Definition Classes
    Base
  7. abstract class Node extends Product

    Base class for all IR nodes/operations/definitions.

    Base class for all IR nodes/operations/definitions.

    Definition Classes
    Base
  8. class NotImplementedStagingException extends Scalan.StagingException
    Definition Classes
    Base
  9. sealed abstract class OwnerKind extends AnyRef

    Variants of owner parameter of constructors of nested classes: 1) predefined node classes are owned by IR cake (ScalanOwner) 2) entity classes are owned by enclosing EntityObject

    Variants of owner parameter of constructors of nested classes: 1) predefined node classes are owned by IR cake (ScalanOwner) 2) entity classes are owned by enclosing EntityObject

    Definition Classes
    Base
  10. case class Placeholder[T](eT: Scalan.LElem[T]) extends Scalan.Node with Scalan.Def[T] with Product with Serializable

    Symbols may temporary refer to this node until their target node is updated.

    Symbols may temporary refer to this node until their target node is updated.

    Definition Classes
    Base
  11. abstract class Ref[+T] extends AnyRef

    Abstract representation of a computable value.

    Abstract representation of a computable value. Default implementation is a simple lightweight reference to the corresponding definition. Every Ref have direct access to its Def via node property. Every Ref is typed, and the type is avaliable via elem property.

    Definition Classes
    Base
    See also

    SingleRep

  12. final class SingleRef[+T] extends Scalan.Ref[T]

    A Ref is a symbolic reference used internally to refer to graph nodes.

    A Ref is a symbolic reference used internally to refer to graph nodes. Light weight stateless immutable reference to a graph node (Def[T]). Two symbols are equal if they refer to the nodes with the same id, which is due to Def unification means equal symbols refer to the same instance of Def.

    Definition Classes
    Base
  13. class StagingException extends RuntimeException
    Definition Classes
    Base
  14. abstract class Transformer extends AnyRef

    Base class for Ref to Ref transformations.

    Base class for Ref to Ref transformations. Each transformer keeps a mapping data between references to original nodes and references to the corresponding transformed nodes.

    Definition Classes
    Base
  15. case class Variable[T](varId: Int)(implicit eT: Scalan.LElem[T]) extends Scalan.Node with Scalan.Def[T] with Product with Serializable

    Node class for typed variables.

    Node class for typed variables. In particular for lambda-bound variables.

    varId

    is independent from nodeId, shouldn't be used as node id.

    eT

    type descriptor of the variable type

    Definition Classes
    Base
  16. abstract class CompanionElem[T] extends Scalan.Elem[T]

    Base class for all descriptors of staged companions

    Base class for all descriptors of staged companions

    Definition Classes
    Entities
  17. trait ConcreteElem[TData, TClass] extends Scalan.EntityElem[TClass]

    Base class for all descriptors of staged classes.

    Base class for all descriptors of staged classes.

    Definition Classes
    Entities
  18. trait ConcreteElem1[A, TData, TClass, C[_]] extends Scalan.EntityElem1[A, TClass, C]

    Base class for all descriptors of staged classes with one type parameter.

    Base class for all descriptors of staged classes with one type parameter. Note, it doesn't inherit from ConcreteElem

    Definition Classes
    Entities
  19. abstract class EntityElem[A] extends Scalan.Elem[A] with Equals

    Base class for all descriptors of staged traits.

    Base class for all descriptors of staged traits. See derived classes in impl packages.

    Definition Classes
    Entities
  20. abstract class EntityElem1[A, To, C[_]] extends Scalan.EntityElem[To]

    Base class for all descriptors of staged traits with one type parameter.

    Base class for all descriptors of staged traits with one type parameter.

    Definition Classes
    Entities
  21. case class InvokeFailure(exception: Throwable) extends Scalan.InvokeResult with Product with Serializable

    Exception thrown during MethodCall invocation.

    Exception thrown during MethodCall invocation.

    Definition Classes
    MethodCalls
  22. sealed abstract class InvokeResult extends AnyRef

    Result of MethodCall invocation.

    Result of MethodCall invocation.

    Definition Classes
    MethodCalls
    See also

    tryInvoke

  23. case class InvokeSuccess(result: Scalan.Ref[_]) extends Scalan.InvokeResult with Product with Serializable

    Successful MethodCall invocation with the given result.

    Successful MethodCall invocation with the given result.

    Definition Classes
    MethodCalls
  24. case class MethodCall extends Scalan.Node with Scalan.Def[Any] with Product with Serializable

    Graph node to represent invocation of the method of some class.

    Graph node to represent invocation of the method of some class.

    Definition Classes
    MethodCalls
  25. case class NewObject[A](eA: Scalan.Elem[A], args: Seq[Any]) extends Scalan.BaseDef[A] with Product with Serializable

    Represents invocation of constructor of the class described by eA.

    Represents invocation of constructor of the class described by eA.

    eA

    class descriptor for new instance

    args

    arguments of class constructor

    Definition Classes
    MethodCalls
  26. abstract class BaseElem[A] extends Scalan.Elem[A] with Serializable with Equals
    Definition Classes
    TypeDescs
  27. class BaseElemLiftable[A] extends Scalan.BaseElem[A]

    Type descriptor for primitive types.

    Type descriptor for primitive types. There is implicit val declaration for each primitive type.

    Definition Classes
    TypeDescs
  28. abstract class Cont[F[_]] extends Scalan.TypeDesc

    Descriptor of type constructor of * -> * kind.

    Descriptor of type constructor of * -> * kind. Type constructor is not a type, but rather a function from type to type. It contains methods which abstract relationship between types T, F[T] etc.

    Definition Classes
    TypeDescs
    Annotations
    @implicitNotFound( "No Cont available for ${F}." )
  29. abstract class Elem[A] extends Scalan.TypeDesc

    Type descriptor of staged types, which correspond to source (unstaged) RTypes defined outside of IR cake.

    Type descriptor of staged types, which correspond to source (unstaged) RTypes defined outside of IR cake.

    A

    the type represented by this descriptor

    Definition Classes
    TypeDescs
    Annotations
    @implicitNotFound( "No Elem available for ${A}." )
  30. class ElemCacheEntry extends AnyRef

    Elements cache information for each Elem class.

    Elements cache information for each Elem class.

    Definition Classes
    TypeDescs
  31. case class EnvRep[A](run: (Scalan.DataEnv) ⇒ (Scalan.DataEnv, Scalan.Ref[A])) extends Product with Serializable

    State monad for symbols computed in a data environment.

    State monad for symbols computed in a data environment. DataEnv is used as the state of the state monad.

    Definition Classes
    TypeDescs
  32. case class FuncElem[A, B](eDom: Scalan.Elem[A], eRange: Scalan.Elem[B]) extends Scalan.Elem[(A) ⇒ B] with Product with Serializable

    Type descriptor for A => B type where descriptors for A and B are given as arguments.

    Type descriptor for A => B type where descriptors for A and B are given as arguments.

    Definition Classes
    TypeDescs
  33. trait Functor[F[_]] extends Scalan.Cont[F]
    Definition Classes
    TypeDescs
  34. sealed abstract class MethodDesc extends AnyRef
    Definition Classes
    TypeDescs
  35. case class PairElem[A, B](eFst: Scalan.Elem[A], eSnd: Scalan.Elem[B]) extends Scalan.Elem[(A, B)] with Product with Serializable

    Type descriptor for (A, B) type where descriptors for A and B are given as arguments.

    Type descriptor for (A, B) type where descriptors for A and B are given as arguments.

    Definition Classes
    TypeDescs
  36. case class RMethodDesc(method: Method) extends Scalan.MethodDesc with Product with Serializable
    Definition Classes
    TypeDescs
  37. case class SumElem[A, B](eLeft: Scalan.Elem[A], eRight: Scalan.Elem[B]) extends Scalan.Elem[Scalan.|[A, B]] with Product with Serializable

    Type descriptor for A | B type where descriptors for A and B are given as arguments.

    Type descriptor for A | B type where descriptors for A and B are given as arguments.

    Definition Classes
    TypeDescs
  38. abstract class TypeDesc extends Serializable
    Definition Classes
    TypeDescs
  39. case class WMethodDesc(wrapSpec: WrapSpec, method: Method) extends Scalan.MethodDesc with Product with Serializable
    Definition Classes
    TypeDescs
  40. case class GraphFile(file: File, fileType: String) extends Product with Serializable
    Definition Classes
    GraphVizExport
  41. implicit class SeqExpExtensionsForEmitGraph extends AnyRef
    Definition Classes
    GraphVizExport
  42. implicit class EqualOps[A] extends AnyRef

    Extension methods to construct ApplyBinOp nodes

    Extension methods to construct ApplyBinOp nodes

    Definition Classes
    Equal
  43. case class Equals[A]()(implicit evidence$1: Scalan.Elem[A]) extends Scalan.BinOp[A, Boolean] with Product with Serializable

    Binary operation representing structural equality between arguments.

    Binary operation representing structural equality between arguments.

    Definition Classes
    Equal
  44. case class NotEquals[A]()(implicit evidence$2: Scalan.Elem[A]) extends Scalan.BinOp[A, Boolean] with Product with Serializable

    Binary operation representing structural inequality between arguments.

    Binary operation representing structural inequality between arguments.

    Definition Classes
    Equal
  45. case class Apply[A, B](f: Scalan.Ref[(A) ⇒ B], arg: Scalan.Ref[A], mayInline: Boolean = true) extends Scalan.Node with Scalan.Def[B] with Product with Serializable
    Definition Classes
    Functions
  46. implicit class FuncExtensions[A, B] extends AnyRef
    Definition Classes
    Functions
  47. class Lambda[A, B] extends Scalan.AstGraph with Scalan.Def[(A) ⇒ B]

    Represent lambda expression as IR node.

    Represent lambda expression as IR node.

    Definition Classes
    Functions
  48. implicit class LambdaOps[A, B] extends AnyRef
    Definition Classes
    Functions
  49. class LambdaStack extends AnyRef
    Definition Classes
    Functions
  50. class ElseIfBranch[T] extends AnyRef

    Defines syntax available after IF (cond) THEN thenp ELSEIF (cond1)

    Defines syntax available after IF (cond) THEN thenp ELSEIF (cond1)

    Definition Classes
    IfThenElse
  51. class IfBranch extends AnyRef

    Defines syntax available after IF (cond)

    Defines syntax available after IF (cond)

    Definition Classes
    IfThenElse
  52. case class IfThenElseLazy[T](cond: Scalan.Ref[Boolean], thenp: Scalan.Ref[Scalan.Thunk[T]], elsep: Scalan.Ref[Scalan.Thunk[T]]) extends Scalan.Node with Scalan.Def[T] with Product with Serializable

    IR node to represent IF condition with lazy branches.

    IR node to represent IF condition with lazy branches.

    Definition Classes
    IfThenElse
  53. class ThenIfBranch[T] extends AnyRef

    Defines syntax available after IF (cond) THEN thenp

    Defines syntax available after IF (cond) THEN thenp

    Definition Classes
    IfThenElse
  54. implicit class RepBooleanOps extends AnyRef
    Definition Classes
    LogicalOps
  55. case class Abs[T](n: ExactNumeric[T])(implicit evidence$8: Scalan.Elem[T]) extends Scalan.UnOp[T, T] with Product with Serializable
    Definition Classes
    NumericOps
  56. class DivOp[T] extends Scalan.EndoBinOp[T]
    Definition Classes
    NumericOps
  57. case class IntegralDivide[T](i: ExactIntegral[T])(implicit elem: Scalan.Elem[T]) extends Scalan.DivOp[T] with Product with Serializable
    Definition Classes
    NumericOps
  58. case class IntegralMod[T](i: ExactIntegral[T])(implicit elem: Scalan.Elem[T]) extends Scalan.DivOp[T] with Product with Serializable
    Definition Classes
    NumericOps
  59. implicit class IntegralOpsCls[T] extends AnyRef
    Definition Classes
    NumericOps
  60. case class NumericMinus[T](n: ExactNumeric[T])(implicit evidence$4: Scalan.Elem[T]) extends Scalan.EndoBinOp[T] with Product with Serializable
    Definition Classes
    NumericOps
  61. case class NumericNegate[T](n: ExactNumeric[T])(implicit evidence$7: Scalan.Elem[T]) extends Scalan.UnOp[T, T] with Product with Serializable
    Definition Classes
    NumericOps
  62. implicit class NumericOpsCls[T] extends AnyRef
    Definition Classes
    NumericOps
  63. case class NumericPlus[T](n: ExactNumeric[T])(implicit evidence$3: Scalan.Elem[T]) extends Scalan.EndoBinOp[T] with Product with Serializable
    Definition Classes
    NumericOps
  64. case class NumericTimes[T](n: ExactNumeric[T])(implicit evidence$5: Scalan.Elem[T]) extends Scalan.EndoBinOp[T] with Product with Serializable
    Definition Classes
    NumericOps
  65. case class NumericToDouble[T](n: ExactNumeric[T]) extends Scalan.UnOp[T, Double] with Product with Serializable
    Definition Classes
    NumericOps
  66. case class NumericToFloat[T](n: ExactNumeric[T]) extends Scalan.UnOp[T, Float] with Product with Serializable
    Definition Classes
    NumericOps
  67. case class NumericToInt[T](n: ExactNumeric[T]) extends Scalan.UnOp[T, Int] with Product with Serializable
    Definition Classes
    NumericOps
  68. case class NumericToLong[T](n: ExactNumeric[T]) extends Scalan.UnOp[T, Long] with Product with Serializable
    Definition Classes
    NumericOps
  69. case class OrderingCompare[T](ord: ExactOrdering[T]) extends Scalan.BinOp[T, Int] with Product with Serializable
    Definition Classes
    OrderingOps
  70. case class OrderingGT[T](ord: ExactOrdering[T]) extends Scalan.BinOp[T, Boolean] with Product with Serializable
    Definition Classes
    OrderingOps
  71. case class OrderingGTEQ[T](ord: ExactOrdering[T]) extends Scalan.BinOp[T, Boolean] with Product with Serializable
    Definition Classes
    OrderingOps
  72. case class OrderingLT[T](ord: ExactOrdering[T]) extends Scalan.BinOp[T, Boolean] with Product with Serializable
    Definition Classes
    OrderingOps
  73. case class OrderingLTEQ[T](ord: ExactOrdering[T]) extends Scalan.BinOp[T, Boolean] with Product with Serializable
    Definition Classes
    OrderingOps
  74. case class OrderingMax[T](ord: ExactOrdering[T])(implicit evidence$1: Scalan.Elem[T]) extends Scalan.BinOp[T, T] with Product with Serializable
    Definition Classes
    OrderingOps
  75. case class OrderingMin[T](ord: ExactOrdering[T])(implicit evidence$2: Scalan.Elem[T]) extends Scalan.BinOp[T, T] with Product with Serializable
    Definition Classes
    OrderingOps
  76. class OrderingOpsCls[T] extends AnyRef
    Definition Classes
    OrderingOps
  77. case class LiftableThunk[ST, T](lT: Base.Liftables.Liftable[ST, T]) extends Base.Liftables.Liftable[Scalan.SThunk[ST], Scalan.Thunk[T]] with Product with Serializable
    Definition Classes
    Thunks
  78. implicit class RepThunkOps[T] extends AnyRef
    Definition Classes
    Thunks
  79. trait Thunk[+A] extends AnyRef
    Definition Classes
    Thunks
  80. class ThunkCompanion extends AnyRef
    Definition Classes
    Thunks
  81. case class ThunkConst[ST, T](constValue: Scalan.SThunk[ST], lT: Base.Liftables.Liftable[ST, T]) extends Scalan.BaseDef[Scalan.Thunk[T]] with LiftedConst[Scalan.SThunk[ST], Scalan.Thunk[T]] with Product with Serializable
    Definition Classes
    Thunks
  82. class ThunkDef[A] extends Scalan.AstGraph with Scalan.Def[Scalan.Thunk[A]]
    Definition Classes
    Thunks
  83. case class ThunkElem[A](eItem: Scalan.Elem[A]) extends Scalan.EntityElem1[A, Scalan.Thunk[A], Scalan.Thunk] with Product with Serializable
    Definition Classes
    Thunks
  84. case class ThunkForce[A](thunk: Scalan.Ref[Scalan.Thunk[A]]) extends Scalan.Node with Scalan.Def[A] with Product with Serializable
    Definition Classes
    Thunks
  85. class ThunkScope extends AnyRef
    Definition Classes
    Thunks
  86. class ThunkStack extends AnyRef
    Definition Classes
    Thunks
  87. case class First[A, B](pair: Scalan.Ref[(A, B)]) extends Scalan.Node with Scalan.Def[A] with Product with Serializable
    Definition Classes
    Tuples
  88. implicit class ListOps[A, B] extends AnyRef
    Definition Classes
    Tuples
  89. case class Second[A, B](pair: Scalan.Ref[(A, B)]) extends Scalan.Node with Scalan.Def[B] with Product with Serializable
    Definition Classes
    Tuples
  90. case class Tup[A, B](a: Scalan.Ref[A], b: Scalan.Ref[B]) extends Scalan.Node with Scalan.Def[(A, B)] with Product with Serializable
    Definition Classes
    Tuples
  91. implicit class TupleOps2[A, B] extends AnyRef
    Definition Classes
    Tuples
  92. implicit class TupleOps3[A, B, C] extends AnyRef
    Definition Classes
    Tuples
  93. implicit class TupleOps4[A, B, C, D] extends AnyRef
    Definition Classes
    Tuples
  94. implicit class TupleOps5[A, B, C, D, E] extends AnyRef
    Definition Classes
    Tuples
  95. case class ApplyBinOp[A, R](op: Scalan.BinOp[A, R], lhs: Scalan.Ref[A], rhs: Scalan.Ref[A]) extends Scalan.BaseDef[R] with Product with Serializable
    Definition Classes
    UnBinOps
  96. case class ApplyBinOpLazy[A, R](op: Scalan.BinOp[A, R], lhs: Scalan.Ref[A], rhs: Scalan.Ref[Scalan.Thunk[A]]) extends Scalan.BaseDef[R] with Product with Serializable
    Definition Classes
    UnBinOps
  97. case class ApplyUnOp[A, R](op: Scalan.UnOp[A, R], arg: Scalan.Ref[A]) extends Scalan.BaseDef[R] with Product with Serializable
    Definition Classes
    UnBinOps
  98. class BinOp[A, R] extends AnyRef
    Definition Classes
    UnBinOps
  99. class UnOp[A, R] extends AnyRef
    Definition Classes
    UnBinOps
  100. case class Convert[From, To](eFrom: Scalan.Elem[From], eTo: Scalan.Elem[To], x: Scalan.Ref[Scalan.Def[_]], conv: Scalan.Ref[(From) ⇒ To]) extends Scalan.BaseDef[To] with Product with Serializable
    Definition Classes
    UniversalOps
  101. case class Downcast[From, To](input: Scalan.Ref[From], eTo: Scalan.Elem[To]) extends Scalan.BaseDef[To] with Product with Serializable
    Definition Classes
    UniversalOps
  102. case class HashCode[A]() extends Scalan.UnOp[A, Int] with Product with Serializable
    Definition Classes
    UniversalOps
  103. case class OpCost(lambdaVar: Scalan.Sym, costedValueId: Int, args: Seq[Scalan.Ref[Int]], opCost: Scalan.Ref[Int]) extends Scalan.BaseDef[Int] with Product with Serializable

    Special graph node to represent accumulation of the operation costs.

    Special graph node to represent accumulation of the operation costs. In general, due to node sharing it is incorrect to just sum up all the args costs and add resCost to that value. Example:
    val x = .. val y = op1(x) val z = op2(x) val res = op3(y, z) The naive summation will lead to the cost of x is accumulated both into cost of y and into cost of z, so in the cost of res it is accumulated twice. To avoid this problem OpCost nodes require special handling in during evaluation.

    lambdaVar

    the variable of the lambda in which scope this node is created. This makes this node belong to the lambda body, even if it doesn't otherwise depend on lambda argument.

    costedValueId

    The id of the node for which this node represents cost

    args

    costs of the arguments, which are here represent dependency information.

    opCost

    operation cost, which should be added to the current scope accumulated cost

    Definition Classes
    UniversalOps
  104. implicit class RepUniversalOps[A] extends AnyRef
    Definition Classes
    UniversalOps
  105. case class SizeOf[T](value: Scalan.Ref[T]) extends Scalan.BaseDef[Long] with Product with Serializable

    Represents calculation of size in bytes of the given value.

    Represents calculation of size in bytes of the given value. The descriptor value.elem can be used to decompose value into components.

    Definition Classes
    UniversalOps
  106. case class ToString[A]() extends Scalan.UnOp[A, String] with Product with Serializable
    Definition Classes
    UniversalOps
  107. case class Upcast[From, To](input: Scalan.Ref[From], eTo: Scalan.Elem[To]) extends Scalan.BaseDef[To] with Product with Serializable
    Definition Classes
    UniversalOps
  108. abstract class AstGraph extends Scalan.Node

    Base class for all compound nodes with schedule (e.g.

    Base class for all compound nodes with schedule (e.g. Lambda, ThunkDef). The graph is directed acyclic (i.e. DAG) in which edges go from boundVars down to roots.

    Definition Classes
    AstGraphs
  109. case class GraphNode(sym: Scalan.Sym, usages: Buffer[Int]) extends Product with Serializable

    GraphNode is created for each symbol of the AstGraph and represents graph linking structure

    GraphNode is created for each symbol of the AstGraph and represents graph linking structure

    Definition Classes
    AstGraphs
  110. class PGraphUsages extends DFunc[Int, Buffer[Int]]

    Deboxed function to obtain usages of a given node.

    Deboxed function to obtain usages of a given node. Represents adjacency matrix of the reversed graph g.

    Definition Classes
    ProgramGraphs
  111. case class ProgramGraph(roots: Seq[Scalan.Sym], mapping: Nullable[Scalan.Transformer], filterNode: Nullable[(Scalan.Sym) ⇒ Boolean]) extends Scalan.AstGraph with Product with Serializable

    Immutable graph collected from roots following Ref.node.deps links.

    Immutable graph collected from roots following Ref.node.deps links.

    Definition Classes
    ProgramGraphs
  112. class DefaultPass extends Scalan.Pass

    Default pass to be used when IR is used without special compiler configuration.

    Default pass to be used when IR is used without special compiler configuration.

    Definition Classes
    Transforming
  113. case class MapTransformer(subst: HashMap[Scalan.Sym, Scalan.Sym]) extends Scalan.Transformer with Product with Serializable

    Concrete and default implementation of Transformer using underlying HashMap.

    Concrete and default implementation of Transformer using underlying HashMap.

    Definition Classes
    Transforming
  114. abstract class Mirror extends AnyRef

    Base class for mirrors of graph nodes.

    Base class for mirrors of graph nodes. Provides default implementations which can be overriden if special logic is required.

    Definition Classes
    Transforming
  115. implicit class PartialRewriter extends Scalan.Rewriter

    Turns partial function into rewriter (i.e.

    Turns partial function into rewriter (i.e. set of rewriting rules)

    Definition Classes
    Transforming
  116. abstract class Pass extends AnyRef

    Descriptor of a current compiler pass.

    Descriptor of a current compiler pass. Compiler can be configured to perform one pass after another. Each pass has name, configuration parameters, finalizaton logic etc.

    Definition Classes
    Transforming
  117. case class PassConfig(shouldUnpackTuples: Boolean = false, shouldExtractFields: Boolean = true, constantPropagation: Boolean = true, shouldSlice: Boolean = false) extends Product with Serializable

    Configuration parameters of the Pass descriptor.

    Configuration parameters of the Pass descriptor.

    Definition Classes
    Transforming
  118. abstract class Rewriter extends AnyRef
    Definition Classes
    Transforming
  119. type ContextFunc[T <: SType] = (special.sigma.Context) ⇒ Value[T]
    Definition Classes
    Evaluation
  120. type CostedCollFunc[A, B] = (Costed[A]) ⇒ CostedColl[B]
    Definition Classes
    RuntimeCosting
  121. type CostedOptionFunc[A, B] = (Costed[A]) ⇒ CostedOption[B]
    Definition Classes
    RuntimeCosting
  122. type CostedTh[T] = Ref[Thunk[Costed[T]]]
    Definition Classes
    RuntimeCosting
  123. type CostingEnv = Map[Any, RCosted[_]]
    Definition Classes
    RuntimeCosting
  124. type DataEnv = Map[Sym, AnyRef]

    Immutable data environment used to assign data values to graph nodes.

    Immutable data environment used to assign data values to graph nodes.

    Definition Classes
    TypeDescs
  125. type DefEnv = Map[Sym, (Int, SType)]

    Describes assignment of valIds for symbols which become ValDefs.

    Describes assignment of valIds for symbols which become ValDefs. Each ValDef in current scope have entry in this map

    Definition Classes
    TreeBuilding
  126. type EndoBinOp[A] = BinOp[A, A]
    Definition Classes
    UnBinOps
  127. type EndoUnOp[A] = UnOp[A, A]
    Definition Classes
    UnBinOps
  128. type LElem[A] = Lazy[Elem[A]]

    Type descriptor which is computed lazily on demand.

    Type descriptor which is computed lazily on demand.

    Definition Classes
    TypeDescs
  129. type LambdaData[A, B] = (Lambda[A, B], Nullable[(Ref[A]) ⇒ Ref[B]], Ref[A], Ref[B])
    Definition Classes
    Functions
  130. type LazyRep[T] = MutableLazy[Ref[T]]
    Definition Classes
    Library
  131. type PGraph = ProgramGraph
    Definition Classes
    ProgramGraphs
  132. type RColl[T] = Ref[Coll[T]]
    Definition Classes
    RuntimeCosting
  133. type RCosted[A] = Ref[Costed[A]]
    Definition Classes
    Library
  134. type RCostedColl[T] = Ref[CostedColl[T]]
    Definition Classes
    RuntimeCosting
  135. type RCostedCollFunc[A, B] = Ref[CostedCollFunc[A, B]]
    Definition Classes
    RuntimeCosting
  136. type RCostedOption[T] = Ref[CostedOption[T]]
    Definition Classes
    RuntimeCosting
  137. type RCostedOptionFunc[A, B] = Ref[CostedOptionFunc[A, B]]
    Definition Classes
    RuntimeCosting
  138. type RCostingResult[T] = Ref[((Context) ⇒ T, ((Int, Size[Context])) ⇒ Int)]
    Definition Classes
    IRContext
  139. type RFunc[-A, +B] = Ref[(A) ⇒ B]
    Definition Classes
    Base
  140. type RFuncCosted[A, B] = Ref[(Costed[A]) ⇒ Costed[B]]
    Definition Classes
    RuntimeCosting
  141. type ROption[T] = Ref[WOption[T]]
    Definition Classes
    RuntimeCosting
  142. type RPair[+A, +B] = Ref[(A, B)]
    Definition Classes
    Base
  143. type RSize[Val] = Ref[Size[Val]]
    Definition Classes
    Library
  144. type SThunk[T] = () ⇒ T
    Definition Classes
    Thunks
  145. type Schedule = Seq[Sym]

    Type synonim for graph schedules.

    Type synonim for graph schedules.

    Definition Classes
    AstGraphs
  146. type ScheduleIds = Buffer[Int]

    Alternative representation of schedules using node ids.

    Alternative representation of schedules using node ids.

    Definition Classes
    AstGraphs
  147. type Subst = HashMap[Sym, Sym]
    Definition Classes
    Functions
  148. type Sym = Ref[_]

    Untyped shortcut sinonim of Ref, which is used as untyped reference to graph nodes (definitions).

    Untyped shortcut sinonim of Ref, which is used as untyped reference to graph nodes (definitions). Following a tradition in compiler engineering we call references to definitions as symbols.

    Definition Classes
    Base
  149. type Th[+T] = Ref[Thunk[T]]
    Definition Classes
    Thunks
  150. type |[+A, +B] = Either[A, B]
    Definition Classes
    Base
  151. class AvlTreeCoster extends IRContext.Coster[IRContext.AvlTree]

    Costing rules for SAvlTree methods

    Costing rules for SAvlTree methods

    Definition Classes
    CostingRules
  152. class BoxCoster extends IRContext.Coster[IRContext.Box]

    Costing rules for SBox methods

    Costing rules for SBox methods

    Definition Classes
    CostingRules
  153. case class Cast[To](eTo: IRContext.Elem[To], x: IRContext.Ref[IRContext.Def[_]]) extends IRContext.BaseDef[To] with Product with Serializable
    Definition Classes
    CostingRules
  154. class CollCoster[T] extends IRContext.Coster[IRContext.Coll[T]]

    Costing rules for SCollection methods (see object SCollection)

    Costing rules for SCollection methods (see object SCollection)

    Definition Classes
    CostingRules
  155. class ContextCoster extends IRContext.Coster[IRContext.Context]

    Costing rules for SContext methods

    Costing rules for SContext methods

    Definition Classes
    CostingRules
  156. abstract class Coster[T] extends AnyRef

    For each Sigma type there should be one Coster class (derived from this).

    For each Sigma type there should be one Coster class (derived from this). Each coster object implements a set of costing rules, one rule for each method of the corresponding Sigma type. For example, BoxCoster is coster for Box type, it contains rules for all methods registered in SBox type descriptor. This class defines generic costing helpers, to unify and simplify costing rules of individual methods.

    Definition Classes
    CostingRules
  157. abstract class CostingHandler[T] extends AnyRef

    Implements basic costing rule invocation mechanism.

    Implements basic costing rule invocation mechanism. Each MethodCall node of ErgoTree is costed using the same mechanism. When MethodCall is matched during traverse of ErgoTree in RuntimeCosting.evalNode: 1) the type of the receiver object is used to lookup the corresponding CostingHandler 2) The apply method of CostingHandler is called to create the Coster 3) When Coster is created, the costing-rule-method is looked up using reflection and then invoked. 4) The result of costing-rule-method is returned as the result of MethodCall node costing.

    Instances of this class are typically singleton objects (see below).

    Definition Classes
    CostingRules
    See also

    Coster

  158. class GroupElementCoster extends IRContext.Coster[IRContext.GroupElement]

    Costing rules for SGroupElement methods

    Costing rules for SGroupElement methods

    Definition Classes
    CostingRules
  159. class HeaderCoster extends IRContext.Coster[IRContext.Header]

    Costing rules for SHeader methods

    Costing rules for SHeader methods

    Definition Classes
    CostingRules
  160. class KnownCollInfo[T] extends AnyRef
    Definition Classes
    CostingRules
  161. class OptionCoster[T] extends IRContext.Coster[IRContext.WOption[T]]

    Costing rules for SOption methods (see object SOption)

    Costing rules for SOption methods (see object SOption)

    Definition Classes
    CostingRules
  162. class PreHeaderCoster extends IRContext.Coster[IRContext.PreHeader]

    Costing rules for SPreHeader methods

    Costing rules for SPreHeader methods

    Definition Classes
    CostingRules
  163. class SigmaDslBuilderCoster extends IRContext.Coster[IRContext.SigmaDslBuilder]

    Costing rules for SGlobal methods

    Costing rules for SGlobal methods

    Definition Classes
    CostingRules
  164. class CostAccumulator extends AnyRef

    Implements finite state machine with stack of graph blocks (scopes), which correspond to lambdas and thunks.

    Implements finite state machine with stack of graph blocks (scopes), which correspond to lambdas and thunks. It accepts messages: startScope(), endScope(), add(), reset() At any time totalCost is the currently accumulated cost.

    Definition Classes
    Evaluation
  165. class CostCounter extends AnyRef

    Incapsulate simple monotonic (add only) counter with reset.

    Incapsulate simple monotonic (add only) counter with reset.

    Definition Classes
    Evaluation
  166. case class RCostingResultEx[T](costedGraph: IRContext.Ref[(IRContext.Costed[IRContext.Context]) ⇒ IRContext.Costed[T]], costF: IRContext.Ref[((IRContext.Context, (Int, IRContext.Size[IRContext.Context]))) ⇒ Int]) extends Product with Serializable
    Definition Classes
    IRContext
  167. case class CostOf(opName: String, opType: SFunc) extends IRContext.BaseDef[Int] with Product with Serializable

    To enable specific configuration uncomment one of the lines above and use it in the beginPass below.

    To enable specific configuration uncomment one of the lines above and use it in the beginPass below.

    Definition Classes
    RuntimeCosting
  168. trait CostedThunk[A] extends IRContext.Node with IRContext.Costed[IRContext.Thunk[A]]
    Definition Classes
    RuntimeCosting
  169. case class CostedThunkCtor[A](costedBlock: IRContext.Ref[IRContext.Thunk[IRContext.Costed[A]]], thunkCost: IRContext.Ref[Int]) extends IRContext.Node with IRContext.CostedThunk[A] with Product with Serializable
    Definition Classes
    RuntimeCosting
  170. class CostingRuleStat extends AnyRef
    Definition Classes
    RuntimeCosting
  171. class ElemAccessor[T] extends AnyRef
    Definition Classes
    RuntimeCosting
  172. implicit class ElemOpsForCosting extends AnyRef
    Definition Classes
    RuntimeCosting
  173. case class PerKbCostOf(operId: OperationId, size: IRContext.Ref[Long]) extends IRContext.BaseDef[Int] with Product with Serializable

    Graph node which represents cost of operation, which depends on size of the data.

    Graph node which represents cost of operation, which depends on size of the data.

    operId

    id of the operation in CostTable

    size

    size of the data which is used to compute operation cost

    Definition Classes
    RuntimeCosting
  174. implicit class RCostedCollFuncOps[A, B] extends AnyRef
    Definition Classes
    RuntimeCosting
  175. implicit class RFuncCostedOps[A, B] extends AnyRef
    Definition Classes
    RuntimeCosting
  176. trait SizeThunk[A] extends IRContext.Node with IRContext.Size[IRContext.Thunk[A]]
    Definition Classes
    RuntimeCosting
  177. case class SizeThunkCtor[A](sizeBlock: IRContext.Ref[IRContext.Thunk[IRContext.Size[A]]]) extends IRContext.Node with IRContext.SizeThunk[A] with Product with Serializable
    Definition Classes
    RuntimeCosting
  178. trait Coll[A] extends scalan.Library.Node with scalan.Library.Def[scalan.Library.Coll[A]]
    Definition Classes
    Colls
    Annotations
    @ContainerType() @FunctorType() @Liftable() @WithMethodCallRecognizers()
  179. trait CollBuilder extends scalan.Library.Node with scalan.Library.Def[scalan.Library.CollBuilder]
    Definition Classes
    Colls
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  180. trait CollBuilderCompanion extends AnyRef
    Definition Classes
    Colls
  181. trait CollCompanion extends AnyRef
    Definition Classes
    Colls
  182. trait PairColl[L, R] extends scalan.Library.Node with scalan.Library.Coll[(L, R)]
    Definition Classes
    Colls
    Annotations
    @WithMethodCallRecognizers()
  183. trait PairCollCompanion extends AnyRef
    Definition Classes
    Colls
  184. trait ReplColl[A] extends scalan.Library.Node with scalan.Library.Coll[A]
    Definition Classes
    Colls
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  185. trait ReplCollCompanion extends AnyRef
    Definition Classes
    Colls
  186. abstract class CCostedBuilder extends scalan.Library.Node with scalan.Library.CostedBuilder
    Definition Classes
    ConcreteCosts
  187. trait CCostedBuilderCompanion extends AnyRef
    Definition Classes
    ConcreteCosts
  188. abstract class CCostedColl[Item] extends scalan.Library.Node with scalan.Library.CostedColl[Item]
    Definition Classes
    ConcreteCosts
  189. trait CCostedCollCompanion extends AnyRef
    Definition Classes
    ConcreteCosts
  190. abstract class CCostedFunc[Env, Arg, Res] extends scalan.Library.Node with scalan.Library.CostedFunc[Env, Arg, Res]
    Definition Classes
    ConcreteCosts
  191. trait CCostedFuncCompanion extends AnyRef
    Definition Classes
    ConcreteCosts
  192. abstract class CCostedPair[L, R] extends scalan.Library.Node with scalan.Library.CostedPair[L, R]
    Definition Classes
    ConcreteCosts
  193. trait CCostedPairCompanion extends AnyRef
    Definition Classes
    ConcreteCosts
  194. abstract class CCostedPrim[Val] extends scalan.Library.Node with scalan.Library.CostedPrim[Val]
    Definition Classes
    ConcreteCosts
  195. trait CCostedPrimCompanion extends AnyRef
    Definition Classes
    ConcreteCosts
  196. abstract class CSizeColl[Item] extends scalan.Library.Node with scalan.Library.SizeColl[Item]
    Definition Classes
    ConcreteSizes
  197. trait CSizeCollCompanion extends AnyRef
    Definition Classes
    ConcreteSizes
  198. abstract class CSizeFunc[Env, Arg, Res] extends scalan.Library.Node with scalan.Library.SizeFunc[Env, Arg, Res]
    Definition Classes
    ConcreteSizes
  199. trait CSizeFuncCompanion extends AnyRef
    Definition Classes
    ConcreteSizes
  200. abstract class CSizeOption[Item] extends scalan.Library.Node with scalan.Library.SizeOption[Item]
    Definition Classes
    ConcreteSizes
  201. trait CSizeOptionCompanion extends AnyRef
    Definition Classes
    ConcreteSizes
  202. abstract class CSizePair[L, R] extends scalan.Library.Node with scalan.Library.SizePair[L, R]
    Definition Classes
    ConcreteSizes
  203. trait CSizePairCompanion extends AnyRef
    Definition Classes
    ConcreteSizes
  204. abstract class CSizePrim[Val] extends scalan.Library.Node with scalan.Library.SizePrim[Val]
    Definition Classes
    ConcreteSizes
  205. trait CSizePrimCompanion extends AnyRef
    Definition Classes
    ConcreteSizes
  206. abstract class CCostedOption[T] extends scalan.Library.Node with scalan.Library.CostedOption[T]
    Definition Classes
    CostedOptions
  207. trait CCostedOptionCompanion extends AnyRef
    Definition Classes
    CostedOptions
  208. trait Costed[Val] extends scalan.Library.Node with scalan.Library.Def[scalan.Library.Costed[Val]]
    Definition Classes
    Costs
    Annotations
    @WithMethodCallRecognizers()
  209. trait CostedBuilder extends scalan.Library.Node with scalan.Library.Def[scalan.Library.CostedBuilder]
    Definition Classes
    Costs
    Annotations
    @WithMethodCallRecognizers()
  210. trait CostedBuilderCompanion extends AnyRef
    Definition Classes
    Costs
  211. trait CostedColl[Item] extends scalan.Library.Node with scalan.Library.Costed[scalan.Library.Coll[Item]]
    Definition Classes
    Costs
    Annotations
    @WithMethodCallRecognizers()
  212. trait CostedCollCompanion extends AnyRef
    Definition Classes
    Costs
  213. trait CostedCompanion extends AnyRef
    Definition Classes
    Costs
  214. trait CostedFunc[Env, Arg, Res] extends scalan.Library.Node with scalan.Library.Costed[(Arg) ⇒ Res]
    Definition Classes
    Costs
  215. trait CostedFuncCompanion extends AnyRef
    Definition Classes
    Costs
  216. trait CostedOption[T] extends scalan.Library.Node with scalan.Library.Costed[scalan.Library.WOption[T]]
    Definition Classes
    Costs
  217. trait CostedOptionCompanion extends AnyRef
    Definition Classes
    Costs
  218. trait CostedPair[L, R] extends scalan.Library.Node with scalan.Library.Costed[(L, R)]
    Definition Classes
    Costs
  219. trait CostedPairCompanion extends AnyRef
    Definition Classes
    Costs
  220. trait CostedPrim[Val] extends scalan.Library.Node with scalan.Library.Costed[Val]
    Definition Classes
    Costs
  221. trait CostedPrimCompanion extends AnyRef
    Definition Classes
    Costs
  222. abstract class IntPlusMonoid extends scalan.Library.Node with scalan.Library.Monoid[Int]
    Definition Classes
    MonoidInstances
  223. trait IntPlusMonoidCompanion extends AnyRef
    Definition Classes
    MonoidInstances
  224. abstract class LongPlusMonoid extends scalan.Library.Node with scalan.Library.Monoid[Long]
    Definition Classes
    MonoidInstances
  225. trait LongPlusMonoidCompanion extends AnyRef
    Definition Classes
    MonoidInstances
  226. abstract class MonoidBuilderInst extends scalan.Library.Node with scalan.Library.MonoidBuilder
    Definition Classes
    MonoidInstances
  227. trait MonoidBuilderInstCompanion extends AnyRef
    Definition Classes
    MonoidInstances
  228. trait Monoid[T] extends scalan.Library.Node with scalan.Library.Def[scalan.Library.Monoid[T]]
    Definition Classes
    Monoids
  229. trait MonoidBuilder extends scalan.Library.Node with scalan.Library.Def[scalan.Library.MonoidBuilder]
    Definition Classes
    Monoids
    Annotations
    @WithMethodCallRecognizers()
  230. trait MonoidBuilderCompanion extends AnyRef
    Definition Classes
    Monoids
  231. trait MonoidCompanion extends AnyRef
    Definition Classes
    Monoids
  232. trait Size[Val] extends scalan.Library.Node with scalan.Library.Def[scalan.Library.Size[Val]]
    Definition Classes
    Sizes
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  233. trait SizeColl[Item] extends scalan.Library.Node with scalan.Library.Size[scalan.Library.Coll[Item]]
    Definition Classes
    Sizes
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  234. trait SizeCollCompanion extends AnyRef
    Definition Classes
    Sizes
  235. trait SizeCompanion extends AnyRef
    Definition Classes
    Sizes
  236. trait SizeFunc[Env, Arg, Res] extends scalan.Library.Node with scalan.Library.Size[(Arg) ⇒ Res]
    Definition Classes
    Sizes
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  237. trait SizeFuncCompanion extends AnyRef
    Definition Classes
    Sizes
  238. trait SizeOption[T] extends scalan.Library.Node with scalan.Library.Size[scalan.Library.WOption[T]]
    Definition Classes
    Sizes
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  239. trait SizeOptionCompanion extends AnyRef
    Definition Classes
    Sizes
  240. trait SizePair[L, R] extends scalan.Library.Node with scalan.Library.Size[(L, R)]
    Definition Classes
    Sizes
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  241. trait SizePairCompanion extends AnyRef
    Definition Classes
    Sizes
  242. trait SizePrim[Val] extends scalan.Library.Node with scalan.Library.Size[Val]
    Definition Classes
    Sizes
    Annotations
    @Liftable()
  243. trait SizePrimCompanion extends AnyRef
    Definition Classes
    Sizes
  244. trait SizeAnyValue extends scalan.SigmaLibrary.Node with scalan.SigmaLibrary.Size[scalan.SigmaLibrary.AnyValue]
    Definition Classes
    CostedObjects
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  245. trait SizeAnyValueCompanion extends AnyRef
    Definition Classes
    CostedObjects
  246. trait SizeBox extends scalan.SigmaLibrary.Node with scalan.SigmaLibrary.Size[scalan.SigmaLibrary.Box]
    Definition Classes
    CostedObjects
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  247. trait SizeBoxCompanion extends AnyRef
    Definition Classes
    CostedObjects
  248. trait SizeBuilder extends scalan.SigmaLibrary.Node with scalan.SigmaLibrary.Def[scalan.SigmaLibrary.SizeBuilder]
    Definition Classes
    CostedObjects
    Annotations
    @Liftable()
  249. trait SizeBuilderCompanion extends AnyRef
    Definition Classes
    CostedObjects
  250. trait SizeContext extends scalan.SigmaLibrary.Node with scalan.SigmaLibrary.Size[scalan.SigmaLibrary.Context]
    Definition Classes
    CostedObjects
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  251. trait SizeContextCompanion extends AnyRef
    Definition Classes
    CostedObjects
  252. trait SizeSigmaProp extends scalan.SigmaLibrary.Node with scalan.SigmaLibrary.Size[scalan.SigmaLibrary.SigmaProp]
    Definition Classes
    CostedObjects
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  253. trait SizeSigmaPropCompanion extends AnyRef
    Definition Classes
    CostedObjects
  254. trait AnyValue extends scalan.SigmaLibrary.Node with scalan.SigmaLibrary.Def[scalan.SigmaLibrary.AnyValue]
    Definition Classes
    SigmaDsl
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  255. trait AnyValueCompanion extends AnyRef
    Definition Classes
    SigmaDsl
  256. trait AvlTree extends scalan.SigmaLibrary.Node with scalan.SigmaLibrary.Def[scalan.SigmaLibrary.AvlTree]
    Definition Classes
    SigmaDsl
    Annotations
    @Liftable()
  257. trait AvlTreeCompanion extends AnyRef
    Definition Classes
    SigmaDsl
  258. trait BigInt extends scalan.SigmaLibrary.Node with scalan.SigmaLibrary.Def[scalan.SigmaLibrary.BigInt]
    Definition Classes
    SigmaDsl
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  259. trait BigIntCompanion extends AnyRef
    Definition Classes
    SigmaDsl
  260. trait Box extends scalan.SigmaLibrary.Node with scalan.SigmaLibrary.Def[scalan.SigmaLibrary.Box]
    Definition Classes
    SigmaDsl
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  261. trait BoxCompanion extends AnyRef
    Definition Classes
    SigmaDsl
  262. trait Context extends scalan.SigmaLibrary.Node with scalan.SigmaLibrary.Def[scalan.SigmaLibrary.Context]
    Definition Classes
    SigmaDsl
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  263. trait ContextCompanion extends AnyRef
    Definition Classes
    SigmaDsl
  264. trait CostModel extends scalan.SigmaLibrary.Node with scalan.SigmaLibrary.Def[scalan.SigmaLibrary.CostModel]
    Definition Classes
    SigmaDsl
    Annotations
    @Liftable()
  265. trait CostModelCompanion extends AnyRef
    Definition Classes
    SigmaDsl
  266. trait GroupElement extends scalan.SigmaLibrary.Node with scalan.SigmaLibrary.Def[scalan.SigmaLibrary.GroupElement]
    Definition Classes
    SigmaDsl
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  267. trait GroupElementCompanion extends AnyRef
    Definition Classes
    SigmaDsl
  268. trait Header extends scalan.SigmaLibrary.Node with scalan.SigmaLibrary.Def[scalan.SigmaLibrary.Header]
    Definition Classes
    SigmaDsl
    Annotations
    @Liftable()
  269. trait HeaderCompanion extends AnyRef
    Definition Classes
    SigmaDsl
  270. trait PreHeader extends scalan.SigmaLibrary.Node with scalan.SigmaLibrary.Def[scalan.SigmaLibrary.PreHeader]
    Definition Classes
    SigmaDsl
    Annotations
    @Liftable()
  271. trait PreHeaderCompanion extends AnyRef
    Definition Classes
    SigmaDsl
  272. trait SigmaContract extends scalan.SigmaLibrary.Node with scalan.SigmaLibrary.Def[scalan.SigmaLibrary.SigmaContract]
    Definition Classes
    SigmaDsl
    Annotations
    @Liftable()
  273. trait SigmaContractCompanion extends AnyRef
    Definition Classes
    SigmaDsl
  274. trait SigmaDslBuilder extends scalan.SigmaLibrary.Node with scalan.SigmaLibrary.Def[scalan.SigmaLibrary.SigmaDslBuilder]
    Definition Classes
    SigmaDsl
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  275. trait SigmaDslBuilderCompanion extends AnyRef
    Definition Classes
    SigmaDsl
  276. trait SigmaProp extends scalan.SigmaLibrary.Node with scalan.SigmaLibrary.Def[scalan.SigmaLibrary.SigmaProp]
    Definition Classes
    SigmaDsl
    Annotations
    @Liftable() @WithMethodCallRecognizers()
  277. trait SigmaPropCompanion extends AnyRef
    Definition Classes
    SigmaDsl
  278. trait OptionWrapSpec extends scalan.Library.Node with scalan.Library.WrapSpecBase
    Definition Classes
    WrappersSpec
  279. trait OptionWrapSpecCompanion extends AnyRef
    Definition Classes
    WrappersSpec
  280. trait RTypeWrapSpec extends scalan.Library.Node with scalan.Library.WrapSpecBase
    Definition Classes
    WrappersSpec
  281. trait RTypeWrapSpecCompanion extends AnyRef
    Definition Classes
    WrappersSpec
  282. trait SpecialPredefWrapSpec extends scalan.Library.Node with scalan.Library.WrapSpecBase
    Definition Classes
    WrappersSpec
  283. trait SpecialPredefWrapSpecCompanion extends AnyRef
    Definition Classes
    WrappersSpec
  284. trait WrapSpecBase extends scalan.Library.Node with scalan.Library.Def[scalan.Library.WrapSpecBase] with WrapSpec
    Definition Classes
    WrappersSpec
  285. trait WrapSpecBaseCompanion extends AnyRef
    Definition Classes
    WrappersSpec
  286. trait WOption[A] extends special.wrappers.WrappersModule.Node with special.wrappers.WrappersModule.Def[special.wrappers.WrappersModule.WOption[A]]
    Definition Classes
    WOptions
    Annotations
    @External() @ContainerType() @FunctorType() @Liftable() @WithMethodCallRecognizers()
  287. trait WOptionCompanion extends AnyRef
    Definition Classes
    WOptions
  288. trait WRType[A] extends special.wrappers.WrappersModule.Node with special.wrappers.WrappersModule.Def[special.wrappers.WrappersModule.WRType[A]]
    Definition Classes
    WRTypes
    Annotations
    @External() @Liftable() @WithMethodCallRecognizers()
  289. trait WRTypeCompanion extends AnyRef
    Definition Classes
    WRTypes
  290. trait WSpecialPredef extends special.wrappers.WrappersModule.Node with special.wrappers.WrappersModule.Def[special.wrappers.WrappersModule.WSpecialPredef]
    Definition Classes
    WSpecialPredefs
    Annotations
    @External() @WithMethodCallRecognizers()
  291. trait WSpecialPredefCompanion extends AnyRef
    Definition Classes
    WSpecialPredefs

Value Members

  1. object &&

    Logical AND between two pattern matches of the save value x.

    Logical AND between two pattern matches of the save value x. Can be used to construct patterns like case P1 && P2 => ...

    Definition Classes
    Base
  2. object Def
    Definition Classes
    Base
  3. object ExpWithElem
    Definition Classes
    Base
  4. object Liftables

    Data type ST is liftable is there is Liftable[ST, T] instance for some type T.

    Data type ST is liftable is there is Liftable[ST, T] instance for some type T. Liftable typeclass allows to define which types can have values embedded as literals into graph IR.

    Definition Classes
    Base
  5. object NoOwner extends Scalan.OwnerKind with Product with Serializable
    Definition Classes
    Base
  6. object ScalanOwner extends Scalan.OwnerKind with Product with Serializable
    Definition Classes
    Base
  7. object IsNumericToInt
    Definition Classes
    Library
  8. object IsNumericToLong
    Definition Classes
    Library
  9. object InvokeImpossible extends Scalan.InvokeResult with Product with Serializable

    Invocation is not possible, e.g.

    Invocation is not possible, e.g. when receiver doesn't implemented the method.

    Definition Classes
    MethodCalls
  10. object Elem extends Serializable
    Definition Classes
    TypeDescs
  11. object EnvRep extends Serializable
    Definition Classes
    TypeDescs
  12. object ConstantLambda

    Matcher for lambdas which don't depend on their arguments (but can close over other expressions, unlike VeryConstantLambda).

    Matcher for lambdas which don't depend on their arguments (but can close over other expressions, unlike VeryConstantLambda).

    Definition Classes
    Functions
  13. object IdentityLambda
    Definition Classes
    Functions
  14. object Lambda
    Definition Classes
    Functions
  15. object VeryConstantLambda

    Matcher for lambdas which return staging-time constants.

    Matcher for lambdas which return staging-time constants. VeryConstantLambda(x) should be equivalent to ConstantLambda(Def(Const(x)))

    Definition Classes
    Functions
  16. object ConstantThunk
    Definition Classes
    Thunks
  17. object ThunkDef
    Definition Classes
    Thunks
  18. object IsPair
    Definition Classes
    Tuples
  19. object Pair
    Definition Classes
    Tuples
  20. object ProgramGraph extends Serializable
    Definition Classes
    ProgramGraphs
  21. object MapTransformer extends Serializable
    Definition Classes
    Transforming
  22. object Pass
    Definition Classes
    Transforming
  23. def !!!(msg: String, e: Throwable, syms: Ref[_]*): Nothing
    Definition Classes
    Base
  24. def !!!(msg: String, syms: Ref[_]*): Nothing
    Definition Classes
    Base
  25. def !!!: Nothing

    Helper methods to throw errors

    Helper methods to throw errors

    Definition Classes
    Base
  26. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  27. final def ##(): Int
    Definition Classes
    AnyRef → Any
  28. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  29. def ???(value: Any, syms: Ref[_]*): Nothing
    Definition Classes
    Base
  30. def ???: Nothing
    Definition Classes
    Base
  31. val And: BinOp[Boolean, Boolean]
    Definition Classes
    LogicalOps
  32. val AnyElement: Elem[Any]

    Type descriptor for Any, cannot be used implicitly.

    Type descriptor for Any, cannot be used implicitly.

    Definition Classes
    TypeDescs
  33. val AnyRefElement: Elem[AnyRef]

    Type descriptor for AnyRef, cannot be used implicitly.

    Type descriptor for AnyRef, cannot be used implicitly.

    Definition Classes
    TypeDescs
  34. val AvlTreeDigestInfo: KnownCollInfo[Byte]
    Definition Classes
    CostingRules
  35. val BinaryXorOp: BinOp[Boolean, Boolean]
    Definition Classes
    LogicalOps
  36. implicit val BooleanElement: Elem[Boolean]
    Definition Classes
    TypeDescs
  37. val BooleanToInt: UnOp[Boolean, Int]
    Definition Classes
    LogicalOps
  38. val BoxBytesInfo: KnownCollInfo[Byte]
    Definition Classes
    CostingRules
  39. val BoxBytesWithoutRefsInfo: KnownCollInfo[Byte]
    Definition Classes
    CostingRules
  40. val BoxPropositionBytesInfo: KnownCollInfo[Byte]
    Definition Classes
    CostingRules
  41. implicit val ByteElement: Elem[Byte]
    Definition Classes
    TypeDescs
  42. val CM: CollMethods.type
    Definition Classes
    Library
  43. implicit val CharElement: Elem[Char]
    Definition Classes
    TypeDescs
  44. def Colls: special.collection.CollBuilder
    Definition Classes
    RuntimeCosting
    Annotations
    @inline()
  45. def CostOfDHTuple: Ref[Int]
    Definition Classes
    RuntimeCosting
    Annotations
    @inline()
  46. def CostOfProveDlog: Ref[Int]
    Definition Classes
    RuntimeCosting
    Annotations
    @inline()
  47. val DefaultMirror: Mirror

    Default Mirror instance which is used in core IR methods.

    Default Mirror instance which is used in core IR methods.

    Definition Classes
    Transforming
  48. implicit val DoubleElement: Elem[Double]
    Definition Classes
    TypeDescs
  49. val DowncastBigIntOpType: SFunc
    Definition Classes
    RuntimeCosting
  50. val EValOfSizeColl: ElemAccessor[Coll[Size[Any]]]
    Definition Classes
    RuntimeCosting
  51. val EmptyTypeArgs: ListMap[String, (TypeDesc, Variance)]

    Since ListMap is immutable this empty map can be shared by all other maps created from it.

    Since ListMap is immutable this empty map can be shared by all other maps created from it.

    Definition Classes
    TypeDescs
  52. val EncodedGroupElementInfo: KnownCollInfo[Byte]
    Definition Classes
    CostingRules
  53. implicit val FloatElement: Elem[Float]
    Definition Classes
    TypeDescs
  54. implicit final def FuncElemExtensions[A, B](eAB: Elem[(A) ⇒ B]): FuncElem[A, B]
    Definition Classes
    TypeDescs
  55. val HashInfo: KnownCollInfo[Byte]
    Definition Classes
    CostingRules
  56. val HeadersInfo: KnownCollInfo[Header]
    Definition Classes
    CostingRules
  57. def IF(cond: Ref[Boolean]): IfBranch

    If c then t else e construction with standard lazy evaluation of branches.

    If c then t else e construction with standard lazy evaluation of branches. The representation uses Thunk for each branch

    Definition Classes
    IfThenElse
  58. implicit val IntElement: Elem[Int]
    Definition Classes
    TypeDescs
  59. final def IntZero: Ref[Int]

    Zero literal node, which is lazily created and can be efficiently reused.

    Zero literal node, which is lazily created and can be efficiently reused. Much faster alternative to (0: Rep[Int]) or toRep(0).

    Definition Classes
    Base
    Annotations
    @inline()
  60. val LazyAnyElement: Lazy[Elem[Any]]

    Predefined Lazy value saved here to be used in hotspot code.

    Predefined Lazy value saved here to be used in hotspot code.

    Definition Classes
    TypeDescs
  61. val LongBytesInfo: KnownCollInfo[Byte]
    Definition Classes
    CostingRules
  62. implicit val LongElement: Elem[Long]
    Definition Classes
    TypeDescs
  63. val NoRewriting: Rewriter

    Identity rewriter, i.e.

    Identity rewriter, i.e. doesn't change the graph when applied.

    Definition Classes
    Transforming
  64. val NonceBytesInfo: KnownCollInfo[Byte]
    Definition Classes
    CostingRules
  65. val Not: UnOp[Boolean, Boolean]
    Definition Classes
    LogicalOps
  66. val NothingElement: Elem[Nothing]
    Definition Classes
    TypeDescs
  67. val Or: BinOp[Boolean, Boolean]
    Definition Classes
    LogicalOps
  68. implicit def OrderingToOrderingOps[T](x: T)(implicit n: ExactOrdering[T], et: Elem[T]): OrderingOpsCls[T]
    Definition Classes
    OrderingOps
  69. implicit final def PairElemExtensions[A, B](eAB: Elem[(A, B)]): PairElem[A, B]
    Definition Classes
    TypeDescs
  70. def RCostedThunk[A](costedBlock: Ref[Thunk[Costed[A]]], thunkCost: Ref[Int]): Ref[Costed[Thunk[A]]]
    Definition Classes
    RuntimeCosting
  71. def RSizeThunk[A](sizeBlock: Ref[Thunk[Size[A]]]): Ref[Size[Thunk[A]]]
    Definition Classes
    RuntimeCosting
  72. def SOME[A](x: Ref[A]): Ref[WOption[A]]
    Definition Classes
    CostingRules
  73. implicit val ShortElement: Elem[Short]
    Definition Classes
    TypeDescs
  74. def SigmaDsl: CostingSigmaDslBuilder.type
    Definition Classes
    RuntimeCosting
    Annotations
    @inline()
  75. val SigmaPropBytesInfo: KnownCollInfo[Byte]
    Definition Classes
    CostingRules
  76. def SizeAvlTree: RSize[AvlTree]
    Definition Classes
    CostingRules
    Annotations
    @inline()
  77. def SizeBigInt: RSize[BigInt]
    Definition Classes
    CostingRules
    Annotations
    @inline()
  78. def SizeBoolean: RSize[Boolean]
    Definition Classes
    CostingRules
    Annotations
    @inline()
  79. def SizeByte: RSize[Byte]
    Definition Classes
    CostingRules
    Annotations
    @inline()
  80. def SizeGroupElement: RSize[GroupElement]
    Definition Classes
    CostingRules
    Annotations
    @inline()
  81. def SizeInt: RSize[Int]
    Definition Classes
    CostingRules
    Annotations
    @inline()
  82. def SizeLong: RSize[Long]
    Definition Classes
    CostingRules
    Annotations
    @inline()
  83. def SizeShort: RSize[Short]
    Definition Classes
    CostingRules
    Annotations
    @inline()
  84. def SizeSigmaProposition: RSize[SigmaProp]
    Definition Classes
    CostingRules
    Annotations
    @inline()
  85. def SizeString: RSize[String]
    Definition Classes
    CostingRules
    Annotations
    @inline()
  86. def SizeUnit: RSize[Unit]
    Definition Classes
    CostingRules
    Annotations
    @inline()
  87. def SomeIntZero: Ref[WOption[Int]]
    Definition Classes
    CostingRules
    Annotations
    @inline()
  88. implicit val StringElement: Elem[String]
    Definition Classes
    TypeDescs
  89. implicit final def SumElemExtensions[A, B](eAB: Elem[|[A, B]]): SumElem[A, B]
    Definition Classes
    TypeDescs
  90. val Thunk: ThunkCompanion
    Definition Classes
    Thunks
  91. val TokensInfo: KnownCollInfo[(Coll[Byte], Long)]
    Definition Classes
    CostingRules
  92. final def TypeArgs(descs: (String, (TypeDesc, Variance))*): ListMap[String, (TypeDesc, Variance)]
    Definition Classes
    TypeDescs
  93. implicit val UnitElement: Elem[Unit]
    Definition Classes
    TypeDescs
  94. val UpcastBigIntOpType: SFunc
    Definition Classes
    RuntimeCosting
  95. val VotesInfo: KnownCollInfo[Byte]
    Definition Classes
    CostingRules
  96. def WRTypeSigmaProp: Ref[WRType[SigmaProp]]
    Definition Classes
    CostingRules
    Annotations
    @inline()
  97. val _costOfProveDHTuple: CostOf
    Definition Classes
    RuntimeCosting
  98. val _costOfProveDlogEval: CostOf
    Definition Classes
    RuntimeCosting
  99. val _currentPass: Pass
    Definition Classes
    Transforming
  100. def adaptSigmaBoolean(v: BoolValue): Value[SBoolean.type]
    Definition Classes
    RuntimeCosting
  101. final def allContextDependant(syms: Array[Sym]): Boolean

    Definition Classes
    RuntimeCosting
    Annotations
    @inline()
  102. def allowedOpCodesInCosting: HashSet[OpCodeExtra]

    Returns a set of opCodeEx values (extended op codes) which are allowed in cost function.

    Returns a set of opCodeEx values (extended op codes) which are allowed in cost function. This may include both ErgoTree codes (from OpCodes) and also additional non-ErgoTree codes from OpCodesExtra. Any IR graph node can be uniquely assigned to extended op code value from OpCodes + OpCodesExtra combined range. (See getOpCodeEx)

    Attributes
    protected
    Definition Classes
    Evaluation
  103. def alphaEqual(s1: Sym, s2: Sym): Boolean
    Definition Classes
    Functions
  104. def applyBinOp[A, R](op: BinOp[A, R], lhs: Ref[A], rhs: Ref[A]): Ref[R]
    Definition Classes
    UnBinOps
  105. def applyBinOpLazy[A, R](op: BinOp[A, R], lhs: Ref[A], rhs: Ref[Thunk[A]]): Ref[R]
    Definition Classes
    UnBinOps
  106. def applyUnOp[A, R](op: UnOp[A, R], arg: Ref[A]): Ref[R]
    Definition Classes
    UnBinOps
  107. final def asCosted[T](x: Ref[_]): Ref[Costed[T]]
    Definition Classes
    RuntimeCosting
    Annotations
    @inline()
  108. def asCostedColl[T](collC: RCosted[Coll[T]]): Ref[CostedColl[T]]
    Definition Classes
    CostingRules
  109. def asCostedFunc[A, B](fC: RCosted[(A) ⇒ B]): Ref[CostedFunc[Unit, A, B]]
    Definition Classes
    CostingRules
  110. def asCostedPair[A, B](pC: RCosted[(A, B)]): Ref[CostedPair[A, B]]
    Definition Classes
    CostingRules
  111. final def asElem[T](d: TypeDesc): Elem[T]

    Helper type case method.

    Helper type case method.

    Definition Classes
    TypeDescs
    Annotations
    @inline()
  112. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  113. final def asRep[T](x: Ref[_]): Ref[T]

    Helper to type cast node references.

    Helper to type cast node references.

    Definition Classes
    Base
    Annotations
    @inline()
  114. def asSizeBox(ctx: RSize[Box]): Ref[SizeBox]
    Definition Classes
    CostingRules
  115. def asSizeColl[T](collS: RSize[Coll[T]]): Ref[SizeColl[T]]
    Definition Classes
    CostingRules
  116. def asSizeContext(ctx: RSize[Context]): Ref[SizeContext]
    Definition Classes
    CostingRules
  117. def asSizeOption[T](optS: RSize[WOption[T]]): Ref[SizeOption[T]]
    Definition Classes
    CostingRules
  118. def asSizePair[A, B](s: RSize[(A, B)]): Ref[SizePair[A, B]]
    Definition Classes
    CostingRules
  119. def assertElem(value: Ref[_], elem: Elem[_], hint: ⇒ String): Unit
    Definition Classes
    TypeDescs
  120. def assertElem(value: Ref[_], elem: Elem[_]): Unit
    Definition Classes
    TypeDescs
  121. def assertEqualElems[A](e1: Elem[A], e2: Elem[A], m: ⇒ String): Unit
    Definition Classes
    TypeDescs
  122. def assertValueIdForOpCost[A, B](value: Ref[A], cost: Ref[B]): Unit
    Definition Classes
    UniversalOps
  123. def attachCost[T](source: RCosted[T], accCost: Ref[Int], cost: Ref[Int]): RCosted[T]

    Build a new costed value with the given cost in a dependency list.

    Build a new costed value with the given cost in a dependency list. This is required to correctly handle tuple field accesses like v._1 and not to lose the cost of v in the cost of resulting value.

    Definition Classes
    RuntimeCosting
  124. def beginPass(pass: Pass): Unit

    Called to setup IR before the new pass is executed.

    Called to setup IR before the new pass is executed.

    Definition Classes
    Transforming
  125. def buildCostedGraph[T](envVals: Map[Any, SValue], tree: SValue): Ref[(Costed[Context]) ⇒ Costed[T]]
    Definition Classes
    RuntimeCosting
  126. def buildTree[T <: SType](f: Ref[(Context) ⇒ Any], constantsProcessing: Option[ConstantStore] = None): Value[T]

    Transforms the given function f from graph-based IR to ErgoTree expression.

    Transforms the given function f from graph-based IR to ErgoTree expression.

    f

    reference to the graph node representing function from Context.

    constantsProcessing

    if Some(store) is specified, then each constant is segregated and a placeholder is inserted in the resulting expression.

    returns

    expression of ErgoTree which corresponds to the function f

    Definition Classes
    TreeBuilding
  127. val builder: TransformingSigmaBuilder.type

    Should be specified in the final cake

    Should be specified in the final cake

    Definition Classes
    IRContext → RuntimeCosting
  128. val cacheElems: Boolean

    Whether IR type descriptors should be cached.

    Whether IR type descriptors should be cached.

    Definition Classes
    Base
  129. val cachePairs: Boolean

    Whether Tup instances should be cached.

    Whether Tup instances should be cached.

    Definition Classes
    Base
  130. final def cachedElemByClass[E <: Elem[_]](args: AnyRef*)(implicit clazz: Class[E]): E

    Retrieve an instance of the given Elem class by either looking up in the cache or creating a new one.

    Retrieve an instance of the given Elem class by either looking up in the cache or creating a new one. We assume that all Elem instances are uniquely defined by (clazz, args)

    args

    arguments of Elem class constructor

    clazz

    Elem class

    Definition Classes
    TypeDescs
  131. def canBeInvoked(d: Def[_], m: Method, args: Array[AnyRef]): Boolean

    Method invocation checker.

    Method invocation checker.

    Attributes
    protected
    Definition Classes
    MethodCalls
  132. def checkCost(ctx: SContext, exp: Value[SType], costF: Ref[(Size[Context]) ⇒ Int], maxCost: Long): Int
    Definition Classes
    IRContext
  133. def checkCostWithContext(ctx: SContext, costF: Ref[((Context, (Int, Size[Context]))) ⇒ Int], maxCost: Long, initCost: Long): Try[Int]

    TODO soft-fork: Version Based Costing The following is based on ErgoTree.header checks performed during deserialization and described in ErgoTreeSerializer The next version should ensure that v2 node contained both old and new version of casting component (Coster).

    TODO soft-fork: Version Based Costing The following is based on ErgoTree.header checks performed during deserialization and described in ErgoTreeSerializer The next version should ensure that v2 node contained both old and new version of casting component (Coster).

    Then v2 node during chain validation will use version in the ErgoTree header, 1) if version = 1 then execute the old CosterV1 2) if version = 2 then execute CosterV2. Thus v2 protocol will apply the new costing for only new versions.

    With this scheme changing the parameters will not have negative effects, the old scripts will be validated according to the old parameter values, and the new ones according to the new values.

    And taking into account the cleaning of the garbage and cutting the blockchain history, the old scripts at some point will die out of the blockchain.

    Definition Classes
    IRContext
  134. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  135. def clusterColor(g: AstGraph): Option[String]
    Attributes
    protected
    Definition Classes
    GraphVizExport
  136. def clusterSchedule(g: AstGraph): Seq[Sym]
    Attributes
    protected
    Definition Classes
    GraphVizExport
  137. def colBuilder: Ref[CollBuilder]
    Definition Classes
    RuntimeCosting → Library
    Annotations
    @inline()
  138. def compile[SA, SB, A, B](dataEnv: Map[Sym, AnyRef], f: Ref[(A) ⇒ B], costLimit: Option[Long] = None)(implicit lA: Liftable[SA, A], lB: Liftable[SB, B]): (SA) ⇒ (SB, Int)

    Transform graph IR into the corresponding Scala function

    Transform graph IR into the corresponding Scala function

    f

    simbol of the graph representing function from type A to B

    costLimit

    when Some(value) is specified, then OpCost nodes will be used to accumulate total cost of execution.

    Definition Classes
    Evaluation
  139. def compose[A, B, C](f: Ref[(B) ⇒ C], g: Ref[(A) ⇒ B]): Ref[(A) ⇒ C]

    Composition of two functions (in mathematical notation), where first g is applied and them f.

    Composition of two functions (in mathematical notation), where first g is applied and them f.

    Definition Classes
    Functions
  140. def constCost[T](implicit arg0: Elem[T]): Ref[Int]
    Definition Classes
    RuntimeCosting
  141. def constCost(tpe: SType): Ref[Int]
    Definition Classes
    RuntimeCosting
  142. def constFun[A, B](x: Ref[B])(implicit e: Elem[A]): Ref[(A) ⇒ B]
    Definition Classes
    Functions
  143. def constantTypeSize[T](implicit eT: Elem[T]): RSize[T]
    Definition Classes
    RuntimeCosting
  144. final def container[F[_]](implicit arg0: Cont[F]): Cont[F]
    Definition Classes
    TypeDescs
  145. implicit final def containerElem[F[_], A](implicit arg0: Cont[F], arg1: Elem[A]): Elem[F[A]]
    Definition Classes
    TypeDescs
  146. def cost[T](env: ScriptEnv, typed: SValue): Ref[(Costed[Context]) ⇒ Costed[T]]
    Definition Classes
    RuntimeCosting
  147. def costOf(v: SValue): Ref[Int]
    Definition Classes
    RuntimeCosting
  148. def costOf(method: SMethod): Ref[Int]
    Definition Classes
    RuntimeCosting
  149. def costOf(opName: String, opType: SFunc): Ref[Int]
    Definition Classes
    RuntimeCosting
  150. def costOf(opName: String, opType: SFunc, doEval: Boolean): Ref[Int]
    Definition Classes
    RuntimeCosting
  151. def costOf(costOp: CostOf, doEval: Boolean): Ref[Int]
    Definition Classes
    RuntimeCosting
  152. def costOfSigmaTree(sigmaTree: SigmaBoolean): Int
    Definition Classes
    RuntimeCosting
  153. def costedBooleanTransformer[T](node: BooleanTransformer[_], xs: RCostedColl[T], condition: RCosted[(T) ⇒ WrappedType], calcF: Ref[(T) ⇒ Any], accCost: Ref[Int]): Ref[Costed[_ >: Boolean with SigmaProp]]
    Definition Classes
    RuntimeCosting
  154. def costedBuilder: Ref[CostedBuilder]
    Definition Classes
    RuntimeCosting → Library
    Annotations
    @inline()
  155. val costedBuilderValue: special.collection.CostedBuilder
    Definition Classes
    IRContext → Evaluation
  156. def costedGlobal: RCosted[SigmaDslBuilder]
    Definition Classes
    RuntimeCosting
    Annotations
    @inline()
  157. def costedPrimToColl[A](coll: Ref[Coll[A]], c: Ref[Int], s: RSize[Coll[A]]): RCostedColl[A]
    Definition Classes
    RuntimeCosting
  158. def costedPrimToOption[A](opt: Ref[WOption[A]], c: Ref[Int], s: RSize[WOption[A]]): RCostedOption[A]
    Definition Classes
    RuntimeCosting
  159. def costedPrimToPair[A, B](p: Ref[(A, B)], c: Ref[Int], s: RSize[(A, B)]): Ref[CCostedPair[A, B]]
    Definition Classes
    RuntimeCosting
  160. def createDefinition[T](optScope: Nullable[ThunkScope], s: Ref[T], d: Def[T]): Ref[T]

    Here we hook into graph building process at the point where each new graph node is added to the graph.

    Here we hook into graph building process at the point where each new graph node is added to the graph. First, we call super.createDefinition, which adds the new node d to the graph (s is the node's symbol). Next, we update context dependence analysis information (see isSupportedIndexExpression) The graph node is context-dependent if: 1) it is the node of Context type 2) all nodes it depends on are context-dependent

    optScope

    optional thunk scope to put given definition

    s

    symbol refering to d

    d

    definition node to add to the scope of globally

    returns

    reference to d (which is s)

    Attributes
    protected
    Definition Classes
    RuntimeCosting → Base
    See also

    super.createDefinition, isSupportedIndexExpression

  161. def currentPass: Pass

    IR global current Pass, changes when the compier switches from one pass to the next one.

    IR global current Pass, changes when the compier switches from one pass to the next one. Should remain constant during the whole pass execution.

    Definition Classes
    Transforming
  162. val debugModeSanityChecks: Boolean

    Whether to perform extended checks of correctness, expected invariants and data consistency.

    Whether to perform extended checks of correctness, expected invariants and data consistency. NOTE: Since it may add substantial overhead, set it to false before using in production.

    Definition Classes
    Base
  163. def defCount: Int

    Returns a number of definitions added to this IR context.

    Returns a number of definitions added to this IR context.

    Definition Classes
    Base
  164. def def_unapply[T](e: Ref[T]): Nullable[Def[T]]
    Definition Classes
    Base
  165. def defaultGraphVizConfig: GraphVizConfig
    Definition Classes
    GraphVizExport
  166. def delayInvoke: Nothing
    Definition Classes
    MethodCalls
  167. def doCosting(env: ScriptEnv, typed: SValue, okRemoveIsProven: Boolean): RCostingResult[Any]
    Definition Classes
    IRContext
  168. def doCosting[T](env: ScriptEnv, typed: SValue): RCostingResult[T]
    Definition Classes
    IRContext
  169. def doCostingEx(env: ScriptEnv, typed: SValue, okRemoveIsProven: Boolean): RCostingResultEx[Any]
    Definition Classes
    IRContext
  170. def downcast[To](value: Ref[_])(implicit arg0: Elem[To]): Ref[To]
    Definition Classes
    UniversalOps
  171. val eCollByte: Elem[Coll[Byte]]
    Definition Classes
    RuntimeCosting
  172. val ePairOfCollByte: Elem[(Coll[Byte], Coll[Byte])]
    Definition Classes
    RuntimeCosting
  173. val elemCache: AVHashMap[Class[_], ElemCacheEntry]
    Attributes
    protected
    Definition Classes
    TypeDescs
  174. def elemToCostedElem[T](implicit e: Elem[T]): Elem[Costed[T]]

    For a given data type returns the corresponding specific descendant of CostedElem[T]

    For a given data type returns the corresponding specific descendant of CostedElem[T]

    Definition Classes
    RuntimeCosting
  175. def elemToExactIntegral[T](e: Elem[T]): ExactIntegral[T]
    Definition Classes
    RuntimeCosting
  176. def elemToExactNumeric[T](e: Elem[T]): ExactNumeric[T]
    Definition Classes
    RuntimeCosting
  177. def elemToExactOrdering[T](e: Elem[T]): ExactOrdering[T]
    Definition Classes
    RuntimeCosting
  178. def elemToSType[T](e: Elem[T]): SType
    Definition Classes
    RuntimeCosting
  179. final def element[A](implicit ea: Elem[A]): Elem[A]
    Definition Classes
    TypeDescs
  180. def emitDepGraph(exceptionOrGraph: Either[Throwable, AstGraph], directory: File, fileName: String)(implicit config: GraphVizConfig): Option[GraphFile]
    Definition Classes
    GraphVizExport
  181. def emitDepGraph(graph: AstGraph, directory: File, fileName: String)(implicit config: GraphVizConfig): Option[GraphFile]
    Definition Classes
    GraphVizExport
  182. def emitDepGraph(ss: Seq[Sym], directory: File, fileName: String)(implicit config: GraphVizConfig): Option[GraphFile]
    Definition Classes
    GraphVizExport
  183. def emitDepGraph(start: Sym, directory: File, fileName: String)(implicit config: GraphVizConfig): Option[GraphFile]
    Definition Classes
    GraphVizExport
  184. def emitDepGraph(d: Def[_], directory: File, fileName: String)(implicit config: GraphVizConfig): Option[GraphFile]
    Definition Classes
    GraphVizExport
  185. def emitDot(dotText: String, directory: File, fileName: String)(implicit config: GraphVizConfig): Option[GraphFile]
    Definition Classes
    GraphVizExport
  186. def emitExceptionGraph(e: Throwable, directory: File, fileName: String)(implicit config: GraphVizConfig): Option[GraphFile]
    Definition Classes
    GraphVizExport
  187. def emptyMatchSubst: Subst
    Definition Classes
    Functions
    Annotations
    @inline()
  188. def endPass(pass: Pass): Unit

    Called to let this IR context to finalized the given pass.

    Called to let this IR context to finalized the given pass.

    Definition Classes
    Transforming
  189. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  190. def equalValues[A](x: Any, y: Any)(implicit eA: Elem[A]): Boolean
    Attributes
    protected
    Definition Classes
    Equal
  191. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  192. def error(msg: String, srcCtx: Option[SourceContext]): Nothing
    Definition Classes
    RuntimeCosting
  193. def error(msg: String): Nothing
    Definition Classes
    RuntimeCosting
  194. def evalNode[T <: SType](ctx: RCosted[Context], env: CostingEnv, node: Value[T]): RCosted[CompiletimeCosting.evalNode.T.WrappedType]

    Recursively translates each ErgoTree node into the corresponding cost formula.

    Recursively translates each ErgoTree node into the corresponding cost formula. The cost formula is represented using graph-based IR defined by this IRContext cake. Each node: Value[T] which evaluates to the value of type T is transformed to a value of type RCosted[A] which is a synonym of Ref[Costed[A]] type. The translation is performed recursively on a structure of the ErgoTree expression.

    ctx

    reference to the graph node, which represents costed CONTEXT expression.

    env

    environment of costed ValDef nodes (see BlockValue case).

    node

    expression to be costed

    returns

    a reference to the graph node of type Costed[T#WrappedType]

    Definition Classes
    CompiletimeCosting → RuntimeCosting
  195. implicit def extendCostedCollElem[A](elem: Elem[CostedColl[A]]): CostedCollElem[A, CostedColl[A]]
    Definition Classes
    RuntimeCosting
  196. implicit def extendCostedElem[A](elem: Elem[Costed[A]]): CostedElem[A, Costed[A]]
    Definition Classes
    RuntimeCosting
  197. implicit def extendCostedFuncElem[E, A, B](e: Elem[CostedFunc[E, A, B]]): CostedFuncElem[E, A, B, _]
    Definition Classes
    RuntimeCosting
  198. implicit def extendSizeElem[A](elem: Elem[Size[A]]): SizeElem[A, Size[A]]
    Definition Classes
    RuntimeCosting
  199. implicit def extendThunkElement[T](elem: Elem[Thunk[T]]): ThunkElem[T]
    Definition Classes
    Thunks
  200. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  201. def findGlobalDefinition[T](d: Def[T]): Ref[T]

    Lookup definition in this IR context's hash table of definitions.

    Lookup definition in this IR context's hash table of definitions.

    returns

    node reference to an instance stored in hash table, which is equal to d and null if there is no definition which is equal to d

    Definition Classes
    Base
  202. def findIsProven[T](f: Ref[(Context) ⇒ T]): Option[Sym]

    Finds SigmaProp.isProven method calls in the given Lambda f

    Finds SigmaProp.isProven method calls in the given Lambda f

    Definition Classes
    Evaluation
  203. def findOrCreateDefinition[T](d: Def[T], newSym: ⇒ Ref[T]): Ref[T]

    Lookup d in the heap of nodes.

    Lookup d in the heap of nodes. If the lookup is successfull, then its reference is returned. If the node is not found in the heap, then it is added and d.self reference is returned.

    d

    node to be added to the head of nodes

    newSym

    producer of the reference to be used as the reference to d node.

    returns

    return a reference to d node in the heap

    Definition Classes
    Base
  204. def forceThunkByMirror[A](thunk: Th[A], subst: MapTransformer = MapTransformer.empty()): Ref[A]
    Definition Classes
    Thunks
  205. def forceThunkDefByMirror[A](th: ThunkDef[A], subst: MapTransformer = MapTransformer.empty()): Ref[A]
    Definition Classes
    Thunks
  206. def formatConst(x: Any): String
    Attributes
    protected
    Definition Classes
    GraphVizExport
  207. def formatDef(d: Def[_])(implicit config: GraphVizConfig): String

    Used by Graphviz dot file generator to format text label of the graph node.

    Used by Graphviz dot file generator to format text label of the graph node.

    Attributes
    protected
    Definition Classes
    RuntimeCosting → Thunks → MethodCalls → GraphVizExport
  208. def formatMetadata(s: Sym): List[String]
    Attributes
    protected
    Definition Classes
    GraphVizExport
  209. final def freshId: Int

    Get next fresh node id

    Get next fresh node id

    Definition Classes
    Base
    Annotations
    @inline()
  210. final def freshSym[T](d: Def[T]): Ref[T]

    Lookup of create reference to the given definition.

    Lookup of create reference to the given definition. To lookup d.nodeId is used as the index in the _symbolTable. If Ref is not found in _symbolTable, then new Ref instance is created and stored in _symbolTable at d.nodeId index.

    Definition Classes
    Base
    Annotations
    @inline()
  211. implicit final def fun[A, B](f: (Ref[A]) ⇒ Ref[B])(implicit eA: LElem[A]): Ref[(A) ⇒ B]

    Executes given lambda to construct Lambda node.

    Executes given lambda to construct Lambda node. The function f can be called with any symbol and has an effect of growing a graph starting from the argument symbol. If a reference to Variable node is passed as argument, then the constructed graph nodes can be collected to Lambda node forming its body and schedule.

    f

    function which execution will create body nodes

    eA

    arguments type descriptor

    Definition Classes
    Functions
  212. implicit final def fun2[A, B, C](f: (Ref[A], Ref[B]) ⇒ Ref[C])(implicit eA: LElem[A], eB: LElem[B]): Ref[((A, B)) ⇒ C]
    Definition Classes
    Functions
  213. implicit final def funcElement[A, B](implicit ea: Elem[A], eb: Elem[B]): Elem[(A) ⇒ B]
    Definition Classes
    TypeDescs
  214. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  215. def getDataEnv: DataEnv

    Constructs a new data environment for evaluation of graphs using compile method.

    Constructs a new data environment for evaluation of graphs using compile method. This environment contains global variables.

    Definition Classes
    Evaluation
  216. def getEntityObject(name: String): Nullable[EntityObject]
    Definition Classes
    Base
    Annotations
    @inline()
  217. def getFromEnv(dataEnv: DataEnv, s: Sym): Any
    Definition Classes
    Evaluation
  218. def getOpCodeEx(d: Def[_]): OpCodeExtra

    Returns extended op code assigned to the given IR graph node.

    Returns extended op code assigned to the given IR graph node.

    Definition Classes
    Evaluation
  219. def getOwnerKind(constructor: Constructor[_]): OwnerKind

    Returns OwnerKind for the given constructor, using its first parameter.

    Returns OwnerKind for the given constructor, using its first parameter.

    Attributes
    protected
    Definition Classes
    Base
  220. def getRegisterCost: Ref[Int]
    Definition Classes
    CostingRules
    Annotations
    @inline()
  221. final def getSourceValues(dataEnv: DataEnv, forWrapper: Boolean, stagedValues: AnyRef*): Seq[AnyRef]
    Definition Classes
    TypeDescs
  222. final def getSym(id: Int): Sym

    Lookup node reference by its id.

    Lookup node reference by its id. This is simple array access by index O(1) operation.

    Definition Classes
    Base
    Annotations
    @inline()
  223. implicit def groupElementToECPoint(g: special.sigma.GroupElement): EcPointType
    Attributes
    protected
    Definition Classes
    RuntimeCosting
  224. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  225. def identityFun[A](implicit e: Elem[A]): Ref[(A) ⇒ A]
    Definition Classes
    Functions
  226. def ifThenElseLazy[T](cond: Ref[Boolean], thenp: ⇒ Ref[T], elsep: ⇒ Ref[T]): Ref[T]

    Constructs IfThenElse node wrapping by-name args into ThunkDef nodes.

    Constructs IfThenElse node wrapping by-name args into ThunkDef nodes.

    Definition Classes
    IfThenElse
  227. def intPlusMonoid: Ref[Monoid[Int]]
    Definition Classes
    RuntimeCosting → Library
    Annotations
    @inline()
  228. val intPlusMonoidValue: special.collection.IntPlusMonoid
    Definition Classes
    Library
  229. def integral[T](implicit arg0: ExactIntegral[T]): ExactIntegral[T]
    Definition Classes
    NumericOps
  230. def invokeUnlifted(e: Elem[_], mc: MethodCall, dataEnv: DataEnv): AnyRef

    Invoke source type method corresponding to the given MethodCall node.

    Invoke source type method corresponding to the given MethodCall node. This method delegated the work to the given element instance.

    e

    type descriptor of receiver node

    mc

    IR node representing method invocation

    dataEnv

    environment where each symbol of 'mc' has associated data value

    returns

    data value returned from invoked method

    Definition Classes
    Library → TypeDescs
  231. def isAllowedOpCodeInCosting(opCode: OpCodeExtra): Boolean
    Definition Classes
    Evaluation
  232. final def isContextDependant(sym: Sym): Boolean
    Definition Classes
    RuntimeCosting
    Annotations
    @inline()
  233. def isCostingProcess: Boolean
    Definition Classes
    RuntimeCosting
  234. val isInlineThunksOnForce: Boolean
    Definition Classes
    Thunks
  235. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  236. def isInvokeEnabled(d: Def[_], m: Method): Boolean

    Method invocation enabler.

    Method invocation enabler.

    returns

    true if the given method can be invoked on the given node.

    Definition Classes
    MethodCalls
  237. final def isOne[T](x: T, n: ExactNumeric[T]): Boolean
    Definition Classes
    NumericOps
    Annotations
    @inline()
  238. def isSupportedIndexExpression(i: Ref[Int]): Boolean

    Checks that index expression sub-graph (which root is i) consists of context-dependent nodes.

    Checks that index expression sub-graph (which root is i) consists of context-dependent nodes. This is used in the validation rule for the costing of ByIndex operation.

    Definition Classes
    RuntimeCosting
    See also

    RuntimeCosting, CheckIsSupportedIndexExpression

  239. final def isZero[T](x: T, n: ExactNumeric[T]): Boolean
    Definition Classes
    NumericOps
    Annotations
    @inline()
  240. val keepOriginalFunc: Boolean

    Global flag governing lambda reification in fun and mkLambda.

    Global flag governing lambda reification in fun and mkLambda. If this flag is true then original f: Ref[A] => Ref[B] function is stored in Lambda node. As a consequence if f is not stored, then unfoldLambda is done by mirrorLambda.

    Definition Classes
    Functions
  241. val lambdaStack: List[Lambda[_, _]]
    Definition Classes
    Functions
  242. implicit def liftElem[T](eT: Elem[T]): Ref[WRType[T]]
    Definition Classes
    Library
  243. implicit def liftToRep[A](x: A)(implicit arg0: Elem[A]): Ref[A]
    Definition Classes
    Base
    Annotations
    @inline()
  244. def liftableFromElem[WT](eWT: Elem[WT]): Liftable[_, WT]
    Definition Classes
    RuntimeCosting
  245. implicit def liftableThunk[ST, T](implicit lT: Liftable[ST, T]): Liftable[SThunk[ST], Thunk[T]]
    Definition Classes
    Thunks
  246. def logWarn(msg: ⇒ String): Unit

    Log warning message to the log.

    Log warning message to the log. This is default and simple implementation, which can be overriden.

    Definition Classes
    Base
  247. def longPlusMonoid: Ref[Monoid[Long]]
    Definition Classes
    RuntimeCosting → Library
    Annotations
    @inline()
  248. val longPlusMonoidValue: special.collection.LongPlusMonoid
    Definition Classes
    Library
  249. def matchAny(a1: Any, a2: Any, allowInexactMatch: Boolean, subst: Subst): Nullable[Subst]
    Attributes
    protected
    Definition Classes
    Functions
  250. def matchDefs(d1: Def[_], d2: Def[_], allowInexactMatch: Boolean, subst: Subst): Nullable[Subst]
    Attributes
    protected
    Definition Classes
    Thunks → Functions
  251. def matchExps(s1: Sym, s2: Sym, allowInexactMatch: Boolean, subst: Subst): Nullable[Subst]
    Attributes
    protected
    Definition Classes
    Functions
  252. def matchIterators(i1: Iterator[_], i2: Iterator[_], allowInexactMatch: Boolean, subst: Subst): Nullable[Subst]
    Attributes
    protected
    Definition Classes
    Functions
  253. def mirrorApply[A, B](lam: Lambda[A, B], s: Ref[A]): Ref[B]
    Definition Classes
    Functions
  254. def mkApply[A, B](f: Ref[(A) ⇒ B], x: Ref[A]): Ref[B]
    Definition Classes
    Functions
  255. def mkCostedColl[T](col: Ref[Coll[T]], len: Ref[Int], cost: Ref[Int]): Ref[CostedColl[T]]

    Helper to create costed collection of some constant size type T

    Helper to create costed collection of some constant size type T

    Definition Classes
    RuntimeCosting
  256. def mkCostedColl[T](values: RColl[T], costs: RColl[Int], sizes: RColl[Size[T]], valuesCost: Ref[Int]): RCostedColl[T]
    Definition Classes
    CostingRules
  257. def mkCostedFunc[A, R](f: RFuncCosted[A, R], cost: Ref[Int], codeSize: Ref[Long], eArg: Elem[A], eRes: Elem[R]): Ref[CostedFunc[Unit, A, R]]
    Definition Classes
    CostingRules
  258. def mkCostedOption[T](value: ROption[T], costOpt: ROption[Int], sizeOpt: ROption[Size[T]], accCost: Ref[Int]): RCostedOption[T]
    Definition Classes
    CostingRules
  259. def mkLambda[A, B, C](f: (Ref[A], Ref[B]) ⇒ Ref[C])(implicit eA: LElem[A], eB: LElem[B]): Ref[((A, B)) ⇒ C]
    Definition Classes
    Functions
  260. def mkLambda[A, B, C](f: (Ref[A]) ⇒ (Ref[B]) ⇒ Ref[C])(implicit eA: LElem[A], eB: Elem[B]): Ref[(A) ⇒ (B) ⇒ C]
    Definition Classes
    Functions
  261. def mkLambda[A, B](f: (Ref[A]) ⇒ Ref[B], mayInline: Boolean, alphaEquality: Boolean, keepOriginalFunc: Boolean)(implicit eA: LElem[A]): Ref[(A) ⇒ B]
    Definition Classes
    Functions
  262. def mkMethodCall(receiver: Sym, method: Method, args: Seq[AnyRef], neverInvoke: Boolean, isAdapterCall: Boolean, resultElem: Elem[_]): Sym

    Creates new MethodCall node and returns its node ref.

    Creates new MethodCall node and returns its node ref.

    Definition Classes
    MethodCalls
  263. def mkNormalizedOpCost(costedValue: Sym, costs: Seq[Ref[Int]]): Ref[Int]
    Definition Classes
    RuntimeCosting
  264. def mkSizeColl[T](len: Ref[Int])(implicit arg0: Elem[T]): Ref[Size[Coll[T]]]
    Definition Classes
    CostingRules
  265. def mkSizeOption[T](size: RSize[T]): Ref[Size[WOption[T]]]
    Definition Classes
    CostingRules
  266. def mkSizePair[A, B](l: RSize[A], r: RSize[B]): Ref[Size[(A, B)]]
    Definition Classes
    CostingRules
  267. def monoidBuilder: Ref[MonoidBuilder]
    Definition Classes
    RuntimeCosting
    Annotations
    @inline()
  268. val monoidBuilderValue: special.collection.MonoidBuilder
    Definition Classes
    IRContext → Evaluation
  269. def msgCostLimitError(cost: Long, limit: Long): String
    Definition Classes
    Evaluation
  270. val nInitialDefs: Int
    Definition Classes
    Base
  271. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  272. def newObjEx[A](args: Any*)(implicit eA: Elem[A]): Ref[A]

    Creates new NewObject node and returns its node ref.

    Creates new NewObject node and returns its node ref.

    Definition Classes
    MethodCalls
  273. lazy val noConstPropagationPass: DefaultPass

    Pass configuration which is used to turn-off constant propagation.

    Pass configuration which is used to turn-off constant propagation.

    Definition Classes
    IRContext
    See also

    beginPass(noCostPropagationPass)

  274. def nodeColor(td: TypeDesc, d: Def[_])(implicit config: GraphVizConfig): String
    Attributes
    protected
    Definition Classes
    Thunks → GraphVizExport
  275. def nodeColor(td: TypeDesc): String
    Attributes
    protected
    Definition Classes
    GraphVizExport
  276. final def nodeLabel(parts: String*)(implicit config: GraphVizConfig): String
    Attributes
    protected
    Definition Classes
    GraphVizExport
  277. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  278. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  279. def numeric[T](implicit arg0: ExactNumeric[T]): ExactNumeric[T]
    Definition Classes
    NumericOps
  280. val okMeasureOperationTime: Boolean
    Definition Classes
    RuntimeCosting
  281. val okPrintEvaluatedEntries: Boolean

    Whether to print values of evaluated nodes of the graph.

    Whether to print values of evaluated nodes of the graph.

    Definition Classes
    RuntimeCosting
  282. def okRegisterModules: Boolean

    Whether staged modules should be registered when cake is constructed and initialized.

    Whether staged modules should be registered when cake is constructed and initialized.

    Definition Classes
    Modules
  283. def onEvaluatedGraphNode(env: DataEnv, sym: Sym, value: AnyRef): Unit
    Definition Classes
    Evaluation
  284. def onReset(): Unit

    Called during resetContext() operation after the core context state has been reset.

    Called during resetContext() operation after the core context state has been reset. Derived classes can override to define application specific initialization. Don't forget to call super method in the beginning of your overriding method.

    Attributes
    protected
    Definition Classes
    RuntimeCosting → CostingRules → Library → Base
  285. def onTreeNodeCosted[T <: SType](ctx: RCosted[Context], env: CostingEnv, node: Value[T], costed: RCosted[RuntimeCosting.onTreeNodeCosted.T.WrappedType]): Unit
    Attributes
    protected
    Definition Classes
    RuntimeCosting
  286. def opCost(costedValue: Sym, args: Seq[Ref[Int]], opCost: Ref[Int]): Ref[Int]
    Definition Classes
    UniversalOps
  287. def opcodeToBinOp[A](opCode: Byte, eA: Elem[A]): BinOp[A, _]
    Definition Classes
    RuntimeCosting
  288. def opcodeToEndoBinOp[T](opCode: Byte, eT: Elem[T]): EndoBinOp[T]
    Definition Classes
    RuntimeCosting
  289. val outputComputedResults: Boolean

    Whether to output the computed results of the script.

    Whether to output the computed results of the script.

    Definition Classes
    RuntimeCosting
  290. val outputEstimatedCost: Boolean

    Whether to output the cost value estimated for the script given by ScriptNameProp environment variable

    Whether to output the cost value estimated for the script given by ScriptNameProp environment variable

    Definition Classes
    RuntimeCosting
  291. implicit final def pairElement[A, B](implicit ea: Elem[A], eb: Elem[B]): Elem[(A, B)]
    Definition Classes
    TypeDescs
  292. def partsIterator(td: TypeDesc): TraversableOnce[TypeDesc] { def seq: scala.collection.TraversableOnce[CompiletimeIRContext.this.TypeDesc]{def seq: scala.collection.TraversableOnce[CompiletimeIRContext.this.TypeDesc]{def seq: scala.collection.TraversableOnce[CompiletimeIRContext.this.TypeDesc]}} }
    Attributes
    protected
    Definition Classes
    GraphVizExport
  293. def patternMatch(s1: Sym, s2: Sym): Nullable[Subst]
    Definition Classes
    Functions
  294. def perItemCostOf(node: SValue, arrLength: Ref[Int]): Ref[Int]
    Definition Classes
    RuntimeCosting
  295. def perKbCostOf(node: SValue, dataSize: Ref[Long]): Ref[Int]
    Definition Classes
    RuntimeCosting
  296. def perKbCostOf(opName: String, opType: SFunc, dataSize: Ref[Long]): Ref[Int]
    Definition Classes
    RuntimeCosting
  297. def perKbCostOf(method: SMethod, dataSize: Ref[Long]): Ref[Int]
    Definition Classes
    RuntimeCosting
  298. def placeholder[T](implicit eT: LElem[T]): Ref[T]
    Definition Classes
    Base
    Annotations
    @inline()
  299. def printEnvEntry(sym: Sym, value: AnyRef): String
    Attributes
    protected
    Definition Classes
    Evaluation
  300. def propagateBinOp[T, R](op: BinOp[T, R], x: Ref[T], y: Ref[T]): Ref[R]

    Perform constant propagation if enabled and both arguments are Const.

    Perform constant propagation if enabled and both arguments are Const.

    returns

    null if propagation is not done

    Definition Classes
    DefRewriting
  301. def propagateUnOp[T, R](op: UnOp[T, R], x: Ref[T]): Ref[R]

    Perform constant propagation if enabled and argument is Const.

    Perform constant propagation if enabled and argument is Const.

    returns

    null if propagation is not done

    Definition Classes
    DefRewriting
  302. def registerEntityObject(name: String, obj: EntityObject): Unit
    Attributes
    protected
    Definition Classes
    Base
  303. def registerModule(moduleInfo: ModuleInfo): Unit

    Called once for each staged module during this cake initialization.

    Called once for each staged module during this cake initialization.

    Attributes
    protected
    Definition Classes
    Modules
  304. implicit def reifyObject[A](obj: Def[A]): Ref[A]

    Implicit injection of new definition (graph node) into universum of nodes with collapsing semantics.

    Implicit injection of new definition (graph node) into universum of nodes with collapsing semantics. If there exists node n in this IR such that obj equals n, then the value of n.self is returned, i.e. the new node obj is collapsed with already existing one. This has an effect of Common Subexpression Elimination (CSE) when an expression tree is transformed to the graph and identical subtrees are collapsed. After a reference to the node is obtained, global rewriting rules are examined and the reference may be replaced with a new one.

    Definition Classes
    Base
  305. def removeIsProven[T, R](f: (Ref[T]) ⇒ Ref[Any]): (Ref[T]) ⇒ Ref[Any]
    Definition Classes
    RuntimeCosting
  306. implicit def repOrderingToOrderingOps[T](x: Ref[T])(implicit n: ExactOrdering[T]): OrderingOpsCls[T]
    Definition Classes
    OrderingOps
  307. implicit def repToThunk[A](block: Ref[A]): Ref[Thunk[A]]
    Definition Classes
    Thunks
  308. def resetContext(): Unit
    Definition Classes
    CostedObjectsDefs → Base
  309. final def rewriteBinOp[A, R](op: BinOp[A, R], x: Ref[A], y: Ref[A]): Ref[_]

    Rewrites application of given binary operation to the given arguments.

    Rewrites application of given binary operation to the given arguments.

    returns

    null if no rewriting is defined.

    Definition Classes
    DefRewriting
  310. final def rewriteBoolConsts(lhs: Sym, rhs: Sym, ifTrue: (Sym) ⇒ Sym, ifFalse: (Sym) ⇒ Sym, ifEqual: (Sym) ⇒ Sym, ifNegated: (Sym) ⇒ Sym): Sym
    Definition Classes
    LogicalOps
    Annotations
    @inline()
  311. def rewriteDef[T](d: Def[T]): Ref[_]

    For performance reasons the patterns are organized in special (non-declarative) way.

    For performance reasons the patterns are organized in special (non-declarative) way. Unfortunately, this is less readable, but gives significant performance boost Look at comments to understand the logic of the rules.

    d

    node to be matched against rewrite patterns

    returns

    reference of new node if RW pattern is found and applied null if no rewriting is defined.

    Definition Classes
    CompiletimeCosting → RuntimeCosting → Library → DefRewriting
  312. def rewriteNonInvokableMethodCall(mc: MethodCall): Ref[_]

    This method is called for each MethodCall node which is about to be added to the graph.

    This method is called for each MethodCall node which is about to be added to the graph. This means mc has been examined by all the rewrite rules, but has not need rewritten. Now, if this method returns null, then mc will be added to the graph. However, in this method, mc can be examined by a second set of RW rules (kind of lower priority rules). These rules kind of context dependent, because at this point we know that the first RW set didn't triggered any rewrite.

    Definition Classes
    RuntimeCosting → MethodCalls
  313. final def rewriteUnOp[A, R](op: UnOp[A, R], x: Ref[A]): Ref[_]

    Rewrites application of given unary operation to the given argument.

    Rewrites application of given unary operation to the given argument.

    returns

    null if no rewriting is defined.

    Definition Classes
    DefRewriting
  314. val ruleStack: List[CostingRuleStat]
    Definition Classes
    RuntimeCosting
  315. val saveGraphsInFile: Boolean

    Whether to save calcF and costF graphs in the file given by ScriptNameProp environment variable

    Whether to save calcF and costF graphs in the file given by ScriptNameProp environment variable

    Definition Classes
    RuntimeCosting
  316. def selectFieldCost: Ref[Int]
    Definition Classes
    CostingRules
    Annotations
    @inline()
  317. def shouldEmitCluster(g: AstGraph): Boolean
    Attributes
    protected
    Definition Classes
    GraphVizExport
  318. def showGraphs(graph: AstGraph)(implicit config: GraphVizConfig): Unit
    Definition Classes
    GraphVizExport
  319. def showGraphs(roots: Sym*)(implicit config: GraphVizConfig): Unit
    Definition Classes
    GraphVizExport
  320. def sigmaDslBuilder: Ref[SigmaDslBuilder]
    Definition Classes
    RuntimeCosting → SigmaLibrary
    Annotations
    @inline()
  321. val sigmaDslBuilderValue: CostingSigmaDslBuilder.type
    Definition Classes
    IRContext → Evaluation
  322. implicit lazy val sizeAnyElement: Elem[Size[Any]]
    Definition Classes
    SigmaLibrary
  323. def sizeOf[T](value: Ref[T]): Ref[Long]
    Definition Classes
    UniversalOps
  324. def sizeOfData[ST, T](x: ST)(implicit lT: Liftable[ST, T]): RSize[T]
    Definition Classes
    RuntimeCosting
  325. def specialPredef: Ref[WSpecialPredefCompanionCtor]
    Definition Classes
    Library
  326. def splitCostedCollFunc[A, B](f: RCostedCollFunc[A, B]): (Ref[(A) ⇒ Coll[B]], Ref[((Int, Size[A])) ⇒ (Coll[Int], Int)], Ref[(Size[A]) ⇒ Coll[Size[B]]])
    Definition Classes
    RuntimeCosting
  327. def splitCostedFunc[A, B](f: RFuncCosted[A, B]): (Ref[(A) ⇒ B], Ref[((Int, Size[A])) ⇒ Int], Ref[(Size[A]) ⇒ Size[B]])
    Definition Classes
    RuntimeCosting
  328. def splitCostedFunc2[A, B](f: RFuncCosted[A, B], okRemoveIsValid: Boolean): (Ref[(A) ⇒ Any], Ref[((Int, Size[A])) ⇒ Int])
    Definition Classes
    RuntimeCosting
  329. def stagingExceptionMessage(message: String, syms: Seq[Ref[_]]): String

    Prettyprint exception message

    Prettyprint exception message

    Attributes
    protected
    Definition Classes
    Base
  330. def stypeToElem[T <: SType](t: T): Elem[RuntimeCosting.stypeToElem.T.WrappedType]
    Definition Classes
    RuntimeCosting
  331. val substFromCostTable: Boolean

    Whether to create CostOf nodes or substutute costs from CostTable as constants in the graph.

    Whether to create CostOf nodes or substutute costs from CostTable as constants in the graph. true - substitute; false - create CostOf nodes

    Definition Classes
    RuntimeCosting
  332. implicit final def sumElement[A, B](implicit ea: Elem[A], eb: Elem[B]): Elem[|[A, B]]
    Definition Classes
    TypeDescs
  333. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  334. def throwInvocationException(whatFailed: String, cause: Throwable, receiver: Sym, m: Method, args: Seq[Any]): Nothing
    Definition Classes
    MethodCalls
  335. implicit val thunkCont: Cont[Thunk]
    Definition Classes
    Thunks
  336. implicit def thunkElement[T](implicit eItem: Elem[T]): Elem[Thunk[T]]
    Definition Classes
    Thunks
  337. val thunkStack: ThunkStack
    Attributes
    protected
    Definition Classes
    Thunks
  338. def thunk_create[A](block: ⇒ Ref[A]): Ref[Thunk[A]]
    Definition Classes
    Thunks
  339. def thunk_force[A](t: Th[A]): Ref[A]
    Definition Classes
    Thunks
  340. def thunk_map[A, B](t: Th[A], f: Ref[(A) ⇒ B]): Th[B]
    Definition Classes
    Thunks
  341. def thunk_map1[A, B](t: Th[A], f: (Ref[A]) ⇒ Ref[B]): Th[B]
    Definition Classes
    Thunks
  342. def toExp[T](d: Def[T], newSym: ⇒ Ref[T]): Ref[T]

    Updates the universe of symbols and definitions, then rewrites until fix-point

    Updates the universe of symbols and definitions, then rewrites until fix-point

    d

    A new graph node to add to the universe

    newSym

    A symbol that will be used if d doesn't exist in the universe

    returns

    The symbol of the graph which is semantically(up to rewrites) equivalent to d

    Attributes
    protected[scalan]
    Definition Classes
    Base
  343. implicit final def toLazyElem[A](implicit eA: Elem[A]): LElem[A]
    Definition Classes
    TypeDescs
  344. def toRep[A](x: A)(implicit eA: Elem[A]): Ref[A]

    Lifting of data values to IR nodes.

    Lifting of data values to IR nodes.

    Definition Classes
    Base
  345. def toString(): String
    Definition Classes
    AnyRef → Any
  346. def transformProductParam(x: Any, t: Transformer): Any

    Transforms this object into new one by applying t to every Ref inside its structure.

    Transforms this object into new one by applying t to every Ref inside its structure. The structure is build out of Seq, Array, Option and Def values. Other structure items remain unchanged and copied to the new instance.

    Attributes
    protected
    Definition Classes
    Base
  347. def tryCast[To](x: Ref[Def[_]])(implicit eTo: Elem[To]): Ref[To]
    Definition Classes
    CostingRules
  348. def tryConvert[From, To](eFrom: Elem[From], eTo: Elem[To], x: Ref[Def[_]], conv: Ref[(From) ⇒ To]): Ref[To]
    Definition Classes
    UniversalOps
  349. val tuplesCache: AVHashMap[Ref[_], (Ref[_], Ref[_])]
    Definition Classes
    Tuples
  350. def typeSize[T](implicit arg0: Elem[T]): Ref[Long]
    Definition Classes
    RuntimeCosting
  351. def typeSize(tpe: SType): Ref[Long]
    Definition Classes
    RuntimeCosting
  352. def unfoldLambda[A, B](f: Ref[(A) ⇒ B], x: Ref[A]): Ref[B]
    Definition Classes
    Functions
  353. def unfoldLambda[A, B](lam: Lambda[A, B], x: Ref[A]): Ref[B]
    Definition Classes
    Functions
  354. val unfoldWithOriginalFunc: Boolean

    Turns on/off lambda unfolding using original function f stored in the Lambda node.

    Turns on/off lambda unfolding using original function f stored in the Lambda node. If this flag is false then this function cannot be used even if it is present in the node.

    Definition Classes
    Functions
  355. def unrefDelegate[T <: AnyRef](x: Ref[T])(implicit ct: ClassTag[T]): T

    Create delegate instance suitable for method invocation.

    Create delegate instance suitable for method invocation. It is used when T is a class or a trait and the node referred by x doesn't conform to T. This method returns dynamically constructed instance, which conforms to T. Whenever a method of T is called on that instance, the call is intercepted and DelegatedInterceptionHandler.invoke method is called, then a new MethodCall can be constructed (which is befavior by default).

    Attributes
    protected
    Definition Classes
    MethodCalls
  356. def unzipPair[A, B](p: Ref[(A, B)]): (Ref[A], Ref[B])
    Definition Classes
    Tuples
  357. def upcast[To](value: Ref[_])(implicit arg0: Elem[To]): Ref[To]
    Definition Classes
    UniversalOps
  358. def upcastFun[A, B >: A](implicit arg0: Elem[A]): Ref[(A) ⇒ B]
    Definition Classes
    Functions
  359. final def updateSymbolTable[T](s: Ref[T], d: Def[T]): Ref[T]

    Create or find symbol (node Ref) which refers to the given node in the table of all created symbols.

    Create or find symbol (node Ref) which refers to the given node in the table of all created symbols. The d.nodeId is the index in the _symbolTable which is DBuffer (backed by Array)

    returns

    new of existing symbol

    Definition Classes
    Base
  360. val useAlphaEquality: Boolean

    Global lambda equality mode used by default.

    Global lambda equality mode used by default. It is used in fun and fun2 lambda builders. If this flag is true then Lambda nodes are equal if they are the same up to renaming of symbols. (see Lambda.equals()). Each Lambda node has independent equality mode flag which is setup in the constructor.

    Definition Classes
    Functions
  361. final def valueFromRep[A](x: Ref[A]): A

    Extract data value from Const node or throw an exception.

    Extract data value from Const node or throw an exception.

    Definition Classes
    Base
    Annotations
    @inline()
  362. def variable[T](implicit eT: LElem[T]): Ref[T]
    Definition Classes
    Base
    Annotations
    @inline()
  363. def verifyCostFunc(costF: Ref[(Any) ⇒ Int]): Try[Unit]

    Checks if the function (Lambda node) given by the symbol costF contains only allowed operations in the schedule.

    Checks if the function (Lambda node) given by the symbol costF contains only allowed operations in the schedule.

    Definition Classes
    Evaluation
  364. def verifyIsProven[T](f: Ref[(Context) ⇒ T]): Try[Unit]

    Checks that if SigmaProp.isProven method calls exists in the given Lambda's schedule, then it is the last operation.

    Checks that if SigmaProp.isProven method calls exists in the given Lambda's schedule, then it is the last operation.

    Definition Classes
    Evaluation
  365. implicit lazy val wRTypeAnyElement: Elem[WRType[Any]]
    Definition Classes
    SigmaLibrary
  366. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  367. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  368. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  369. def withConstantSize[T](v: Ref[T], cost: Ref[Int]): RCosted[T]
    Definition Classes
    RuntimeCosting
  370. def zeroSize[V](eVal: Elem[V]): RSize[V]
    Definition Classes
    Library
  371. implicit def zipPair[A, B](p: (Ref[A], Ref[B])): Ref[(A, B)]
    Definition Classes
    Tuples
  372. object AvlTreeCoster extends IRContext.CostingHandler[IRContext.AvlTree]
    Definition Classes
    CostingRules
  373. object BoxCoster extends IRContext.CostingHandler[IRContext.Box]
    Definition Classes
    CostingRules
  374. object CollCoster extends IRContext.CostingHandler[IRContext.Coll[Any]]
    Definition Classes
    CostingRules
  375. object ContextCoster extends IRContext.CostingHandler[IRContext.Context]
    Definition Classes
    CostingRules
  376. object GroupElementCoster extends IRContext.CostingHandler[IRContext.GroupElement]

    CostingHandler for SGroupElement, see SGroupElement.coster

    CostingHandler for SGroupElement, see SGroupElement.coster

    Definition Classes
    CostingRules
  377. object HeaderCoster extends IRContext.CostingHandler[IRContext.Header]
    Definition Classes
    CostingRules
  378. object OptionCoster extends IRContext.CostingHandler[IRContext.WOption[Any]]
    Definition Classes
    CostingRules
  379. object PreHeaderCoster extends IRContext.CostingHandler[IRContext.PreHeader]
    Definition Classes
    CostingRules
  380. object SigmaDslBuilderCoster extends IRContext.CostingHandler[IRContext.SigmaDslBuilder]
    Definition Classes
    CostingRules
  381. object LoopOperation
    Definition Classes
    Evaluation
  382. object AllOf
    Definition Classes
    RuntimeCosting
  383. object AllZk
    Definition Classes
    RuntimeCosting
  384. object AnyOf
    Definition Classes
    RuntimeCosting
  385. object AnyZk
    Definition Classes
    RuntimeCosting
  386. object CostedFoldExtractors
    Definition Classes
    RuntimeCosting
  387. object ElemAccessor
    Definition Classes
    RuntimeCosting
  388. object HasSigmas
    Definition Classes
    RuntimeCosting
  389. object IsConstSizeCostedColl
    Definition Classes
    RuntimeCosting
  390. object IsCostedPair
    Definition Classes
    RuntimeCosting
  391. object IsArithOp
    Definition Classes
    TreeBuilding
  392. object IsConstantDef
    Definition Classes
    TreeBuilding
  393. object IsContextProperty
    Definition Classes
    TreeBuilding
  394. object IsInternalDef
    Definition Classes
    TreeBuilding
  395. object IsLogicalBinOp
    Definition Classes
    TreeBuilding
  396. object IsLogicalUnOp
    Definition Classes
    TreeBuilding
  397. object IsNumericUnOp
    Definition Classes
    TreeBuilding
  398. object IsRelationOp
    Definition Classes
    TreeBuilding
  399. object Coll extends scalan.Library.EntityObject
    Definition Classes
    CollsDefs
  400. object CollBuilder extends scalan.Library.EntityObject
    Definition Classes
    CollsDefs
  401. object PairColl extends scalan.Library.EntityObject
    Definition Classes
    CollsDefs
  402. object ReplColl extends scalan.Library.EntityObject
    Definition Classes
    CollsDefs
  403. object CCostedBuilder extends scalan.Library.EntityObject
    Definition Classes
    ConcreteCostsDefs
  404. object CCostedColl extends scalan.Library.EntityObject
    Definition Classes
    ConcreteCostsDefs
  405. object CCostedFunc extends scalan.Library.EntityObject
    Definition Classes
    ConcreteCostsDefs
  406. object CCostedPair extends scalan.Library.EntityObject
    Definition Classes
    ConcreteCostsDefs
  407. object CCostedPrim extends scalan.Library.EntityObject
    Definition Classes
    ConcreteCostsDefs
  408. object CSizeColl extends scalan.Library.EntityObject
    Definition Classes
    ConcreteSizesDefs
  409. object CSizeFunc extends scalan.Library.EntityObject
    Definition Classes
    ConcreteSizesDefs
  410. object CSizeOption extends scalan.Library.EntityObject
    Definition Classes
    ConcreteSizesDefs
  411. object CSizePair extends scalan.Library.EntityObject
    Definition Classes
    ConcreteSizesDefs
  412. object CSizePrim extends scalan.Library.EntityObject
    Definition Classes
    ConcreteSizesDefs
  413. object CCostedOption extends scalan.Library.EntityObject
    Definition Classes
    CostedOptionsDefs
  414. object Costed extends scalan.Library.EntityObject
    Definition Classes
    CostsDefs
  415. object CostedBuilder extends scalan.Library.EntityObject
    Definition Classes
    CostsDefs
  416. object CostedColl extends scalan.Library.EntityObject
    Definition Classes
    CostsDefs
  417. object CostedFunc extends scalan.Library.EntityObject
    Definition Classes
    CostsDefs
  418. object CostedOption extends scalan.Library.EntityObject
    Definition Classes
    CostsDefs
  419. object CostedPair extends scalan.Library.EntityObject
    Definition Classes
    CostsDefs
  420. object CostedPrim extends scalan.Library.EntityObject
    Definition Classes
    CostsDefs
  421. object IntPlusMonoid extends scalan.Library.EntityObject
    Definition Classes
    MonoidInstancesDefs
  422. object LongPlusMonoid extends scalan.Library.EntityObject
    Definition Classes
    MonoidInstancesDefs
  423. object MonoidBuilderInst extends scalan.Library.EntityObject
    Definition Classes
    MonoidInstancesDefs
  424. object Monoid extends scalan.Library.EntityObject
    Definition Classes
    MonoidsDefs
  425. object MonoidBuilder extends scalan.Library.EntityObject
    Definition Classes
    MonoidsDefs
  426. object Size extends scalan.Library.EntityObject
    Definition Classes
    SizesDefs
  427. object SizeColl extends scalan.Library.EntityObject
    Definition Classes
    SizesDefs
  428. object SizeFunc extends scalan.Library.EntityObject
    Definition Classes
    SizesDefs
  429. object SizeOption extends scalan.Library.EntityObject
    Definition Classes
    SizesDefs
  430. object SizePair extends scalan.Library.EntityObject
    Definition Classes
    SizesDefs
  431. object SizePrim extends scalan.Library.EntityObject
    Definition Classes
    SizesDefs
  432. object SizeAnyValue extends scalan.SigmaLibrary.EntityObject
    Definition Classes
    CostedObjectsDefs
  433. object SizeBox extends scalan.SigmaLibrary.EntityObject
    Definition Classes
    CostedObjectsDefs
  434. object SizeBuilder extends scalan.SigmaLibrary.EntityObject
    Definition Classes
    CostedObjectsDefs
  435. object SizeContext extends scalan.SigmaLibrary.EntityObject
    Definition Classes
    CostedObjectsDefs
  436. object SizeSigmaProp extends scalan.SigmaLibrary.EntityObject
    Definition Classes
    CostedObjectsDefs
  437. object AnyValue extends scalan.SigmaLibrary.EntityObject
    Definition Classes
    SigmaDslDefs
  438. object AvlTree extends scalan.SigmaLibrary.EntityObject
    Definition Classes
    SigmaDslDefs
  439. object BigInt extends scalan.SigmaLibrary.EntityObject
    Definition Classes
    SigmaDslDefs
  440. object Box extends scalan.SigmaLibrary.EntityObject
    Definition Classes
    SigmaDslDefs
  441. object Context extends scalan.SigmaLibrary.EntityObject
    Definition Classes
    SigmaDslDefs
  442. object CostModel extends scalan.SigmaLibrary.EntityObject
    Definition Classes
    SigmaDslDefs
  443. object GroupElement extends scalan.SigmaLibrary.EntityObject
    Definition Classes
    SigmaDslDefs
  444. object Header extends scalan.SigmaLibrary.EntityObject
    Definition Classes
    SigmaDslDefs
  445. object PreHeader extends scalan.SigmaLibrary.EntityObject
    Definition Classes
    SigmaDslDefs
  446. object SigmaContract extends scalan.SigmaLibrary.EntityObject
    Definition Classes
    SigmaDslDefs
  447. object SigmaDslBuilder extends scalan.SigmaLibrary.EntityObject
    Definition Classes
    SigmaDslDefs
  448. object SigmaProp extends scalan.SigmaLibrary.EntityObject
    Definition Classes
    SigmaDslDefs
  449. object OptionWrapSpec extends scalan.Library.EntityObject
    Definition Classes
    WrappersSpecDefs
  450. object RTypeWrapSpec extends scalan.Library.EntityObject
    Definition Classes
    WrappersSpecDefs
  451. object SpecialPredefWrapSpec extends scalan.Library.EntityObject
    Definition Classes
    WrappersSpecDefs
  452. object WrapSpecBase extends scalan.Library.EntityObject
    Definition Classes
    WrappersSpecDefs
  453. object WOption extends special.wrappers.WrappersModule.EntityObject
    Definition Classes
    WOptionsDefs
  454. object WRType extends special.wrappers.WrappersModule.EntityObject
    Definition Classes
    WRTypesDefs
  455. object WSpecialPredef extends special.wrappers.WrappersModule.EntityObject
    Definition Classes
    WSpecialPredefsDefs

Inherited from CompiletimeCosting

Inherited from IRContext

Inherited from TreeBuilding

Inherited from Evaluation

Inherited from RuntimeCosting

Inherited from CostingRules

Inherited from SigmaLibrary

Inherited from CostedObjectsModule

Inherited from CostedObjectsDefs

Inherited from CostedObjects

Inherited from SigmaDslModule

Inherited from SigmaDslDefs

Inherited from SigmaDsl

Inherited from WrappersModule

Inherited from Library

Inherited from CostedOptionsModule

Inherited from CostedOptionsDefs

Inherited from CostedOptions

Inherited from MonoidInstancesModule

Inherited from MonoidInstancesDefs

Inherited from MonoidInstances

Inherited from MonoidsModule

Inherited from MonoidsDefs

Inherited from Monoids

Inherited from ConcreteCostsModule

Inherited from ConcreteCostsDefs

Inherited from ConcreteCosts

Inherited from ConcreteSizesModule

Inherited from ConcreteSizesDefs

Inherited from ConcreteSizes

Inherited from CostsModule

Inherited from CostsDefs

Inherited from Costs

Inherited from SizesModule

Inherited from SizesDefs

Inherited from Sizes

Inherited from CollsModule

Inherited from CollsDefs

Inherited from Colls

Inherited from WrappersSpecModule

Inherited from WrappersSpecDefs

Inherited from WrappersSpec

Inherited from WrappersModule

Inherited from WRTypesModule

Inherited from WRTypesDefs

Inherited from WRTypes

Inherited from WOptionsModule

Inherited from WOptionsDefs

Inherited from WOptions

Inherited from WSpecialPredefsModule

Inherited from WSpecialPredefsDefs

Inherited from WSpecialPredefs

Inherited from Scalan

Inherited from DefRewriting

Inherited from Modules

Inherited from Entities

Inherited from Thunks

Inherited from IfThenElse

Inherited from Functions

Inherited from ProgramGraphs

Inherited from AstGraphs

Inherited from Transforming

Inherited from UniversalOps

Inherited from Equal

Inherited from OrderingOps

Inherited from LogicalOps

Inherited from UnBinOps

Inherited from NumericOps

Inherited from Tuples

Inherited from MethodCalls

Inherited from GraphVizExport

Inherited from TypeDescs

Inherited from Base

Inherited from AnyRef

Inherited from Any

Ungrouped