Struct AssemblyAccumulator
pub struct AssemblyAccumulator { /* private fields */ }Description
Shared ordered scatter state for assembly backend implementors.
Backends may evaluate packets under any placement, but must present them here exactly once in increasing logical index order. This type owns the numerical accumulation tree used by both reference and parallel paths.
Implementations§
§impl AssemblyAccumulator
impl AssemblyAccumulator
pub fn new(plan: &AssemblyPlan) -> Result<AssemblyAccumulator, Diagnostic>
pub fn new(plan: &AssemblyPlan) -> Result<AssemblyAccumulator, Diagnostic>
Allocate one deterministic accumulator per planned target.
§Errors
Propagates invalid target shape as EQ0806.
pub const fn plan(&self) -> &AssemblyPlan
pub const fn plan(&self) -> &AssemblyPlan
Plan used to validate packet-local projections before ordered scatter.
pub fn scatter_packet(
self,
packet_index: usize,
packet: &AssemblyPacket,
) -> Result<AssemblyAccumulator, Diagnostic>
pub fn scatter_packet( self, packet_index: usize, packet: &AssemblyPacket, ) -> Result<AssemblyAccumulator, Diagnostic>
Scatter the next logical packet through the common ordered path.
§Errors
Returns EQ0806 for skipped/repeated indices, a target outside the
plan, invalid global DOFs, or non-finite accumulation.
pub fn scatter_projected(
self,
packet_index: usize,
projected: &[TargetAssemblyDelta],
) -> Result<AssemblyAccumulator, Diagnostic>
pub fn scatter_projected( self, packet_index: usize, projected: &[TargetAssemblyDelta], ) -> Result<AssemblyAccumulator, Diagnostic>
Accumulate one plan-validated projection in logical packet order.
This is the single stateful scatter path shared by serial packet assembly and backends that project packets independently.
The projection must come from Self::plan. A delta projected against
a different plan is rejected when it names a target outside this plan or
a degree of freedom outside its target, which is what a backend holding
the wrong plan produces; two structurally interchangeable plans are not
distinguished, so a caller obtains the plan from the accumulator rather
than reconstructing one.
§Errors
Returns EQ0806 for skipped/repeated indices, empty or foreign-plan
projections, invalid global DOFs, or non-finite accumulation.
pub fn finish(
self,
execution: ExecutionReport,
) -> Result<AssemblyResult, Diagnostic>
pub fn finish( self, execution: ExecutionReport, ) -> Result<AssemblyResult, Diagnostic>
Finalize all targets and attach exact execution evidence.
§Errors
Returns EQ0806 if any target has an empty structural row.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for AssemblyAccumulator
impl RefUnwindSafe for AssemblyAccumulator
impl Send for AssemblyAccumulator
impl Sync for AssemblyAccumulator
impl Unpin for AssemblyAccumulator
impl UnsafeUnpin for AssemblyAccumulator
impl UnwindSafe for AssemblyAccumulator
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
§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.