object Planner extends Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Planner
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply[T[_[_]], F[_], QS[_]](implicit P: Planner[T, F, QS]): Planner[T, F, QS]
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- implicit def constDeadEndPlanner[T[_[_]], F[_]](implicit arg0: PlannerErrorME[F]): Planner[T, F, [β$0$]Const[DeadEnd, β$0$]]
- implicit def constReadPlanner[T[_[_]], F[_], A](implicit arg0: PlannerErrorME[F]): Planner[T, F, [β$1$]Const[Read[A], β$1$]]
- implicit def constShiftedReadDirPlanner[T[_[_]], F[_]](implicit arg0: PlannerErrorME[F]): Planner[T, F, [β$2$]Const[ShiftedRead[Path[Abs, Dir, Sandboxed]], β$2$]]
- implicit def constShiftedReadFilePlanner[T[_[_]], F[_]](implicit arg0: CorecursiveT[T], arg1: Applicative[F], arg2: NameGenerator[F]): Planner[T, F, [β$3$]Const[ShiftedRead[Path[Abs, File, Sandboxed]], β$3$]]
- implicit def coproduct[T[_[_]], N[_], F[_], G[_]](implicit F: Planner[T, N, F], G: Planner[T, N, G]): Planner[T, N, [γ$9$]Coproduct[F, G, γ$9$]]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- implicit def equiJoinPlanner[T[_[_]], F[_]](implicit arg0: BirecursiveT[T], arg1: ShowT[T], arg2: EqualT[T], arg3: Monad[F], arg4: NameGenerator[F], arg5: PlannerErrorME[F]): Planner[T, F, [β$8$]EquiJoin[T, β$8$]]
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def mapFuncPlanner[T[_[_]], F[_]](implicit arg0: BirecursiveT[T], arg1: ShowT[T], arg2: Applicative[F], arg3: Monad[F], arg4: NameGenerator[F], arg5: PlannerErrorME[F]): Planner[T, F, [β$6$]Coproduct[[β$62$]MapFuncCore[T, β$62$], [β$63$]MapFuncDerived[T, β$63$], β$6$]]
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- implicit def projectBucketPlanner[T[_[_]], F[_]](implicit arg0: RecursiveT[T], arg1: ShowT[T], arg2: PlannerErrorME[F]): Planner[T, F, [β$4$]ProjectBucket[T, β$4$]]
- implicit def qScriptCorePlanner[T[_[_]], F[_]](implicit arg0: BirecursiveT[T], arg1: ShowT[T], arg2: EqualT[T], arg3: Monad[F], arg4: NameGenerator[F], arg5: PlannerErrorME[F]): Planner[T, F, [β$7$]QScriptCore[T, β$7$]]
- def reduceFuncPlanner[T[_[_]], F[_]](implicit arg0: BirecursiveT[T], arg1: Applicative[F]): Planner[T, F, ReduceFunc]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- implicit def thetaJoinPlanner[T[_[_]], F[_]](implicit arg0: RecursiveT[T], arg1: ShowT[T], arg2: PlannerErrorME[F]): Planner[T, F, [β$5$]ThetaJoin[T, β$5$]]
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )