Struct fenris::assembly::buffers::BasisFunctionBuffer
source · pub struct BasisFunctionBuffer<T: Scalar> { /* private fields */ }
Implementations§
source§impl<T: Real> BasisFunctionBuffer<T>
impl<T: Real> BasisFunctionBuffer<T>
pub fn resize(&mut self, node_count: usize, reference_dim: usize)
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>,
sourcepub 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>,
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
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>,
pub fn element_nodes(&self) -> &[usize]
pub fn element_basis_values(&self) -> &[T]
pub fn element_basis_values_mut(&mut self) -> &mut [T]
pub fn element_gradients<D: DimName>(&self) -> MatrixView<'_, T, D, Dyn>
pub fn element_gradients_mut<D: DimName>( &mut self ) -> MatrixViewMut<'_, T, D, Dyn>
pub fn element_values_gradients_mut<D: DimName>( &mut self ) -> (&mut [T], MatrixViewMut<'_, T, D, Dyn>)
Trait Implementations§
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> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
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
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.