#![feature(core, collections, str_words, slice_patterns)]
#![cfg_attr(test, feature(test))]
#![deny(missing_docs)]
#[cfg(feature = "glium-support")]
#[macro_use]
extern crate glium;
#[macro_use]
mod error;
pub mod raw;
use std::io::BufRead;
use std::simd::f32x4;
use std::num::cast;
use std::collections::HashMap;
use std::collections::hash_map::Entry::*;
use raw::{parse_obj, RawObj};
use raw::object::Polygon;
use raw::object::Polygon::*;
pub use error::ObjResult;
pub fn load_obj<V: FromRawVertex, T: BufRead>(input: T) -> ObjResult<Obj<V>> {
let raw = try!(parse_obj(input));
Obj::new(raw)
}
pub struct Obj<V = Vertex> {
pub name: Option<String>,
pub vertices: Vec<V>,
pub indices: Vec<u16>,
}
impl<V: FromRawVertex> Obj<V> {
fn new(raw: RawObj) -> ObjResult<Self> {
let (vertices, indices) = try!(FromRawVertex::process(raw.positions, raw.normals, raw.polygons));
Ok(Obj {
name: raw.name,
vertices: vertices,
indices: indices
})
}
}
pub trait FromRawVertex {
fn process(vertices: Vec<f32x4>, normals: Vec<f32x4>, polygons: Vec<Polygon>) -> ObjResult<(Vec<Self>, Vec<u16>)>;
}
#[derive(Copy, PartialEq, Clone, Debug)]
pub struct Vertex {
pub position: [f32; 3],
pub normal: [f32; 3],
}
#[cfg(feature = "glium-support")]
implement_vertex!(Vertex, position, normal);
impl FromRawVertex for Vertex {
fn process(positions: Vec<f32x4>, normals: Vec<f32x4>, polygons: Vec<Polygon>) -> ObjResult<(Vec<Self>, Vec<u16>)> {
let mut vb = Vec::with_capacity(polygons.len() * 3);
let mut ib = Vec::with_capacity(polygons.len() * 3);
{
let mut cache = HashMap::new();
let mut map = |pi: usize, ni: usize| {
let index = match cache.entry((pi, ni)) {
Vacant(entry) => {
let p = positions[pi];
let n = normals[ni];
let vertex = Vertex { position: [p.0, p.1, p.2], normal: [n.0, n.1, n.2] };
let index = cast(vb.len()).unwrap();
vb.push(vertex);
entry.insert(index);
index
}
Occupied(entry) => {
*entry.get()
}
};
ib.push(index)
};
for polygon in polygons.into_iter() {
match polygon {
P(_) | PT(_) => error!(InsufficientData, "Tried to extract normal data which are not contained in the model"),
PN(ref vec) if vec.len() == 3 => {
for &(pi, ni) in vec.iter() { map(pi, ni) }
}
PTN(ref vec) if vec.len() == 3 => {
for &(pi, _, ni) in vec.iter() { map(pi, ni) }
}
_ => error!(UntriangulatedModel, "Model should be triangulated first to be loaded properly")
}
}
}
vb.shrink_to_fit();
Ok((vb, ib))
}
}
#[derive(Copy, PartialEq, Clone, Debug)]
pub struct Position {
pub position: [f32; 3]
}
#[cfg(feature = "glium-support")]
implement_vertex!(Position, position);
impl FromRawVertex for Position {
fn process(vertices: Vec<f32x4>, _: Vec<f32x4>, polygons: Vec<Polygon>) -> ObjResult<(Vec<Self>, Vec<u16>)> {
let vb = vertices.into_iter().map(|v| Position { position: [v.0, v.1, v.2] }).collect();
let mut ib = Vec::with_capacity(polygons.len() * 3);
{
let mut map = |pi| { ib.push(cast(pi).unwrap()) };
for polygon in polygons.into_iter() {
match polygon {
P(ref vec) if vec.len() == 3 => {
for &pi in vec.iter() { map(pi) }
}
PT(ref vec) | PN(ref vec) if vec.len() == 3 => {
for &(pi, _) in vec.iter() { map(pi) }
}
PTN(ref vec) if vec.len() == 3 => {
for &(pi, _, _) in vec.iter() { map(pi) }
}
_ => error!(UntriangulatedModel, "Model should be triangulated first to be loaded properly")
}
}
}
Ok((vb, ib))
}
}