Struct GraphNodeId 

pub struct GraphNodeId(/* private fields */);

A unique identifier for nodes in a graph structure.

GraphNodeId is a newtype wrapper around a u64 that provides a unique identifier for each node in a graph. The ID is automatically generated using an atomic counter, ensuring thread-safe unique ID generation across the application.

Examples

use radiate_gp::collections::GraphNodeId;

let id1 = GraphNodeId::new();
let id2 = GraphNodeId::new();
assert_ne!(id1, id2); // Each ID is unique

Implementation Details

• Uses an atomic counter (AtomicU64) to ensure thread-safe ID generation
• Implements Debug, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, and Ord
• When the “serde” feature is enabled, implements Serialize and Deserialize
• Uses #[repr(transparent)] to ensure the same memory layout as u64

Implementations

impl GraphNodeId

pub fn new() -> Self

Trait Implementations

impl Clone for GraphNodeId

fn clone(&self) -> GraphNodeId

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphNodeId

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

Formats the value using the given formatter.

impl Hash for GraphNodeId

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 Ord for GraphNodeId

fn cmp(&self, other: &GraphNodeId) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for GraphNodeId

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

fn partial_cmp(&self, other: &GraphNodeId) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Copy for GraphNodeId

impl Eq for GraphNodeId

impl StructuralPartialEq for GraphNodeId