Inputs

Struct Inputs 

Source
pub(super) struct Inputs<const N: usize> {
    pub(super) dim: usize,
    pub(super) axes: [usize; 3],
    pub(super) k: Jet<N>,
    pub(super) r: [Jet<N>; 3],
    pub(super) kpar: [Jet<N>; 3],
    pub(super) direct: [[Jet<N>; 3]; 3],
    pub(super) reciprocal: [[Jet<N>; 3]; 3],
    pub(super) measure: Jet<N>,
}
Expand description

The inputs of one sum as jets in the slots above (or constants for the split derivative), in lattice coordinates except for the Cartesian shift.

Fields§

§dim: usize§axes: [usize; 3]

Cartesian axis of each lattice coordinate.

§k: Jet<N>§r: [Jet<N>; 3]§kpar: [Jet<N>; 3]§direct: [[Jet<N>; 3]; 3]§reciprocal: [[Jet<N>; 3]; 3]

Reciprocal rows; a_i · b_j = 2π δ_ij gives their vector derivatives.

§measure: Jet<N>

Cell measure |det a|.

Implementations§

Source§

impl<const N: usize> Inputs<N>

Source

pub(super) fn new( wave: Family, k: Complex, lattice: &BlochLattice, r: [f64; 3], variable: bool, with_reciprocal: bool, ) -> Self

Without with_reciprocal the reciprocal rows and the measure, which only the Ewald parts read, stay zero: the direct shells skip their jets. Always inlined, so the caller builds the inputs in its own frame instead of copying a returned value.

Source

pub(super) fn point(&self, rows: &[[Jet<N>; 3]; 3], n: [i64; 3]) -> [Jet<N>; 3]

Integer combination Σ_i n_i rows_i of lattice rows.

Source

pub(super) fn combination( &self, rows: &[[Jet<N>; 3]; 3], c: [f64; 3], ) -> [Jet<N>; 3]

Combination Σ_i c_i rows_i of lattice rows with integer-valued c.

Source

pub(super) fn reduce( &self, rows: &[[Jet<N>; 3]; 3], reduction: Option<&Reduction>, ) -> [[Jet<N>; 3]; 3]

The reduced rows U rows, or rows when they are reduced already.

Source

pub(super) fn image(&self, point: &[Jet<N>; 3]) -> [Jet<N>; 3]

Cartesian displacement -r - R of the image at lattice point R.

Source

pub(super) fn phase(&self, point: &[Jet<N>; 3]) -> Jet<N>

Bloch phase q · R of lattice point R.

Auto Trait Implementations§

§

impl<const N: usize> Freeze for Inputs<N>

§

impl<const N: usize> RefUnwindSafe for Inputs<N>

§

impl<const N: usize> Send for Inputs<N>

§

impl<const N: usize> Sync for Inputs<N>

§

impl<const N: usize> Unpin for Inputs<N>

§

impl<const N: usize> UnwindSafe for Inputs<N>

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,