Class

quasar.mimir.EvaluatorModule

EvaluatorLike

Related Doc: package EvaluatorModule

Permalink

abstract class EvaluatorLike[N[+_]] extends OpFinder with ReductionFinder

Linear Supertypes
EvaluatorModule.ReductionFinder, EvaluatorModule.TransSpecable, EvaluatorModule.EvaluatorMethods, EvaluatorModule.OpFinder, AnyRef, Any
Known Subclasses
Evaluator
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EvaluatorLike
  2. ReductionFinder
  3. TransSpecable
  4. EvaluatorMethods
  5. OpFinder
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

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

    Permalink

Type Members

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

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

    Permalink
    Definition Classes
    ReductionFinder

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

    Permalink
    Definition Classes
    TransSpecable

  4. trait TransSpecableOrderFold[T] extends AnyRef

    Permalink
    Definition Classes
    TransSpecable

Abstract Value Members

  1. abstract def Exists: TableLibModule.Lib.Reduction { type Result = Option[Boolean] }

    Permalink

  2. abstract def Forall: TableLibModule.Lib.Reduction { type Result = Option[Boolean] }

    Permalink

  3. abstract def coerceToDouble: EvaluatorModule.F1

    Permalink

  4. abstract def concatString: EvaluatorModule.F2

    Permalink

  5. abstract def freshIdScanner: EvaluatorModule.Scanner

    Permalink

  6. abstract def op1ForUnOp(op: yggdrasil.bytecode.Instructions.instructions.UnaryOperation): TableLibModule.Lib.Op1

    Permalink
    Definition Classes
    OpFinder

  7. abstract def op2ForBinOp(op: yggdrasil.bytecode.Instructions.instructions.BinaryOperation): Option[TableLibModule.Lib.Op2]

    Permalink
    Definition Classes
    OpFinder

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

    Permalink

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. object Op2F2ForBinOp

    Permalink
    Definition Classes
    TransSpecable

  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    ReductionFinder

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

    Permalink
    Definition Classes
    EvaluatorMethods

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

    Permalink
    Definition Classes
    EvaluatorMethods

  10. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    EvaluatorMethods

  12. def composeOptimizations(optimize: Boolean, funcs: List[(EvaluatorModule.DepGraph) ⇒ EvaluatorModule.DepGraph]): (EvaluatorModule.DepGraph) ⇒ EvaluatorModule.DepGraph

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  14. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  15. def eval(graph: EvaluatorModule.DepGraph, ctx: EvaluationContext, optimize: Boolean): N[EvaluatorModule.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).

  16. def finalize(): Unit

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

  17. def findAncestor(to: EvaluatorModule.DepGraph, ctx: EvaluationContext): Option[EvaluatorModule.DepGraph]

    Permalink
    Definition Classes
    TransSpecable

  18. def findOrderAncestor(to: EvaluatorModule.DepGraph, ctx: EvaluationContext): Option[EvaluatorModule.DepGraph]

    Permalink
    Definition Classes
    TransSpecable

  19. def findReductions(node: EvaluatorModule.DepGraph, ctx: EvaluationContext): MegaReduceState

    Permalink
    Definition Classes
    ReductionFinder

  20. def findTransSpecAndAncestor(to: EvaluatorModule.DepGraph, ctx: EvaluationContext): Option[(TransSpec1, EvaluatorModule.DepGraph)]

    Permalink
    Definition Classes
    TransSpecable

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

    Permalink
    Definition Classes
    TransSpecable

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

    Permalink
    Definition Classes
    TransSpecable

  23. def fullRewriteDAG(optimize: Boolean, ctx: EvaluationContext): (EvaluatorModule.DepGraph) ⇒ EvaluatorModule.DepGraph

    Permalink

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

    Permalink
    Definition Classes
    AnyRef → Any

  25. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  26. def inlineNodeValue(graph: EvaluatorModule.DepGraph, from: EvaluatorModule.DepGraph, result: RValue): EvaluatorModule.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.

  27. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  28. def isTransSpecable(to: EvaluatorModule.DepGraph, from: EvaluatorModule.DepGraph): Boolean

    Permalink
    Definition Classes
    TransSpecable

  29. def megaReduce(node: EvaluatorModule.DepGraph, st: MegaReduceState): EvaluatorModule.DepGraph

    Permalink
    Definition Classes
    ReductionFinder

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

    Permalink
    Definition Classes
    TransSpecable

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

    Permalink
    Definition Classes
    TransSpecable

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

    Permalink
    Definition Classes
    TransSpecable

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

    Permalink
    Definition Classes
    AnyRef

  34. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  35. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  36. def stagedRewriteDAG(optimize: Boolean, ctx: EvaluationContext): (EvaluatorModule.DepGraph) ⇒ EvaluatorModule.DepGraph

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  38. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    TransSpecable

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

    Permalink
    Definition Classes
    EvaluatorMethods

  41. final def wait(): Unit

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

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

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

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

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

Inherited from EvaluatorModule.ReductionFinder

Inherited from EvaluatorModule.TransSpecable

Inherited from EvaluatorModule.EvaluatorMethods

Inherited from EvaluatorModule.OpFinder

Inherited from AnyRef

Inherited from Any

Ungrouped