pub struct ValueId(pub u32);Expand description
Index of a value in a graph. Values are stored in definition order, so a node’s inputs always have smaller ids than the node itself.
Tuple Fields§
§0: u32Implementations§
Trait Implementations§
impl Copy for ValueId
impl Eq for ValueId
Source§impl Ord for ValueId
impl Ord for ValueId
1.21.0 (const: unstable) · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
1.21.0 (const: unstable) · Source§fn min(self, other: Self) -> Selfwhere
Self: Sized,
fn min(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the minimum of two values. Read more
Source§impl PartialOrd for ValueId
impl PartialOrd for ValueId
impl StructuralPartialEq for ValueId
Auto Trait Implementations§
impl Freeze for ValueId
impl RefUnwindSafe for ValueId
impl Send for ValueId
impl Sync for ValueId
impl Unpin for ValueId
impl UnsafeUnpin for ValueId
impl UnwindSafe for ValueId
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more