WaveSet

Struct WaveSet 

Source
pub(crate) struct WaveSet {
    basis: MultipoleBasis,
    ks: [Complex; 2],
    helicity: bool,
    radial: Radial,
    normalizations: Vec<Complex>,
    radial_table_len: usize,
    harmonic_tables: Vec<Option<SolidTable>>,
    radial_ranges: Vec<Option<(u32, u32)>>,
}
Expand description

Evaluates the waves of a multipole basis at any point, for one pair of medium wavenumbers, polarization convention and radial kind.

Fields§

§basis: MultipoleBasis§ks: [Complex; 2]§helicity: bool§radial: Radial§normalizations: Vec<Complex>

Point-independent normalization of each spherical mode; empty for cylinders.

§radial_table_len: usize

Scaled radial functions cached per position and wavenumber: the largest spherical degree plus three, or zero for cylinders.

§harmonic_tables: Vec<Option<SolidTable>>

Dense harmonic recurrences per (position, wavenumber). Sparse mode sets and interleaved centres use single harmonics instead of repeatedly filling tables.

§radial_ranges: Vec<Option<(u32, u32)>>

Degree ranges whose outgoing radial values share one Hankel sequence, selected independently of mode order so column permutations retain the same values.

Implementations§

Source§

impl WaveSet

Source

fn write_state(&self, writer: &mut Writer)

Source

fn read_state(reader: &mut Reader<'_>) -> Result<Self>

Rebuild only basis-dependent normalization and recurrence plans. Sampling values and derivatives remains the responsibility of the later operation.

Source

pub(crate) fn new( basis: MultipoleBasis, ks: [Complex; 2], helicity: bool, radial: Radial, ) -> Result<Self>

Source

fn of_valid_basis( basis: MultipoleBasis, ks: [Complex; 2], helicity: bool, radial: Radial, ) -> Result<Self>

Self::new for a basis that has passed validate.

Source

pub(crate) fn cache<const N: usize>(&self) -> SampleCache<N>

Source

fn wavenumber(&self, pol: u8) -> usize

Index of the wavenumber of polarization pol; equal wavenumbers share one.

Source

pub(crate) fn wave<const N: usize>( &self, i: usize, point: [f64; 3], cache: &mut SampleCache<N>, ) -> Result<(VectorWave, [Complex; 3])>

Wave i at point and, for cylindrical waves at level WITH_AXIAL, its axial-wavenumber derivative. Derivatives are evaluated only above VALUES.

Source

fn cached_parts<const N: usize>( &self, pidx: usize, wavenumber: usize, mode: Mode, point: [f64; 3], cache: &mut SampleCache<N>, ) -> Result<[VectorWave; 2]>

The spherical parts of mode at point from the cached radial functions and a scaled solid harmonic. It rejects what spherical_wave rejects: a wavenumber whose square underflows and a relative position that overflows.

Source

fn sampled_operator<const N: usize>( &self, points: &[[f64; 3]], value: impl Fn(usize, usize, VectorWave, [Complex; 3]) -> [Complex; 3] + Sync, ) -> Result<DMatrix<Complex>>

Sample an operator with shared radial and harmonic work per point. Both the primal and its pushforward write directly into column-major storage.

Source

fn pullback<const N: usize>( &self, points: &[[f64; 3]], coefficients: Option<&[Complex]>, cotangent: impl Fn(usize, usize) -> [Complex; 3] + Sync, ) -> Result<(FieldGradient, Vec<f64>)>

The pullback over all points; level WITH_AXIAL adds per-mode axial gradients.

Trait Implementations§

Source§

impl Debug for WaveSet

Source§

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

Formats the value using the given formatter. Read more

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
§

impl<T> ByRef<T> for T

§

fn by_ref(&self) -> &T

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> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts 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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts 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

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

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

§

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

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

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

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

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.
§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,