pub struct PlannerInput<'a> {
pub graph: Graph,
pub registry: &'a Registry,
}Expand description
Input to the planner: a graph plus registry reference.
use daedalus_planner::{PlannerInput, Graph};
use daedalus_registry::store::Registry;
let registry = Registry::new();
let input = PlannerInput { graph: Graph::default(), registry: ®istry };
assert_eq!(input.graph.nodes.len(), 0);Fields§
§graph: Graph§registry: &'a RegistryTrait Implementations§
Source§impl<'a> Clone for PlannerInput<'a>
impl<'a> Clone for PlannerInput<'a>
Source§fn clone(&self) -> PlannerInput<'a>
fn clone(&self) -> PlannerInput<'a>
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl<'a> Freeze for PlannerInput<'a>
impl<'a> !RefUnwindSafe for PlannerInput<'a>
impl<'a> Send for PlannerInput<'a>
impl<'a> Sync for PlannerInput<'a>
impl<'a> Unpin for PlannerInput<'a>
impl<'a> !UnwindSafe for PlannerInput<'a>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more