Class

quasar.frontend.logicalplan

LogicalPlanR

Related Doc: package logicalplan

Permalink

class LogicalPlanR[T[_[_]]] extends AnyRef

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LogicalPlanR
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new LogicalPlanR()(implicit arg0: Recursive[T], arg1: Corecursive[T])

    Permalink

Type Members

  1. type SemDisj[A] = \/[NonEmptyList[SemanticError], A]

    Permalink
  2. type SemNames[A] = IndexedStateT[SemDisj, NameGen, NameGen, A]

    Permalink
  3. type SemValidation[A] = Validation[NonEmptyList[SemanticError], A]

    Permalink
  4. type Typed[F[_]] = Cofree[F, Type]

    Permalink

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. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. val checkTypesƒ: ((Type, LogicalPlan[ConstrainedPlan[T]])) ⇒ NameT[SemDisj, ConstrainedPlan[T]]

    Permalink
  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. def constant(data: Data): T[LogicalPlan]

    Permalink
  8. def ensureCorrectTypes(term: T[LogicalPlan]): ValidationNel[SemanticError, T[LogicalPlan]]

    Permalink
  9. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. def free(name: Symbol): T[LogicalPlan]

    Permalink
  13. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  14. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  15. def inferTypes(typ: Type, term: T[LogicalPlan]): SemValidation[Typed[LogicalPlan]]

    Permalink
  16. def invoke[N <: Nat](func: GenericFunc[N], values: Input[T[LogicalPlan], N]): T[LogicalPlan]

    Permalink
  17. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  18. def let(name: Symbol, form: T[LogicalPlan], in: T[LogicalPlan]): T[LogicalPlan]

    Permalink
  19. def lpParaZygoHisto[A, B]: (T[LogicalPlan]) ⇒ ((LogicalPlan[(T[LogicalPlan], B)]) ⇒ B, (LogicalPlan[Cofree[LogicalPlan, (B, A)]]) ⇒ scalaz.Scalaz.Id[A]) ⇒ scalaz.Scalaz.Id[A]

    Permalink
  20. def lpParaZygoHistoM[M[_], A, B](t: T[LogicalPlan])(f: (LogicalPlan[(T[LogicalPlan], B)]) ⇒ B, g: (LogicalPlan[Cofree[LogicalPlan, (B, A)]]) ⇒ M[A])(implicit arg0: Monad[M]): M[A]

    Permalink
  21. def lpParaZygoHistoS[S, A, B]: (T[LogicalPlan]) ⇒ ((LogicalPlan[(T[LogicalPlan], B)]) ⇒ B, (LogicalPlan[Cofree[LogicalPlan, (B, A)]]) ⇒ IndexedStateT[[+X]X, S, S, A]) ⇒ IndexedStateT[[+X]X, S, S, A]

    Permalink
  22. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  23. def normalizeLets(t: T[LogicalPlan]): T[LogicalPlan]

    Permalink
  24. val normalizeLetsƒ: (LogicalPlan[T[LogicalPlan]]) ⇒ Predef.Option[LogicalPlan[T[LogicalPlan]]]

    Permalink

    Per the following: 1.

    Per the following: 1. Successive Lets are re-associated to the right: (let a = (let b = x1 in x2) in x3) becomes (let b = x1 in (let a = x2 in x3)) 2. Lets are "hoisted" outside of Invoke and Typecheck nodes: (add (let a = x1 in x2) (let b = x3 in x4)) becomes (let a = x1 in (let b = x3 in (add x2 x4)) Note that this is safe only if all bound names are unique; otherwise it could create spurious shadowing. normalizeTempNames is recommended. NB: at the moment, Lets are only hoisted one level.

  25. def normalizeTempNames(t: T[LogicalPlan]): T[LogicalPlan]

    Permalink
  26. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  27. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  28. def paths(lp: T[LogicalPlan]): Predef.Set[FPath]

    Permalink

    The set of paths referenced in the given plan.

  29. def read(path: FPath): T[LogicalPlan]

    Permalink
  30. def rename[M[_]](f: (Symbol) ⇒ M[Symbol])(t: T[LogicalPlan])(implicit arg0: Monad[M]): M[T[LogicalPlan]]

    Permalink
  31. def renameƒ[M[_]](f: (Symbol) ⇒ M[Symbol])(implicit arg0: Monad[M]): CoalgebraM[M, LogicalPlan, (Predef.Map[Symbol, Symbol], T[LogicalPlan])]

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

    Permalink
    Definition Classes
    AnyRef
  33. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  34. def typecheck(expr: T[LogicalPlan], typ: Type, cont: T[LogicalPlan], fallback: T[LogicalPlan]): T[LogicalPlan]

    Permalink
  35. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  36. final def wait(arg0: Long, arg1: Int): Unit

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped