PlannerInstances

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. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

6. implicit def constDataPlanner[M[_], FMT](implicit arg0: Monad[M], SP: StructuralPlanner[M, FMT]): Planner[M, FMT, [β$3$]Const[Data, β$3$]]

   

7. implicit def constDeadEnd[F[_], FMT](implicit arg0: MonadPlanErr[F]): Planner[F, FMT, [β$16$]Const[DeadEnd, β$16$]]

   

   Definition Classes

   PlannerInstances1

8. implicit def constReadDir[F[_], FMT](implicit arg0: MonadPlanErr[F]): Planner[F, FMT, [β$18$]Const[Read[Path[Abs, Dir, Sandboxed]], β$18$]]

   

   Definition Classes

   PlannerInstances1

9. implicit def constReadFile[F[_], FMT](implicit arg0: Applicative[F], arg1: SearchOptions[FMT]): Planner[F, FMT, [β$6$]Const[Read[Path[Abs, File, Sandboxed]], β$6$]]

   

   Definition Classes

   PlannerInstances1

10. implicit def constShiftedReadDir[F[_], FMT](implicit arg0: Monad[F], arg1: QNameGenerator[F], arg2: PrologW[F], arg3: MonadPlanErr[F], arg4: SearchOptions[FMT], SP: StructuralPlanner[F, FMT]): Planner[F, FMT, [β$7$]Const[ShiftedRead[Path[Abs, Dir, Sandboxed]], β$7$]]

    

    Definition Classes

    PlannerInstances1

11. implicit def constShiftedReadFile[F[_], FMT](implicit arg0: MonadPlanErr[F]): Planner[F, FMT, [β$20$]Const[ShiftedRead[Path[Abs, File, Sandboxed]], β$20$]]

    

    Definition Classes

    PlannerInstances1

12. implicit def coproduct[M[_], FMT, F[_], G[_]](implicit F: Lazy[Planner[M, FMT, F]], G: Lazy[Planner[M, FMT, G]]): Planner[M, FMT, [γ$0$]Coproduct[F, G, γ$0$]]

    

13. implicit def eitherTPlanner[M[_], FMT, F[_], E](implicit arg0: Functor[M], P: Planner[M, FMT, F]): Planner[[γ$26$]EitherT[M, E, γ$26$], FMT, F]

    

    Definition Classes

    PlannerInstances2

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

    

    Definition Classes

    AnyRef

15. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

16. implicit def equiJoin[F[_], FMT, T[_[_]]](implicit arg0: MonadPlanErr[F]): Planner[F, FMT, [β$22$]EquiJoin[T, β$22$]]

    

    Definition Classes

    PlannerInstances1

17. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    AnyRef → Any

19. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

20. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

21. implicit def mapFunc[M[_], FMT, T[_[_]]](implicit arg0: Monad[M], arg1: QNameGenerator[M], arg2: PrologW[M], arg3: MonadPlanErr[M], arg4: RecursiveT[T], DP: Planner[M, FMT, [β$4$]Const[Data, β$4$]], SP: StructuralPlanner[M, FMT]): Planner[M, FMT, [β$5$]MapFunc[T, β$5$]]

    

    Definition Classes

    PlannerInstances0

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

    

    Definition Classes

    AnyRef

23. final def notify(): Unit

    

    Definition Classes

    AnyRef

24. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

25. implicit def projectBucket[F[_], FMT, T[_[_]]](implicit arg0: MonadPlanErr[F]): Planner[F, FMT, [β$24$]ProjectBucket[T, β$24$]]

    

    Definition Classes

    PlannerInstances1

26. implicit def qScriptCore[F[_], FMT, T[_[_]]](implicit arg0: Monad[F], arg1: QNameGenerator[F], arg2: PrologW[F], arg3: MonadPlanErr[F], arg4: BirecursiveT[T], SP: StructuralPlanner[F, FMT], QTP: Lazy[Planner[F, FMT, [β$8$]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$], β$8$]]], MFP: Planner[F, FMT, [β$9$]MapFunc[T, β$9$]]): Planner[F, FMT, [β$10$]QScriptCore[T, β$10$]]

    

    Definition Classes

    PlannerInstances1

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

    

    Definition Classes

    AnyRef

28. implicit def thetaJoin[F[_], FMT, T[_[_]]](implicit arg0: Monad[F], arg1: QNameGenerator[F], arg2: RecursiveT[T], QTP: Lazy[Planner[F, FMT, [β$12$]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$], β$12$]]], MFP: Planner[F, FMT, [β$13$]MapFunc[T, β$13$]]): Planner[F, FMT, [β$14$]ThetaJoin[T, β$14$]]

    

    Definition Classes

    PlannerInstances1

29. def toString(): String

    

    Definition Classes

    AnyRef → Any

30. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

33. implicit def writerTPlanner[M[_], FMT, F[_], W](implicit arg0: Functor[M], arg1: Monoid[W], P: Planner[M, FMT, F]): Planner[[γ$29$]WriterT[M, W, γ$29$], FMT, F]

    

    Definition Classes

    PlannerInstances2