pub struct GraphId(/* private fields */);Expand description
Process-unique identifier for a Graph, minted monotonically by
Graph::new. Exists so affinity diagnostics can name which graphs
disagree; it is not a stable address, an index, or anything to persist.
Trait Implementations§
impl Copy for GraphId
impl Eq for GraphId
Source§impl Ord for GraphId
impl Ord for GraphId
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 GraphId
impl PartialOrd for GraphId
impl StructuralPartialEq for GraphId
Auto Trait Implementations§
impl Freeze for GraphId
impl RefUnwindSafe for GraphId
impl Send for GraphId
impl Sync for GraphId
impl Unpin for GraphId
impl UnsafeUnpin for GraphId
impl UnwindSafe for GraphId
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.