object Planner
- Source
- Planner.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Planner
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Type Members
- type H[F[_], A] = IndexedStateT[F, TraversalState, TraversalState, A]
- final case class Node(id: Int, name: String, end: Double, cost: Double, elemCost: Double, children: List[Node], batchId: Option[Int]) extends Product with Serializable
- final case class NodeTree(root: List[Node], source: Option[NodeTree] = None) extends Product with Serializable
- final case class TraversalState(id: Int, currentCost: Double) extends Product with Serializable
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[F[_]](implicit F: Applicative[F]): Planner[F]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def costForCont[F[_], G[_]](edges: PreparedStep[G, _, _], cont: Prepared[G, _])(implicit arg0: Statistics[F], arg1: Monad[F], S: Stateful[F, TraversalState]): F[List[Node]]
- def costForFields[F[_], G[_]](prepared: NonEmptyList[PreparedField[G, _]])(implicit F: Monad[F], stats: Statistics[F], S: Stateful[F, TraversalState]): F[List[Node]]
- def costForPrepared[F[_], G[_]](p: Prepared[G, _])(implicit arg0: Statistics[F], F: Monad[F], S: Stateful[F, TraversalState]): F[List[Node]]
- def costForStep[F[_], G[_]](step: PreparedStep[G, _, _], right: F[List[Node]])(implicit stats: Statistics[F], F: Monad[F], S: Stateful[F, TraversalState]): F[List[Node]]
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def getId[F[_]](implicit arg0: Applicative[F], S: Stateful[F, TraversalState]): F[Int]
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def liftStatistics[F[_]](stats: Statistics[F])(implicit arg0: Applicative[F]): Statistics[[β$0$]IndexedStateT[F, TraversalState, TraversalState, β$0$]]
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def nextId[F[_]](implicit arg0: Applicative[F], S: Stateful[F, Int]): F[Int]
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def runCostAnalysis[F[_]](f: (Statistics[[β$2$]IndexedStateT[F, TraversalState, TraversalState, β$2$]]) => H[F, List[Node]])(implicit arg0: Monad[F], arg1: Statistics[F]): F[NodeTree]
- def runCostAnalysisFor[F[_], A](f: (Statistics[[β$1$]IndexedStateT[F, TraversalState, TraversalState, β$1$]]) => H[F, A])(implicit arg0: Monad[F], stats: Statistics[F]): F[A]
- def scopeCost[F[_], A](fa: F[A])(implicit arg0: Monad[F], S: Stateful[F, TraversalState]): F[A]
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- object NodeTree extends Serializable