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] = (slamdata.Predef.PartialFunction[slamdata.Predef.List[In], Out], slamdata.Predef.List[InputFinder[T]])

    Permalink

  4. type PartialSelector[T[_[_]]] = (slamdata.Predef.PartialFunction[slamdata.Predef.List[BsonField], Selector], slamdata.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[slamdata.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: :<:[[β$41$]QScriptCore[T, β$41$], F], SR: :<:[[β$42$]Const[ShiftedRead[Path[Abs, File, Sandboxed]], β$42$], F]): (QScriptCore[T, T[F]]) ⇒ M[F[T[F]]]

    Permalink

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

    Permalink

  11. def clone(): AnyRef

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

  12. def createFieldName(i: slamdata.Predef.Int): slamdata.Predef.String

    Permalink

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

    Permalink

  14. def elideMoreGeneralGuards[M[_], T[_[_]]](subType: Type)(implicit arg0: Applicative[M], arg1: RecursiveT[T], merr: MonadError_[M, FileSystemError]): (CoEnvMap[T, FreeMap[T]]) ⇒ M[CoEnvMap[T, FreeMap[T]]]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  16. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

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

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

  19. def finalize(): Unit

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

  20. def findFirst[T[_[_]], F[_], A](f: slamdata.Predef.PartialFunction[T[F], A])(implicit arg0: RecursiveT[T], arg1: Functor[F], arg2: Foldable[F]): CoalgebraM[[β$39$]\/[A, β$39$], F, T[F]]

    Permalink

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

    Permalink

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

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

    Permalink
    Definition Classes
    AnyRef → Any

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

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

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

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

    Permalink

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

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

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

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

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

    Permalink

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

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

  35. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  36. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

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

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

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

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  42. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  43. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

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

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

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

  48. def rebaseWB[T[_[_]], M[_], WF[_], EX[_]](joinHandler: JoinHandler[WF, M], funcHandler: FuncHandler[T, EX], free: FreeQS[T], src: WorkflowBuilder[WF])(implicit arg0: EqualT[T], arg1: Monad[M], arg2: Functor[WF], arg3: Coalesce[WF], arg4: Crush[WF], arg5: Crystallize[WF], arg6: 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

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

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

    Permalink
    Definition Classes
    AnyRef

  51. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink

  53. final def wait(): Unit

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

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

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped