Skip to main content

SpectralAnalysis

Struct SpectralAnalysis 

Source
pub struct SpectralAnalysis;
Expand description

Spectral processing and analysis utilities.

Implementations§

Source§

impl SpectralAnalysis

Source

pub fn find_peaks( record: &SpectrumRecord, window: usize, threshold: f64, ) -> Vec<PeakResult>

Find peaks in the Y array using a simple local-maximum criterion.

A point is a peak if it is strictly greater than its window neighbours on each side and above the given threshold.

Source

pub fn als_baseline(y: &[f64], lam: f64, p: f64, iterations: usize) -> Vec<f64>

Asymmetric Least Squares (ALS) baseline correction.

Returns the corrected Y array (input Y minus estimated baseline).

§Parameters
  • y — input intensity array.
  • lam — smoothing parameter (typically 1e4 – 1e7).
  • p — asymmetry parameter (typically 0.001 – 0.1).
  • iterations — number of ALS iterations (typically 10–30).
Source

pub fn savitzky_golay(y: &[f64], window: SgWindow) -> Vec<f64>

Savitzky-Golay smoothing filter applied to Y values.

Uses a 2nd-order polynomial over the given window. Returns the smoothed Y array (same length as input).

Source

pub fn moving_average(y: &[f64], half_window: usize) -> Vec<f64>

Simple moving-average smoothing.

The output at index i is the average of y[i-half..=i+half]. Boundary points are left unchanged.

Source

pub fn derivative(record: &SpectrumRecord) -> Vec<f64>

Compute the first derivative of Y with respect to X using central differences.

Boundary points use one-sided differences.

Source

pub fn integrate(record: &SpectrumRecord, x_start: f64, x_end: f64) -> f64

Integrate the spectrum using the trapezoidal rule between x_start and x_end.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.