Struct mutiny::geometry::Geometry

pub struct Geometry<T: 'static + Clone> { /* fields omitted */ }

Methods

impl<T: 'static + Clone> Geometry<T>

pub fn new(mesh: Mesh<T>) -> Geometry<T>

pub fn has_changed(&self) -> bool

pub fn reset_has_changed(&mut self)

pub fn set(&mut self, mesh: Mesh<T>)

Methods from Deref<Target = Mesh<T>>

pub fn set_vertices(&mut self, vertices: Vec<T>)

Set the mesh vertices

pub fn set_indices(&mut self, indices: Vec<u32>)

Set the mesh vertices

pub fn indices(&self) -> &Vec<u32>

pub fn indices_mut(&mut self) -> &mut Vec<u32>

pub fn vertices(&self) -> &[T]

pub fn vertices_mut(&mut self) -> &mut [T]

pub fn iter(&self) -> Iter<T>

Iterator over the mesh vertices in the order they where inserted

pub fn iter_mut(&mut self) -> IterMut<T>

Mutable iterator over the mesh vertices in the order they where inserted

pub fn pop(&mut self) -> Option<T>

Pop the last vertex

pub fn push(&mut self, value: T)

Push a vertex at the end of the mesh

pub fn extend_from_slice(&mut self, other: &[T])

Extend the mesh with a slice of new vertices

pub fn extend_from_mesh(&mut self, other: &Mesh<T>)

Extend the mesh with another mesh

The vertices and indices will just be inserted at the end without taking into account the primitive types

pub fn extend<I>(&mut self, other: I) where     I: IntoIterator<Item = T>,

Extend the mesh with an iterator of new vertices

pub fn insert(&mut self, index: usize, element: T)

Insert a vertex at a certain position

pub fn get_mut(&mut self, index: usize) -> &mut T

Mutably get the vertex at the specified position.

Will panic if the vertex doesn't exist

pub fn reserve(&mut self, capacity: usize)

Reserve as much capacity for vertices

pub unsafe fn set_len(&mut self, len: usize)

Unsafe operation that sets the len of the vertices collection

pub fn truncate(&mut self, len: usize)

Truncate the mesh vertices at the specified len

pub fn last(&self) -> Option<&T>

Last vertex if there's any

pub fn last_mut(&mut self) -> Option<&mut T>

Last vertex mutably if there's any

pub fn primitive_type(&self) -> PrimitiveType

Primitive type

pub fn set_primitive_type(&mut self, ty: PrimitiveType)

pub fn add_face(&mut self, i0: u32, i1: u32, i2: u32)

Add a triangle face (only for Triangles primitive type)

pub fn clear(&mut self)

Clear the mesh vertices and indices

pub fn clear_vertices(&mut self)

Clear the vertices

pub fn clear_indices(&mut self)

Clear the indices

pub fn len(&self) -> usize

Number of vertices

pub fn is_empty(&self) -> bool

Contains any vertices

pub fn faces(&self) -> Box<dyn Iterator<Item = [&T; 3]>>

pub fn faces_mut(&mut self) -> Box<dyn Iterator<Item = [&mut T; 3]>>

Trait Implementations

impl<T: 'static + Clone> Debug for Geometry<T>

fn fmt(&self, fmt: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<T: 'static + Clone> Deref for Geometry<T>

type Target = Mesh<T>

The resulting type after dereferencing.

fn deref(&self) -> &Mesh<T>

Dereferences the value.

impl<T: 'static + Clone> DerefMut for Geometry<T>

fn deref_mut(&mut self) -> &mut Mesh<T>

Mutably dereferences the value.

impl<T: 'static + Clone> Component for Geometry<T>

type Storage = DenseVec<Geometry<T>>

fn type_name() -> &'static str

fn id() -> TypeId

impl<'a, T: 'static + Clone> DebugParameter for Geometry<T>

fn debug<S: Serializer>(     &self,     serializer: S ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>