Struct LocalCsrShard
pub struct LocalCsrShard<'a> { /* private fields */ }Description
Borrowed pairing of one canonical local layout and its owned-row CSR data.
DistributedCsr owns each LocalLayout exactly once. This view keeps
shard action convenient without cloning that identity-bearing layout into
the numerical storage.
Implementations§
§impl<'a> LocalCsrShard<'a>
impl<'a> LocalCsrShard<'a>
pub const fn layout(&self) -> &LocalLayout
pub const fn layout(&self) -> &LocalLayout
Owned/ghost vector layout used by this shard.
pub fn same_origin(self, other: LocalCsrShard<'a>) -> bool
pub fn same_origin(self, other: LocalCsrShard<'a>) -> bool
Whether two views borrow the exact same sealed layout and CSR storage.
This process-local authority check is intentionally distinct from structural equality and from durable algebraic identity. A repeated solver action can prove it received the admitted objects in constant time without walking resident coefficients; an equal clone is not the same origin.
pub fn capture_execution(
self,
) -> Result<LocalCsrExecutionCapture<'a>, Diagnostic>
pub fn capture_execution( self, ) -> Result<LocalCsrExecutionCapture<'a>, Diagnostic>
Capture a backend-independent rectangular CSR execution projection.
Every global column is deterministically remapped into a local input
ordered as [owned | ghost]. Rows, values, and layout identity remain
derived from this accepted shard; the capture owns only the local
remap and its exact coefficient permutation.
§Errors
Returns EQ0807 if the shard and layout disagree, the CSR shape is not
canonical, or a global column is absent from both owned and ghost maps.
pub fn apply(
&self,
owned: &[f64],
ghosts: &[f64],
output: &mut [f64],
) -> Result<(), Diagnostic>
pub fn apply( &self, owned: &[f64], ghosts: &[f64], output: &mut [f64], ) -> Result<(), Diagnostic>
Apply owned rows from owned and already-exchanged ghost values.
Inputs and output use the exact ascending orders in LocalLayout.
§Errors
Returns EQ0802 for shape/non-finite values or an internally missing
local/ghost column.
pub fn diagonal(
&self,
output: &mut [f64],
) -> Result<DiagonalAvailability, Diagnostic>
pub fn diagonal( &self, output: &mut [f64], ) -> Result<DiagonalAvailability, Diagnostic>
Write diagonal entries for the owned rows in local-layout order.
§Errors
Returns EQ0802 when output does not match the owned-row extent.
Trait Implementations§
§impl<'a> Clone for LocalCsrShard<'a>
impl<'a> Clone for LocalCsrShard<'a>
§impl<'a> Debug for LocalCsrShard<'a>
impl<'a> Debug for LocalCsrShard<'a>
§impl<'a> PartialEq for LocalCsrShard<'a>
impl<'a> PartialEq for LocalCsrShard<'a>
§fn eq(&self, other: &LocalCsrShard<'a>) -> bool
fn eq(&self, other: &LocalCsrShard<'a>) -> bool
self and other values to be equal, and is used by ==.impl<'a> Copy for LocalCsrShard<'a>
impl<'a> StructuralPartialEq for LocalCsrShard<'a>
Auto Trait Implementations§
impl<'a> Freeze for LocalCsrShard<'a>
impl<'a> RefUnwindSafe for LocalCsrShard<'a>
impl<'a> Send for LocalCsrShard<'a>
impl<'a> Sync for LocalCsrShard<'a>
impl<'a> Unpin for LocalCsrShard<'a>
impl<'a> UnsafeUnpin for LocalCsrShard<'a>
impl<'a> UnwindSafe for LocalCsrShard<'a>
Blanket Implementations§
Source§impl<T> Any for Twhere
T: 'static + ?Sized,
impl<T> Any for Twhere
T: 'static + ?Sized,
§impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
§fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
§impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
§type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
§fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
Source§impl<T> Borrow<T> for Twhere
T: ?Sized,
impl<T> Borrow<T> for Twhere
T: ?Sized,
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T, Dst> ConvAsUtil<Dst> for T
impl<T, Dst> ConvAsUtil<Dst> for T
§fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
§impl<T> ConvUtil for T
impl<T> ConvUtil for T
§fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
§fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
§fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
§fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> Twhere
Self: Distribution<T>,
Source§impl<T> From<T> for T
impl<T> From<T> for T
Source§impl<T, U> Into<U> for Twhere
U: From<T>,
impl<T, U> Into<U> for Twhere
U: From<T>,
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>
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>where
F: FnOnce(&Self) -> bool,
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where
F: FnOnce(&Self) -> bool,
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§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> Same for T
impl<T> Same for T
§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>
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.