Struct dae_parser::Vertices

pub struct Vertices {
    pub id: String,
    pub name: Option<String>,
    pub inputs: Vec<Input>,
    pub position: usize,
    pub extra: Vec<Extra>,
}

Declares the attributes and identity of mesh-vertices.

Fields

id: String

A text string containing the unique identifier of the element. This value must be unique within the document.

name: Option<String>

The text string name of this element.

inputs: Vec<Input>

The list of inputs.

position: usize

The index into inputs for the Semantic::Position input (which must exist).

extra: Vec<Extra>

Provides arbitrary additional information about this element.

Implementations

impl Vertices

pub fn position_input(&self) -> &Input

The input with Semantic::Position.

Trait Implementations

impl Clone for Vertices

fn clone(&self) -> Vertices

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Vertices

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

Formats the value using the given formatter.

impl HasId for Vertices

fn id(&self) -> Option<&str>

Get the ID of the node.

fn get_local_map<'a, 'b>(
    maps: &'b LocalMaps<'a>
) -> &'b Option<LocalMap<'a, Self>>

Extract the relevant LocalMap field from a LocalMaps.

fn get_local_map_mut<'a, 'b>(
    maps: &'b mut LocalMaps<'a>
) -> &'b mut Option<LocalMap<'a, Self>>

Extract the relevant LocalMap field from a LocalMaps.

impl Traversable for Vertices

fn traverse<'a, E>(
    doc: &'a Document,
    f: impl FnMut(&'a Self) -> Result<(), E>
) -> Result<(), E> where
    Self: 'a, 

Run the function f on all elements of type Self in the document doc.

impl XNode for Vertices

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.