gql-core
0.1-1a4792a
API
Generated with
gql-core/gql/Planner

Planner

gql.Planner$
See thePlanner companion trait
object Planner

Attributes

Companion:
trait
Source:
Planner.scala
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
Planner.type

Members list

Concise view

Type members

Classlikes

final case class BatchRef[K, V](batcherId: BatchKey[K, V], uniqueNodeId: UniqueBatchInstance[K, V])

Attributes

Source:
Planner.scala
Graph
Supertypes
trait Product
trait Equals
class Object
trait Matchable
class Any
final case class Node(id: NodeId, name: String, cost: Double, elemCost: Double, parents: Set[NodeId], batchId: Option[BatchRef[_, _]])

Attributes

Source:
Planner.scala
Graph
Supertypes
trait Product
trait Equals
class Object
trait Matchable
class Any
final case class NodeId(id: Int) extends AnyVal

Attributes

Companion:
object
Source:
Planner.scala
Graph
Supertypes
trait Product
trait Equals
class AnyVal
trait Matchable
class Any
object NodeId

Attributes

Companion:
class
Source:
Planner.scala
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
NodeId.type
final case class NodeTree(all: List[Node], endTimes: EndTimes, source: Option[NodeTree])

Attributes

Companion:
object
Source:
Planner.scala
Graph
Supertypes
trait Product
trait Equals
class Object
trait Matchable
class Any
object NodeTree

Attributes

Companion:
class
Source:
Planner.scala
Graph
Supertypes
trait Product
trait Mirror
class Object
trait Matchable
class Any
Self type
final case class TraversalState(id: Int, parents: Set[NodeId], nodes: Chain[Node])

Attributes

Source:
Planner.scala
Graph
Supertypes
trait Product
trait Equals
class Object
trait Matchable
class Any

Types

type EndTimes = Map[NodeId, Double]

Attributes

Source:
Planner.scala
type H[F[_], A] = StateT[F, TraversalState, A]

Attributes

Source:
Planner.scala

Value members

Concrete methods

def addNode[F[_]](node: Node)(implicit S: Stateful[F, TraversalState]): F[Unit]

Attributes

Source:
Planner.scala
def addNodes[F[_]](nodes: Chain[Node])(implicit S: Stateful[F, TraversalState]): F[Unit]

Attributes

Source:
Planner.scala
def apply[F[_]](implicit F: Applicative[F]): Planner[F]

Attributes

Source:
Planner.scala
def costForCont[F[_] : Monad, G[_]](edges: PreparedStep[G, _, _], cont: Prepared[G, _])(implicit evidence$3: Statistics[F], evidence$4: Monad[F], S: Stateful[F, TraversalState]): F[Unit]

Attributes

Source:
Planner.scala
def costForFields[F[_], G[_]](prepared: NonEmptyList[PreparedField[G, _]])(implicit F: Monad[F], stats: Statistics[F], S: Stateful[F, TraversalState]): F[Unit]

Attributes

Source:
Planner.scala
def costForPrepared[F[_] : Statistics, G[_]](p: Prepared[G, _])(implicit evidence$2: Statistics[F], F: Monad[F], S: Stateful[F, TraversalState]): F[Unit]

Attributes

Source:
Planner.scala
def costForStep[F[_], G[_]](step: PreparedStep[G, _, _])(implicit stats: Statistics[F], F: Monad[F], S: Stateful[F, TraversalState]): F[Unit]

Attributes

Source:
Planner.scala
def getId[F[_] : Applicative](implicit evidence$1: Applicative[F], S: Stateful[F, TraversalState]): F[NodeId]

Attributes

Source:
Planner.scala
def liftStatistics[F[_] : Applicative](stats: Statistics[F]): Statistics[[_] =>> H[F, _$23]]

Attributes

Source:
Planner.scala
def runCostAnalysis[F[_] : Statistics, A](f: Statistics[[_] =>> H[F, _$27]] => H[F, A]): F[NodeTree]

Attributes

Source:
Planner.scala
def runCostAnalysisFor[F[_] : Monad, A](f: Statistics[[_] =>> H[F, _$25]] => H[F, A])(implicit evidence$6: Monad[F], stats: Statistics[F]): F[A]

Attributes

Source:
Planner.scala
def setParents[F[_]](parents: Set[NodeId])(implicit S: Stateful[F, TraversalState]): F[Unit]

Attributes

Source:
Planner.scala
Generated with