Struct BasicUlidGenerator

pub struct BasicUlidGenerator<ID, T, R>
where
    ID: Ulid,
    T: TimeSource<ID::Ty>,
    R: RandSource<ID::Ty>,
{ /* private fields */ }

A monotonic ULID-style ID generator suitable for single-threaded environments.

This generator is lightweight and fast, but is not thread-safe.

Features

• ❌ Not thread-safe
• ✅ Probabilistically unique (no coordination required)
• ✅ Time-ordered (monotonically increasing per millisecond)

Recommended When

• You’re in a single-threaded environment (no shared access)
• You need require monotonically increasing IDs (ID generated within the same millisecond increment a sequence counter)

See Also

• LockUlidGenerator

Implementations

impl<ID, T, R> BasicUlidGenerator<ID, T, R>

where ID: Ulid, T: TimeSource<ID::Ty>, R: RandSource<ID::Ty>,

pub fn new(clock: T, rng: R) -> Self

Creates a new BasicUlidGenerator with the provided time source and RNG.

Parameters

• clock: A TimeSource used to retrieve the current timestamp
• rng: A RandSource used to generate random bits

Returns

A ready-to-use ULID generator suitable for producing unique, sortable IDs.

Example

use ferroid::{BasicUlidGenerator, ULID, MonotonicClock, ThreadRandom};

let generator = BasicUlidGenerator::<ULID, _, _>::new(MonotonicClock::default(), ThreadRandom::default());
let id = generator.next_id();
println!("Generated ID: {:?}", id);

pub fn from_components( timestamp: ID::Ty, random: ID::Ty, clock: T, rng: R, ) -> Self

Creates a new ID generator from explicit component values.

This constructor is primarily useful for advanced use cases such as restoring state from persistent storage or controlling the starting point of the generator manually.

Parameters

• timestamp: The initial timestamp component (usually in milliseconds)
• machine_id: The machine or worker identifier
• sequence: The initial sequence number
• clock: A TimeSource implementation used to fetch the current time

Returns

A new generator instance preloaded with the given state.

⚠️ Note

In typical use cases, you should prefer Self::new to let the generator initialize itself from the current time.

pub fn next_id(&self) -> IdGenStatus<ID>

Generates a new ULID.

Internally calls Self::try_next_id and unwraps the result. This method will panic on error, so prefer the fallible version if you want explicit control over error handling.

Panics

This method currently has no fallible code paths, but may panic if an internal error occurs in future implementations. For explicitly fallible behavior, use Self::try_next_id instead.

Example

use ferroid::{BasicUlidGenerator, IdGenStatus, ULID, MonotonicClock, ThreadRandom};

let clock = MonotonicClock::default();
let rand = ThreadRandom::default();
let generator = BasicUlidGenerator::<ULID, _, _>::new(clock, rand);

// Attempt to generate a new ID
match generator.next_id() {
    IdGenStatus::Ready { id } => {
        println!("ID: {}", id);
    }
    IdGenStatus::Pending { yield_for } => {
        println!("Exhausted; wait for: {}ms", yield_for);
    }
}

pub fn try_next_id(&self) -> Result<IdGenStatus<ID>>

Attempts to generate a new ULID with fallible error handling.

Combines the current timestamp with a freshly generated random value to produce a unique identifier. Returns IdGenStatus::Ready on success.

Returns

• Ok(IdGenStatus::Ready { id }) A ULID was generated
• Ok(IdGenStatus::Pending { yield_for }) Never, but kept to match the Snowflake API
• Err(e) if the time source or rand source failed

Example

use ferroid::{BasicUlidGenerator, IdGenStatus, ULID, MonotonicClock, ThreadRandom};

let clock = MonotonicClock::default();
let rand = ThreadRandom::default();
let generator = BasicUlidGenerator::<ULID, _, _>::new(clock, rand);

// Attempt to generate a new ID
match generator.try_next_id() {
    Ok(IdGenStatus::Ready { id }) => {
        println!("ID: {}", id);
    }
    Ok(IdGenStatus::Pending { yield_for }) => {
        println!("Exhausted; wait for: {}ms", yield_for);
    }
    Err(e) => eprintln!("Generator error: {}", e),
}

Trait Implementations

impl<ID, T, R> UlidGenerator<ID, T, R> for BasicUlidGenerator<ID, T, R>

where ID: Ulid, T: TimeSource<ID::Ty>, R: RandSource<ID::Ty>,

fn new(clock: T, rng: R) -> Self

fn next_id(&self) -> IdGenStatus<ID>

Returns the next available ID

fn try_next_id(&self) -> Result<IdGenStatus<ID>>

A fallible version of Self::next_id that returns a Result.