pub struct Mesh<V: Copy> {
pub vertex_buffer: VertexBuffer<V>,
pub index_buffer: IndexBuffer,
}
Fields§
§vertex_buffer: VertexBuffer<V>
§index_buffer: IndexBuffer
Implementations§
source§impl<V: Vertex> Mesh<V>
impl<V: Vertex> Mesh<V>
pub fn create_with_indices<F: Facade>( facade: &F, primitive_type: PrimitiveType, vertices: &[V], indices: &[u32] ) -> Result<Self, CreationError>
Auto Trait Implementations§
impl<V> !RefUnwindSafe for Mesh<V>
impl<V> !Send for Mesh<V>
impl<V> !Sync for Mesh<V>
impl<V> Unpin for Mesh<V>where V: Unpin,
impl<V> !UnwindSafe for Mesh<V>
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).§unsafe fn to_subset_unchecked(&self) -> SS
unsafe 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.