MongoDbQScriptPlanner

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 HasInt[WF[_]]: (WorkflowBuilder[WF]) ⇒ OutputM[Predef.Long]

   

5. def HasLiteral[WF[_]]: (WorkflowBuilder[WF]) ⇒ OutputM[Bson]

   

   Annotations

   @SuppressWarnings()

6. object Planner

   

7. object Point

   

8. object Roll

   

9. val accumulator: (ReduceFunc[Fix[ExprOp]]) ⇒ AccumOp[Fix[ExprOp]]

   

10. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

11. def assumeReadType[T[_[_]], F[_]](typ: Type)(implicit arg0: Recursive[T], arg1: Corecursive[T], arg2: Functor[F], QC: :<:[[β$57$]QScriptCore[T, β$57$], F], R: :<:[[β$58$]Const[Read, β$58$], F]): (QScriptCore[T, T[F]]) ⇒ \/[PlannerError, F[T[F]]]

    

12. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

13. def elideMoreGeneralGuards[T[_[_]]](subType: Type)(implicit arg0: Recursive[T]): (CoEnv[Hole, [β$51$]MapFunc[T, β$51$], T[[γ$53$]CoEnv[Hole, [β$52$]MapFunc[T, β$52$], γ$53$]]]) ⇒ \/[PlannerError, CoEnv[Hole, [β$56$]MapFunc[T, β$56$], T[[γ$54$]CoEnv[Hole, [β$55$]MapFunc[T, β$55$], γ$54$]]]]

    

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

    

    Definition Classes

    AnyRef

15. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

16. def exprOrJs[M[_], A](a: A)(exf: (A) ⇒ M[Fix[ExprOp]], jsf: (A) ⇒ M[JsFn])(implicit arg0: Functor[M], arg1: Plus[M]): M[Expr]

    

17. def expression[T[_[_]], EX[_]](funcHandler: FuncHandler[T, EX])(implicit arg0: Recursive[T], arg1: ShowT[T], arg2: Traverse[EX], inj: :<:[EX, ExprOp]): AlgebraM[OutputM, [β$6$]MapFunc[T, β$6$], Fix[ExprOp]]

    

18. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

19. def findFirst[T[_[_]], F[_], A](f: Predef.PartialFunction[T[F], A])(implicit arg0: Recursive[T], arg1: Functor[F], arg2: Foldable[F]): CoalgebraM[[β$50$]\/[A, β$50$], F, T[F]]

    

20. def generateTypeCheck[In, Out](or: (Out, Out) ⇒ Out)(f: Predef.PartialFunction[Type, (In) ⇒ Out]): (Type) ⇒ Predef.Option[(In) ⇒ Out]

    

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

    

    Definition Classes

    AnyRef → Any

22. def getExpr[T[_[_]], EX[_]](funcHandler: FuncHandler[T, EX])(fm: T[[γ$38$]CoEnv[Hole, [β$37$]MapFunc[T, β$37$], γ$38$]])(implicit arg0: Recursive[T], arg1: ShowT[T], arg2: Traverse[EX], ev: :<:[EX, ExprOp]): OutputM[Fix[ExprOp]]

    

23. def getExprBuilder[T[_[_]], WF[_], EX[_]](funcHandler: FuncHandler[T, EX])(src: WorkflowBuilder[WF], fm: FreeMap[T])(implicit arg0: Recursive[T], arg1: Corecursive[T], arg2: ShowT[T], arg3: Traverse[EX], ev: :<:[EX, ExprOp]): OutputM[WorkflowBuilder[WF]]

    

24. def getExprRed[T[_[_]], EX[_]](funcHandler: FuncHandler[T, EX])(jr: T[[γ$44$]CoEnv[ReduceIndex, [β$43$]MapFunc[T, β$43$], γ$44$]])(implicit arg0: Recursive[T], arg1: ShowT[T], arg2: Traverse[EX], ev: :<:[EX, ExprOp]): OutputM[Fix[ExprOp]]

    

25. def getJsFn[T[_[_]]](fm: T[[γ$40$]CoEnv[Hole, [β$39$]MapFunc[T, β$39$], γ$40$]])(implicit arg0: Recursive[T], arg1: ShowT[T]): OutputM[JsFn]

    

26. def getJsMerge[T[_[_]]](jf: JoinFunc[T], a1: JsCore, a2: JsCore)(implicit arg0: Recursive[T], arg1: Corecursive[T], arg2: ShowT[T]): OutputM[JsFn]

    

27. def getJsRed[T[_[_]]](jr: T[[γ$46$]CoEnv[ReduceIndex, [β$45$]MapFunc[T, β$45$], γ$46$]])(implicit arg0: Recursive[T], arg1: ShowT[T]): OutputM[JsFn]

    

28. def handleFreeMap[T[_[_]], EX[_]](funcHandler: FuncHandler[T, EX], fm: T[[γ$42$]CoEnv[Hole, [β$41$]MapFunc[T, β$41$], γ$42$]])(implicit arg0: Recursive[T], arg1: ShowT[T], arg2: Traverse[EX], ev: :<:[EX, ExprOp]): OutputM[Expr]

    

29. def handleRedRepair[T[_[_]], EX[_]](funcHandler: FuncHandler[T, EX], jr: FreeMapA[T, ReduceIndex])(implicit arg0: Recursive[T], arg1: Corecursive[T], arg2: ShowT[T], arg3: Traverse[EX], ev: :<:[EX, ExprOp]): OutputM[Expr]

    

30. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

31. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

32. def javascript[T[_[_]]](implicit arg0: Recursive[T], arg1: ShowT[T]): AlgebraM[OutputM, [β$7$]MapFunc[T, β$7$], JsCore]

    

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

    

    Definition Classes

    AnyRef

34. final def notify(): Unit

    

    Definition Classes

    AnyRef

35. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

36. def plan[T[_[_]]](logical: T[LogicalPlan], queryContext: QueryContext)(implicit arg0: Recursive[T], arg1: Corecursive[T], arg2: EqualT[T], arg3: ShowT[T], arg4: RenderTreeT[T]): EitherT[[γ$67$]WriterT[MongoDbIO, Vector[PhaseResult], γ$67$], FileSystemError, Crystallized[WorkflowF]]

    

    Translate the QScript plan to an executable MongoDB "physical" plan, taking into account the current runtime environment as captured by the given context.

    Translate the QScript plan to an executable MongoDB "physical" plan, taking into account the current runtime environment as captured by the given context. Internally, the type of the plan being built constrains which operators can be used, but the resulting plan uses the largest, common type so that callers don't need to worry about it.

37. def plan0[T[_[_]], WF[_], EX[_]](joinHandler: JoinHandler[WF, M], funcHandler: FuncHandler[T, EX])(lp: T[LogicalPlan])(implicit arg0: Recursive[T], arg1: Corecursive[T], arg2: EqualT[T], arg3: ShowT[T], arg4: RenderTreeT[T], arg5: Functor[WF], arg6: Coalesce[WF], arg7: Crush[WF], arg8: Crystallize[WF], arg9: Traverse[EX], ev0: :<:[WorkflowOpCoreF, WF], ev2: Ops[WF], ev3: :<:[EX, ExprOp], ev4: RenderTree[Fix[WF]]): EitherT[[γ$59$]WriterT[MongoDbIO, Vector[PhaseResult], γ$59$], FileSystemError, Crystallized[WF]]

    

38. def processMapFunc[T[_[_]], A](fm: T[[γ$4$]CoEnv[A, [β$3$]MapFunc[T, β$3$], γ$4$]])(recovery: (A) ⇒ JsCore)(implicit arg0: Recursive[T], arg1: ShowT[T]): OutputM[JsCore]

    

39. def processMapFuncExpr[T[_[_]], EX[_], A](funcHandler: FuncHandler[T, EX])(fm: T[[γ$1$]CoEnv[A, [β$0$]MapFunc[T, β$0$], γ$1$]])(recovery: (A) ⇒ OutputM[Fix[ExprOp]])(implicit arg0: Recursive[T], arg1: ShowT[T], arg2: Traverse[EX], inj: :<:[EX, ExprOp]): OutputM[Fix[ExprOp]]

    

40. def rebaseWB[T[_[_]], WF[_], EX[_]](joinHandler: JoinHandler[WF, M], funcHandler: FuncHandler[T, EX], free: FreeQS[T], src: WorkflowBuilder[WF])(implicit arg0: Functor[WF], arg1: Coalesce[WF], arg2: Crush[WF], arg3: Crystallize[WF], arg4: Traverse[EX], F: Aux[T, [β$47$]Coproduct[[β$6$]QScriptCore[T, β$6$], [A]Coproduct[[β$0$]ProjectBucket[T, β$0$], [A]Coproduct[[β$5$]ThetaJoin[T, β$5$], [A]Coproduct[[β$1$]EquiJoin[T, β$1$], [A]Coproduct[[β$4$]Const[ShiftedRead, β$4$], [A]Coproduct[[β$2$]Const[Read, β$2$], [β$3$]Const[DeadEnd, β$3$], A], A], A], A], A], β$47$]], ev0: :<:[WorkflowOpCoreF, WF], ev1: RenderTree[WorkflowBuilder[WF]], ev2: Ops[WF], ev3: :<:[EX, ExprOp]): StateT[OutputM, NameGen, WorkflowBuilder[WF]]

    

41. def selector[T[_[_]]](implicit arg0: Recursive[T], arg1: ShowT[T]): GAlgebra[[β$9$](T[[β$8$]MapFunc[T, β$8$]], β$9$), [β$10$]MapFunc[T, β$10$], OutputM[PartialSelector]]

    

    The selector phase tries to turn expressions into MongoDB selectors -- i.e.

    The selector phase tries to turn expressions into MongoDB selectors -- i.e. Mongo query expressions. Selectors are only used for the filtering pipeline op, so it's quite possible we build more stuff than is needed (but it doesn't matter, unneeded annotations will be ignored by the pipeline phase).

    Like the expression op phase, this one requires bson field annotations.

    Most expressions cannot be turned into selector expressions without using the "$where" operator, which allows embedding JavaScript code. Unfortunately, using this operator turns filtering into a full table scan. We should do a pass over the tree to identify partial boolean expressions which can be turned into selectors, factoring out the leftovers for conversion using $where.

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

    

    Definition Classes

    AnyRef

43. def toString(): String

    

    Definition Classes

    AnyRef → Any

44. def unimplemented(name: Predef.String): \/[InternalError, Nothing]

    

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

    @throws( ... )