Struct Triangle

pub struct Triangle<T> {
    pub x: T,
    pub y: T,
    pub z: T,
}

A polygon with 3 points. Maps to GL_TRIANGLE

Fields

x: T

the first point of a triangle

y: T

the second point of a triangle

z: T

the third point of a triangle

Implementations

impl<T> Triangle<T>

pub fn new(v0: T, v1: T, v2: T) -> Self

create a new Triangle with supplied vertcies

Trait Implementations

impl<T: Clone> Clone for Triangle<T>

fn clone(&self) -> Triangle<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for Triangle<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: Clone> EmitLines for Triangle<T>

type Vertex = T

The Vertex defines the corners of a Polygon

fn emit_lines<E>(self, emit: E)

where E: FnMut(Line<T>),

convert a polygon into lines, each line is emitted via calling of the callback of emit This allow for a variable amount of lines to be returned

impl<T: Clone> EmitTriangles for Triangle<T>

type Vertex = T

The content of each point in the face

fn emit_triangles<F>(&self, emit: F)

where F: FnMut(Triangle<T>),

convert a polygon to one or more triangles, each triangle is returned by calling emit

impl IndexedPolygon<Triangle<usize>> for Cone

fn indexed_polygon(&self, idx: usize) -> Triangle<usize>

return a polygon with indices to the shared vertex

fn indexed_polygon_count(&self) -> usize

return the number of polygons that are needed to represent this mesh

fn indexed_polygon_iter<'a>(&'a self) -> IndexedPolygonIterator<'a, Self, V>

create a iterator that will return a polygon for each face in the source mesh

impl IndexedPolygon<Triangle<usize>> for IcoSphere

fn indexed_polygon_count(&self) -> usize

return the number of polygons that are needed to represent this mesh

fn indexed_polygon(&self, idx: usize) -> Triangle<usize>

return a polygon with indices to the shared vertex

fn indexed_polygon_iter<'a>(&'a self) -> IndexedPolygonIterator<'a, Self, V>

create a iterator that will return a polygon for each face in the source mesh

impl<T: Clone, U> MapVertex<T, U> for Triangle<T>

type Output = Triangle<U>

Output should be a a container of the same shape of the type It’s internal values should reflect any transformation the map did.

fn map_vertex<F>(self, map: F) -> Triangle<U>

where F: FnMut(T) -> U,

map a function to each vertex in polygon creating a new polygon

impl<T: PartialEq> PartialEq for Triangle<T>

fn eq(&self, other: &Triangle<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Copy> Copy for Triangle<T>

impl<T: Eq> Eq for Triangle<T>

impl<T> StructuralPartialEq for Triangle<T>