Package

quasar.frontend

logicalplan

Permalink

package logicalplan

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

Type Members

  1. sealed abstract class Component[T, A] extends AnyRef

    Permalink
  2. final case class Constant[A](data: Data) extends LogicalPlan[A] with Product with Serializable

    Permalink
  3. final case class ConstrainedPlan[T](inferred: Type, constraints: slamdata.Predef.List[NamedConstraint[T]], plan: T) extends Product with Serializable

    Permalink
  4. final case class EquiCond[T, A](run0: (T, T) ⇒ A) extends Component[T, A] with Product with Serializable

    Permalink

    A condition that refers to left and right sources using equality, so may be rewritten into the join condition.

  5. final case class Free[A](name: Symbol) extends LogicalPlan[A] with Product with Serializable

    Permalink
  6. final case class Invoke[N <: Nat, A](func: GenericFunc[N], values: Input[A, N]) extends LogicalPlan[A] with Product with Serializable

    Permalink
  7. final case class Join[A](left: A, right: A, tpe: JoinType, condition: JoinCondition[A]) extends LogicalPlan[A] with Product with Serializable

    Permalink
  8. final case class JoinCondition[A](leftName: Symbol, rightName: Symbol, value: A) extends Product with Serializable

    Permalink
  9. final case class JoinSideName[A](name: Symbol) extends LogicalPlan[A] with Product with Serializable

    Permalink
  10. final case class LeftCond[T, A](run0: (T) ⇒ A) extends Component[T, A] with Product with Serializable

    Permalink

    A condition which refers only to the left source

  11. final case class Let[A](let: Symbol, form: A, in: A) extends LogicalPlan[A] with Product with Serializable

    Permalink
  12. sealed abstract class LogicalPlan[A] extends slamdata.Predef.Product with slamdata.Predef.Serializable

    Permalink
  13. final class LogicalPlanR[T] extends AnyRef

    Permalink
  14. final case class NamedConstraint[T](name: Symbol, inferred: Type, term: T) extends Product with Serializable

    Permalink
  15. final case class NeitherCond[T, A](run0: A) extends Component[T, A] with Product with Serializable

    Permalink

    An expression that doesn't refer to any source.

  16. final class Optimizer[T] extends AnyRef

    Permalink
  17. final case class OtherCond[T, A](run0: (T, T) ⇒ A) extends Component[T, A] with Product with Serializable

    Permalink

    A condition which refers to both sources but doesn't have the right shape to become the join condition.

  18. final case class Read[A](path: FPath) extends LogicalPlan[A] with Product with Serializable

    Permalink
  19. final case class RightCond[T, A](run0: (T) ⇒ A) extends Component[T, A] with Product with Serializable

    Permalink

    A condition which refers only to the right source.

  20. final case class Sort[A](src: A, order: NonEmptyList[(A, SortDir)]) extends LogicalPlan[A] with Product with Serializable

    Permalink
  21. final case class TemporalTrunc[A](part: TemporalPart, src: A) extends LogicalPlan[A] with Product with Serializable

    Permalink
  22. final case class Typecheck[A](expr: A, typ: Type, cont: A, fallback: A) extends LogicalPlan[A] with Product with Serializable

    Permalink

Value Members

  1. object Component

    Permalink
  2. object InvokeUnapply

    Permalink
  3. object LogicalPlan extends Serializable

    Permalink
  4. def constant[A]: Prism[LogicalPlan[A], Data]

    Permalink
  5. def free[A]: Prism[LogicalPlan[A], Symbol]

    Permalink
  6. def freshName(prefix: slamdata.Predef.String): State[NameGen, Symbol]

    Permalink
  7. def invoke[A]: Prism[LogicalPlan[A], (GenericFunc[Nat], Input[A, Nat])]

    Permalink
  8. def join[A]: Prism[LogicalPlan[A], (A, A, JoinType, JoinCondition[A])]

    Permalink
  9. def joinSideName[A]: Prism[LogicalPlan[A], Symbol]

    Permalink
  10. def let[A]: Prism[LogicalPlan[A], (Symbol, A, A)]

    Permalink
  11. def read[A]: Prism[LogicalPlan[A], FPath]

    Permalink
  12. def sort[A]: Prism[LogicalPlan[A], (A, NonEmptyList[(A, SortDir)])]

    Permalink
  13. def temporalTrunc[A]: Prism[LogicalPlan[A], (TemporalPart, A)]

    Permalink
  14. def typecheck[A]: Prism[LogicalPlan[A], (A, Type, A, A)]

    Permalink

Inherited from AnyRef

Inherited from Any

Ungrouped