Trait ChildPhases 

pub trait ChildPhases<S, D>
where
    S: PlanningSolution,
    D: Director<S>,
{
    // Required method
    fn solve_all(&mut self, solver_scope: &mut SolverScope<'_, S, D>);
}

Trait for child phases that can solve a partition.

Implemented for tuples of phases via macro.

Required Methods

fn solve_all(&mut self, solver_scope: &mut SolverScope<'_, S, D>)

Implementations on Foreign Types

impl<S, D, P0> ChildPhases<S, D> for (P0,)

where S: PlanningSolution, D: Director<S>, P0: Phase<S, D>,

fn solve_all(&mut self, solver_scope: &mut SolverScope<'_, S, D>)

impl<S, D, P0, P1> ChildPhases<S, D> for (P0, P1)

where S: PlanningSolution, D: Director<S>, P0: Phase<S, D>, P1: Phase<S, D>,

fn solve_all(&mut self, solver_scope: &mut SolverScope<'_, S, D>)

impl<S, D, P0, P1, P2> ChildPhases<S, D> for (P0, P1, P2)

where S: PlanningSolution, D: Director<S>, P0: Phase<S, D>, P1: Phase<S, D>, P2: Phase<S, D>,

fn solve_all(&mut self, solver_scope: &mut SolverScope<'_, S, D>)

impl<S, D, P0, P1, P2, P3> ChildPhases<S, D> for (P0, P1, P2, P3)

where S: PlanningSolution, D: Director<S>, P0: Phase<S, D>, P1: Phase<S, D>, P2: Phase<S, D>, P3: Phase<S, D>,

fn solve_all(&mut self, solver_scope: &mut SolverScope<'_, S, D>)

impl<S, D, P0, P1, P2, P3, P4> ChildPhases<S, D> for (P0, P1, P2, P3, P4)

where S: PlanningSolution, D: Director<S>, P0: Phase<S, D>, P1: Phase<S, D>, P2: Phase<S, D>, P3: Phase<S, D>, P4: Phase<S, D>,

fn solve_all(&mut self, solver_scope: &mut SolverScope<'_, S, D>)

impl<S, D, P0, P1, P2, P3, P4, P5> ChildPhases<S, D> for (P0, P1, P2, P3, P4, P5)

where S: PlanningSolution, D: Director<S>, P0: Phase<S, D>, P1: Phase<S, D>, P2: Phase<S, D>, P3: Phase<S, D>, P4: Phase<S, D>, P5: Phase<S, D>,

fn solve_all(&mut self, solver_scope: &mut SolverScope<'_, S, D>)

impl<S, D, P0, P1, P2, P3, P4, P5, P6> ChildPhases<S, D> for (P0, P1, P2, P3, P4, P5, P6)

where S: PlanningSolution, D: Director<S>, P0: Phase<S, D>, P1: Phase<S, D>, P2: Phase<S, D>, P3: Phase<S, D>, P4: Phase<S, D>, P5: Phase<S, D>, P6: Phase<S, D>,

fn solve_all(&mut self, solver_scope: &mut SolverScope<'_, S, D>)

impl<S, D, P0, P1, P2, P3, P4, P5, P6, P7> ChildPhases<S, D> for (P0, P1, P2, P3, P4, P5, P6, P7)

where S: PlanningSolution, D: Director<S>, P0: Phase<S, D>, P1: Phase<S, D>, P2: Phase<S, D>, P3: Phase<S, D>, P4: Phase<S, D>, P5: Phase<S, D>, P6: Phase<S, D>, P7: Phase<S, D>,

fn solve_all(&mut self, solver_scope: &mut SolverScope<'_, S, D>)

Implementors