object
MongoDbQScriptPlanner
Type Members
-
type
GenT[X[_], A] = IndexedStateT[X, NameGen, NameGen, A]
-
type
MongoQScript[T[_[_]], A] = Coproduct[[β$75$]QScriptCore[T, β$75$], [A]Coproduct[[β$73$]EquiJoin[T, β$73$], [β$74$]Const[ShiftedRead[Path[Abs, File, Sandboxed]], β$74$], A], A]
-
type
MongoQScriptCP[T[_[_]]] = :\:[[β$75$]QScriptCore[T, β$75$], :/:[[β$73$]EquiJoin[T, β$73$], [β$74$]Const[ShiftedRead[Path[Abs, File, Sandboxed]], β$74$]]]
-
type
OutputM[A] = \/[PlannerError, A]
-
type
Partial[T[_[_]], In, Out] = (slamdata.Predef.PartialFunction[slamdata.Predef.List[In], Out], slamdata.Predef.List[InputFinder[T]])
-
type
PartialSelector[T[_[_]]] = (slamdata.Predef.PartialFunction[slamdata.Predef.List[BsonField], Selector], slamdata.Predef.List[InputFinder[T]])
-
trait
Planner[F[_]] extends AnyRef
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
HasInt[M[_], WF[_]](wb: WorkflowBuilder[WF])(implicit arg0: Monad[M], merr: MonadError_[M, FileSystemError]): M[slamdata.Predef.Long]
-
def
HasLiteral[M[_], WF[_]](wb: WorkflowBuilder[WF])(implicit arg0: Applicative[M], merr: MonadError_[M, FileSystemError]): M[Bson]
-
-
val
accumulator: (ReduceFunc[Fix[ExprOp]]) ⇒ AccumOp[Fix[ExprOp]]
-
final
def
asInstanceOf[T0]: T0
-
def
assumeReadType[M[_], T[_[_]], F[_]](typ: Type)(implicit arg0: Monad[M], arg1: BirecursiveT[T], arg2: Functor[F], merr: MonadError_[M, FileSystemError], QC: :<:[[β$71$]QScriptCore[T, β$71$], F], SR: :<:[[β$72$]Const[ShiftedRead[Path[Abs, File, Sandboxed]], β$72$], F]): (QScriptCore[T, T[F]]) ⇒ M[F[T[F]]]
-
-
def
clone(): AnyRef
-
def
createFieldName(i: slamdata.Predef.Int): slamdata.Predef.String
-
def
defaultSelector[T[_[_]]]: PartialSelector[T]
-
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]]]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
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]
-
def
expression[T[_[_]], M[_], EX[_]](funcHandler: ~>[[β$11$]MapFuncCore[T, β$11$], [β$12$]Option[Free[EX, β$12$]]])(implicit arg0: RecursiveT[T], arg1: ShowT[T], arg2: Applicative[M], arg3: Traverse[EX], merr: MonadError_[M, FileSystemError], inj: :<:[EX, ExprOp]): AlgebraM[M, [β$13$]MapFuncCore[T, β$13$], Fix[ExprOp]]
-
def
finalize(): Unit
-
def
findFirst[T[_[_]], F[_], A](f: slamdata.Predef.PartialFunction[T[F], A])(implicit arg0: RecursiveT[T], arg1: Functor[F], arg2: Foldable[F]): CoalgebraM[[β$69$]\/[A, β$69$], F, T[F]]
-
def
generateTypeCheck[In, Out](or: (Out, Out) ⇒ Out)(f: slamdata.Predef.PartialFunction[Type, (In) ⇒ Out]): (Type) ⇒ slamdata.Predef.Option[(In) ⇒ Out]
-
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]]
-
final
def
getClass(): Class[_]
-
def
getExpr[T[_[_]], M[_], EX[_]](funcHandler: ~>[[β$52$]MapFuncCore[T, β$52$], [β$53$]Option[Free[EX, β$53$]]])(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]]
-
def
getExprBuilder[T[_[_]], M[_], WF[_], EX[_]](funcHandler: ~>[[β$54$]MapFuncCore[T, β$54$], [β$55$]Option[Free[EX, β$55$]]])(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]]
-
def
getExprRed[T[_[_]], M[_], EX[_]](funcHandler: ~>[[β$62$]MapFuncCore[T, β$62$], [β$63$]Option[Free[EX, β$63$]]])(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]]
-
def
getJsFn[T[_[_]], M[_]](fm: FreeMap[T])(implicit arg0: RecursiveT[T], arg1: ShowT[T], arg2: Monad[M], merr: MonadError_[M, FileSystemError]): M[JsFn]
-
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]
-
def
getJsRed[T[_[_]], M[_]](jr: Free[[β$64$]MapFuncCore[T, β$64$], ReduceIndex])(implicit arg0: RecursiveT[T], arg1: ShowT[T], arg2: Monad[M], merr: MonadError_[M, FileSystemError]): M[JsFn]
-
def
getReduceBuilder[T[_[_]], M[_], WF[_], EX[_]](funcHandler: ~>[[β$56$]MapFuncCore[T, β$56$], [β$57$]Option[Free[EX, β$57$]]])(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]]
-
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]]
-
def
ginterpret[W[_], F[_], A, B](f: (A) ⇒ B, φ: GAlgebra[W, F, B]): GAlgebra[W, [γ$0$]CoEnv[A, F, γ$0$], B]
-
def
handleFreeMap[T[_[_]], M[_], EX[_]](funcHandler: ~>[[β$58$]MapFuncCore[T, β$58$], [β$59$]Option[Free[EX, β$59$]]], 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]
-
def
handleRedRepair[T[_[_]], M[_], EX[_]](funcHandler: ~>[[β$60$]MapFuncCore[T, β$60$], [β$61$]Option[Free[EX, β$61$]]], 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]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
javascript[T[_[_]], M[_]](implicit arg0: RecursiveT[T], arg1: ShowT[T], arg2: Applicative[M], merr: MonadError_[M, FileSystemError]): AlgebraM[M, [β$14$]MapFuncCore[T, β$14$], JsCore]
-
def
liftErr[M[_], A](meh: EitherE[A])(implicit arg0: Applicative[M], merr: MonadError_[M, FileSystemError]): M[A]
-
def
liftM[M[_], A](meh: M[A])(implicit arg0: Monad[M], merr: MonadError_[M, FileSystemError], mst: MonadState_[M, NameGen]): M[A]
-
def
log[M[_], A](label: slamdata.Predef.String, ma: M[A])(implicit arg0: Monad[M], arg1: RenderTree[A], mtell: MonadTell_[M, PhaseResults]): M[A]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
plan[T[_[_]], M[_]](logical: T[LogicalPlan], queryContext: QueryContext[M])(implicit arg0: BirecursiveT[T], arg1: EqualT[T], arg2: ShowT[T], arg3: RenderTreeT[T], arg4: Monad[M], merr: MonadError_[M, FileSystemError], mtell: MonadTell_[M, PhaseResults]): M[Crystallized[WorkflowF]]
-
def
plan0[T[_[_]], M[_], WF[_], EX[_]](listContents: ListContents[M], joinHandler: JoinHandler[WF, M], funcHandler: ~>[[β$85$]MapFuncCore[T, β$85$], [β$86$]Option[Free[EX, β$86$]]])(lp: T[LogicalPlan])(implicit arg0: BirecursiveT[T], arg1: EqualT[T], arg2: RenderTreeT[T], arg3: ShowT[T], arg4: Monad[M], arg5: Functor[WF], arg6: Coalesce[WF], arg7: Crush[WF], arg8: Crystallize[WF], arg9: 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]]
-
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]
-
def
processMapFuncExpr[T[_[_]], M[_], EX[_], A](funcHandler: ~>[[β$1$]MapFuncCore[T, β$1$], [β$2$]Option[Free[EX, β$2$]]])(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]]
-
def
rebaseWB[T[_[_]], M[_], WF[_], EX[_]](joinHandler: JoinHandler[WF, M], funcHandler: ~>[[β$65$]MapFuncCore[T, β$65$], [β$66$]Option[Free[EX, β$66$]]], 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, [β$67$]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$], β$67$]], ev0: :<:[WorkflowOpCoreF, WF], ev1: RenderTree[WorkflowBuilder[WF]], ev2: Ops[WF], ev3: :<:[EX, ExprOp]): M[WorkflowBuilder[WF]]
-
def
selector[T[_[_]]](implicit arg0: RecursiveT[T], arg1: ShowT[T]): GAlgebra[[β$16$](T[[β$15$]MapFuncCore[T, β$15$]], β$16$), [β$17$]MapFuncCore[T, β$17$], OutputM[PartialSelector[T]]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toMongoQScript[T[_[_]], M[_]](lp: T[LogicalPlan], listContents: ListContents[M])(implicit arg0: BirecursiveT[T], arg1: EqualT[T], arg2: RenderTreeT[T], arg3: ShowT[T], arg4: Monad[M], merr: MonadError_[M, FileSystemError], mtell: MonadTell_[M, PhaseResults]): M[T[[β$76$]Coproduct[[β$75$]QScriptCore[T, β$75$], [A]Coproduct[[β$73$]EquiJoin[T, β$73$], [β$74$]Const[ShiftedRead[Path[Abs, File, Sandboxed]], β$74$], A], β$76$]]]
-
def
toString(): String
-
def
unimplemented[M[_], A](label: slamdata.Predef.String)(implicit merr: MonadError_[M, FileSystemError]): M[A]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any