cellular_raza_concepts

Struct DecomposedDomain

Source 
pub struct DecomposedDomain<I, S, C> {
    pub n_subdomains: NonZeroUsize,
    pub index_subdomain_cells: Vec<(I, S, Vec<C>)>,
    pub neighbor_map: BTreeMap<I, BTreeSet<I>>,
    pub rng_seed: u64,
}
Expand description

Generated by the decompose method. The backend will know how to deal with this type and crate a working simulation from it.

Fields§

§n_subdomains: NonZeroUsize

Number of spawned SubDomains. This number is guaranteed to be smaller or equal to the number may be different to the one given to the Domain::decompose method. Such behaviour can result from not being able to construct as many subdomains as desired. Note that this function will attempt to construct more SubDomains than available CPUs if given a larger number.

§index_subdomain_cells: Vec<(I, S, Vec<C>)>

Vector containing properties of individual SubDomains. Entries are Domain::SubDomainIndex, SubDomain, and a vector of cells.

§neighbor_map: BTreeMap<I, BTreeSet<I>>

Encapsulates how the subdomains are linked to each other. Eg. two subdomains without any boundary will never appear in each others collection of neighbors. For the future, we might opt to change to an undirected graph rather than a BTreeMap.

§rng_seed: u64

Initial seed of the simulation for random number generation.

Auto Trait Implementations§

§

impl<I, S, C> Freeze for DecomposedDomain<I, S, C>

§

impl<I, S, C> RefUnwindSafe for DecomposedDomain<I, S, C>
where I: RefUnwindSafe, S: RefUnwindSafe, C: RefUnwindSafe,

§

impl<I, S, C> Send for DecomposedDomain<I, S, C>
where I: Send, S: Send, C: Send,

§

impl<I, S, C> Sync for DecomposedDomain<I, S, C>
where I: Sync, S: Sync, C: Sync,

§

impl<I, S, C> Unpin for DecomposedDomain<I, S, C>
where I: Unpin, S: Unpin, C: Unpin,

§

impl<I, S, C> UnwindSafe for DecomposedDomain<I, S, C>
where I: RefUnwindSafe + UnwindSafe, S: UnwindSafe, C: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V