Enum web_glitz::pipeline::graphics::WindingOrder

pub enum WindingOrder {
    Clockwise,
    CounterClockwise,
}

Enumerates the possible winding orders for triangles that may be used by a [Rasterizer].

A triangle is considered to have 2 sides or 'faces': a front-face and a back-face. The winding order determines which face is considered the front-face, and thus by extension which face is considered the back-face.

Each triangle is defined by 3 points: a first point (point a), a second point (point b), and a third point (point c):

//        a
//       /\
//      /  \
//     /    \
//    /      \
//   /________\
//  c          b

In the above example we are looking at just one face of a triangle: the face that is facing toward us. If we trace the outline of this triangle from a -> b -> c -> a, we'll notice that we've followed a clockwise path. If the winding order is defined to be WindingOrder::Clockwise, then we are looking at the front-face of this triangle. If the winding order is defined to be WindingOrder::CounterClockwise, then we are looking at the back-face of this triangle.

Variants

Clockwise

CounterClockwise

Trait Implementations

impl Clone for WindingOrder

fn clone(&self) -> WindingOrder

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for WindingOrder

impl Debug for WindingOrder

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

Formats the value using the given formatter.

impl Hash for WindingOrder

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl PartialEq<WindingOrder> for WindingOrder

fn eq(&self, other: &WindingOrder) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use]fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl StructuralPartialEq for WindingOrder