2019-01-07 21:10:31 +00:00
|
|
|
// Local
|
|
|
|
use super::Pipeline;
|
|
|
|
|
2019-01-11 23:18:34 +00:00
|
|
|
/// A `Vec`-based mesh structure used to store mesh data on the CPU.
|
2019-01-13 20:53:55 +00:00
|
|
|
#[derive(Clone)]
|
2019-01-07 21:10:31 +00:00
|
|
|
pub struct Mesh<P: Pipeline> {
|
|
|
|
verts: Vec<P::Vertex>,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<P: Pipeline> Mesh<P> {
|
2019-01-11 23:18:34 +00:00
|
|
|
/// Create a new `Mesh`
|
2019-01-11 20:14:37 +00:00
|
|
|
pub fn new() -> Self {
|
2019-01-07 21:10:31 +00:00
|
|
|
Self { verts: vec![] }
|
|
|
|
}
|
|
|
|
|
2019-01-11 23:18:34 +00:00
|
|
|
/// Get a slice referencing the vertices of this mesh.
|
2019-01-11 20:14:37 +00:00
|
|
|
pub fn vertices(&self) -> &[P::Vertex] {
|
2019-01-07 21:10:31 +00:00
|
|
|
&self.verts
|
|
|
|
}
|
|
|
|
|
2019-01-11 23:18:34 +00:00
|
|
|
/// Push a new vertex onto the end of this mesh.
|
2019-01-07 21:10:31 +00:00
|
|
|
pub fn push(&mut self, vert: P::Vertex) {
|
|
|
|
self.verts.push(vert);
|
|
|
|
}
|
2019-01-11 20:14:37 +00:00
|
|
|
|
2019-01-11 23:18:34 +00:00
|
|
|
/// Push a new polygon onto the end of this mesh.
|
|
|
|
pub fn push_tri(&mut self, tri: Tri<P>) {
|
|
|
|
self.verts.push(tri.a);
|
|
|
|
self.verts.push(tri.b);
|
|
|
|
self.verts.push(tri.c);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Push a new quad onto the end of this mesh.
|
2019-01-11 20:14:37 +00:00
|
|
|
pub fn push_quad(&mut self, quad: Quad<P>) {
|
2019-01-11 23:18:34 +00:00
|
|
|
// A quad is composed of two triangles. The code below converts the former to the latter.
|
|
|
|
|
2019-01-11 20:14:37 +00:00
|
|
|
// Tri 1
|
|
|
|
self.verts.push(quad.a.clone());
|
|
|
|
self.verts.push(quad.b);
|
|
|
|
self.verts.push(quad.c.clone());
|
|
|
|
|
|
|
|
// Tri 2
|
|
|
|
self.verts.push(quad.c);
|
|
|
|
self.verts.push(quad.d);
|
|
|
|
self.verts.push(quad.a);
|
|
|
|
}
|
2019-01-13 20:53:55 +00:00
|
|
|
|
|
|
|
/// Push the vertices of another mesh onto the end of this mesh
|
|
|
|
pub fn push_mesh(&mut self, other: &Mesh<P>) {
|
|
|
|
self.verts.extend_from_slice(other.vertices());
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Push the vertices of another mesh onto the end of this mesh
|
|
|
|
pub fn push_mesh_map<F: FnMut(P::Vertex) -> P::Vertex>(&mut self, other: &Mesh<P>, mut f: F) {
|
|
|
|
// Reserve enough space in our Vec. This isn't necessary, but it tends to reduce the number
|
|
|
|
// of required (re)allocations.
|
|
|
|
self.verts.reserve(other.vertices().len());
|
|
|
|
|
|
|
|
for vert in other.vertices() {
|
|
|
|
self.verts.push(f(vert.clone()));
|
|
|
|
}
|
|
|
|
}
|
2019-01-11 20:14:37 +00:00
|
|
|
}
|
|
|
|
|
2019-01-11 23:18:34 +00:00
|
|
|
/// Represents a triangle stored on the CPU.
|
|
|
|
pub struct Tri<P: Pipeline> {
|
|
|
|
a: P::Vertex,
|
|
|
|
b: P::Vertex,
|
|
|
|
c: P::Vertex,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<P: Pipeline> Tri<P> {
|
|
|
|
pub fn new(
|
|
|
|
a: P::Vertex,
|
|
|
|
b: P::Vertex,
|
|
|
|
c: P::Vertex,
|
|
|
|
) -> Self {
|
|
|
|
Self { a, b, c }
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Represents a quad stored on the CPU.
|
2019-01-11 20:14:37 +00:00
|
|
|
pub struct Quad<P: Pipeline> {
|
|
|
|
a: P::Vertex,
|
|
|
|
b: P::Vertex,
|
|
|
|
c: P::Vertex,
|
|
|
|
d: P::Vertex,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<P: Pipeline> Quad<P> {
|
|
|
|
pub fn new(
|
|
|
|
a: P::Vertex,
|
|
|
|
b: P::Vertex,
|
|
|
|
c: P::Vertex,
|
|
|
|
d: P::Vertex,
|
|
|
|
) -> Self {
|
|
|
|
Self { a, b, c, d }
|
|
|
|
}
|
2019-01-07 21:10:31 +00:00
|
|
|
}
|