RewriteJoins

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. def +(other: String): String

   

   Implicit information

   This member is added by an implicit conversion from RewriteJoins to any2stringadd[RewriteJoins] performed by method any2stringadd in scala.Predef.

   Definition Classes

   any2stringadd

4. def ->[B](y: B): (RewriteJoins, B)

   

   Implicit information

   This member is added by an implicit conversion from RewriteJoins to ArrowAssoc[RewriteJoins] performed by method ArrowAssoc in scala.Predef.

   Definition Classes

   ArrowAssoc

   Annotations

   @inline()

5. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

6. def and(p1Opt: Option[Node], p2: Node): Node

   

7. def and(ns: IndexedSeq[Node]): Node

   

8. def andThen[A](g: (CompilerState) ⇒ A): (CompilerState) ⇒ A

   

   Definition Classes

   Function1

   Annotations

   @unspecialized()

9. def apply(state: CompilerState): CompilerState

   

   Run the phase

   Run the phase

   Definition Classes

   RewriteJoins → Phase → Function1

10. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

11. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

12. def compose[A](g: (A) ⇒ CompilerState): (A) ⇒ CompilerState

    

    Definition Classes

    Function1

    Annotations

    @unspecialized()

13. def eliminateIllegalRefs(j: Join, illegal: Set[TermSymbol], outsideRef: TermSymbol): (Join, Map[List[TermSymbol], Node])

    

    Recursively push refs from the right-hand side of a Join to the left-hand side out of the join.

    Recursively push refs from the right-hand side of a Join to the left-hand side out of the join. This is only possible when they occur in a a mapping Bind(_, _, Pure(StructNode)) directly at the RHS of a Join. Returns the (possibly transformed) Join and replacements for forward paths into it.

    TODO: If the remainder of the mapping Bind is purely aliasing, eliminate it entirely.

14. def ensuring(cond: (RewriteJoins) ⇒ Boolean, msg: ⇒ Any): RewriteJoins

    

    Implicit information

    This member is added by an implicit conversion from RewriteJoins to Ensuring[RewriteJoins] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

15. def ensuring(cond: (RewriteJoins) ⇒ Boolean): RewriteJoins

    

    Implicit information

    This member is added by an implicit conversion from RewriteJoins to Ensuring[RewriteJoins] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

16. def ensuring(cond: Boolean, msg: ⇒ Any): RewriteJoins

    

    Implicit information

    This member is added by an implicit conversion from RewriteJoins to Ensuring[RewriteJoins] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

17. def ensuring(cond: Boolean): RewriteJoins

    

    Implicit information

    This member is added by an implicit conversion from RewriteJoins to Ensuring[RewriteJoins] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

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

    

    Definition Classes

    AnyRef

19. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

20. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

21. def flattenAliasingMap(b: Bind): Bind

    

    Merge nested mapping operations of the form Bind(_, Bind(_, _, Pure(StructNode(p1), _)), Pure(StructNode(p2), _)) into a single Bind, provided that each element of either p1 or p2 contains not more than one path.

    Merge nested mapping operations of the form Bind(_, Bind(_, _, Pure(StructNode(p1), _)), Pure(StructNode(p2), _)) into a single Bind, provided that each element of either p1 or p2 contains not more than one path. This transformation is not required for the correctness of join rewriting but it keeps the tree smaller to speed up subsequent phases.

22. def formatted(fmtstr: String): String

    

    Implicit information

    This member is added by an implicit conversion from RewriteJoins to StringFormat[RewriteJoins] performed by method StringFormat in scala.Predef.

    Definition Classes

    StringFormat

    Annotations

    @inline()

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

    

    Definition Classes

    AnyRef → Any

24. def hasRefTo(n: Node, s: Set[TermSymbol]): Boolean

    

25. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

26. def hoistFilterFromBind(b: Bind): (Node, Set[TypeSymbol])

    

    Recursively hoist Filter out of of Bind(_, Filter, Pure(StructNode)).

    Recursively hoist Filter out of of Bind(_, Filter, Pure(StructNode)). Returns the possibly modified tree plus a set of invalidated TypeSymbols (non-empty if additional columns have to be added to the base projection for the filters).

27. def hoistFilters(j: Join): (Join, Set[TypeSymbol])

    

    Hoist Filter nodes in Join generators into join predicates.

28. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

29. lazy val logger: SlickLogger

    

    Attributes

    protected[this]

    Definition Classes

    Logging

30. val name: String

    

    The unique name of the phase

    The unique name of the phase

    Definition Classes

    RewriteJoins → Phase

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

    

    Definition Classes

    AnyRef

32. final def notify(): Unit

    

    Definition Classes

    AnyRef

33. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

34. def rearrangeJoinConditions(j: Join, alsoPull: Set[TermSymbol]): Join

    

    In a Join(s1, _, _, Join(_, _, _, _, JoinType.Inner, on2), JoinType.Inner, on1) where parts of on2 refer to s1, merge them into on1.

    In a Join(s1, _, _, Join(_, _, _, _, JoinType.Inner, on2), JoinType.Inner, on1) where parts of on2 refer to s1, merge them into on1. Nested joins are processed recursively. The same is done in the opposite direction, pushing predicates down into sub-joins if they only reference one side of the join.

35. def splitConjunctions(n: Node): IndexedSeq[Node]

    

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

    

    Definition Classes

    AnyRef

37. def toString(): String

    

    Definition Classes

    Function1 → AnyRef → Any

38. def tr(n: Node): Node

    

39. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

42. def →[B](y: B): (RewriteJoins, B)

    

    Implicit information

    This member is added by an implicit conversion from RewriteJoins to ArrowAssoc[RewriteJoins] performed by method ArrowAssoc in scala.Predef.

    Definition Classes

    ArrowAssoc