Class

quasar.mimir.StdLibEvaluatorStack

Evaluator

Related Doc: package StdLibEvaluatorStack

Permalink

abstract class Evaluator[N[+_]] extends EvaluatorLike[N] with StdLibOpFinder with StdLibStaticInliner

Linear Supertypes
StdLibEvaluatorStack.StdLibStaticInliner, StdLibEvaluatorStack.StdLibOpFinder, StdLibEvaluatorStack.EvaluatorLike[N], StdLibEvaluatorStack.PredicatePullups, StdLibEvaluatorStack.JoinOptimizer, StdLibEvaluatorStack.StaticInliner, StdLibEvaluatorStack.ReductionFinder, StdLibEvaluatorStack.TransSpecable, StdLibEvaluatorStack.EvaluatorMethods, StdLibEvaluatorStack.OpFinder, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Evaluator
  2. StdLibStaticInliner
  3. StdLibOpFinder
  4. EvaluatorLike
  5. PredicatePullups
  6. JoinOptimizer
  7. StaticInliner
  8. ReductionFinder
  9. TransSpecable
  10. EvaluatorMethods
  11. OpFinder
  12. AnyRef
  13. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Evaluator(N0: Monad[N])(implicit mn: ~>[M, N], nm: ~>[N, M])

    Permalink

Type Members

  1. case class GroupEdit(group: BucketSpec, graphEdit: (PredicatePullupsModule.DepGraph, PredicatePullupsModule.DepGraph), specEdit: (BucketSpec, BucketSpec)) extends Product with Serializable

    Permalink
    Definition Classes
    PredicatePullups

  2. case class MegaReduceState(ancestorByReduce: Map[Reduce, ReductionFinderModule.DepGraph], parentsByAncestor: Map[ReductionFinderModule.DepGraph, List[ReductionFinderModule.DepGraph]], reducesByParent: Map[ReductionFinderModule.DepGraph, List[Reduce]], specByParent: Map[ReductionFinderModule.DepGraph, TransSpec1]) extends Product with Serializable

    Permalink
    Definition Classes
    ReductionFinder

  3. case class ReduceInfo(reduce: Reduce, spec: TransSpec1, ancestor: ReductionFinderModule.DepGraph) extends Product with Serializable

    Permalink
    Definition Classes
    ReductionFinder

  4. trait TransSpecableFold[T] extends TransSpecableOrderFold[T]

    Permalink
    Definition Classes
    TransSpecable

  5. trait TransSpecableOrderFold[T] extends AnyRef

    Permalink
    Definition Classes
    TransSpecable

