Planner

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 apply[T[_[_]], F[_], QS[_]](implicit P: Planner[T, F, QS]): Planner[T, F, QS]

   

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. implicit def constDeadEndPlanner[T[_[_]], F[_]](implicit arg0: PlannerErrorME[F]): Planner[T, F, [β$0$]Const[DeadEnd, β$0$]]

   

8. implicit def constReadPlanner[T[_[_]], F[_], A](implicit arg0: PlannerErrorME[F]): Planner[T, F, [β$1$]Const[Read[A], β$1$]]

   

9. implicit def constShiftedReadDirPlanner[T[_[_]], F[_]](implicit arg0: PlannerErrorME[F]): Planner[T, F, [β$2$]Const[ShiftedRead[Path[Abs, Dir, Sandboxed]], β$2$]]

   

10. 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$]]

    

11. 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$]]

    

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

    

    Definition Classes

    AnyRef

13. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

14. implicit def equiJoinPlanner[T[_[_]], F[_]](implicit arg0: BirecursiveT[T], arg1: ShowT[T], arg2: Monad[F], arg3: NameGenerator[F], arg4: PlannerErrorME[F]): Planner[T, F, [β$8$]EquiJoin[T, β$8$]]

    

15. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    AnyRef → Any

17. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

18. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

19. 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$]]

    

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

    

    Definition Classes

    AnyRef

21. final def notify(): Unit

    

    Definition Classes

    AnyRef

22. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

23. implicit def projectBucketPlanner[T[_[_]], F[_]](implicit arg0: RecursiveT[T], arg1: ShowT[T], arg2: PlannerErrorME[F]): Planner[T, F, [β$4$]ProjectBucket[T, β$4$]]

    

24. implicit def qScriptCorePlanner[T[_[_]], F[_]](implicit arg0: BirecursiveT[T], arg1: ShowT[T], arg2: Monad[F], arg3: NameGenerator[F], arg4: PlannerErrorME[F]): Planner[T, F, [β$7$]QScriptCore[T, β$7$]]

    

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

    

    Definition Classes

    AnyRef

26. implicit def thetaJoinPlanner[T[_[_]], F[_]](implicit arg0: RecursiveT[T], arg1: ShowT[T], arg2: PlannerErrorME[F]): Planner[T, F, [β$5$]ThetaJoin[T, β$5$]]

    

27. def toString(): String

    

    Definition Classes

    AnyRef → Any

28. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )