pub struct IterationState {
pub liquid: HydroState,
pub gas: Option<HydroState>,
pub liquid_neighors: Array2<usize>,
pub liquid_cumulative_probability: Array2<f64>,
pub misc: HashMap<String, Vec<f64>>,
}Fields§
§liquid: HydroState§gas: Option<HydroState>§liquid_neighors: Array2<usize>§liquid_cumulative_probability: Array2<f64>§misc: HashMap<String, Vec<f64>>Implementations§
Auto Trait Implementations§
impl Freeze for IterationState
impl RefUnwindSafe for IterationState
impl Send for IterationState
impl Sync for IterationState
impl Unpin for IterationState
impl UnsafeUnpin for IterationState
impl UnwindSafe for IterationState
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
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.