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[M[_], FMT, F[_]](implicit ev: Planner[M, FMT, F]): Planner[M, FMT, F]

   

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 constDataPlanner[M[_], FMT](implicit arg0: Monad[M], SP: StructuralPlanner[M, FMT]): Planner[M, FMT, [β$3$]Const[Data, β$3$]]

   

   Definition Classes

   PlannerInstances

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

   

   Definition Classes

   PlannerInstances1

9. implicit def constRead[F[_], FMT](implicit arg0: MonadPlanErr[F]): Planner[F, FMT, [β$15$]Const[Read, β$15$]]

   

   Definition Classes

   PlannerInstances1

10. implicit def constShiftedRead[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, [β$9$]Const[ShiftedRead, β$9$]]

    

    Definition Classes

    PlannerInstances1

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

    

    Definition Classes

    PlannerInstances

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

    

    Definition Classes

    PlannerInstances2

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

    

    Definition Classes

    AnyRef

14. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

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

    

    Definition Classes

    PlannerInstances1

16. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    AnyRef → Any

18. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

19. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

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

    

    Definition Classes

    AnyRef

22. final def notify(): Unit

    

    Definition Classes

    AnyRef

23. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

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

    

    Definition Classes

    PlannerInstances1

25. 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, [β$6$]Coproduct[[β$6$]QScriptCore[T, β$6$], [A]Coproduct[[β$0$]ProjectBucket[T, β$0$], [A]Coproduct[[β$5$]ThetaJoin[T, β$5$], [A]Coproduct[[β$1$]EquiJoin[T, β$1$], [A]Coproduct[[β$4$]Const[ShiftedRead, β$4$], [A]Coproduct[[β$2$]Const[Read, β$2$], [β$3$]Const[DeadEnd, β$3$], A], A], A], A], A], β$6$]]], MFP: Planner[F, FMT, [β$7$]MapFunc[T, β$7$]]): Planner[F, FMT, [β$8$]QScriptCore[T, β$8$]]

    

    Definition Classes

    PlannerInstances1

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

    

    Definition Classes

    AnyRef

27. implicit def thetaJoin[F[_], FMT, T[_[_]]](implicit arg0: Monad[F], arg1: QNameGenerator[F], arg2: RecursiveT[T], QTP: Lazy[Planner[F, FMT, [β$10$]Coproduct[[β$6$]QScriptCore[T, β$6$], [A]Coproduct[[β$0$]ProjectBucket[T, β$0$], [A]Coproduct[[β$5$]ThetaJoin[T, β$5$], [A]Coproduct[[β$1$]EquiJoin[T, β$1$], [A]Coproduct[[β$4$]Const[ShiftedRead, β$4$], [A]Coproduct[[β$2$]Const[Read, β$2$], [β$3$]Const[DeadEnd, β$3$], A], A], A], A], A], β$10$]]], MFP: Planner[F, FMT, [β$11$]MapFunc[T, β$11$]]): Planner[F, FMT, [β$12$]ThetaJoin[T, β$12$]]

    

    Definition Classes

    PlannerInstances1

28. def toString(): String

    

    Definition Classes

    AnyRef → Any

29. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    PlannerInstances2