$$ \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 FiniteElementMeshDataSetBuilder<'a, T, D, C>where
    T: Scalar,
    D: DimName,
    DefaultAllocator: Allocator<T, D>,{ /* private fields */ }

Implementations§

source§

impl<'a, T, D, C> FiniteElementMeshDataSetBuilder<'a, T, D, C>where T: Scalar, D: DimName, DefaultAllocator: Allocator<T, D>,

source

pub fn from_mesh(mesh: &'a Mesh<T, D, C>) -> Self

source§

impl<'a, T, D, C> FiniteElementMeshDataSetBuilder<'a, T, D, C>where T: Real + ToPrimitive, D: DimName, DefaultAllocator: Allocator<T, D>,

source

pub fn with_title(self, title: impl Into<String>) -> Self

source

pub fn with_point_vector_attributes<S: Scalar + Zero + ToPrimitive>( self, name: impl Into<String>, num_components: usize, attributes: &[S] ) -> Self

Adds the given attribute data as vector point attributes.

The size of each vector is inferred from the size of the attributes array. For example, if the number of elements in the attributes array is 20 and the number of points is 10, each vector will be interpreted as two-dimensional.

Panics

Panics if the number of entries in the attribute vector is not equal to the product of the vertex count in the mesh and the number of components,

Panics if there are more than 3 components per vector.

source

pub fn with_point_scalar_attributes<S: Scalar + ToPrimitive>( self, name: impl Into<String>, num_components: usize, attributes: &[S] ) -> Self

Adds the given attribute data as scalar point attributes.

Panics

Panics if the number of entries in the attribute vector is not equal to the product of the vertex count in the mesh and the number of components.

source

pub fn with_cell_scalar_attributes<S: Scalar + ToPrimitive>( self, name: impl Into<String>, num_components: usize, attributes: &[S] ) -> Self

Adds the given attribute data as scalar cell attributes.

Panics

Panics if the number of entries in the attribute vector is not equal to the product of the cell count in the mesh and the number of components.

source

pub fn try_build(&self) -> Result<DataSet>where C: VtkCellConnectivity,

source

pub fn try_export(&self, filename: impl AsRef<Path>) -> Result<()>where C: VtkCellConnectivity,

Convenience function for directly exporting the dataset to a file.

Auto Trait Implementations§

§

impl<'a, T, D, C> !RefUnwindSafe for FiniteElementMeshDataSetBuilder<'a, T, D, C>

§

impl<'a, T, D, C> !Send for FiniteElementMeshDataSetBuilder<'a, T, D, C>

§

impl<'a, T, D, C> !Sync for FiniteElementMeshDataSetBuilder<'a, T, D, C>

§

impl<'a, T, D, C> Unpin for FiniteElementMeshDataSetBuilder<'a, T, D, C>

§

impl<'a, T, D, C> !UnwindSafe for FiniteElementMeshDataSetBuilder<'a, T, D, C>

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.