Struct dae_parser::Plane

pub struct Plane {
    pub equation: [f32; 4],
    pub extra: Vec<Extra>,
}

Defines an infinite plane primitive.

Fields

equation: [f32; 4]

The coefficients for the plane’s equation: Ax + By + Cz + D = 0.

extra: Vec<Extra>

Provides arbitrary additional information about this element.

Trait Implementations

impl Clone for Plane

fn clone(&self) -> Plane

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Plane

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

Formats the value using the given formatter.

impl XNode for Plane

const NAME: &'static str

The name of the XML element.

fn parse(element: &Element) -> Result<Self, Error>

Parse an XML element into this type. In most cases, the parser will require with a debug_assert that the element to parse has name Self::NAME.

fn parse_box(element: &Element) -> Result<Box<Self>, Error>

Parse an XML element and return the data structure in a Box. This can be faster in some cases when the data structure is large.

fn parse_one<'a>(
    it: &mut impl Iterator<Item = &'a Element>
) -> Result<Self, Error>

Parse a single required element from the given element iterator.

fn parse_opt(it: &mut Peekable<Children<'_>>) -> Result<Option<Self>, Error>

Parse an optional element from the given element iterator, using Self::NAME to determine if it is the correct type.

fn parse_opt_box(
    it: &mut Peekable<Children<'_>>
) -> Result<Option<Box<Self>>, Error>

Parse an optional boxed element from the given element iterator, using Self::NAME to determine if it is the correct type.

fn parse_list(it: &mut Peekable<Children<'_>>) -> Result<Vec<Self>, Error>

Parse a list of elements from the given element iterator, as long as it continues yielding elements of name Self::NAME.

fn parse_list_n<const N: usize>(
    it: &mut Peekable<Children<'_>>
) -> Result<Vec<Self>, Error>

Parse a list of elements from the given element iterator, as long as it continues yielding elements of name Self::NAME, and assert that the resulting list has length at least N.