pub struct SimulationGraph {
pub timelines: HashMap<ParticleID, Timeline>,
pub barriers: SlotMap<BarrierID, Barrier>,
pub callbacks: HashMap<String, BTreeSet<BarrierID>>,
}Expand description
A simulation graph consists of a timeline for every type of particle Timelines can be connected by common synchronization barriers due to mutual interactions
Fields§
§timelines: HashMap<ParticleID, Timeline>§barriers: SlotMap<BarrierID, Barrier>§callbacks: HashMap<String, BTreeSet<BarrierID>>Auto Trait Implementations§
impl Freeze for SimulationGraph
impl RefUnwindSafe for SimulationGraph
impl Send for SimulationGraph
impl Sync for SimulationGraph
impl Unpin for SimulationGraph
impl UnwindSafe for SimulationGraph
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