microsite
API
Generated with
microsite/izumi/izumi.distage/izumi.distage.planning/izumi.distage.planning.solver

izumi.distage.planning.solver

package izumi.distage.planning.solver

Members list

Type members

Classlikes

abstract class GenericSemigraphTraverse[Err](queries: GraphQueries, subcontextHandler: SubcontextHandler[Err])

Attributes

Companion
object
Supertypes
class Object
trait Matchable
class Any
object GenericSemigraphTraverse

Attributes

Companion
class
Supertypes
class Object
trait Matchable
class Any
Self type
class GraphQueries(bindingTranslator: BindingTranslator)

Attributes

Supertypes
class Object
trait Matchable
class Any
trait PlanSolver

Attributes

Companion
object
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class Impl
object PlanSolver

Attributes

Companion
trait
Supertypes
class Object
trait Matchable
class Any
Self type
PlanSolver.type
object PlanVerifier

Attributes

Companion
class
Supertypes
class Object
trait Matchable
class Any
Self type
class PlanVerifier(queries: GraphQueries)

Attributes

See also
Companion
object
Supertypes
class Object
trait Matchable
class Any
object SemigraphSolver

Attributes

Companion
trait
Supertypes
class Object
trait Matchable
class Any
Self type
trait SemigraphSolver[N, I, V]

Combined Garbage Collector, Conflict Resolver and Mutation Resolver

Combined Garbage Collector, Conflict Resolver and Mutation Resolver

Traces the graph from the roots, solves the conflicts just in time by applying the axis rules, and orders mutators in sane and predictable order.

"predecessor" stands for "a node which should be processed before its successor".

Map of predecessors is a map where the key is a dependent and the value is a set of all its direct dependencies

Attributes

Companion
object
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class SemigraphSolverImpl[N, I, V]
Generated with