VectorWaveResidual

Struct VectorWaveResidual 

Source
pub struct VectorWaveResidual {
    family: Family,
    labels: Vec<WaveLabel>,
    arguments: [Vec<Complex>; 6],
    helicity: bool,
    size: usize,
}
Expand description

What vector_wave_array saves for its pullback: the family, the labels, the convention and the arguments, each one value for all outputs or one per output.

The pullback computes each output’s gradients on its own and adds the gradients of a scalar argument in output order on the calling thread, so its result does not depend on the thread count.

Fields§

§family: Family§labels: Vec<WaveLabel>§arguments: [Vec<Complex>; 6]§helicity: bool§size: usize

Implementations§

Source§

impl VectorWaveResidual

Source

pub fn new( family: Family, labels: Vec<WaveLabel>, arguments: [Vec<Complex>; 6], helicity: bool, ) -> Result<Self>

Retain broadcast inputs without evaluating the waves.

Source

pub fn values(&self) -> Result<Vec<[Complex; 3]>>

Evaluate the values of the retained wave inputs.

Source§

impl VectorWaveResidual

Source

fn element(&self, i: usize) -> (WaveLabel, [Complex; 6])

Source

fn fixed_plane(&self) -> Option<(WaveLabel, [Complex; 3])>

The label and wave vector that several plane waves share, and hence their one polarization, when they differ only in their points.

Source

fn point(&self, i: usize) -> [Complex; 3]

The point (x, y, z) of plane wave i.

Source

pub fn pushforward( &self, tangents: [&[Complex]; 6], ) -> Result<Vec<[Complex; 3]>>

Directional derivative of every wave from scalar or elementwise argument tangents. It carries one direction, irrespective of the number of arguments.

Source

pub fn pullback(&self, cotangent: &[[Complex; 3]]) -> Result<[Vec<Complex>; 6]>

The gradients of the six arguments from one complex vector cotangent per output; an argument given as one value for all outputs gets the sum of its gradients.

Trait Implementations§

Source§

impl Debug for VectorWaveResidual

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,