final 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 TR: Aux[T, LogicalPlan], TC: Aux[T, LogicalPlan])

Type Members

  1. type SemDisj[A] = \/[NonEmptyList[SemanticError], A]
  2. type SemNames[A] = IndexedStateT[SemDisj, NameGen, NameGen, A]
  3. type SemValidation[A] = Validation[NonEmptyList[SemanticError], A]
  4. type Typed[F[_]] = Cofree[F, Type]

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def absolutePaths(lp: T): ISet[APath]

    The set of absolute paths referenced in the given plan.

  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def bindFree(vars: slamdata.Predef.Map[CIName, T])(t: T): T
  7. val checkTypesƒ: ((Type, LogicalPlan[ConstrainedPlan[T]])) ⇒ NameT[SemDisj, ConstrainedPlan[T]]
  8. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  9. def constant(data: Data): T
  10. def constrain(inf: Type, poss: Type): slamdata.Predef.Option[Type]
  11. def ensureCorrectTypes(term: T): ValidationNel[SemanticError, T]
  12. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  14. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  15. def free(name: Symbol): T
  16. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  17. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  18. def inferTypes(typ: Type, term: T): SemValidation[Typed[LogicalPlan]]
    Annotations
    @SuppressWarnings()
  19. def invoke[N <: Nat](func: GenericFunc[N], values: Input[T, N]): T
  20. def invoke1(func: GenericFunc[shapeless.Nat._1], v1: T): T
  21. def invoke2(func: GenericFunc[shapeless.Nat._2], v1: T, v2: T): T
  22. def invoke3(func: GenericFunc[shapeless.Nat._3], v1: T, v2: T, v3: T): T
  23. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  24. def join(left: T, right: T, tpe: JoinType, cond: JoinCondition[T]): T
  25. def joinSideName(name: Symbol): T
  26. def let(name: Symbol, form: T, in: T): T
  27. def lpParaZygoHisto[A, B]: (T) ⇒ ((LogicalPlan[(T, B)]) ⇒ B, (LogicalPlan[Cofree[LogicalPlan, (B, A)]]) ⇒ scalaz.Scalaz.Id[A]) ⇒ scalaz.Scalaz.Id[A]
  28. def lpParaZygoHistoM[M[_], A, B](t: T)(f: (LogicalPlan[(T, B)]) ⇒ B, g: (LogicalPlan[Cofree[LogicalPlan, (B, A)]]) ⇒ M[A])(implicit arg0: Monad[M]): M[A]
  29. def lpParaZygoHistoS[S, A, B]: (T) ⇒ ((LogicalPlan[(T, B)]) ⇒ B, (LogicalPlan[Cofree[LogicalPlan, (B, A)]]) ⇒ IndexedStateT[[X]X, S, S, A]) ⇒ IndexedStateT[[X]X, S, S, A]
  30. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  31. def normalizeLets(t: T): T
  32. val normalizeLetsƒ: (LogicalPlan[T]) ⇒ slamdata.Predef.Option[LogicalPlan[T]]

    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.

  33. def normalizeTempNames(t: T): T
  34. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  35. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  36. def paths(lp: T): ISet[FPath]

    The set of paths referenced in the given plan.

  37. def read(path: FPath): T
  38. def rename[M[_]](f: (Symbol) ⇒ M[Symbol])(t: T)(implicit arg0: Monad[M]): M[T]
  39. def renameƒ[M[_]](f: (Symbol) ⇒ M[Symbol])(implicit arg0: Monad[M]): CoalgebraM[M, LogicalPlan, (slamdata.Predef.Map[Symbol, Symbol], T)]
  40. def sort(src: T, order: NonEmptyList[(T, SortDir)]): T
  41. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  42. def temporalTrunc(part: TemporalPart, src: T): T
  43. def toString(): String
    Definition Classes
    AnyRef → Any
  44. def typecheck(expr: T, typ: Type, cont: T, fallback: T): T
  45. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  46. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  47. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped