pub struct ObjData {
pub vertices: Vec<Vector3<f32>>,
pub point_colors: Vec<Vector3<f32>>,
pub normals: Vec<Vector3<f32>>,
pub uvs: Vec<Vector2<f32>>,
pub vertex_face_indices: Vec<Vec<u64>>,
pub normal_face_indices: Vec<Vec<u64>>,
pub uv_face_indices: Vec<Vec<u64>>,
pub lines: Vec<[u64; 2]>,
pub objects: Vec<ObjectRanges>,
pub face_material_use: Vec<usize>,
pub material_list: Vec<MtlData>,
}
Fields§
§vertices: Vec<Vector3<f32>>
§point_colors: Vec<Vector3<f32>>
§normals: Vec<Vector3<f32>>
§uvs: Vec<Vector2<f32>>
§vertex_face_indices: Vec<Vec<u64>>
§normal_face_indices: Vec<Vec<u64>>
§uv_face_indices: Vec<Vec<u64>>
§lines: Vec<[u64; 2]>
§objects: Vec<ObjectRanges>
§face_material_use: Vec<usize>
§material_list: Vec<MtlData>
Implementations§
Trait Implementations§
Source§impl<'a> WaveFrontCompatible<'a> for ObjData
impl<'a> WaveFrontCompatible<'a> for ObjData
type Scalar = f32
fn pos_iterator(&'a self) -> impl Iterator<Item = [f32; 3]>
fn point_color_iterator(&'a self) -> impl Iterator<Item = [f32; 3]>
fn uv_iterator(&'a self) -> impl Iterator<Item = [f32; 2]>
fn norm_iterator(&'a self) -> impl Iterator<Item = [f32; 3]>
fn segment_iterator(&'a self) -> impl Iterator<Item = [usize; 2]>
fn pos_index_iterator( &'a self, ) -> impl Iterator<Item = impl Iterator<Item = usize>>
fn uv_index_iterator( &'a self, ) -> impl Iterator<Item = impl Iterator<Item = usize>>
fn norm_index_iterator( &'a self, ) -> impl Iterator<Item = impl Iterator<Item = usize>>
Auto Trait Implementations§
impl Freeze for ObjData
impl RefUnwindSafe for ObjData
impl Send for ObjData
impl Sync for ObjData
impl Unpin for ObjData
impl UnwindSafe for ObjData
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
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>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moreSource§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).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.