pub struct GraphInput {
pub nodes: Vec<GraphNodeInput>,
pub edges: Vec<GraphEdgeInput>,
}Fields§
§nodes: Vec<GraphNodeInput>§edges: Vec<GraphEdgeInput>Implementations§
Source§impl GraphInput
impl GraphInput
pub fn build_sddp_graph( &self, system_input: &SystemInput, ) -> Result<DirectedGraph<NodeData>, String>
Trait Implementations§
Source§impl<'de> Deserialize<'de> for GraphInput
impl<'de> Deserialize<'de> for GraphInput
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations§
impl Freeze for GraphInput
impl RefUnwindSafe for GraphInput
impl Send for GraphInput
impl Sync for GraphInput
impl Unpin for GraphInput
impl UnwindSafe for GraphInput
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> 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