Struct gut::CellIndex [−][src]
pub struct CellIndex(_);
Expand description
Define index type
Implementations
Trait Implementations
Get the size of the attribute at the appropriate mesh location determined by I
.
Read only access to the attribute dictionary.
Read and write access to the attribute dictionary.
pub fn attrib_dict_and_cache_mut(
mesh: &mut M
) -> (&mut HashMap<String, Attribute<CellIndex>, RandomState, Global>, Option<&mut HashSet<Value<MaybeUninit<usize>, AttributeValueHashVTable>, RandomState, Global>>)
pub fn attrib_dict_and_cache_mut(
mesh: &mut M
) -> (&mut HashMap<String, Attribute<CellIndex>, RandomState, Global>, Option<&mut HashSet<Value<MaybeUninit<usize>, AttributeValueHashVTable>, RandomState, Global>>)
Read and write access to the attribute dictionary as well as an optional cache for indirect attribute values. Read more
impl<M> Connectivity<VertexIndex, CellIndex> for M where
M: VertexCell + CellVertex + NumVertices,
impl<M> Connectivity<VertexIndex, CellIndex> for M where
M: VertexCell + CellVertex + NumVertices,
Implement vertex connectivity for cell based meshes (e.g. TetMesh).
Get the number of elements which are considered for connectivity Read more
pub fn push_neighbours<T>(
&self,
index: VertexIndex,
stack: &mut Vec<VertexIndex, Global>,
&(),
Option<&[T]>
) where
T: Default + PartialEq<T>,
pub fn push_neighbours<T>(
&self,
index: VertexIndex,
stack: &mut Vec<VertexIndex, Global>,
&(),
Option<&[T]>
) where
T: Default + PartialEq<T>,
Push all neighbours of the element at the given index
to the given stack
. Read more
Precompute additional topology information prior to determining connectivity. Read more
Determine the connectivity of a set of meshes. Read more
Determine the connectivity of a set of meshes. Read more
This method returns an ordering between self
and other
values if one exists. Read more
This method tests less than (for self
and other
) and is used by the <
operator. Read more
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
Auto Trait Implementations
impl RefUnwindSafe for CellIndex
impl UnwindSafe for CellIndex
Blanket Implementations
Mutably borrows from an owned value. Read more
impl<T> CloneBytes for T where
T: 'static + Clone,
impl<T> CloneBytes for T where
T: 'static + Clone,
pub unsafe fn clone_bytes(
src: &[MaybeUninit<u8>]
) -> Box<[MaybeUninit<u8>], Global>
pub unsafe fn clone_from_bytes(
dst: &mut [MaybeUninit<u8>],
src: &[MaybeUninit<u8>]
)
pub unsafe fn clone_into_raw_bytes(
src: &[MaybeUninit<u8>],
dst: &mut [MaybeUninit<u8>]
)
impl<M> Connectivity<VertexIndex, CellIndex> for M where
M: VertexCell + CellVertex + NumVertices,
impl<M> Connectivity<VertexIndex, CellIndex> for M where
M: VertexCell + CellVertex + NumVertices,
Get the number of elements which are considered for connectivity Read more
pub fn push_neighbours<T>(
&self,
index: VertexIndex,
stack: &mut Vec<VertexIndex, Global>,
&(),
Option<&[T]>
) where
T: Default + PartialEq<T>,
pub fn push_neighbours<T>(
&self,
index: VertexIndex,
stack: &mut Vec<VertexIndex, Global>,
&(),
Option<&[T]>
) where
T: Default + PartialEq<T>,
Push all neighbours of the element at the given index
to the given stack
. Read more
Precompute additional topology information prior to determining connectivity. Read more
Determine the connectivity of a set of meshes. Read more
Determine the connectivity of a set of meshes. Read more
impl<T> DebugBytes for T where
T: 'static + Debug,
impl<T> DebugBytes for T where
T: 'static + Debug,
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
Convert Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert &mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read more
pub unsafe fn drop_bytes(bytes: &mut [MaybeUninit<u8>])
type Output = <I as GetIndex<'a, S>>::Output
fn at(&self, idx: I) -> Self::Output
fn at(&self, idx: I) -> Self::Output
Return a value at the given index. This is provided as the checked
version of get
that will panic if the equivalent get
call is None
,
which typically means that the given index is out of bounds. Read more
unsafe fn at_unchecked(&self, idx: I) -> Self::Output
unsafe fn at_unchecked(&self, idx: I) -> Self::Output
Return a value at the given index. This is provided as the unchecked
version of get
that has undefined behavior when the index is out of bounds. Read more
impl<T> HashBytes for T where
T: 'static + Hash,
impl<T> HashBytes for T where
T: 'static + Hash,
pub unsafe fn hash_bytes(bytes: &[MaybeUninit<u8>], state: &mut dyn Hasher)
type Output = <I as IsolateIndex<S>>::Output
pub unsafe fn isolate_unchecked(self, idx: I) -> <S as Isolate<I>>::Output
pub fn try_isolate(self, idx: I) -> Option<<S as Isolate<I>>::Output>
impl<T> PartialEqBytes for T where
T: 'static + PartialEq<T>,
impl<T> PartialEqBytes for T where
T: 'static + PartialEq<T>,
pub unsafe fn eq_bytes(a: &[MaybeUninit<u8>], b: &[MaybeUninit<u8>]) -> bool
impl<T, N> PushArrayToVec<N> for T where
T: Clone,
N: Array<T>,
impl<T, N> PushArrayToVec<N> for T where
T: Clone,
N: Array<T>,
pub fn push_to_vec(element: <N as Array<T>>::Array, set: &mut Vec<T, Global>)
pub fn push_to_vec(element: <N as Array<T>>::Array, set: &mut Vec<T, Global>)
This method tells this type how it can be pushed to a Vec
as an array.
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.