pub struct TileProgram { /* private fields */ }Expand description
One tile of a RhsProgram (RFC U3 §4): it reads u and aux over their
storage boxes and writes only the owned rows of du.
Send + Sync + Clone: it holds the program and plain layout data, so
tiles of one rank can share it across threads, each with its own
RhsWorkspace. It reads the forcing sets of the program it was cut
from.
Implementations§
Source§impl TileProgram
impl TileProgram
Sourcepub fn layout(&self) -> &TileLayout
pub fn layout(&self) -> &TileLayout
The tile’s input layout: every variable’s storage and owned boxes.
Sourcepub fn forcing_slots(&self) -> &[ForcingSlot]
pub fn forcing_slots(&self) -> &[ForcingSlot]
The forcing slots a set for this tile holds: the whole program’s.
Sourcepub fn new_workspace(&self) -> RhsWorkspace
pub fn new_workspace(&self) -> RhsWorkspace
Buffers for Self::eval_into.
Sourcepub fn eval_into(
&self,
u: &[f64],
aux: &[f64],
p: &[f64],
t: f64,
forcing: &ForcingSet,
du: &mut [f64],
ws: &mut RhsWorkspace,
) -> Result<(), RhsError>
pub fn eval_into( &self, u: &[f64], aux: &[f64], p: &[f64], t: f64, forcing: &ForcingSet, du: &mut [f64], ws: &mut RhsWorkspace, ) -> Result<(), RhsError>
Write the tile’s owned rows of du (RFC U3 §4): u and aux hold
every in-domain cell of their storage boxes (and, on a periodic axis,
the wrapped values of the cells outside 1..N); every other element of
du is left as the caller holds it.
Trait Implementations§
Source§impl Clone for TileProgram
impl Clone for TileProgram
Auto Trait Implementations§
impl Freeze for TileProgram
impl RefUnwindSafe for TileProgram
impl Send for TileProgram
impl Sync for TileProgram
impl Unpin for TileProgram
impl UnsafeUnpin for TileProgram
impl UnwindSafe for TileProgram
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<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.