pub struct VertexBufferRefMut<'a> { /* private fields */ }Expand description
See VertexBuffer::modify for more info.
Implementations§
Source§impl<'a> VertexBufferRefMut<'a>
impl<'a> VertexBufferRefMut<'a>
Sourcepub fn push_vertex<T: Copy>(
&mut self,
vertex: &T,
) -> Result<(), ValidationError>
pub fn push_vertex<T: Copy>( &mut self, vertex: &T, ) -> Result<(), ValidationError>
Tries to append a vertex to the buffer.
§Safety and validation
This method accepts any type that has appropriate size, the size must be equal with the size defined by layout. The Copy trait bound is required to ensure that the type does not have any custom destructors.
Sourcepub fn remove_last_vertex(&mut self)
pub fn remove_last_vertex(&mut self)
Removes last vertex from the buffer.
Sourcepub fn pop_vertex<T: Copy>(&mut self) -> Result<T, ValidationError>
pub fn pop_vertex<T: Copy>(&mut self) -> Result<T, ValidationError>
Copies data of last vertex from the buffer to an instance of variable of a type.
§Safety and validation
This method accepts any type that has appropriate size, the size must be equal with the size defined by layout. The Copy trait bound is required to ensure that the type does not have any custom destructors.
Sourcepub fn cast_data_mut<T: Copy>(&mut self) -> Result<&mut [T], ValidationError>
pub fn cast_data_mut<T: Copy>(&mut self) -> Result<&mut [T], ValidationError>
Tries to cast internal data buffer to a slice of given type. It may fail if size of type is not equal with claimed size (which is set by the layout).
Sourcepub fn iter_mut(&mut self) -> impl Iterator<Item = VertexViewMut<'_>> + '_
pub fn iter_mut(&mut self) -> impl Iterator<Item = VertexViewMut<'_>> + '_
Creates iterator that emits read/write accessors for vertices.
Sourcepub fn get_mut(&mut self, n: usize) -> Option<VertexViewMut<'_>>
pub fn get_mut(&mut self, n: usize) -> Option<VertexViewMut<'_>>
Returns a read/write accessor of n-th vertex.
Sourcepub fn duplicate(&mut self, n: usize)
pub fn duplicate(&mut self, n: usize)
Duplicates n-th vertex and puts it at the back of the buffer.
Sourcepub fn add_attribute<T: Copy>(
&mut self,
descriptor: VertexAttributeDescriptor,
fill_value: T,
) -> Result<(), ValidationError>
pub fn add_attribute<T: Copy>( &mut self, descriptor: VertexAttributeDescriptor, fill_value: T, ) -> Result<(), ValidationError>
Adds new attribute at the end of layout, reorganizes internal data storage to be
able to contain new attribute. Default value of the new attribute in the buffer
becomes fill_value. Graphically this could be represented like so:
Add secondary texture coordinates: Before: P1_N1_TC1_P2_N2_TC2… After: P1_N1_TC1_TC2(fill_value)_P2_N2_TC2_TC2(fill_value)…
Methods from Deref<Target = VertexBuffer>§
Sourcepub fn is_empty(&self) -> bool
pub fn is_empty(&self) -> bool
Returns true if buffer does not contain any vertex, false - otherwise.
Sourcepub fn data_hash(&self) -> u64
pub fn data_hash(&self) -> u64
Returns cached data hash. Cached value is guaranteed to be in actual state.
Sourcepub fn modify(&mut self) -> VertexBufferRefMut<'_>
pub fn modify(&mut self) -> VertexBufferRefMut<'_>
Provides mutable access to content of the buffer.
§Performance
This method returns special structure which has custom destructor that calculates hash of the data once modification is over. You must hold this structure as long as possible while modifying contents of the buffer. Do not even try to do this:
use rg3d::{
scene::mesh::buffer::{VertexBuffer, VertexWriteTrait, VertexAttributeUsage},
core::algebra::Vector3
};
fn do_something(buffer: &mut VertexBuffer) {
for i in 0..buffer.vertex_count() {
buffer
.modify() // Doing this in a loop will cause HUGE performance issues!
.get_mut(i as usize)
.unwrap()
.write_3_f32(VertexAttributeUsage::Position, Vector3::<f32>::default())
.unwrap();
}
}Instead do this:
use rg3d::{
scene::mesh::buffer::{VertexBuffer, VertexWriteTrait, VertexAttributeUsage},
core::algebra::Vector3
};
fn do_something(buffer: &mut VertexBuffer) {
let mut buffer_modifier = buffer.modify();
for mut vertex in buffer_modifier.iter_mut() {
vertex
.write_3_f32(VertexAttributeUsage::Position, Vector3::<f32>::default())
.unwrap();
}
}Why do we even need such complications? It is used for lazy hash calculation which is used for automatic upload of contents to GPU in case if content has changed.
Sourcepub fn has_attribute(&self, usage: VertexAttributeUsage) -> bool
pub fn has_attribute(&self, usage: VertexAttributeUsage) -> bool
Checks if an attribute of usage exists.
Sourcepub fn layout(&self) -> &[VertexAttribute]
pub fn layout(&self) -> &[VertexAttribute]
Returns vertex buffer layout.
Sourcepub fn cast_data_ref<T: Copy>(&self) -> Result<&[T], ValidationError>
pub fn cast_data_ref<T: Copy>(&self) -> Result<&[T], ValidationError>
Tries to cast internal data buffer to a slice of given type. It may fail if size of type is not equal with claimed size (which is set by the layout).
Sourcepub fn iter(&self) -> impl Iterator<Item = VertexViewRef<'_>> + '_
pub fn iter(&self) -> impl Iterator<Item = VertexViewRef<'_>> + '_
Creates iterator that emits read accessors for vertices.
Sourcepub fn get(&self, n: usize) -> Option<VertexViewRef<'_>>
pub fn get(&self, n: usize) -> Option<VertexViewRef<'_>>
Returns a read accessor of n-th vertex.
Sourcepub fn vertex_count(&self) -> u32
pub fn vertex_count(&self) -> u32
Returns exact amount of vertices in the buffer.
Sourcepub fn vertex_size(&self) -> u8
pub fn vertex_size(&self) -> u8
Return vertex size of the buffer.
Sourcepub fn find_free_shader_location(&self) -> u8
pub fn find_free_shader_location(&self) -> u8
Finds free location for an attribute in the layout.
Trait Implementations§
Source§impl<'a> DerefMut for VertexBufferRefMut<'a>
impl<'a> DerefMut for VertexBufferRefMut<'a>
Source§impl<'a> Drop for VertexBufferRefMut<'a>
impl<'a> Drop for VertexBufferRefMut<'a>
Auto Trait Implementations§
impl<'a> Freeze for VertexBufferRefMut<'a>
impl<'a> RefUnwindSafe for VertexBufferRefMut<'a>
impl<'a> Send for VertexBufferRefMut<'a>
impl<'a> Sync for VertexBufferRefMut<'a>
impl<'a> Unpin for VertexBufferRefMut<'a>
impl<'a> !UnwindSafe for VertexBufferRefMut<'a>
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
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
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.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.