pub struct CompositionGraph {
pub composition_id: String,
pub nodes: HashMap<String, CompositionNode>,
pub edges: HashMap<String, Vec<String>>,
pub metadata: HashMap<String, String>,
}Expand description
Composition graph for complex component relationships
Fields§
§composition_id: StringGraph identifier
nodes: HashMap<String, CompositionNode>Component nodes
edges: HashMap<String, Vec<String>>Component edges (dependencies)
metadata: HashMap<String, String>Graph metadata
Trait Implementations§
Source§impl Clone for CompositionGraph
impl Clone for CompositionGraph
Source§fn clone(&self) -> CompositionGraph
fn clone(&self) -> CompositionGraph
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 Freeze for CompositionGraph
impl RefUnwindSafe for CompositionGraph
impl Send for CompositionGraph
impl Sync for CompositionGraph
impl Unpin for CompositionGraph
impl UnwindSafe for CompositionGraph
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more