Optimizer

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. implicit val ComponentApplicative: Applicative[Component]

   

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. def elideLets[T[_[_]]](implicit arg0: Recursive[T], arg1: FunctorT[T]): (LogicalPlan[T[LogicalPlan]]) ⇒ Predef.Option[LogicalPlan[T[LogicalPlan]]]

   

   Like simplifyƒ, but eliminates _all_ Let (and any bound Free) nodes.

8. val elideTypeCheckƒ: Algebra[LogicalPlan, Fix[LogicalPlan]]

   

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

   

   Definition Classes

   AnyRef

10. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

11. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

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

    

    Definition Classes

    AnyRef → Any

13. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

14. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

15. val namesƒ: Algebra[LogicalPlan, Predef.Set[Predef.Symbol]]

    

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

    

    Definition Classes

    AnyRef

17. final def notify(): Unit

    

    Definition Classes

    AnyRef

18. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

19. val optimize: (Fix[LogicalPlan]) ⇒ Fix[LogicalPlan]

    

    Apply universal, type-oblivious transformations intended to improve the performance of a query regardless of the backend.

    Apply universal, type-oblivious transformations intended to improve the performance of a query regardless of the backend. The input is expected to come straight from the SQL^2 compiler or another source of un-optimized queries.

20. def preferProjections(t: Fix[LogicalPlan]): Fix[LogicalPlan]

    

21. def preserveFree0[A](x: (Fix[LogicalPlan], A))(f: (A) ⇒ Fix[LogicalPlan]): Fix[LogicalPlan]

    

22. val rewriteCrossJoinsƒ: (LogicalPlan[(Fix[LogicalPlan], Fix[LogicalPlan])]) ⇒ State[NameGen, Fix[LogicalPlan]]

    

    Rewrite joins and subsequent filtering so that: 1) Filtering that is equivalent to an equi-join is rewritten into the join condition.

    Rewrite joins and subsequent filtering so that: 1) Filtering that is equivalent to an equi-join is rewritten into the join condition. 2) Filtering that refers to only side of the join is hoisted prior to the join. The input plan must have been simplified already so that the structure is in a canonical form for inspection.

23. val shapeƒ: GAlgebra[[β$0$](Fix[LogicalPlan], β$0$), LogicalPlan, Predef.Option[Predef.List[Fix[LogicalPlan]]]]

    

24. def simplify(t: Fix[LogicalPlan]): Fix[LogicalPlan]

    

25. def simplifyƒ[T[_[_]]](implicit arg0: Recursive[T], arg1: Corecursive[T]): (LogicalPlan[T[LogicalPlan]]) ⇒ Predef.Option[LogicalPlan[T[LogicalPlan]]]

    

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

    

    Definition Classes

    AnyRef

27. def toString(): String

    

    Definition Classes

    AnyRef → Any

28. def uniqueName[F[_]](prefix: Predef.String, plans: F[Fix[LogicalPlan]])(implicit arg0: Functor[F], arg1: Foldable[F]): Predef.Symbol

    

29. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )