Struct IdGenerator 

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

Thread-safe ID allocator.

The counter starts at 1 so every allocated ID is a valid NonZeroU32. Zero is never handed out: it is the niche value that makes Option<Id> free (4 bytes, not 8). Allocation panics only after exhausting the full u32 space (>4 billion ids), which is treated as a programmer limit.

The counter uses Relaxed ordering: uniqueness needs the atomicity of the read-modify-write, not an ordering edge to any other memory location.

Implementations

impl<T> IdGenerator<T>

pub fn new() -> Self

pub fn with_start(start: u32) -> Self

pub fn next(&self) -> T

where T: From<NonZeroU32>,

pub fn reserve(&self, count: u32) -> u32

Reserve count contiguous identifiers and return the first slot.

A caller that numbers a whole unit of work reserves one block, so the block order follows the caller’s order and never the thread timing. An empty reservation returns the next slot without consuming it.

Trait Implementations

impl<T: Debug> Debug for IdGenerator<T>

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

Formats the value using the given formatter.

impl<T> Default for IdGenerator<T>

fn default() -> Self

Returns the “default value” for a type.