Struct ShiftRegistrationResult 

#[non_exhaustive]
pub struct ShiftRegistrationResult {
    pub registered_data: FdMatrix,
    pub shifts: Vec<f64>,
}

Result of least-squares shift (rigid horizontal) registration.

Each curve fᵢ is shifted by shifts[i] and re-evaluated at the original argvals grid via linear interpolation with boundary clamping.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

registered_data: FdMatrix

Registered (shifted) functional data matrix (n × m).

registered_data[(i, j)] equals linear_interp(argvals, row_i, argvals[j] − shifts[i]).

shifts: Vec<f64>

Per-curve horizontal shifts δᵢ (length n).

Positive δᵢ shifts the curve to the right (later in time); negative δᵢ shifts the curve to the left.

Trait Implementations

impl Clone for ShiftRegistrationResult

fn clone(&self) -> ShiftRegistrationResult

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ShiftRegistrationResult

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

Formats the value using the given formatter.

impl PartialEq for ShiftRegistrationResult

fn eq(&self, other: &ShiftRegistrationResult) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for ShiftRegistrationResult