Trait

wrappers.scala.impl

WOptionsDefs

Related Doc: package impl

Permalink

trait WOptionsDefs extends Scalan with WOptions

Self Type
WrappersModule
Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. WOptionsDefs
  2. WOptions
  3. Scalan
  4. DefRewriting
  5. Modules
  6. Entities
  7. Thunks
  8. IfThenElse
  9. Functions
  10. ProgramGraphs
  11. AstGraphs
  12. Transforming
  13. UniversalOps
  14. Equal
  15. OrderingOps
  16. LogicalOps
  17. UnBinOps
  18. NumericOps
  19. Tuples
  20. MethodCalls
  21. GraphVizExport
  22. TypeDescs
  23. Base
  24. AnyRef
  25. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. case class Abs[T](n: ExactNumeric[T])(implicit evidence$8: Scalan.Elem[T]) extends Scalan.UnOp[T, T] with Product with Serializable

    Permalink

    Descriptor of unary abs operation.

    Descriptor of unary abs operation.

    Definition Classes
    NumericOps
  2. 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

    Permalink
    Definition Classes
    Functions
  3. 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

    Permalink

    Graph node which represents application of the given binary operation to the given arguments.

    Graph node which represents application of the given binary operation to the given arguments.

    Definition Classes
    UnBinOps
  4. 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

    Permalink

    Graph node which represents application of the given binary operation to the given arguments where the second argument is lazy.

    Graph node which represents application of the given binary operation to the given arguments where the second argument is lazy.

    Definition Classes
    UnBinOps
  5. case class ApplyUnOp[A, R](op: Scalan.UnOp[A, R], arg: Scalan.Ref[A]) extends Scalan.BaseDef[R] with Product with Serializable

    Permalink

    Graph node which represents application of the given unary operation to the given argument.

    Graph node which represents application of the given unary operation to the given argument.

    Definition Classes
    UnBinOps
  6. abstract class AstGraph extends Scalan.Node

    Permalink

    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
  7. abstract class BaseDef[+T] extends Scalan.Node with Scalan.Def[T]

    Permalink

    Base class for most predefined operations.

    Base class for most predefined operations.

    Definition Classes
    Base
  8. abstract class BaseElem[A] extends Scalan.Elem[A] with Serializable with Equals

    Permalink
    Definition Classes
    TypeDescs
  9. class BaseElemLiftable[A] extends Scalan.BaseElem[A]

    Permalink

    Type descriptor for primitive types.

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

    Definition Classes
    TypeDescs
  10. abstract class BinOp[A, R] extends AnyRef

    Permalink

    Base class for descriptors of binary operations.

    Base class for descriptors of binary operations.

    Definition Classes
    UnBinOps
  11. abstract class CompanionDef[T] extends Scalan.Node with Scalan.Def[T]

    Permalink

    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
  12. abstract class CompanionElem[T] extends Scalan.Elem[T]

    Permalink

    Base class for all descriptors of staged companions

    Base class for all descriptors of staged companions

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

    Permalink

    Base class for all descriptors of staged classes.

    Base class for all descriptors of staged classes.

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

    Permalink

    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
  15. case class Const[T](x: T)(implicit eT: Scalan.Elem[T]) extends Scalan.BaseDef[T] with Product with Serializable

    Permalink

    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
  16. abstract class Cont[F[_]] extends Scalan.TypeDesc

    Permalink

    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}." )
  17. 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

    Permalink
    Definition Classes
    UniversalOps
  18. type DataEnv = Map[special.wrappers.WrappersModule.Sym, AnyRef]

    Permalink

    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
  19. trait Def[+T] extends Scalan.Node

    Permalink

    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
  20. class DefaultPass extends Scalan.Pass

    Permalink

    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
  21. abstract class DivOp[T] extends Scalan.EndoBinOp[T]

    Permalink

    Base class for descriptors of binary division operations.

    Base class for descriptors of binary division operations.

    Definition Classes
    NumericOps
  22. case class Downcast[From, To](input: Scalan.Ref[From], eTo: Scalan.Elem[To]) extends Scalan.BaseDef[To] with Product with Serializable

    Permalink
    Definition Classes
    UniversalOps
  23. abstract class Elem[A] extends Scalan.TypeDesc

    Permalink

    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}." )
  24. class ElemCacheEntry extends AnyRef

    Permalink

    Elements cache information for each Elem class.

    Elements cache information for each Elem class.

    Definition Classes
    TypeDescs
  25. class ElseIfBranch[T] extends AnyRef

    Permalink

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

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

    Definition Classes
    IfThenElse
  26. type EndoBinOp[A] = special.wrappers.WrappersModule.BinOp[A, A]

    Permalink
    Definition Classes
    UnBinOps
  27. type EndoUnOp[A] = special.wrappers.WrappersModule.UnOp[A, A]

    Permalink
    Definition Classes
    UnBinOps
  28. abstract class EntityElem[A] extends Scalan.Elem[A] with Equals

    Permalink

    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
  29. abstract class EntityElem1[A, To, C[_]] extends Scalan.EntityElem[To]

    Permalink

    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
  30. class EntityObject extends AnyRef

    Permalink

    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
  31. case class EntityObjectOwner(obj: Scalan.EntityObject) extends Scalan.OwnerKind with Product with Serializable

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

    Permalink

    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
  33. implicit class EqualOps[A] extends AnyRef

    Permalink

    Extension methods to construct ApplyBinOp nodes

    Extension methods to construct ApplyBinOp nodes

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

    Permalink

    Binary operation representing structural equality between arguments.

    Binary operation representing structural equality between arguments.

    Definition Classes
    Equal
  35. case class First[A, B](pair: Scalan.Ref[(A, B)]) extends Scalan.Node with Scalan.Def[A] with Product with Serializable

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

    Permalink

    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
  37. implicit class FuncExtensions[A, B] extends AnyRef

    Permalink
    Definition Classes
    Functions
  38. trait Functor[F[_]] extends Scalan.Cont[F]

    Permalink
    Definition Classes
    TypeDescs
  39. case class GraphFile(file: File, fileType: String) extends Product with Serializable

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

    Permalink

    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
  41. case class HashCode[A]() extends Scalan.UnOp[A, Int] with Product with Serializable

    Permalink
    Definition Classes
    UniversalOps
  42. class IfBranch extends AnyRef

    Permalink

    Defines syntax available after IF (cond)

    Defines syntax available after IF (cond)

    Definition Classes
    IfThenElse
  43. 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

    Permalink

    IR node to represent IF condition with lazy branches.

    IR node to represent IF condition with lazy branches.

    Definition Classes
    IfThenElse
  44. case class IntegralDivide[T](i: ExactIntegral[T])(implicit elem: Scalan.Elem[T]) extends Scalan.DivOp[T] with Product with Serializable

    Permalink

    Descriptor of binary / operation (integral division).

    Descriptor of binary / operation (integral division).

    Definition Classes
    NumericOps
  45. case class IntegralMod[T](i: ExactIntegral[T])(implicit elem: Scalan.Elem[T]) extends Scalan.DivOp[T] with Product with Serializable

    Permalink

    Descriptor of binary % operation (reminder of integral division).

    Descriptor of binary % operation (reminder of integral division).

    Definition Classes
    NumericOps
  46. implicit class IntegralOpsCls[T] extends AnyRef

    Permalink

    Extension methods over Ref[T] where T is instance of ExactIntegral type-class.

    Extension methods over Ref[T] where T is instance of ExactIntegral type-class.

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

    Permalink

    Exception thrown during MethodCall invocation.

    Exception thrown during MethodCall invocation.

    Definition Classes
    MethodCalls
  48. sealed abstract class InvokeResult extends AnyRef

    Permalink

    Result of MethodCall invocation.

    Result of MethodCall invocation.

    Definition Classes
    MethodCalls
    See also

    tryInvoke

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

    Permalink

    Successful MethodCall invocation with the given result.

    Successful MethodCall invocation with the given result.

    Definition Classes
    MethodCalls
  50. type LElem[A] = Lazy[special.wrappers.WrappersModule.Elem[A]]

    Permalink

    Type descriptor which is computed lazily on demand.

    Type descriptor which is computed lazily on demand.

    Definition Classes
    TypeDescs
  51. class Lambda[A, B] extends Scalan.AstGraph with Scalan.Def[(A) ⇒ B]

    Permalink

    Represent lambda expression as IR node.

    Represent lambda expression as IR node.

    Definition Classes
    Functions
  52. type LambdaData[A, B] = (special.wrappers.WrappersModule.Lambda[A, B], Nullable[(special.wrappers.WrappersModule.Ref[A]) ⇒ special.wrappers.WrappersModule.Ref[B]], special.wrappers.WrappersModule.Ref[A], special.wrappers.WrappersModule.Ref[B])

    Permalink
    Definition Classes
    Functions
  53. implicit class LambdaOps[A, B] extends AnyRef

    Permalink
    Definition Classes
    Functions
  54. class LambdaStack extends AnyRef

    Permalink
    Definition Classes
    Functions
  55. 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

    Permalink

    Implementation of Liftable type class for Thunk[T] given liftable for T.

    Implementation of Liftable type class for Thunk[T] given liftable for T.

    Definition Classes
    Thunks
  56. implicit class ListOps[A, B] extends AnyRef

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

    Permalink

    Concrete and default implementation of Transformer using underlying HashMap.

    Concrete and default implementation of Transformer using underlying HashMap.

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

    Permalink

    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
  59. sealed abstract class MethodDesc extends AnyRef

    Permalink
    Definition Classes
    TypeDescs
  60. abstract class Mirror extends AnyRef

    Permalink

    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
  61. case class NewObject[A](eA: Scalan.Elem[A], args: Seq[Any]) extends Scalan.BaseDef[A] with Product with Serializable

    Permalink

    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
  62. abstract class Node extends Product

    Permalink

    Base class for all IR nodes/operations/definitions.

    Base class for all IR nodes/operations/definitions.

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

    Permalink

    Binary operation representing structural inequality between arguments.

    Binary operation representing structural inequality between arguments.

    Definition Classes
    Equal
  64. class NotImplementedStagingException extends Scalan.StagingException

    Permalink
    Definition Classes
    Base
  65. case class NumericMinus[T](n: ExactNumeric[T])(implicit evidence$4: Scalan.Elem[T]) extends Scalan.EndoBinOp[T] with Product with Serializable

    Permalink

    Descriptor of binary - operation.

    Descriptor of binary - operation.

    Definition Classes
    NumericOps
  66. case class NumericNegate[T](n: ExactNumeric[T])(implicit evidence$7: Scalan.Elem[T]) extends Scalan.UnOp[T, T] with Product with Serializable

    Permalink

    Descriptor of unary - operation.

    Descriptor of unary - operation.

    Definition Classes
    NumericOps
  67. implicit class NumericOpsCls[T] extends AnyRef

    Permalink

    Extension methods over Ref[T] where T is instance of ExactNumeric type-class.

    Extension methods over Ref[T] where T is instance of ExactNumeric type-class.

    Definition Classes
    NumericOps
  68. case class NumericPlus[T](n: ExactNumeric[T])(implicit evidence$3: Scalan.Elem[T]) extends Scalan.EndoBinOp[T] with Product with Serializable

    Permalink

    Descriptor of binary + operation.

    Descriptor of binary + operation.

    Definition Classes
    NumericOps
  69. case class NumericTimes[T](n: ExactNumeric[T])(implicit evidence$5: Scalan.Elem[T]) extends Scalan.EndoBinOp[T] with Product with Serializable

    Permalink

    Descriptor of binary * operation.

    Descriptor of binary * operation.

    Definition Classes
    NumericOps
  70. case class NumericToDouble[T](n: ExactNumeric[T]) extends Scalan.UnOp[T, Double] with Product with Serializable

    Permalink

    Descriptor of unary ToDouble conversion operation.

    Descriptor of unary ToDouble conversion operation.

    Definition Classes
    NumericOps
  71. case class NumericToFloat[T](n: ExactNumeric[T]) extends Scalan.UnOp[T, Float] with Product with Serializable

    Permalink

    Descriptor of unary ToFloat conversion operation.

    Descriptor of unary ToFloat conversion operation.

    Definition Classes
    NumericOps
  72. case class NumericToInt[T](n: ExactNumeric[T]) extends Scalan.UnOp[T, Int] with Product with Serializable

    Permalink

    Descriptor of unary ToInt conversion operation.

    Descriptor of unary ToInt conversion operation.

    Definition Classes
    NumericOps
  73. case class NumericToLong[T](n: ExactNumeric[T]) extends Scalan.UnOp[T, Long] with Product with Serializable

    Permalink

    Descriptor of unary ToLong conversion operation.

    Descriptor of unary ToLong conversion operation.

    Definition Classes
    NumericOps
  74. 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

    Permalink

    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
  75. case class OrderingCompare[T](ord: ExactOrdering[T]) extends Scalan.BinOp[T, Int] with Product with Serializable

    Permalink

    Descriptor of binary compare operation.

    Descriptor of binary compare operation.

    Definition Classes
    OrderingOps
  76. case class OrderingGT[T](ord: ExactOrdering[T]) extends Scalan.BinOp[T, Boolean] with Product with Serializable

    Permalink

    Descriptor of binary > operation.

    Descriptor of binary > operation.

    Definition Classes
    OrderingOps
  77. case class OrderingGTEQ[T](ord: ExactOrdering[T]) extends Scalan.BinOp[T, Boolean] with Product with Serializable

    Permalink

    Descriptor of binary >= operation.

    Descriptor of binary >= operation.

    Definition Classes
    OrderingOps
  78. case class OrderingLT[T](ord: ExactOrdering[T]) extends Scalan.BinOp[T, Boolean] with Product with Serializable

    Permalink

    Descriptor of binary < operation.

    Descriptor of binary < operation.

    Definition Classes
    OrderingOps
  79. case class OrderingLTEQ[T](ord: ExactOrdering[T]) extends Scalan.BinOp[T, Boolean] with Product with Serializable

    Permalink

    Descriptor of binary <= operation.

    Descriptor of binary <= operation.

    Definition Classes
    OrderingOps
  80. case class OrderingMax[T](ord: ExactOrdering[T])(implicit evidence$1: Scalan.Elem[T]) extends Scalan.BinOp[T, T] with Product with Serializable

    Permalink

    Descriptor of binary max operation.

    Descriptor of binary max operation.

    Definition Classes
    OrderingOps
  81. case class OrderingMin[T](ord: ExactOrdering[T])(implicit evidence$2: Scalan.Elem[T]) extends Scalan.BinOp[T, T] with Product with Serializable

    Permalink

    Descriptor of binary min operation.

    Descriptor of binary min operation.

    Definition Classes
    OrderingOps
  82. class OrderingOpsCls[T] extends AnyRef

    Permalink

    Extension method over Ref[T] given an instance of ExactOrdering for T.

    Extension method over Ref[T] given an instance of ExactOrdering for T.

    Definition Classes
    OrderingOps
  83. sealed abstract class OwnerKind extends AnyRef

    Permalink

    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
  84. type PGraph = special.wrappers.WrappersModule.ProgramGraph

    Permalink
    Definition Classes
    ProgramGraphs
  85. class PGraphUsages extends DFunc[Int, Buffer[Int]]

    Permalink

    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
  86. case class PairElem[A, B](eFst: Scalan.Elem[A], eSnd: Scalan.Elem[B]) extends Scalan.Elem[(A, B)] with Product with Serializable

    Permalink

    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
  87. implicit class PartialRewriter extends Scalan.Rewriter

    Permalink

    Turns partial function into rewriter (i.e.

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

    Definition Classes
    Transforming
  88. abstract class Pass extends AnyRef

    Permalink

    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
  89. case class PassConfig(shouldUnpackTuples: Boolean = false, shouldExtractFields: Boolean = true, constantPropagation: Boolean = true, shouldSlice: Boolean = false) extends Product with Serializable

    Permalink

    Configuration parameters of the Pass descriptor.

    Configuration parameters of the Pass descriptor.

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

    Permalink

    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
  91. case class ProgramGraph(roots: Seq[Scalan.Sym], mapping: Nullable[Scalan.Transformer], filterNode: Nullable[(Scalan.Sym) ⇒ Boolean]) extends Scalan.AstGraph with Product with Serializable

    Permalink

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

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

    Definition Classes
    ProgramGraphs
  92. type RFunc[-A, +B] = special.wrappers.WrappersModule.Ref[(A) ⇒ B]

    Permalink
    Definition Classes
    Base
  93. case class RMethodDesc(method: Method) extends Scalan.MethodDesc with Product with Serializable

    Permalink
    Definition Classes
    TypeDescs
  94. type RPair[+A, +B] = special.wrappers.WrappersModule.Ref[(A, B)]

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

    Permalink

    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

  96. implicit class RepBooleanOps extends AnyRef

    Permalink

    Extension methods over Ref[Boolean].

    Extension methods over Ref[Boolean].

    Definition Classes
    LogicalOps
  97. implicit class RepThunkOps[T] extends AnyRef

    Permalink

    Extension methods on Ref[Thunk[T]] values.

    Extension methods on Ref[Thunk[T]] values.

    Definition Classes
    Thunks
  98. implicit class RepUniversalOps[A] extends AnyRef

    Permalink
    Definition Classes
    UniversalOps
  99. abstract class Rewriter extends AnyRef

    Permalink
    Definition Classes
    Transforming
  100. type SThunk[T] = () ⇒ T

    Permalink

    Runtime representation of lazy values.

    Runtime representation of lazy values. Each Thunk typed graph node evaluates to a value of this type.

    Definition Classes
    Thunks
  101. type Schedule = Seq[special.wrappers.WrappersModule.Sym]

    Permalink

    Type synonim for graph schedules.

    Type synonim for graph schedules.

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

    Permalink

    Alternative representation of schedules using node ids.

    Alternative representation of schedules using node ids.

    Definition Classes
    AstGraphs
  103. case class Second[A, B](pair: Scalan.Ref[(A, B)]) extends Scalan.Node with Scalan.Def[B] with Product with Serializable

    Permalink
    Definition Classes
    Tuples
  104. implicit class SeqExpExtensionsForEmitGraph extends AnyRef

    Permalink
    Definition Classes
    GraphVizExport
  105. final class SingleRef[+T] extends Scalan.Ref[T]

    Permalink

    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
  106. case class SizeOf[T](value: Scalan.Ref[T]) extends Scalan.BaseDef[Long] with Product with Serializable

    Permalink

    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
  107. class StagingException extends RuntimeException

    Permalink
    Definition Classes
    Base
  108. type Subst = HashMap[special.wrappers.WrappersModule.Sym, special.wrappers.WrappersModule.Sym]

    Permalink
    Definition Classes
    Functions
  109. case class SumElem[A, B](eLeft: Scalan.Elem[A], eRight: Scalan.Elem[B]) extends Scalan.Elem[Scalan.|[A, B]] with Product with Serializable

    Permalink

    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
  110. type Sym = special.wrappers.WrappersModule.Ref[_]

    Permalink

    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
  111. type Th[+T] = special.wrappers.WrappersModule.Ref[special.wrappers.WrappersModule.Thunk[T]]

    Permalink
    Definition Classes
    Thunks
  112. class ThenIfBranch[T] extends AnyRef

    Permalink

    Defines syntax available after IF (cond) THEN thenp

    Defines syntax available after IF (cond) THEN thenp

    Definition Classes
    IfThenElse
  113. trait Thunk[+A] extends AnyRef

    Permalink

    Phantom type to define thunk-typed graph nodes and thunk based lazy operations.

    Phantom type to define thunk-typed graph nodes and thunk based lazy operations. Usually used inside Ref, see for example Th. See also for details http://gigiigig.github.io/tlp-step-by-step/phantom-types.html

    Definition Classes
    Thunks
  114. class ThunkCompanion extends AnyRef

    Permalink

    A class of factory to create new Thunks by use Thunk { ... } expressions.

    A class of factory to create new Thunks by use Thunk { ... } expressions.

    Definition Classes
    Thunks
  115. 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

    Permalink

    Graph node to represent constants of type Thunk.

    Graph node to represent constants of type Thunk.

    Definition Classes
    Thunks
    See also

    scalan.Base.Liftables.Liftable

  116. class ThunkDef[A] extends Scalan.AstGraph with Scalan.Def[Scalan.Thunk[A]]

    Permalink

    Graph node representing thunk with reified body.

    Graph node representing thunk with reified body. Each thunk node is a specialized implementation of AstGraph abstract class.

    Definition Classes
    Thunks
  117. case class ThunkElem[A](eItem: Scalan.Elem[A]) extends Scalan.EntityElem1[A, Scalan.Thunk[A], Scalan.Thunk] with Product with Serializable

    Permalink

    Implements a type descriptor of Thunk[A] type given the instance of A.

    Implements a type descriptor of Thunk[A] type given the instance of A.

    Definition Classes
    Thunks
  118. case class ThunkForce[A](thunk: Scalan.Ref[Scalan.Thunk[A]]) extends Scalan.Node with Scalan.Def[A] with Product with Serializable

    Permalink

    Graph node to represent thunk forcing operation.

    Graph node to represent thunk forcing operation.

    Definition Classes
    Thunks
  119. class ThunkScope extends AnyRef

    Permalink

    Helper object to handle construction of nested thunks.

    Helper object to handle construction of nested thunks. One instance is created for each ThunkDef under construction. This corresponds to syntactic nesting of thunks.

    Definition Classes
    Thunks
  120. class ThunkStack extends AnyRef

    Permalink

    The stack of nested thunks during graph construction.

    The stack of nested thunks during graph construction.

    Definition Classes
    Thunks
  121. case class ToString[A]() extends Scalan.UnOp[A, String] with Product with Serializable

    Permalink
    Definition Classes
    UniversalOps
  122. abstract class Transformer extends AnyRef

    Permalink

    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
  123. 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

    Permalink
    Definition Classes
    Tuples
  124. implicit class TupleOps2[A, B] extends AnyRef

    Permalink
    Definition Classes
    Tuples
  125. implicit class TupleOps3[A, B, C] extends AnyRef

    Permalink
    Definition Classes
    Tuples
  126. implicit class TupleOps4[A, B, C, D] extends AnyRef

    Permalink
    Definition Classes
    Tuples
  127. implicit class TupleOps5[A, B, C, D, E] extends AnyRef

    Permalink
    Definition Classes
    Tuples
  128. abstract class TypeDesc extends Serializable

    Permalink
    Definition Classes
    TypeDescs
  129. abstract class UnOp[A, R] extends AnyRef

    Permalink

    Base class for descriptors of unary operations.

    Base class for descriptors of unary operations.

    Definition Classes
    UnBinOps
  130. case class Upcast[From, To](input: Scalan.Ref[From], eTo: Scalan.Elem[To]) extends Scalan.BaseDef[To] with Product with Serializable

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

    Permalink

    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
  132. case class WMethodDesc(wrapSpec: WrapSpec, method: Method) extends Scalan.MethodDesc with Product with Serializable

    Permalink
    Definition Classes
    TypeDescs
  133. trait WOption[A] extends special.wrappers.WrappersModule.Node with special.wrappers.WrappersModule.Def[special.wrappers.WrappersModule.WOption[A]]

    Permalink
    Definition Classes
    WOptions
    Annotations
    @External() @ContainerType() @FunctorType() @Liftable() @WithMethodCallRecognizers()
  134. trait WOptionCompanion extends AnyRef

    Permalink
    Definition Classes
    WOptions
  135. type |[+A, +B] = Either[A, B]

    Permalink
    Definition Classes
    Base

Value Members

  1. def !!!(msg: String, e: Throwable, syms: special.wrappers.WrappersModule.Ref[_]*): Nothing

    Permalink
    Definition Classes
    Base
  2. def !!!(msg: String, syms: special.wrappers.WrappersModule.Ref[_]*): Nothing

    Permalink
    Definition Classes
    Base
  3. def !!!: Nothing

    Permalink

    Helper methods to throw errors

    Helper methods to throw errors

    Definition Classes
    Base
  4. final def !=(arg0: Any): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  6. object &&

    Permalink

    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
  7. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  8. def ???(value: Any, syms: special.wrappers.WrappersModule.Ref[_]*): Nothing

    Permalink
    Definition Classes
    Base
  9. def ???: Nothing

    Permalink
    Definition Classes
    Base
  10. val And: special.wrappers.WrappersModule.EndoBinOp[Boolean]

    Permalink

    Logical AND binary operation.

    Logical AND binary operation.

    Definition Classes
    LogicalOps
  11. val AnyElement: special.wrappers.WrappersModule.Elem[Any]

    Permalink

    Type descriptor for Any, cannot be used implicitly.

    Type descriptor for Any, cannot be used implicitly.

    Definition Classes
    TypeDescs
  12. val AnyRefElement: special.wrappers.WrappersModule.Elem[AnyRef]

    Permalink

    Type descriptor for AnyRef, cannot be used implicitly.

    Type descriptor for AnyRef, cannot be used implicitly.

    Definition Classes
    TypeDescs
  13. val BinaryXorOp: special.wrappers.WrappersModule.EndoBinOp[Boolean]

    Permalink

    Logical XOR binary operation.

    Logical XOR binary operation.

    Definition Classes
    LogicalOps
  14. implicit val BooleanElement: special.wrappers.WrappersModule.Elem[Boolean]

    Permalink
    Definition Classes
    TypeDescs
  15. val BooleanToInt: special.wrappers.WrappersModule.UnOp[Boolean, Int]

    Permalink

    Boolean to Int conversion unary operation.

    Boolean to Int conversion unary operation.

    Definition Classes
    LogicalOps
  16. implicit val ByteElement: special.wrappers.WrappersModule.Elem[Byte]

    Permalink
    Definition Classes
    TypeDescs
  17. implicit val CharElement: special.wrappers.WrappersModule.Elem[Char]

    Permalink
    Definition Classes
    TypeDescs
  18. object ConstantLambda

    Permalink

    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
  19. object ConstantThunk

    Permalink
    Definition Classes
    Thunks
  20. object Def

    Permalink
    Definition Classes
    Base
  21. val DefaultMirror: special.wrappers.WrappersModule.Mirror

    Permalink

    Default Mirror instance which is used in core IR methods.

    Default Mirror instance which is used in core IR methods.

    Definition Classes
    Transforming
  22. implicit val DoubleElement: special.wrappers.WrappersModule.Elem[Double]

    Permalink
    Definition Classes
    TypeDescs
  23. object Elem extends Serializable

    Permalink
    Definition Classes
    TypeDescs
  24. val EmptyArrayOfSym: Array[special.wrappers.WrappersModule.Sym]

    Permalink

    Immutable empty array of symbols, can be used to avoid unnecessary allocations.

    Immutable empty array of symbols, can be used to avoid unnecessary allocations.

    Definition Classes
    Base
  25. val EmptyDSetOfInt: Set[Int]

    Permalink

    Used internally in IR and should be used with care since it is mutable.

    Used internally in IR and should be used with care since it is mutable. At the same time, it is used in the hotspot and allows to avoid roughly tens of thousands of allocations per second. WARNING: Mutations of this instance can lead to undefined behavior.

    Attributes
    protected
    Definition Classes
    Base
  26. val EmptySeqOfSym: Seq[special.wrappers.WrappersModule.Sym]

    Permalink

    Immutable empty Seq, can be used to avoid unnecessary allocations.

    Immutable empty Seq, can be used to avoid unnecessary allocations.

    Definition Classes
    Base
  27. val EmptyTypeArgs: ListMap[String, (special.wrappers.WrappersModule.TypeDesc, Variance)]

    Permalink

    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
  28. object EnvRep extends Serializable

    Permalink
    Definition Classes
    TypeDescs
  29. object ExpWithElem

    Permalink
    Definition Classes
    Base
  30. implicit val FloatElement: special.wrappers.WrappersModule.Elem[Float]

    Permalink
    Definition Classes
    TypeDescs
  31. implicit final def FuncElemExtensions[A, B](eAB: special.wrappers.WrappersModule.Elem[(A) ⇒ B]): special.wrappers.WrappersModule.FuncElem[A, B]

    Permalink
    Definition Classes
    TypeDescs
  32. def IF(cond: special.wrappers.WrappersModule.Ref[Boolean]): special.wrappers.WrappersModule.IfBranch

    Permalink

    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
  33. object IdentityLambda

    Permalink
    Definition Classes
    Functions
  34. implicit val IntElement: special.wrappers.WrappersModule.Elem[Int]

    Permalink
    Definition Classes
    TypeDescs
  35. final def IntZero: special.wrappers.WrappersModule.Ref[Int]

    Permalink

    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()
  36. object InvokeImpossible extends Scalan.InvokeResult with Product with Serializable

    Permalink

    Invocation is not possible, e.g.

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

    Definition Classes
    MethodCalls
  37. object IsPair

    Permalink
    Definition Classes
    Tuples
  38. object Lambda

    Permalink
    Definition Classes
    Functions
  39. val LazyAnyElement: Lazy[special.wrappers.WrappersModule.Elem[Any]]

    Permalink

    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
  40. object Liftables

    Permalink

    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
  41. implicit val LongElement: special.wrappers.WrappersModule.Elem[Long]

    Permalink
    Definition Classes
    TypeDescs
  42. object MapTransformer extends Serializable

    Permalink
    Definition Classes
    Transforming
  43. object NoOwner extends Scalan.OwnerKind with Product with Serializable

    Permalink
    Definition Classes
    Base
  44. val NoRewriting: special.wrappers.WrappersModule.Rewriter

    Permalink

    Identity rewriter, i.e.

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

    Definition Classes
    Transforming
  45. val Not: special.wrappers.WrappersModule.EndoUnOp[Boolean]

    Permalink

    Logical NOT unary operation.

    Logical NOT unary operation.

    Definition Classes
    LogicalOps
  46. val NothingElement: special.wrappers.WrappersModule.Elem[Nothing]

    Permalink
    Definition Classes
    TypeDescs
  47. val Or: special.wrappers.WrappersModule.EndoBinOp[Boolean]

    Permalink

    Logical AND binary operation.

    Logical AND binary operation.

    Definition Classes
    LogicalOps
  48. implicit def OrderingToOrderingOps[T](x: T)(implicit n: ExactOrdering[T], et: special.wrappers.WrappersModule.Elem[T]): special.wrappers.WrappersModule.OrderingOpsCls[T]

    Permalink
    Definition Classes
    OrderingOps
  49. object Pair

    Permalink
    Definition Classes
    Tuples
  50. implicit final def PairElemExtensions[A, B](eAB: special.wrappers.WrappersModule.Elem[(A, B)]): special.wrappers.WrappersModule.PairElem[A, B]

    Permalink
    Definition Classes
    TypeDescs
  51. object Pass

    Permalink
    Definition Classes
    Transforming
  52. object ProgramGraph extends Serializable

    Permalink
    Definition Classes
    ProgramGraphs
  53. object ScalanOwner extends Scalan.OwnerKind with Product with Serializable

    Permalink
    Definition Classes
    Base
  54. implicit val ShortElement: special.wrappers.WrappersModule.Elem[Short]

    Permalink
    Definition Classes
    TypeDescs
  55. implicit val StringElement: special.wrappers.WrappersModule.Elem[String]

    Permalink
    Definition Classes
    TypeDescs
  56. implicit final def SumElemExtensions[A, B](eAB: special.wrappers.WrappersModule.Elem[special.wrappers.WrappersModule.|[A, B]]): special.wrappers.WrappersModule.SumElem[A, B]

    Permalink
    Definition Classes
    TypeDescs
  57. val Thunk: special.wrappers.WrappersModule.ThunkCompanion

    Permalink

    Allow expressions like Thunk { ... } to create new Thunks.

    Allow expressions like Thunk { ... } to create new Thunks.

    Definition Classes
    Thunks
  58. object ThunkDef

    Permalink
    Definition Classes
    Thunks
  59. final def TypeArgs(descs: (String, (special.wrappers.WrappersModule.TypeDesc, Variance))*): ListMap[String, (special.wrappers.WrappersModule.TypeDesc, Variance)]

    Permalink
    Definition Classes
    TypeDescs
  60. implicit val UnitElement: special.wrappers.WrappersModule.Elem[Unit]

    Permalink
    Definition Classes
    TypeDescs
  61. object VeryConstantLambda

    Permalink

    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
  62. object WOption extends special.wrappers.WrappersModule.EntityObject

    Permalink
  63. var _currentPass: special.wrappers.WrappersModule.Pass

    Permalink
    Definition Classes
    Transforming
  64. def alphaEqual(s1: special.wrappers.WrappersModule.Sym, s2: special.wrappers.WrappersModule.Sym): Boolean

    Permalink
    Definition Classes
    Functions
  65. def applyBinOp[A, R](op: special.wrappers.WrappersModule.BinOp[A, R], lhs: special.wrappers.WrappersModule.Ref[A], rhs: special.wrappers.WrappersModule.Ref[A]): special.wrappers.WrappersModule.Ref[R]

    Permalink

    Overridable constructor of a binary operation node.

    Overridable constructor of a binary operation node.

    Definition Classes
    UnBinOps
  66. def applyBinOpLazy[A, R](op: special.wrappers.WrappersModule.BinOp[A, R], lhs: special.wrappers.WrappersModule.Ref[A], rhs: special.wrappers.WrappersModule.Ref[special.wrappers.WrappersModule.Thunk[A]]): special.wrappers.WrappersModule.Ref[R]

    Permalink

    Overridable constructor of a binary operation node with lazy argument.

    Overridable constructor of a binary operation node with lazy argument.

    Definition Classes
    UnBinOps
  67. def applyUnOp[A, R](op: special.wrappers.WrappersModule.UnOp[A, R], arg: special.wrappers.WrappersModule.Ref[A]): special.wrappers.WrappersModule.Ref[R]

    Permalink

    Overridable constructor of an unary operation node.

    Overridable constructor of an unary operation node.

    Definition Classes
    UnBinOps
  68. final def asElem[T](d: special.wrappers.WrappersModule.TypeDesc): special.wrappers.WrappersModule.Elem[T]

    Permalink

    Helper type case method.

    Helper type case method.

    Definition Classes
    TypeDescs
    Annotations
    @inline()
  69. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  70. final def asRep[T](x: special.wrappers.WrappersModule.Ref[_]): special.wrappers.WrappersModule.Ref[T]

    Permalink

    Helper to type cast node references.

    Helper to type cast node references.

    Definition Classes
    Base
    Annotations
    @inline()
  71. def assertElem(value: special.wrappers.WrappersModule.Ref[_], elem: special.wrappers.WrappersModule.Elem[_], hint: ⇒ String): Unit

    Permalink
    Definition Classes
    TypeDescs
  72. def assertElem(value: special.wrappers.WrappersModule.Ref[_], elem: special.wrappers.WrappersModule.Elem[_]): Unit

    Permalink
    Definition Classes
    TypeDescs
  73. def assertEqualElems[A](e1: special.wrappers.WrappersModule.Elem[A], e2: special.wrappers.WrappersModule.Elem[A], m: ⇒ String): Unit

    Permalink
    Definition Classes
    TypeDescs
  74. def assertValueIdForOpCost[A, B](value: special.wrappers.WrappersModule.Ref[A], cost: special.wrappers.WrappersModule.Ref[B]): Unit

    Permalink
    Definition Classes
    UniversalOps
  75. def beginPass(pass: special.wrappers.WrappersModule.Pass): Unit

    Permalink

    Called to setup IR before the new pass is executed.

    Called to setup IR before the new pass is executed.

    Definition Classes
    Transforming
  76. val cacheElems: Boolean

    Permalink

    Whether IR type descriptors should be cached.

    Whether IR type descriptors should be cached.

    Definition Classes
    Base
  77. val cachePairs: Boolean

    Permalink

    Whether Tup instances should be cached.

    Whether Tup instances should be cached.

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

    Permalink

    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
  79. def canBeInvoked(d: special.wrappers.WrappersModule.Def[_], m: Method, args: Array[AnyRef]): Boolean

    Permalink

    Method invocation checker.

    Method invocation checker.

    Attributes
    protected
    Definition Classes
    MethodCalls
  80. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @throws( ... )
  81. def clusterColor(g: special.wrappers.WrappersModule.AstGraph): Option[String]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphVizExport
  82. def clusterSchedule(g: special.wrappers.WrappersModule.AstGraph): Seq[special.wrappers.WrappersModule.Sym]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphVizExport
  83. def compose[A, B, C](f: special.wrappers.WrappersModule.Ref[(B) ⇒ C], g: special.wrappers.WrappersModule.Ref[(A) ⇒ B]): special.wrappers.WrappersModule.Ref[(A) ⇒ C]

    Permalink

    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
  84. def constFun[A, B](x: special.wrappers.WrappersModule.Ref[B])(implicit e: special.wrappers.WrappersModule.Elem[A]): special.wrappers.WrappersModule.Ref[(A) ⇒ B]

    Permalink
    Definition Classes
    Functions
  85. final def container[F[_]](implicit arg0: special.wrappers.WrappersModule.Cont[F]): special.wrappers.WrappersModule.Cont[F]

    Permalink
    Definition Classes
    TypeDescs
  86. implicit final def containerElem[F[_], A](implicit arg0: special.wrappers.WrappersModule.Cont[F], arg1: special.wrappers.WrappersModule.Elem[A]): special.wrappers.WrappersModule.Elem[F[A]]

    Permalink
    Definition Classes
    TypeDescs
  87. def createDefinition[T](optScope: Nullable[special.wrappers.WrappersModule.ThunkScope], s: special.wrappers.WrappersModule.Ref[T], d: special.wrappers.WrappersModule.Def[T]): special.wrappers.WrappersModule.Ref[T]

    Permalink

    Create new definition entry in either given Thunk or in the global hash table.

    Create new definition entry in either given Thunk or in the global hash table.

    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
    Base
  88. def currentPass: special.wrappers.WrappersModule.Pass

    Permalink

    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
  89. val debugModeSanityChecks: Boolean

    Permalink

    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
  90. def defCount: Int

    Permalink

    Returns a number of definitions added to this IR context.

    Returns a number of definitions added to this IR context.

    Definition Classes
    Base
  91. def def_unapply[T](e: special.wrappers.WrappersModule.Ref[T]): Nullable[special.wrappers.WrappersModule.Def[T]]

    Permalink
    Definition Classes
    Base
  92. def defaultGraphVizConfig: GraphVizConfig

    Permalink
    Definition Classes
    GraphVizExport
  93. def delayInvoke: Nothing

    Permalink
    Definition Classes
    MethodCalls
  94. def downcast[To](value: special.wrappers.WrappersModule.Ref[_])(implicit arg0: special.wrappers.WrappersModule.Elem[To]): special.wrappers.WrappersModule.Ref[To]

    Permalink
    Definition Classes
    UniversalOps
  95. val elemCache: AVHashMap[Class[_], special.wrappers.WrappersModule.ElemCacheEntry]

    Permalink
    Attributes
    protected
    Definition Classes
    TypeDescs
  96. final def element[A](implicit ea: special.wrappers.WrappersModule.Elem[A]): special.wrappers.WrappersModule.Elem[A]

    Permalink
    Definition Classes
    TypeDescs
  97. def emitDepGraph(exceptionOrGraph: Either[Throwable, special.wrappers.WrappersModule.AstGraph], directory: File, fileName: String)(implicit config: GraphVizConfig): Option[special.wrappers.WrappersModule.GraphFile]

    Permalink
    Definition Classes
    GraphVizExport
  98. def emitDepGraph(graph: special.wrappers.WrappersModule.AstGraph, directory: File, fileName: String)(implicit config: GraphVizConfig): Option[special.wrappers.WrappersModule.GraphFile]

    Permalink
    Definition Classes
    GraphVizExport
  99. def emitDepGraph(ss: Seq[special.wrappers.WrappersModule.Sym], directory: File, fileName: String)(implicit config: GraphVizConfig): Option[special.wrappers.WrappersModule.GraphFile]

    Permalink
    Definition Classes
    GraphVizExport
  100. def emitDepGraph(start: special.wrappers.WrappersModule.Sym, directory: File, fileName: String)(implicit config: GraphVizConfig): Option[special.wrappers.WrappersModule.GraphFile]

    Permalink
    Definition Classes
    GraphVizExport
  101. def emitDepGraph(d: special.wrappers.WrappersModule.Def[_], directory: File, fileName: String)(implicit config: GraphVizConfig): Option[special.wrappers.WrappersModule.GraphFile]

    Permalink
    Definition Classes
    GraphVizExport
  102. def emitDot(dotText: String, directory: File, fileName: String)(implicit config: GraphVizConfig): Option[special.wrappers.WrappersModule.GraphFile]

    Permalink
    Definition Classes
    GraphVizExport
  103. def emitExceptionGraph(e: Throwable, directory: File, fileName: String)(implicit config: GraphVizConfig): Option[special.wrappers.WrappersModule.GraphFile]

    Permalink
    Definition Classes
    GraphVizExport
  104. final def emptyDBufferOfSym: Buffer[special.wrappers.WrappersModule.Sym]

    Permalink

    Create a new empty buffer around pre-allocated empty array.

    Create a new empty buffer around pre-allocated empty array. This method is preferred, rather that creating empty debox.Buffer directly because it allows to avoid allocation of the empty array.

    Definition Classes
    Base
    Annotations
    @inline()
  105. def emptyMatchSubst: special.wrappers.WrappersModule.Subst

    Permalink
    Definition Classes
    Functions
    Annotations
    @inline()
  106. def endPass(pass: special.wrappers.WrappersModule.Pass): Unit

    Permalink

    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
  107. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  108. def equalValues[A](x: Any, y: Any)(implicit eA: special.wrappers.WrappersModule.Elem[A]): Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    Equal
  109. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  110. implicit def extendThunkElement[T](elem: special.wrappers.WrappersModule.Elem[special.wrappers.WrappersModule.Thunk[T]]): special.wrappers.WrappersModule.ThunkElem[T]

    Permalink

    Implicit conversion (downcast) to access ThunkElem.eItem field.

    Implicit conversion (downcast) to access ThunkElem.eItem field.

    Definition Classes
    Thunks
  111. def findGlobalDefinition[T](d: special.wrappers.WrappersModule.Def[T]): special.wrappers.WrappersModule.Ref[T]

    Permalink

    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
  112. def findOrCreateDefinition[T](d: special.wrappers.WrappersModule.Def[T], newSym: ⇒ special.wrappers.WrappersModule.Ref[T]): special.wrappers.WrappersModule.Ref[T]

    Permalink

    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
  113. def forceThunkByMirror[A](thunk: special.wrappers.WrappersModule.Th[A], subst: special.wrappers.WrappersModule.MapTransformer = MapTransformer.empty()): special.wrappers.WrappersModule.Ref[A]

    Permalink

    Inlines the given thunk by cloning all its nodes and applying the given substitution (transformer).

    Inlines the given thunk by cloning all its nodes and applying the given substitution (transformer).

    thunk

    reference to the thunk node

    subst

    transformer to be applied for each mirrored (cloned) node.

    returns

    the reference to the graph node, which represents the resulting value of the thunk

    Definition Classes
    Thunks
  114. def forceThunkDefByMirror[A](th: special.wrappers.WrappersModule.ThunkDef[A], subst: special.wrappers.WrappersModule.MapTransformer = MapTransformer.empty()): special.wrappers.WrappersModule.Ref[A]

    Permalink

    Inlines the given thunk by cloning all its nodes and applying the given substitution (transformer).

    Inlines the given thunk by cloning all its nodes and applying the given substitution (transformer).

    th

    the thunk node

    subst

    transformer to be applied for each mirrored (cloned) node.

    returns

    the reference to the graph node, which represents the resulting value of the thunk

    Definition Classes
    Thunks
  115. def formatConst(x: Any): String

    Permalink
    Attributes
    protected
    Definition Classes
    GraphVizExport
  116. def formatDef(d: special.wrappers.WrappersModule.Def[_])(implicit config: GraphVizConfig): String

    Permalink
    Attributes
    protected
    Definition Classes
    ThunksGraphVizExport
  117. def formatMetadata(s: special.wrappers.WrappersModule.Sym): List[String]

    Permalink
    Attributes
    protected
    Definition Classes
    GraphVizExport
  118. final def freshId: Int

    Permalink

    Get next fresh node id

    Get next fresh node id

    Definition Classes
    Base
    Annotations
    @inline()
  119. final def freshSym[T](d: special.wrappers.WrappersModule.Def[T]): special.wrappers.WrappersModule.Ref[T]

    Permalink

    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()
  120. implicit final def fun[A, B](f: (special.wrappers.WrappersModule.Ref[A]) ⇒ special.wrappers.WrappersModule.Ref[B])(implicit eA: special.wrappers.WrappersModule.LElem[A]): special.wrappers.WrappersModule.Ref[(A) ⇒ B]

    Permalink

    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
  121. implicit final def fun2[A, B, C](f: (special.wrappers.WrappersModule.Ref[A], special.wrappers.WrappersModule.Ref[B]) ⇒ special.wrappers.WrappersModule.Ref[C])(implicit eA: special.wrappers.WrappersModule.LElem[A], eB: special.wrappers.WrappersModule.LElem[B]): special.wrappers.WrappersModule.Ref[((A, B)) ⇒ C]

    Permalink
    Definition Classes
    Functions
  122. implicit final def funcElement[A, B](implicit ea: special.wrappers.WrappersModule.Elem[A], eb: special.wrappers.WrappersModule.Elem[B]): special.wrappers.WrappersModule.Elem[(A) ⇒ B]

    Permalink
    Definition Classes
    TypeDescs
  123. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate()
  124. def getEntityObject(name: String): Nullable[special.wrappers.WrappersModule.EntityObject]

    Permalink
    Definition Classes
    Base
    Annotations
    @inline()
  125. def getOwnerKind(constructor: Constructor[_]): special.wrappers.WrappersModule.OwnerKind

    Permalink

    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
  126. final def getSourceValues(dataEnv: special.wrappers.WrappersModule.DataEnv, forWrapper: Boolean, stagedValues: AnyRef*): Seq[AnyRef]

    Permalink
    Definition Classes
    TypeDescs
  127. final def getSym(id: Int): special.wrappers.WrappersModule.Sym

    Permalink

    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()
  128. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate()
  129. def identityFun[A](implicit e: special.wrappers.WrappersModule.Elem[A]): special.wrappers.WrappersModule.Ref[(A) ⇒ A]

    Permalink
    Definition Classes
    Functions
  130. def ifThenElseLazy[T](cond: special.wrappers.WrappersModule.Ref[Boolean], thenp: ⇒ special.wrappers.WrappersModule.Ref[T], elsep: ⇒ special.wrappers.WrappersModule.Ref[T]): special.wrappers.WrappersModule.Ref[T]

    Permalink

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

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

    Definition Classes
    IfThenElse
  131. def integral[T](implicit arg0: ExactIntegral[T]): ExactIntegral[T]

    Permalink

    Return an ExactIntegral for a given type T.

    Return an ExactIntegral for a given type T.

    Definition Classes
    NumericOps
  132. def invokeUnlifted(e: special.wrappers.WrappersModule.Elem[_], mc: special.wrappers.WrappersModule.MethodCall, dataEnv: special.wrappers.WrappersModule.DataEnv): AnyRef

    Permalink

    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
    TypeDescs
  133. var isInlineThunksOnForce: Boolean

    Permalink

    Specifies thunk staging strategy with respect to handling thunk_force operation.

    Specifies thunk staging strategy with respect to handling thunk_force operation.

    Definition Classes
    Thunks
    See also

    thunk_force

  134. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  135. def isInvokeEnabled(d: special.wrappers.WrappersModule.Def[_], m: Method): Boolean

    Permalink

    Method invocation enabler.

    Method invocation enabler.

    returns

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

    Definition Classes
    MethodCalls
  136. final def isOne[T](x: T, n: ExactNumeric[T]): Boolean

    Permalink

    Compares the given value with 1 of the given ExactNumeric instance.

    Compares the given value with 1 of the given ExactNumeric instance.

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

    Permalink

    Compares the given value with zero of the given ExactNumeric instance.

    Compares the given value with zero of the given ExactNumeric instance.

    Definition Classes
    NumericOps
    Annotations
    @inline()
  138. var keepOriginalFunc: Boolean

    Permalink

    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
  139. var lambdaStack: List[special.wrappers.WrappersModule.Lambda[_, _]]

    Permalink
    Definition Classes
    Functions
  140. implicit def liftToRep[A](x: A)(implicit arg0: special.wrappers.WrappersModule.Elem[A]): special.wrappers.WrappersModule.Ref[A]

    Permalink
    Definition Classes
    Base
    Annotations
    @inline()
  141. implicit def liftableThunk[ST, T](implicit lT: Liftable[ST, T]): Liftable[special.wrappers.WrappersModule.SThunk[ST], special.wrappers.WrappersModule.Thunk[T]]

    Permalink
    Definition Classes
    Thunks
  142. def logWarn(msg: ⇒ String): Unit

    Permalink

    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
  143. def matchAny(a1: Any, a2: Any, allowInexactMatch: Boolean, subst: special.wrappers.WrappersModule.Subst): Nullable[special.wrappers.WrappersModule.Subst]

    Permalink
    Attributes
    protected
    Definition Classes
    Functions
  144. def matchDefs(d1: special.wrappers.WrappersModule.Def[_], d2: special.wrappers.WrappersModule.Def[_], allowInexactMatch: Boolean, subst: special.wrappers.WrappersModule.Subst): Nullable[special.wrappers.WrappersModule.Subst]

    Permalink
    Attributes
    protected
    Definition Classes
    ThunksFunctions
  145. def matchExps(s1: special.wrappers.WrappersModule.Sym, s2: special.wrappers.WrappersModule.Sym, allowInexactMatch: Boolean, subst: special.wrappers.WrappersModule.Subst): Nullable[special.wrappers.WrappersModule.Subst]

    Permalink
    Attributes
    protected
    Definition Classes
    Functions
  146. def matchIterators(i1: Iterator[_], i2: Iterator[_], allowInexactMatch: Boolean, subst: special.wrappers.WrappersModule.Subst): Nullable[special.wrappers.WrappersModule.Subst]

    Permalink
    Attributes
    protected
    Definition Classes
    Functions
  147. def mirrorApply[A, B](lam: special.wrappers.WrappersModule.Lambda[A, B], s: special.wrappers.WrappersModule.Ref[A]): special.wrappers.WrappersModule.Ref[B]

    Permalink
    Definition Classes
    Functions
  148. def mkApply[A, B](f: special.wrappers.WrappersModule.Ref[(A) ⇒ B], x: special.wrappers.WrappersModule.Ref[A]): special.wrappers.WrappersModule.Ref[B]

    Permalink
    Definition Classes
    Functions
  149. def mkLambda[A, B, C](f: (special.wrappers.WrappersModule.Ref[A], special.wrappers.WrappersModule.Ref[B]) ⇒ special.wrappers.WrappersModule.Ref[C])(implicit eA: special.wrappers.WrappersModule.LElem[A], eB: special.wrappers.WrappersModule.LElem[B]): special.wrappers.WrappersModule.Ref[((A, B)) ⇒ C]

    Permalink
    Definition Classes
    Functions
  150. def mkLambda[A, B, C](f: (special.wrappers.WrappersModule.Ref[A]) ⇒ (special.wrappers.WrappersModule.Ref[B]) ⇒ special.wrappers.WrappersModule.Ref[C])(implicit eA: special.wrappers.WrappersModule.LElem[A], eB: special.wrappers.WrappersModule.Elem[B]): special.wrappers.WrappersModule.Ref[(A) ⇒ (B) ⇒ C]

    Permalink
    Definition Classes
    Functions
  151. def mkLambda[A, B](f: (special.wrappers.WrappersModule.Ref[A]) ⇒ special.wrappers.WrappersModule.Ref[B], mayInline: Boolean, alphaEquality: Boolean, keepOriginalFunc: Boolean)(implicit eA: special.wrappers.WrappersModule.LElem[A]): special.wrappers.WrappersModule.Ref[(A) ⇒ B]

    Permalink
    Definition Classes
    Functions
  152. def mkMethodCall(receiver: special.wrappers.WrappersModule.Sym, method: Method, args: Seq[AnyRef], neverInvoke: Boolean, isAdapterCall: Boolean, resultElem: special.wrappers.WrappersModule.Elem[_]): special.wrappers.WrappersModule.Sym

    Permalink

    Creates new MethodCall node and returns its node ref.

    Creates new MethodCall node and returns its node ref.

    Definition Classes
    MethodCalls
  153. val nInitialDefs: Int

    Permalink
    Definition Classes
    Base
  154. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  155. def newObjEx[A](args: Any*)(implicit eA: special.wrappers.WrappersModule.Elem[A]): special.wrappers.WrappersModule.Ref[A]

    Permalink

    Creates new NewObject node and returns its node ref.

    Creates new NewObject node and returns its node ref.

    Definition Classes
    MethodCalls
  156. def nodeColor(td: special.wrappers.WrappersModule.TypeDesc, d: special.wrappers.WrappersModule.Def[_])(implicit config: GraphVizConfig): String

    Permalink
    Attributes
    protected
    Definition Classes
    ThunksGraphVizExport
  157. def nodeColor(td: special.wrappers.WrappersModule.TypeDesc): String

    Permalink
    Attributes
    protected
    Definition Classes
    GraphVizExport
  158. final def nodeLabel(parts: String*)(implicit config: GraphVizConfig): String

    Permalink
    Attributes
    protected
    Definition Classes
    GraphVizExport
  159. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate()
  160. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate()
  161. def numeric[T](implicit arg0: ExactNumeric[T]): ExactNumeric[T]

    Permalink

    Return an ExactNumeric for a given type T.

    Return an ExactNumeric for a given type T.

    Definition Classes
    NumericOps
  162. def okRegisterModules: Boolean

    Permalink

    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
  163. def onReset(): Unit

    Permalink

    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
    Base
  164. def opCost(costedValue: special.wrappers.WrappersModule.Sym, args: Seq[special.wrappers.WrappersModule.Ref[Int]], opCost: special.wrappers.WrappersModule.Ref[Int]): special.wrappers.WrappersModule.Ref[Int]

    Permalink
    Definition Classes
    UniversalOps
  165. implicit final def pairElement[A, B](implicit ea: special.wrappers.WrappersModule.Elem[A], eb: special.wrappers.WrappersModule.Elem[B]): special.wrappers.WrappersModule.Elem[(A, B)]

    Permalink
    Definition Classes
    TypeDescs
  166. def partsIterator(td: special.wrappers.WrappersModule.TypeDesc): TraversableOnce[special.wrappers.WrappersModule.TypeDesc] { def seq: scala.collection.TraversableOnce[WOptionsDefs.this.TypeDesc]{def seq: scala.collection.TraversableOnce[WOptionsDefs.this.TypeDesc]{def seq: scala.collection.TraversableOnce[WOptionsDefs.this.TypeDesc]}} }

    Permalink
    Attributes
    protected
    Definition Classes
    GraphVizExport
  167. def patternMatch(s1: special.wrappers.WrappersModule.Sym, s2: special.wrappers.WrappersModule.Sym): Nullable[special.wrappers.WrappersModule.Subst]

    Permalink
    Definition Classes
    Functions
  168. def placeholder[T](implicit eT: special.wrappers.WrappersModule.LElem[T]): special.wrappers.WrappersModule.Ref[T]

    Permalink
    Definition Classes
    Base
    Annotations
    @inline()
  169. def propagateBinOp[T, R](op: special.wrappers.WrappersModule.BinOp[T, R], x: special.wrappers.WrappersModule.Ref[T], y: special.wrappers.WrappersModule.Ref[T]): special.wrappers.WrappersModule.Ref[R]

    Permalink

    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
  170. def propagateUnOp[T, R](op: special.wrappers.WrappersModule.UnOp[T, R], x: special.wrappers.WrappersModule.Ref[T]): special.wrappers.WrappersModule.Ref[R]

    Permalink

    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
  171. def registerEntityObject(name: String, obj: special.wrappers.WrappersModule.EntityObject): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Base
  172. def registerModule(moduleInfo: ModuleInfo): Unit

    Permalink

    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
  173. implicit def reifyObject[A](obj: special.wrappers.WrappersModule.Def[A]): special.wrappers.WrappersModule.Ref[A]

    Permalink

    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
  174. implicit def repOrderingToOrderingOps[T](x: special.wrappers.WrappersModule.Ref[T])(implicit n: ExactOrdering[T]): special.wrappers.WrappersModule.OrderingOpsCls[T]

    Permalink
    Definition Classes
    OrderingOps
  175. implicit def repToThunk[A](block: special.wrappers.WrappersModule.Ref[A]): special.wrappers.WrappersModule.Ref[special.wrappers.WrappersModule.Thunk[A]]

    Permalink
    Definition Classes
    Thunks
  176. def resetContext(): Unit

    Permalink
    Definition Classes
    Base
  177. final def rewriteBinOp[A, R](op: special.wrappers.WrappersModule.BinOp[A, R], x: special.wrappers.WrappersModule.Ref[A], y: special.wrappers.WrappersModule.Ref[A]): special.wrappers.WrappersModule.Ref[_]

    Permalink

    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
  178. final def rewriteBoolConsts(lhs: special.wrappers.WrappersModule.Sym, rhs: special.wrappers.WrappersModule.Sym, ifTrue: (special.wrappers.WrappersModule.Sym) ⇒ special.wrappers.WrappersModule.Sym, ifFalse: (special.wrappers.WrappersModule.Sym) ⇒ special.wrappers.WrappersModule.Sym, ifEqual: (special.wrappers.WrappersModule.Sym) ⇒ special.wrappers.WrappersModule.Sym, ifNegated: (special.wrappers.WrappersModule.Sym) ⇒ special.wrappers.WrappersModule.Sym): special.wrappers.WrappersModule.Sym

    Permalink

    Helper method which defines rewriting rules with boolean constants.

    Helper method which defines rewriting rules with boolean constants.

    Definition Classes
    LogicalOps
    Annotations
    @inline()
  179. def rewriteDef[T](d: special.wrappers.WrappersModule.Def[T]): special.wrappers.WrappersModule.Ref[_]

    Permalink

    Rewrites given node to another equivalent node and returns its reference.

    Rewrites given node to another equivalent node and returns its reference.

    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
    DefRewriting
  180. def rewriteNonInvokableMethodCall(mc: special.wrappers.WrappersModule.MethodCall): special.wrappers.WrappersModule.Ref[_]

    Permalink

    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
    MethodCalls
  181. final def rewriteUnOp[A, R](op: special.wrappers.WrappersModule.UnOp[A, R], x: special.wrappers.WrappersModule.Ref[A]): special.wrappers.WrappersModule.Ref[_]

    Permalink

    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
  182. def shouldEmitCluster(g: special.wrappers.WrappersModule.AstGraph): Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    GraphVizExport
  183. def showGraphs(graph: special.wrappers.WrappersModule.AstGraph)(implicit config: GraphVizConfig): Unit

    Permalink
    Definition Classes
    GraphVizExport
  184. def showGraphs(roots: special.wrappers.WrappersModule.Sym*)(implicit config: GraphVizConfig): Unit

    Permalink
    Definition Classes
    GraphVizExport
  185. def sizeOf[T](value: special.wrappers.WrappersModule.Ref[T]): special.wrappers.WrappersModule.Ref[Long]

    Permalink
    Definition Classes
    UniversalOps
  186. def stagingExceptionMessage(message: String, syms: Seq[special.wrappers.WrappersModule.Ref[_]]): String

    Permalink

    Prettyprint exception message

    Prettyprint exception message

    Attributes
    protected
    Definition Classes
    Base
  187. implicit final def sumElement[A, B](implicit ea: special.wrappers.WrappersModule.Elem[A], eb: special.wrappers.WrappersModule.Elem[B]): special.wrappers.WrappersModule.Elem[special.wrappers.WrappersModule.|[A, B]]

    Permalink
    Definition Classes
    TypeDescs
  188. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  189. def throwInvocationException(whatFailed: String, cause: Throwable, receiver: special.wrappers.WrappersModule.Sym, m: Method, args: Seq[Any]): Nothing

    Permalink
    Definition Classes
    MethodCalls
  190. implicit val thunkCont: special.wrappers.WrappersModule.Cont[special.wrappers.WrappersModule.Thunk]

    Permalink

    Thunk is an instance of container type class Cont.

    Thunk is an instance of container type class Cont.

    Definition Classes
    Thunks
  191. implicit def thunkElement[T](implicit eItem: special.wrappers.WrappersModule.Elem[T]): special.wrappers.WrappersModule.Elem[special.wrappers.WrappersModule.Thunk[T]]

    Permalink
    Definition Classes
    Thunks
  192. val thunkStack: special.wrappers.WrappersModule.ThunkStack

    Permalink
    Attributes
    protected
    Definition Classes
    Thunks
  193. def thunk_create[A](block: ⇒ special.wrappers.WrappersModule.Ref[A]): special.wrappers.WrappersModule.Ref[special.wrappers.WrappersModule.Thunk[A]]

    Permalink

    Constructs a new thunk node by executing the given block and collecting all the graph node created along the way.

    Constructs a new thunk node by executing the given block and collecting all the graph node created along the way. This methods: 1) starts a new nested ThunkScope, 2) executes the block to obtain resulting graph node 3) schedule thunk body for execution order 4) adds a new ThunkDef node and returns its reference.

    returns

    a reference to the newly created ThunkDef node

    Definition Classes
    Thunks
  194. def thunk_force[A](t: special.wrappers.WrappersModule.Th[A]): special.wrappers.WrappersModule.Ref[A]

    Permalink

    Logical force of the thunk.

    Logical force of the thunk. Depending on isInlineThunksOnForce it either inlines the thunk body or creates a new ThunkForce node.

    returns

    a reference to the graph node, which represent the result of the thunk's evaluation.

    Definition Classes
    Thunks
  195. def thunk_map[A, B](t: special.wrappers.WrappersModule.Th[A], f: special.wrappers.WrappersModule.Ref[(A) ⇒ B]): special.wrappers.WrappersModule.Th[B]

    Permalink
    Definition Classes
    Thunks
  196. def thunk_map1[A, B](t: special.wrappers.WrappersModule.Th[A], f: (special.wrappers.WrappersModule.Ref[A]) ⇒ special.wrappers.WrappersModule.Ref[B]): special.wrappers.WrappersModule.Th[B]

    Permalink
    Definition Classes
    Thunks
  197. def toExp[T](d: special.wrappers.WrappersModule.Def[T], newSym: ⇒ special.wrappers.WrappersModule.Ref[T]): special.wrappers.WrappersModule.Ref[T]

    Permalink

    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
  198. implicit final def toLazyElem[A](implicit eA: special.wrappers.WrappersModule.Elem[A]): special.wrappers.WrappersModule.LElem[A]

    Permalink
    Definition Classes
    TypeDescs
  199. def toRep[A](x: A)(implicit eA: special.wrappers.WrappersModule.Elem[A]): special.wrappers.WrappersModule.Ref[A]

    Permalink

    Lifting of data values to IR nodes.

    Lifting of data values to IR nodes.

    Definition Classes
    Base
  200. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  201. def transformProductParam(x: Any, t: special.wrappers.WrappersModule.Transformer): Any

    Permalink

    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
  202. def tryConvert[From, To](eFrom: special.wrappers.WrappersModule.Elem[From], eTo: special.wrappers.WrappersModule.Elem[To], x: special.wrappers.WrappersModule.Ref[special.wrappers.WrappersModule.Def[_]], conv: special.wrappers.WrappersModule.Ref[(From) ⇒ To]): special.wrappers.WrappersModule.Ref[To]

    Permalink
    Definition Classes
    UniversalOps
  203. val tuplesCache: AVHashMap[special.wrappers.WrappersModule.Ref[_], (special.wrappers.WrappersModule.Ref[_], special.wrappers.WrappersModule.Ref[_])]

    Permalink
    Definition Classes
    Tuples
  204. def unfoldLambda[A, B](f: special.wrappers.WrappersModule.Ref[(A) ⇒ B], x: special.wrappers.WrappersModule.Ref[A]): special.wrappers.WrappersModule.Ref[B]

    Permalink
    Definition Classes
    Functions
  205. def unfoldLambda[A, B](lam: special.wrappers.WrappersModule.Lambda[A, B], x: special.wrappers.WrappersModule.Ref[A]): special.wrappers.WrappersModule.Ref[B]

    Permalink
    Definition Classes
    Functions
  206. var unfoldWithOriginalFunc: Boolean

    Permalink

    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
  207. def unrefDelegate[T <: AnyRef](x: special.wrappers.WrappersModule.Ref[T])(implicit ct: ClassTag[T]): T

    Permalink

    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
  208. def unzipPair[A, B](p: special.wrappers.WrappersModule.Ref[(A, B)]): (special.wrappers.WrappersModule.Ref[A], special.wrappers.WrappersModule.Ref[B])

    Permalink
    Definition Classes
    Tuples
  209. def upcast[To](value: special.wrappers.WrappersModule.Ref[_])(implicit arg0: special.wrappers.WrappersModule.Elem[To]): special.wrappers.WrappersModule.Ref[To]

    Permalink
    Definition Classes
    UniversalOps
  210. def upcastFun[A, B >: A](implicit arg0: special.wrappers.WrappersModule.Elem[A]): special.wrappers.WrappersModule.Ref[(A) ⇒ B]

    Permalink
    Definition Classes
    Functions
  211. final def updateSymbolTable[T](s: special.wrappers.WrappersModule.Ref[T], d: special.wrappers.WrappersModule.Def[T]): special.wrappers.WrappersModule.Ref[T]

    Permalink

    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
  212. var useAlphaEquality: Boolean

    Permalink

    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
  213. final def valueFromRep[A](x: special.wrappers.WrappersModule.Ref[A]): A

    Permalink

    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()
  214. def variable[T](implicit eT: special.wrappers.WrappersModule.LElem[T]): special.wrappers.WrappersModule.Ref[T]

    Permalink
    Definition Classes
    Base
    Annotations
    @inline()
  215. final def wait(arg0: Long, arg1: Int): Unit

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  217. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  218. implicit def zipPair[A, B](p: (special.wrappers.WrappersModule.Ref[A], special.wrappers.WrappersModule.Ref[B])): special.wrappers.WrappersModule.Ref[(A, B)]

    Permalink
    Definition Classes
    Tuples

Deprecated Value Members

  1. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from WOptions

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