Abstract Value Members

  1. abstract def freshIdScanner: StdLibEvaluatorStack.Scanner

    Permalink
    Definition Classes
    EvaluatorLike

  2. abstract def report: QueryLogger[N, yggdrasil.bytecode.Instructions.instructions.Line]

    Permalink
    Definition Classes
    EvaluatorLike

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. object ConstInt

    Permalink
    Definition Classes
    TransSpecable

  5. val Exists: library.Exists.type

    Permalink
    Definition Classes
    Evaluator → EvaluatorLike

  6. val Forall: library.Forall.type

    Permalink
    Definition Classes
    Evaluator → EvaluatorLike

  7. def MorphContext(ctx: EvaluationContext, node: StdLibEvaluatorStack.DepGraph): StdLibEvaluatorStack.MorphContext

    Permalink
    Definition Classes
    EvaluatorLike → EvaluatorMethods

  8. object Op2F2ForBinOp

    Permalink
    Definition Classes
    TransSpecable

  9. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  10. def buildReduceInfo(reduce: Reduce, ctx: EvaluationContext): ReduceInfo

    Permalink
    Definition Classes
    ReductionFinder

  11. def buildWrappedCrossSpec(spec: (TransSpec2, TransSpec2) ⇒ TransSpec2): TransSpec2

    Permalink
    Definition Classes
    EvaluatorMethods

  12. def buildWrappedJoinSpec(idMatch: IdentityMatch, valueKeys: Set[Int] = Set.empty)(spec: (TransSpec2, TransSpec2) ⇒ TransSpec2): TransSpec2

    Permalink
    Definition Classes
    EvaluatorMethods

  13. def clone(): AnyRef

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

  14. def coerceToDouble(ctx: StdLibEvaluatorStack.MorphContext): CF1

    Permalink
    Definition Classes
    Evaluator → EvaluatorLike

  15. def combineTransSpecs(specs: List[TransSpec1]): TransSpec1

    Permalink
    Definition Classes
    EvaluatorMethods

  16. def composeOptimizations(optimize: Boolean, funcs: List[(StdLibEvaluatorStack.DepGraph) ⇒ StdLibEvaluatorStack.DepGraph]): (StdLibEvaluatorStack.DepGraph) ⇒ StdLibEvaluatorStack.DepGraph

    Permalink
    Definition Classes
    EvaluatorLike

  17. def concatString(ctx: StdLibEvaluatorStack.MorphContext): StdLibEvaluatorStack.F2

    Permalink
    Definition Classes
    Evaluator → EvaluatorLike

  18. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  19. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  20. def eval(graph: StdLibEvaluatorStack.DepGraph, ctx: EvaluationContext, optimize: Boolean): N[StdLibEvaluatorStack.Table]

    Permalink

    The entry point to the evaluator.

    The entry point to the evaluator. The main implementation of the evaluator is comprised by the inner functions, fullEval (the main evaluator function) and prepareEval (which has the primary eval loop).

    Definition Classes
    EvaluatorLike

  21. def finalize(): Unit

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

  22. def findAncestor(to: StdLibEvaluatorStack.DepGraph, ctx: EvaluationContext): Option[StdLibEvaluatorStack.DepGraph]

    Permalink
    Definition Classes
    TransSpecable

  23. def findOrderAncestor(to: StdLibEvaluatorStack.DepGraph, ctx: EvaluationContext): Option[StdLibEvaluatorStack.DepGraph]

    Permalink
    Definition Classes
    TransSpecable

  24. def findReductions(node: StdLibEvaluatorStack.DepGraph, ctx: EvaluationContext): MegaReduceState

    Permalink
    Definition Classes
    ReductionFinder

  25. def findTransSpecAndAncestor(to: StdLibEvaluatorStack.DepGraph, ctx: EvaluationContext): Option[(TransSpec1, StdLibEvaluatorStack.DepGraph)]

    Permalink
    Definition Classes
    TransSpecable

  26. def foldDownTransSpecable[T](to: StdLibEvaluatorStack.DepGraph, from: Option[StdLibEvaluatorStack.DepGraph])(alg: TransSpecableFold[T]): T

    Permalink
    Definition Classes
    TransSpecable

  27. def foldDownTransSpecableOrder[T](to: StdLibEvaluatorStack.DepGraph, from: Option[StdLibEvaluatorStack.DepGraph])(alg: TransSpecableOrderFold[T]): T

    Permalink
    Definition Classes
    TransSpecable

  28. def fullRewriteDAG(optimize: Boolean, ctx: EvaluationContext): (StdLibEvaluatorStack.DepGraph) ⇒ StdLibEvaluatorStack.DepGraph

    Permalink
    Definition Classes
    EvaluatorLike

  29. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  30. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  31. def inlineNodeValue(graph: StdLibEvaluatorStack.DepGraph, from: StdLibEvaluatorStack.DepGraph, result: RValue): StdLibEvaluatorStack.DepGraph

    Permalink

    Takes a graph, a node and a value.

    Takes a graph, a node and a value. Replaces the node (and possibly its parents) with the value into the graph.

    Definition Classes
    EvaluatorLike

  32. def inlineStatics(graph: StdLibEvaluatorStack.DepGraph, ctx: EvaluationContext): StdLibEvaluatorStack.DepGraph

    Permalink
    Definition Classes
    StdLibStaticInliner → StaticInliner

  33. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  34. def isTransSpecable(to: StdLibEvaluatorStack.DepGraph, from: StdLibEvaluatorStack.DepGraph): Boolean

    Permalink
    Definition Classes
    TransSpecable

  35. def megaReduce(node: StdLibEvaluatorStack.DepGraph, st: MegaReduceState): StdLibEvaluatorStack.DepGraph

    Permalink
    Definition Classes
    ReductionFinder

  36. def mkTransSpec(to: StdLibEvaluatorStack.DepGraph, from: StdLibEvaluatorStack.DepGraph, ctx: EvaluationContext): Option[TransSpec1]

    Permalink
    Definition Classes
    TransSpecable

  37. def mkTransSpecOrderWithState[N[+_], S](to: StdLibEvaluatorStack.DepGraph, from: Option[StdLibEvaluatorStack.DepGraph], ctx: EvaluationContext, get: (S) ⇒ (TransSpec1, StdLibEvaluatorStack.DepGraph), set: (S, (TransSpec1, StdLibEvaluatorStack.DepGraph)) ⇒ N[S], init: ((TransSpec1, StdLibEvaluatorStack.DepGraph)) ⇒ N[S])(implicit arg0: Monad[N]): N[S]

    Permalink
    Definition Classes
    TransSpecable

  38. def mkTransSpecWithState[N[_], S](to: StdLibEvaluatorStack.DepGraph, from: Option[StdLibEvaluatorStack.DepGraph], ctx: EvaluationContext, get: (S) ⇒ (TransSpec1, StdLibEvaluatorStack.DepGraph), set: (S, (TransSpec1, StdLibEvaluatorStack.DepGraph)) ⇒ N[S], init: ((TransSpec1, StdLibEvaluatorStack.DepGraph)) ⇒ N[S])(implicit arg0: Monad[N]): N[S]

    Permalink
    Definition Classes
    TransSpecable

  39. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  40. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  41. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  42. def op1ForUnOp(op: yggdrasil.bytecode.Instructions.instructions.UnaryOperation): library.Op1

    Permalink
    Definition Classes
    StdLibOpFinder → OpFinder

  43. def op2ForBinOp(op: yggdrasil.bytecode.Instructions.instructions.BinaryOperation): Option[library.Op2]

    Permalink
    Definition Classes
    StdLibOpFinder → OpFinder

  44. def optimizeJoins(graph: StdLibEvaluatorStack.DepGraph, ctx: EvaluationContext, idGen: IdGen = IdGen): StdLibEvaluatorStack.DepGraph

    Permalink
    Definition Classes
    JoinOptimizer

  45. def predicatePullups(graph: StdLibEvaluatorStack.DepGraph, ctx: EvaluationContext): StdLibEvaluatorStack.DepGraph

    Permalink
    Definition Classes
    PredicatePullups

  46. def rValueToCValue(rvalue: RValue): Option[CValue]

    Permalink
    Definition Classes
    EvaluatorMethods

  47. def stagedRewriteDAG(optimize: Boolean, ctx: EvaluationContext): (StdLibEvaluatorStack.DepGraph) ⇒ StdLibEvaluatorStack.DepGraph

    Permalink
    Definition Classes
    EvaluatorLike

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

    Permalink
    Definition Classes
    AnyRef

  49. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  50. def transFold[N[_], S](to: StdLibEvaluatorStack.DepGraph, from: Option[StdLibEvaluatorStack.DepGraph], ctx: EvaluationContext, get: (S) ⇒ (TransSpec1, StdLibEvaluatorStack.DepGraph), set: (S, (TransSpec1, StdLibEvaluatorStack.DepGraph)) ⇒ N[S], init: ((TransSpec1, StdLibEvaluatorStack.DepGraph)) ⇒ N[S])(implicit arg0: Monad[N]): TransSpecableFold[N[S]]

    Permalink
    Definition Classes
    TransSpecable

  51. def transFromBinOp[A <: SourceType](op: yggdrasil.bytecode.Instructions.instructions.BinaryOperation, ctx: StdLibEvaluatorStack.MorphContext)(left: TransSpec[A], right: TransSpec[A]): TransSpec[A]

    Permalink
    Definition Classes
    EvaluatorMethods

  52. def transRValue[A <: SourceType](rvalue: RValue, target: TransSpec[A]): TransSpec[A]

    Permalink
    Definition Classes
    EvaluatorMethods

  53. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  55. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from StdLibEvaluatorStack.StdLibStaticInliner

Inherited from StdLibEvaluatorStack.StdLibOpFinder

Inherited from StdLibEvaluatorStack.EvaluatorLike[N]

Inherited from StdLibEvaluatorStack.PredicatePullups

Inherited from StdLibEvaluatorStack.JoinOptimizer

Inherited from StdLibEvaluatorStack.StaticInliner

Inherited from StdLibEvaluatorStack.ReductionFinder

Inherited from StdLibEvaluatorStack.TransSpecable

Inherited from StdLibEvaluatorStack.EvaluatorMethods

Inherited from StdLibEvaluatorStack.OpFinder

Inherited from AnyRef

Inherited from Any

Ungrouped