Struct gut::mesh::attrib::IndirectData [−][src]
pub struct IndirectData { /* fields omitted */ }
Expand description
Mesh attribute data.
This stores unique values shared among mesh elements via smart pointers. This type doesn’t store the location of the attribute.
Implementations
Get the type data stored within this attribute
Get the mutable typed data stored within this attribute
Get the type data stored within this attribute
Get the number of bytes per element stored in this attribute.
Number of elements stored by this attribute. This is the same as the number of elements in the associated topology.
Number of bytes stored by this attribute. This is the same as the number of elements multiplied by the size of each element.
Get a const
reference to the i
’th attribute value.
Safety
Calling this method with an out-of-bounds index is undefined behavior even if the output is
not used. For a safe alternative use the get_ref
method.
Get a mutable reference to the i
’th attribute value.
Safety
Calling this method with an out-of-bounds index is undefined behavior even if the output is
not used. For a safe alternative use the get_mut
method.
Get a reference to the internal value vector.
Get a mutable reference to the internal value vector.
Convert this attribute into the underlying buffer. This consumes the attribute.
Extend this attribute by n
elements. Effectively, this function appends the default
element n
number of times to this attribute.
Rotates elements of this attribute in-place to the left.
Rotate this attribute in-place such that the first mid
elements of the underlying buffer
move to the end while the last self.len() - mid
elements move to the front. After
calling rotate_left
, the element previously at index mid
will become the first element
in the slice.
Rotates elements of this attribute in-place to the right.
Rotate this attribute in-place such that the first self.len() - k
elements of the
underlying buffer move to the end while the last k
elements move to the front. After
calling rotate_right
, the element previously at index self.len() - k
will become the
first element in the slice.
Construct an attribute with a given size.
pub fn from_vec<T>(
vec: Vec<T, Global>,
cache: &mut HashSet<Value<MaybeUninit<usize>, AttributeValueHashVTable>, RandomState, Global>
) -> IndirectData where
T: AttributeValueHash + Default,
pub fn from_vec<T>(
vec: Vec<T, Global>,
cache: &mut HashSet<Value<MaybeUninit<usize>, AttributeValueHashVTable>, RandomState, Global>
) -> IndirectData where
T: AttributeValueHash + Default,
Construct an attribute from a given Vec<T>
of data.
pub fn from_slice<T>(
buf: &[T],
cache: &mut HashSet<Value<MaybeUninit<usize>, AttributeValueHashVTable>, RandomState, Global>
) -> IndirectData where
T: AttributeValueHash + Default,
pub fn from_slice<T>(
buf: &[T],
cache: &mut HashSet<Value<MaybeUninit<usize>, AttributeValueHashVTable>, RandomState, Global>
) -> IndirectData where
T: AttributeValueHash + Default,
Construct an attribute from a given slice of data, by copying the data.
Construct a new empty attribute with the same values and default element as self
.
pub fn duplicate_with(
&self,
dup_data: impl FnOnce(Slice<'_, AttributeValueHashVTable>) -> VecDyn<dyn HasAttributeValue + 'static>
) -> IndirectData
pub fn duplicate_with(
&self,
dup_data: impl FnOnce(Slice<'_, AttributeValueHashVTable>) -> VecDyn<dyn HasAttributeValue + 'static>
) -> IndirectData
Construct a new attribute with the same values and default element as self
.
pub fn duplicate_with_len(
&self,
len: usize,
init: impl FnOnce(SliceMut<'_, AttributeValueHashVTable>, Slice<'_, AttributeValueHashVTable>)
) -> IndirectData
pub fn duplicate_with_len(
&self,
len: usize,
init: impl FnOnce(SliceMut<'_, AttributeValueHashVTable>, Slice<'_, AttributeValueHashVTable>)
) -> IndirectData
Construct a new attribute with the same values and default element as self
.
The attribute is first initialized with the default value by allocating len
default
elements. Then the newly created buffer is expected to be modified by the init
function.
The output HDataVec
must be composed of values from the original HDataVec
or the
default element.
The init
function is only allowed to clone data from the second argument into the first.
Adding new data will cause this attribute to go out of sync with the cache.
Convert the data stored by this attribute into a vector of the same size.
Produce an iterator over the underlying data elements.
pub fn update_with<T, F>(
&mut self,
f: F,
cache: &mut HashSet<Value<MaybeUninit<usize>, AttributeValueHashVTable>, RandomState, Global>
) -> Result<&mut IndirectData, Error> where
T: AttributeValueHash,
F: FnMut(usize, &Arc<T>) -> Option<Arc<T>>,
pub fn update_with<T, F>(
&mut self,
f: F,
cache: &mut HashSet<Value<MaybeUninit<usize>, AttributeValueHashVTable>, RandomState, Global>
) -> Result<&mut IndirectData, Error> where
T: AttributeValueHash,
F: FnMut(usize, &Arc<T>) -> Option<Arc<T>>,
Iterate over all the value in this attribute and update them as needed.
This function takes a closure which takes an index and a smart pointer to the stored value and produces an optional new value. The new value is then used to update the attribute using the provided cache.
pub fn set_at<T>(
&'a mut self,
i: usize,
new_value: T,
cache: &'a mut HashSet<Value<MaybeUninit<usize>, AttributeValueHashVTable>, RandomState, Global>
) -> Result<&'a mut IndirectData, Error> where
T: AttributeValueHash,
pub fn set_at<T>(
&'a mut self,
i: usize,
new_value: T,
cache: &'a mut HashSet<Value<MaybeUninit<usize>, AttributeValueHashVTable>, RandomState, Global>
) -> Result<&'a mut IndirectData, Error> where
T: AttributeValueHash,
Set the value of a particular element.
pub fn set_value_at(
&'a mut self,
i: usize,
new_value: &Value<MaybeUninit<usize>, AttributeValueHashVTable>,
cache: &'a mut HashSet<Value<MaybeUninit<usize>, AttributeValueHashVTable>, RandomState, Global>
) -> Result<&'a mut IndirectData, Error>
pub fn set_value_at(
&'a mut self,
i: usize,
new_value: &Value<MaybeUninit<usize>, AttributeValueHashVTable>,
cache: &'a mut HashSet<Value<MaybeUninit<usize>, AttributeValueHashVTable>, RandomState, Global>
) -> Result<&'a mut IndirectData, Error>
Set the value of a particular element.
pub fn push_cloned(
&mut self,
new_value_ref: ValueRef<'_, AttributeValueHashVTable>,
cache: &mut HashSet<Value<MaybeUninit<usize>, AttributeValueHashVTable>, RandomState, Global>
) -> Result<&mut IndirectData, Error>
pub fn push_cloned(
&mut self,
new_value_ref: ValueRef<'_, AttributeValueHashVTable>,
cache: &mut HashSet<Value<MaybeUninit<usize>, AttributeValueHashVTable>, RandomState, Global>
) -> Result<&mut IndirectData, Error>
Push a value onto the underlying data buffer.
Produce a slice to the underlying data referenced by smart pointers.
Produce a mutable slice to the underlying data referenced by smart pointers.
Get a reference to the default element.
Trait Implementations
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
This method tests for !=
.
Auto Trait Implementations
impl RefUnwindSafe for IndirectData
impl Send for IndirectData
impl Sync for IndirectData
impl Unpin for IndirectData
impl UnwindSafe for IndirectData
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<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
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.