Struct SievedArray 

pub struct SievedArray<P, V> { /* private fields */ }

A generic array of values indexed by mesh points, supporting refinement and assembly.

Type Parameters

• P: Point identifier type (must convert to PointId).
• V: Value type stored for each point.

Implementations

impl<P, V> SievedArray<P, V>

where P: Into<PointId> + Copy + Eq,

pub fn atlas(&self) -> &Atlas

Access the underlying atlas for point-to-slice mapping.

pub fn try_get(&self, p: PointId) -> Result<&[V], MeshSieveError>

Get a read-only slice for the given point, or an error if not present.

pub fn try_get_mut(&mut self, p: PointId) -> Result<&mut [V], MeshSieveError>

Get a mutable slice for the given point, or an error if not present.

pub fn try_iter_in_order( &self, ) -> impl Iterator<Item = Result<(PointId, &[V]), MeshSieveError>> + '_

Fallible iterator over (PointId, &[V]) in atlas insertion order.

Complexity

O(n) to traverse, O(1) per element.

Determinism

Iteration strictly follows atlas insertion order.

pub fn iter_in_order(&self) -> impl Iterator<Item = (PointId, &[V])> + '_

Non-fallible iterator over (PointId, &[V]) in atlas insertion order.

Complexity

O(n) to traverse, O(1) per element.

Determinism

Iteration strictly follows atlas insertion order.

impl<P, V: Clone> SievedArray<P, V>

where P: Into<PointId> + Copy + Eq,

pub fn try_set(&mut self, p: PointId, val: &[V]) -> Result<(), MeshSieveError>

Set the values for the given point from a slice, or return an error if lengths mismatch or point not found.

impl<P, V: Clone + Default> SievedArray<P, V>

where P: Into<PointId> + Copy + Eq,

pub fn new(atlas: Atlas) -> Self

Create a new SievedArray with the given atlas.

pub fn try_refine_with_sifter( &mut self, coarse: &SievedArray<P, V>, refinement: &[(P, Vec<(P, Polarity)>)], ) -> Result<(), MeshSieveError>

Refine this array from a coarse array using a sifter (with orientations).

The refinement mapping must be a partial function from fine points to coarse points; any fine point appearing more than once results in [MeshSieveError::DuplicateRefinementTarget].

Complexity

O(m · k), where m is the number of fine targets and k is slice length.

Determinism

Serial: deterministic. Parallel: deterministic final state if refinement has no duplicate fine targets (duplicates are rejected). Writes occur after a read-only computation phase.

pub fn try_refine( &mut self, coarse: &SievedArray<P, V>, refinement: &[(P, Vec<P>)], ) -> Result<(), MeshSieveError>

Refine this array from a coarse array using a simple mapping (all forward), propagating errors.

Complexity

O(m · k), where m is the number of fine targets and k is slice length.

Determinism

Serial: deterministic. Parallel: deterministic final state if refinement has no duplicate fine targets (duplicates are rejected). Writes occur after a read-only computation phase.

impl<P, V> SievedArray<P, V>

where P: Into<PointId> + Copy + Eq, V: FromPrimitive + AddAssign + Div<Output = V> + Clone + Default,

pub fn try_assemble( &self, coarse: &mut SievedArray<P, V>, refinement: &[(P, Vec<P>)], ) -> Result<(), MeshSieveError>

Assemble fine data into coarse by averaging over refinement, propagating errors.

Complexity

O(m · k); performs element-wise reduction per coarse point.

Determinism

Determined by the reduction order, which is fixed by the refinement input order.

Trait Implementations

impl<P: Clone, V: Clone> Clone for SievedArray<P, V>

fn clone(&self) -> SievedArray<P, V>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<P: Debug, V: Debug> Debug for SievedArray<P, V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.