gql-core/gql/Planner

Planner

object Planner
Companion:
class
Source:
Planner.scala
class Object
trait Matchable
class Any
Planner.type

Type members

Classlikes

final case class Node(id: Int, name: String, end: Double, cost: Double, elemCost: Double, children: List[Node], batchId: Option[Int])
final case class NodeTree(root: List[Node], source: Option[NodeTree])
Companion:
object
Source:
Planner.scala
object NodeTree
Companion:
class
Source:
Planner.scala
final case class TraversalState(id: Int, currentCost: Double)

Types

type H[F[_], A] = StateT[F, TraversalState, A]

Value members

Concrete methods

def apply[F[_]](implicit F: Applicative[F]): Planner[F]
def costForCont[F[_] : Monad, G[_]](edges: PreparedStep[G, _, _], cont: Prepared[G, _])(implicit evidence$5: Statistics[F], evidence$6: 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[_] : Statistics, G[_]](p: Prepared[G, _])(implicit evidence$4: 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]]
def getId[F[_] : Applicative](implicit evidence$2: Applicative[F], S: Stateful[F, TraversalState]): F[Int]
def liftStatistics[F[_] : Applicative](stats: Statistics[F]): Statistics[[_] =>> H[F, _$24]]
def nextId[F[_] : Applicative](implicit evidence$3: Applicative[F], S: Stateful[F, Int]): F[Int]
def runCostAnalysis[F[_] : Statistics](f: Statistics[[_] =>> H[F, _$28]] => H[F, List[Node]]): F[NodeTree]
def runCostAnalysisFor[F[_] : Monad, A](f: Statistics[[_] =>> H[F, _$26]] => H[F, A])(implicit evidence$8: Monad[F], stats: Statistics[F]): F[A]
def scopeCost[F[_] : Monad, A](fa: F[A])(implicit evidence$1: Monad[F], S: Stateful[F, TraversalState]): F[A]