Struct InputNodeAndIndex 

#[repr(C)]
pub struct InputNodeAndIndex {
    pub node_id: NodeGraphNodeId,
    pub input_index: usize,
}

Fields

node_id: NodeGraphNodeId

input_index: usize

Trait Implementations

impl Clone for InputNodeAndIndex

fn clone(&self) -> InputNodeAndIndex

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for InputNodeAndIndex

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

Formats the value using the given formatter.

impl Extend<InputNodeAndIndex> for InputNodeAndIndexVec

fn extend<T: IntoIterator<Item = InputNodeAndIndex>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl FromIterator<InputNodeAndIndex> for InputNodeAndIndexVec

fn from_iter<T>(iter: T) -> Self

where T: IntoIterator<Item = InputNodeAndIndex>,

Creates a value from an iterator.

impl PartialEq for InputNodeAndIndex

fn eq(&self, other: &InputNodeAndIndex) -> 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 StructuralPartialEq for InputNodeAndIndex