$$ \gdef\pd#1#2{\frac{\partial #1}{\partial #2}} \gdef\d#1{\, \mathrm{d}#1} \gdef\dx{\d{x}} \gdef\tr#1{\operatorname{tr} (#1)} $$ $$ \gdef\norm#1{\left \lVert #1 \right\rVert} \gdef\seminorm#1{| #1 |} $$ $$ \gdef\vec#1{\mathbf{\boldsymbol{#1}}} \gdef\dvec#1{\bar{\vec #1}} $$
pub struct BasisFunctionBuffer<T: Scalar> { /* private fields */ }

Implementations§

source§

impl<T: Real> BasisFunctionBuffer<T>

source

pub fn resize(&mut self, node_count: usize, reference_dim: usize)

source

pub fn populate_element_nodes_from_space<Space>( &mut self, element_index: usize, space: &Space )where Space: FiniteElementSpace<T> + ?Sized, DefaultAllocator: BiDimAllocator<T, Space::GeometryDim, Space::ReferenceDim>,

source

pub fn populate_element_basis_values_from_space<Space>( &mut self, element_index: usize, space: &Space, reference_coords: &OPoint<T, Space::ReferenceDim> )where Space: FiniteElementSpace<T> + ?Sized, DefaultAllocator: BiDimAllocator<T, Space::GeometryDim, Space::ReferenceDim>,

TODO: Document that populate_element_nodes should be called first

source

pub fn populate_element_basis_gradients_from_space<Space>( &mut self, element_index: usize, space: &Space, reference_coords: &OPoint<T, Space::ReferenceDim> )where Space: FiniteElementSpace<T> + ?Sized, DefaultAllocator: BiDimAllocator<T, Space::GeometryDim, Space::ReferenceDim>,

source

pub fn element_nodes(&self) -> &[usize]

source

pub fn element_basis_values(&self) -> &[T]

source

pub fn element_basis_values_mut(&mut self) -> &mut [T]

source

pub fn element_gradients<D: DimName>(&self) -> MatrixView<'_, T, D, Dyn>

source

pub fn element_gradients_mut<D: DimName>( &mut self ) -> MatrixViewMut<'_, T, D, Dyn>

source

pub fn element_values_gradients_mut<D: DimName>( &mut self ) -> (&mut [T], MatrixViewMut<'_, T, D, Dyn>)

Trait Implementations§

source§

impl<T: Debug + Scalar> Debug for BasisFunctionBuffer<T>

source§

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

Formats the value using the given formatter. Read more
source§

impl<T: Real> Default for BasisFunctionBuffer<T>

source§

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

§

impl<T> RefUnwindSafe for BasisFunctionBuffer<T>where T: RefUnwindSafe,

§

impl<T> Send for BasisFunctionBuffer<T>where T: Send,

§

impl<T> Sync for BasisFunctionBuffer<T>where T: Sync,

§

impl<T> Unpin for BasisFunctionBuffer<T>where T: Unpin,

§

impl<T> UnwindSafe for BasisFunctionBuffer<T>where T: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere 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 Twhere 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.

§

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

§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SPwhere 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 Twhere U: Into<T>,

§

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 Twhere U: TryFrom<T>,

§

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.