Struct InputNode 

pub struct InputNode<T> { /* private fields */ }

Typed handle for an input node.

Implementations

impl<T> InputNode<T>

pub fn id(&self) -> NodeId

Returns the graph-local node id.

Trait Implementations

impl<T> Clone for InputNode<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Copy for InputNode<T>

impl<T: Debug> Debug for InputNode<T>

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

Formats the value using the given formatter.

impl<T: Eq> Eq for InputNode<T>

impl<T: Hash> Hash for InputNode<T>

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, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T> NodeHandle for InputNode<T>

fn id(self) -> NodeId

Returns the graph-local node id backing this typed handle.

impl<T: PartialEq> PartialEq for InputNode<T>

fn eq(&self, other: &InputNode<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: PartialEq> StructuralPartialEq for InputNode<T>