LockMonoUlidGenerator

Struct LockMonoUlidGenerator 

Source
pub struct LockMonoUlidGenerator<ID, T, R>
where ID: UlidId, T: TimeSource<ID::Ty>, R: RandSource<ID::Ty>,
{ /* private fields */ }
Available on crate features ulid and lock only.
Expand description

A lock-based monotonic ULID-style ID generator suitable for multi-threaded environments.

This generator wraps the Ulid state in an Arc<Mutex<_>>, allowing safe shared use across threads.

§Features

  • ✅ Thread-safe
  • ✅ Probabilistically unique (no coordination required)
  • ✅ Time-ordered (monotonically increasing per millisecond)
  • You’re in a multi-threaded environment
  • You need require monotonically increasing IDs (ID generated within the same millisecond increment a sequence counter)
  • Your target doesn’t support atomics.

§See Also

Implementations§

Source§

impl<ID, T, R> LockMonoUlidGenerator<ID, T, R>
where ID: UlidId, T: TimeSource<ID::Ty>, R: RandSource<ID::Ty>,

Source

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

Available on crate features snowflake or ulid only.

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

§Parameters
  • time: 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::{LockMonoUlidGenerator, IdGenStatus, ULID, MonotonicClock, ThreadRandom};

let generator = LockMonoUlidGenerator::new(MonotonicClock::default(), ThreadRandom::default());

let id: ULID = loop {
    match generator.next_id() {
        IdGenStatus::Ready { id } => break id,
        IdGenStatus::Pending { .. } => core::hint::spin_loop(),
    }
};
Source

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

Available on crate features snowflake or ulid only.

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
  • time: 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.

Source

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

Available on crate features snowflake or ulid only.

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

Panics if the lock is poisoned. For explicitly fallible behavior, use Self::try_next_id instead.

§Example
use ferroid::{LockMonoUlidGenerator, IdGenStatus, ULID, MonotonicClock, ThreadRandom};

let generator = LockMonoUlidGenerator::new(MonotonicClock::default(), ThreadRandom::default());

let id: ULID = loop {
    match generator.next_id() {
        IdGenStatus::Ready { id } => break id,
        IdGenStatus::Pending { .. } => std::thread::yield_now(),
    }
};
Source

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

Available on crate features snowflake or ulid only.

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 new ID is available
  • Ok(IdGenStatus::Pending { yield_for }): The time to wait (in milliseconds) before trying again
  • Err(e): the lock was poisoned
§Errors
  • Returns an error if the underlying lock has been poisoned.
§Example
use ferroid::{LockMonoUlidGenerator, IdGenStatus, ULID, ToU64, MonotonicClock, ThreadRandom};

let generator = LockMonoUlidGenerator::new(MonotonicClock::default(), ThreadRandom::default());

// Attempt to generate a new ID
let id: ULID = loop {
    match generator.try_next_id() {
        Ok(IdGenStatus::Ready { id }) => break id,
        Ok(IdGenStatus::Pending { yield_for }) => {
            std::thread::sleep(core::time::Duration::from_millis(yield_for.to_u64()));
        }
        Err(e) => panic!("Generator error: {}", e),
    }
};

Trait Implementations§

Source§

impl<ID, T, R> UlidGenerator<ID, T, R> for LockMonoUlidGenerator<ID, T, R>
where ID: UlidId, T: TimeSource<ID::Ty>, R: RandSource<ID::Ty>,

Available on crate features snowflake or ulid only.
Source§

type Err = Error

Source§

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

Source§

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

Returns the next available ID
Source§

fn try_next_id(&self) -> Result<IdGenStatus<ID>, Self::Err>

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

Auto Trait Implementations§

§

impl<ID, T, R> Freeze for LockMonoUlidGenerator<ID, T, R>
where T: Freeze, R: Freeze,

§

impl<ID, T, R> RefUnwindSafe for LockMonoUlidGenerator<ID, T, R>

§

impl<ID, T, R> Send for LockMonoUlidGenerator<ID, T, R>
where T: Send, R: Send, ID: Send,

§

impl<ID, T, R> Sync for LockMonoUlidGenerator<ID, T, R>
where T: Sync, R: Sync, ID: Send,

§

impl<ID, T, R> Unpin for LockMonoUlidGenerator<ID, T, R>
where T: Unpin, R: Unpin,

§

impl<ID, T, R> UnwindSafe for LockMonoUlidGenerator<ID, T, R>
where T: UnwindSafe, R: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<G, ID, T, R> UlidGeneratorAsyncExt<ID, T, R> for G
where G: UlidGenerator<ID, T, R>, ID: UlidId, T: TimeSource<<ID as Id>::Ty>, R: RandSource<<ID as Id>::Ty>,

Source§

type Err = <G as UlidGenerator<ID, T, R>>::Err

Available on crate features futures and ulid only.
Source§

fn try_next_id_async<'a, S>( &'a self, ) -> impl Future<Output = Result<ID, <G as UlidGeneratorAsyncExt<ID, T, R>>::Err>>
where S: SleepProvider,

Available on crate features futures and ulid only.
Returns a future that resolves to the next available Snowflake ID. Read more
Source§

impl<G, ID, T, R> UlidGeneratorAsyncSmolExt<ID, T, R> for G
where G: UlidGenerator<ID, T, R>, ID: UlidId, T: TimeSource<<ID as Id>::Ty>, R: RandSource<<ID as Id>::Ty>,

Source§

type Err = <G as UlidGenerator<ID, T, R>>::Err

Available on crate feature async-smol and crate feature ulid and (crate features async-tokio or async-smol) only.
Source§

fn try_next_id_async( &self, ) -> impl Future<Output = Result<ID, <G as UlidGeneratorAsyncSmolExt<ID, T, R>>::Err>>

Available on crate feature async-smol and crate feature ulid and (crate features async-tokio or async-smol) only.
Returns a future that resolves to the next available Ulid using the SmolSleep provider. Read more
Source§

impl<G, ID, T, R> UlidGeneratorAsyncTokioExt<ID, T, R> for G
where G: UlidGenerator<ID, T, R>, ID: UlidId, T: TimeSource<<ID as Id>::Ty>, R: RandSource<<ID as Id>::Ty>,

Source§

type Err = <G as UlidGenerator<ID, T, R>>::Err

Available on crate feature async-tokio and crate feature ulid and (crate features async-tokio or async-smol) only.
Source§

fn try_next_id_async( &self, ) -> impl Future<Output = Result<ID, <G as UlidGeneratorAsyncTokioExt<ID, T, R>>::Err>>

Available on crate feature async-tokio and crate feature ulid and (crate features async-tokio or async-smol) only.
Returns a future that resolves to the next available ULID using the TokioSleep provider. Read more
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V