c

slick.compiler

RewriteJoins

class RewriteJoins extends Phase

Rewrite monadic joins to applicative joins. After this phase all Bind nodes are of the form Bind(_, _, Pure(_, _)) (i.e. flatMap has been reduced to map).

Source
RewriteJoins.scala
Linear Supertypes
Phase, Logging, (CompilerState) => CompilerState, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RewriteJoins
  2. Phase
  3. Logging
  4. Function1
  5. AnyRef
  6. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new RewriteJoins()

Type Members

  1. abstract type State

    The immutable state of the phase that can also be accessed by other phases.

    The immutable state of the phase that can also be accessed by other phases.

    Definition Classes
    Phase

Value Members

  1. def and(p1Opt: Option[Node], p2: Node): Node
  2. def and(ns: IndexedSeq[Node]): Node
  3. def andThen[A](g: (CompilerState) => A): (CompilerState) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  4. def apply(state: CompilerState): CompilerState

    Run the phase

    Run the phase

    Definition Classes
    RewriteJoins → Phase → Function1
  5. def compose[A](g: (A) => CompilerState): (A) => CompilerState
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  6. 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.

  7. 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.

  8. def hasRefTo(n: Node, s: Set[TermSymbol]): Boolean
  9. 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).

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

    Hoist Filter nodes in Join generators into join predicates.

  11. val name: String

    The unique name of the phase

    The unique name of the phase

    Definition Classes
    RewriteJoins → Phase
  12. 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.

  13. def splitConjunctions(n: Node): IndexedSeq[Node]
  14. def toString(): String
    Definition Classes
    Function1 → AnyRef → Any
  15. def tr(n: Node): Node