Object

quasar.physical.mongodb

MongoDbQScriptPlanner

Related Doc: package mongodb

Permalink

object MongoDbQScriptPlanner

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

Type Members

  1. type GenT[X[_], A] = IndexedStateT[X, NameGen, NameGen, A]

    Permalink

  2. type OutputM[A] = \/[PlannerError, A]

    Permalink

  3. type Partial[T[_[_]], In, Out] = (Predef.PartialFunction[Predef.List[In], Out], Predef.List[InputFinder[T]])

    Permalink

  4. type PartialSelector[T[_[_]]] = (Predef.PartialFunction[Predef.List[BsonField], Selector], Predef.List[InputFinder[T]])

    Permalink

    Need this until the old connector goes away and we can redefine Selector as Selector[A, B], where A is the field type (naturally BsonField), and B is the recursive parameter.

  5. trait Planner[F[_]] extends AnyRef

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AnyRef → Any

  4. def HasInt[M[_], WF[_]](wb: WorkflowBuilder[WF])(implicit arg0: Monad[M], merr: MonadError_[M, FileSystemError]): M[Predef.Long]

    Permalink
    Annotations
    @SuppressWarnings()

  5. def HasLiteral[M[_], WF[_]](wb: WorkflowBuilder[WF])(implicit arg0: Applicative[M], merr: MonadError_[M, FileSystemError]): M[Bson]

    Permalink
    Annotations
    @SuppressWarnings()

  6. object Planner

    Permalink

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

    Permalink

  8. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  9. def assumeReadType[M[_], T[_[_]], F[_]](typ: Type)(implicit arg0: Monad[M], arg1: BirecursiveT[T], arg2: Functor[F], merr: MonadError_[M, FileSystemError], QC: :<:[[β$42$]QScriptCore[T, β$42$], F], SR: :<:[[β$43$]Const[ShiftedRead[Path[Abs, File, Sandboxed]], β$43$], F]): (QScriptCore[T, T[F]]) ⇒ M[F[T[F]]]

    Permalink
    Annotations
    @SuppressWarnings()

  10. val check: Check[Fix[ExprOp], ExprOp]

    Permalink

  11. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  12. def defaultSelector[T[_[_]]]: PartialSelector[T]

    Permalink

  13. def elideMoreGeneralGuards[M[_], T[_[_]]](subType: Type)(implicit arg0: Applicative[M], arg1: RecursiveT[T], merr: MonadError_[M, FileSystemError]): (CoEnv[Hole, [β$40$]MapFunc[T, β$40$], FreeMap[T]]) ⇒ M[CoEnv[Hole, [β$41$]MapFunc[T, β$41$], FreeMap[T]]]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  15. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink

  17. def expression[T[_[_]], M[_], EX[_]](funcHandler: FuncHandler[T, EX])(implicit arg0: RecursiveT[T], arg1: ShowT[T], arg2: Applicative[M], arg3: Traverse[EX], merr: MonadError_[M, FileSystemError], inj: :<:[EX, ExprOp]): AlgebraM[M, [β$9$]MapFunc[T, β$9$], Fix[ExprOp]]

    Permalink

  18. def finalize(): Unit

    Permalink
    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: RecursiveT[T], arg1: Functor[F], arg2: Foldable[F]): CoalgebraM[[β$39$]\/[A, β$39$], F, T[F]]

    Permalink

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

    Permalink

  21. def getBuilder[T[_[_]], M[_], WF[_], EX[_], A](handler: (FreeMapA[T, A]) ⇒ M[Expr])(src: WorkflowBuilder[WF], fm: FreeMapA[T, A])(implicit arg0: BirecursiveT[T], arg1: ShowT[T], arg2: Monad[M], arg3: Traverse[EX], merr: MonadError_[M, FileSystemError], ev: :<:[EX, ExprOp]): M[WorkflowBuilder[WF]]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef → Any

  23. def getExpr[T[_[_]], M[_], EX[_]](funcHandler: FuncHandler[T, EX])(fm: FreeMap[T])(implicit arg0: RecursiveT[T], arg1: ShowT[T], arg2: Monad[M], arg3: Traverse[EX], merr: MonadError_[M, FileSystemError], ev: :<:[EX, ExprOp]): M[Fix[ExprOp]]

    Permalink

  24. def getExprBuilder[T[_[_]], M[_], WF[_], EX[_]](funcHandler: FuncHandler[T, EX])(src: WorkflowBuilder[WF], fm: FreeMap[T])(implicit arg0: BirecursiveT[T], arg1: ShowT[T], arg2: Monad[M], arg3: Traverse[EX], merr: MonadError_[M, FileSystemError], ev: :<:[EX, ExprOp]): M[WorkflowBuilder[WF]]

    Permalink

  25. def getExprRed[T[_[_]], M[_], EX[_]](funcHandler: FuncHandler[T, EX])(jr: FreeMapA[T, ReduceIndex])(implicit arg0: RecursiveT[T], arg1: ShowT[T], arg2: Monad[M], arg3: Traverse[EX], merr: MonadError_[M, FileSystemError], ev: :<:[EX, ExprOp]): M[Fix[ExprOp]]

    Permalink

  26. def getJsFn[T[_[_]], M[_]](fm: FreeMap[T])(implicit arg0: RecursiveT[T], arg1: ShowT[T], arg2: Monad[M], merr: MonadError_[M, FileSystemError]): M[JsFn]

    Permalink

  27. def getJsMerge[T[_[_]], M[_]](jf: JoinFunc[T], a1: JsCore, a2: JsCore)(implicit arg0: BirecursiveT[T], arg1: ShowT[T], arg2: Monad[M], merr: MonadError_[M, FileSystemError]): M[JsFn]

    Permalink

  28. def getJsRed[T[_[_]], M[_]](jr: Free[[β$36$]MapFunc[T, β$36$], ReduceIndex])(implicit arg0: RecursiveT[T], arg1: ShowT[T], arg2: Monad[M], merr: MonadError_[M, FileSystemError]): M[JsFn]

    Permalink

  29. def getReduceBuilder[T[_[_]], M[_], WF[_], EX[_]](funcHandler: FuncHandler[T, EX])(src: WorkflowBuilder[WF], fm: FreeMapA[T, ReduceIndex])(implicit arg0: BirecursiveT[T], arg1: ShowT[T], arg2: Monad[M], arg3: Traverse[EX], merr: MonadError_[M, FileSystemError], ev: :<:[EX, ExprOp]): M[WorkflowBuilder[WF]]

    Permalink

  30. def getSelector[T[_[_]], M[_], EX[_]](fm: FreeMap[T])(implicit arg0: BirecursiveT[T], arg1: ShowT[T], arg2: Monad[M], arg3: Traverse[EX], merr: MonadError_[M, FileSystemError], inj: :<:[EX, ExprOp]): OutputM[PartialSelector[T]]

    Permalink

  31. def ginterpret[W[_], F[_], A, B](f: (A) ⇒ B, φ: GAlgebra[W, F, B]): GAlgebra[W, [γ$0$]CoEnv[A, F, γ$0$], B]

    Permalink

  32. def handleFreeMap[T[_[_]], M[_], EX[_]](funcHandler: FuncHandler[T, EX], fm: FreeMap[T])(implicit arg0: RecursiveT[T], arg1: ShowT[T], arg2: Monad[M], arg3: Traverse[EX], merr: MonadError_[M, FileSystemError], ev: :<:[EX, ExprOp]): M[Expr]

    Permalink

  33. def handleRedRepair[T[_[_]], M[_], EX[_]](funcHandler: FuncHandler[T, EX], jr: FreeMapA[T, ReduceIndex])(implicit arg0: BirecursiveT[T], arg1: ShowT[T], arg2: Monad[M], arg3: Traverse[EX], merr: MonadError_[M, FileSystemError], ev: :<:[EX, ExprOp]): M[Expr]

    Permalink

  34. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  35. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  36. def javascript[T[_[_]], M[_]](implicit arg0: RecursiveT[T], arg1: ShowT[T], arg2: Applicative[M], merr: MonadError_[M, FileSystemError]): AlgebraM[M, [β$10$]MapFunc[T, β$10$], JsCore]

    Permalink

  37. def liftErr[M[_], A](meh: EitherE[A])(implicit arg0: Applicative[M], merr: MonadError_[M, FileSystemError]): M[A]

    Permalink

    Brings a WorkflowBuilder.EitherE into our M.

  38. def liftM[M[_], A](meh: M[A])(implicit arg0: Monad[M], merr: MonadError_[M, FileSystemError], mst: MonadState_[M, NameGen]): M[A]

    Permalink

    Brings a WorkflowBuilder.M into our M.

  39. def log[M[_], A](label: Predef.String, ma: M[A])(implicit arg0: Monad[M], arg1: RenderTree[A], mtell: MonadTell_[M, PhaseResults]): M[A]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  41. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  42. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  43. def plan[T[_[_]], M[_]](logical: T[LogicalPlan], queryContext: QueryContext[M])(implicit arg0: BirecursiveT[T], arg1: OrderT[T], arg2: EqualT[T], arg3: ShowT[T], arg4: RenderTreeT[T], arg5: Monad[M], merr: MonadError_[M, FileSystemError], mtell: MonadTell_[M, PhaseResults]): M[Crystallized[WorkflowF]]

    Permalink

    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.

  44. def plan0[T[_[_]], M[_], WF[_], EX[_]](listContents: ListContents[M], joinHandler: JoinHandler[WF, M], funcHandler: FuncHandler[T, EX])(lp: T[LogicalPlan])(implicit arg0: BirecursiveT[T], arg1: OrderT[T], arg2: EqualT[T], arg3: RenderTreeT[T], arg4: ShowT[T], arg5: Monad[M], arg6: Functor[WF], arg7: Coalesce[WF], arg8: Crush[WF], arg9: Crystallize[WF], arg10: Traverse[EX], merr: MonadError_[M, FileSystemError], mtell: MonadTell_[M, PhaseResults], ev0: :<:[WorkflowOpCoreF, WF], ev1: Ops[WF], ev2: :<:[EX, ExprOp], ev3: RenderTree[Fix[WF]]): M[Crystallized[WF]]

    Permalink

  45. def processMapFunc[T[_[_]], M[_], A](fm: FreeMapA[T, A])(recovery: (A) ⇒ JsCore)(implicit arg0: RecursiveT[T], arg1: ShowT[T], arg2: Monad[M], merr: MonadError_[M, FileSystemError]): M[JsCore]

    Permalink

  46. def processMapFuncExpr[T[_[_]], M[_], EX[_], A](funcHandler: FuncHandler[T, EX])(fm: FreeMapA[T, A])(recovery: (A) ⇒ Fix[ExprOp])(implicit arg0: RecursiveT[T], arg1: ShowT[T], arg2: Monad[M], arg3: Traverse[EX], merr: MonadError_[M, FileSystemError], inj: :<:[EX, ExprOp]): M[Fix[ExprOp]]

    Permalink

  47. def rebaseWB[T[_[_]], M[_], WF[_], EX[_]](joinHandler: JoinHandler[WF, M], funcHandler: FuncHandler[T, EX], free: FreeQS[T], src: WorkflowBuilder[WF])(implicit arg0: Monad[M], arg1: Functor[WF], arg2: Coalesce[WF], arg3: Crush[WF], arg4: Crystallize[WF], arg5: Traverse[EX], merr: MonadError_[M, FileSystemError], mst: MonadState_[M, NameGen], F: Aux[T, [β$37$]Coproduct[[β$0$]QScriptCore[T, β$0$], [β$1$]Coproduct[[β$2$]ProjectBucket[T, β$2$], [β$3$]Coproduct[[β$4$]ThetaJoin[T, β$4$], [β$5$]Coproduct[[β$6$]EquiJoin[T, β$6$], [β$7$]Coproduct[[β$8$]Const[ShiftedRead[Path[Abs, Dir, Sandboxed]], β$8$], [β$9$]Coproduct[[β$10$]Const[ShiftedRead[Path[Abs, File, Sandboxed]], β$10$], [β$11$]Coproduct[[β$12$]Const[Read[Path[Abs, Dir, Sandboxed]], β$12$], [β$13$]Coproduct[[β$14$]Const[Read[Path[Abs, File, Sandboxed]], β$14$], [β$15$]Const[DeadEnd, β$15$], β$13$], β$11$], β$9$], β$7$], β$5$], β$3$], β$1$], β$37$]], ev0: :<:[WorkflowOpCoreF, WF], ev1: RenderTree[WorkflowBuilder[WF]], ev2: Ops[WF], ev3: :<:[EX, ExprOp]): M[WorkflowBuilder[WF]]

    Permalink

  48. def selector[T[_[_]]](implicit arg0: RecursiveT[T], arg1: ShowT[T]): GAlgebra[[β$12$](T[[β$11$]MapFunc[T, β$11$]], β$12$), [β$13$]MapFunc[T, β$13$], OutputM[PartialSelector[T]]]

    Permalink

    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.

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

    Permalink
    Definition Classes
    AnyRef

  50. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  51. def unimplemented[M[_], A](label: Predef.String)(implicit merr: MonadError_[M, FileSystemError]): M[A]

    Permalink

  52. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped