scru128 3.6.1

//! # SCRU128: Sortable, Clock and Random number-based Unique identifier
//!
//! SCRU128 ID is yet another attempt to supersede [UUID] for the users who need
//! decentralized, globally unique time-ordered identifiers. SCRU128 is inspired by
//! [ULID] and [KSUID] and has the following features:
//!
//! - 128-bit unsigned integer type
//! - Sortable by generation time (as integer and as text)
//! - 25-digit case-insensitive textual representation (Base36)
//! - 48-bit millisecond Unix timestamp that ensures useful life until year 10889
//! - Up to 281 trillion time-ordered but unpredictable unique IDs per millisecond
//! - 80-bit three-layer randomness for global uniqueness
//!
//! ```rust
//! # #[cfg(feature = "global_gen")]
//! # {
//! // generate a new identifier object
//! let x = scru128::new();
//! println!("{}", x); // e.g., "036z951mhjikzik2gsl81gr7l"
//! println!("{}", x.to_u128()); // as a 128-bit unsigned integer
//!
//! // generate a textual representation directly
//! println!("{}", scru128::new_string()); // e.g., "036z951mhzx67t63mq9xe6q0j"
//!
//! # }
//! ```
//!
//! See [SCRU128 Specification] for details.
//!
//! [UUID]: https://en.wikipedia.org/wiki/Universally_unique_identifier
//! [ULID]: https://github.com/ulid/spec
//! [KSUID]: https://github.com/segmentio/ksuid
//! [SCRU128 Specification]: https://github.com/scru128/spec
//!
//! ## Crate features
//!
//! Default features:
//!
//! - `std` enables, among others, the default timestamp source for [`Generator`]
//!   using [`std::time`]. Without `std`, users must provide their own time source
//!   implementing the [`TimeSource`](generator::TimeSource) trait.
//! - `default_rng` (implies `std`) provides the default random number generator for
//!   [`Generator`] and enables the [`Generator::new()`] constructor.
//! - `global_gen` (implies `default_rng`) provides the process-wide default SCRU128
//!   generator and enables the [`new()`] and [`new_string()`] functions.
//! - `rand08`: See below.
//!
//! Optional features:
//!
//! - `serde` enables serialization/deserialization of [`Id`] via serde.
//! - `rand010` enables an adapter for `rand::Rng` to use `rand` (v0.10) and any
//!   other conforming random number generators with [`Generator`].
//!
//! Deprecated optional features:
//!
//! - `rand09` enables an adapter for `rand::RngCore` to use `rand` (v0.9) and any
//!   other conforming random number generators with [`Generator`].
//! - `rand08` enables an adapter for `rand::RngCore` to use `rand` (v0.8) and any
//!   other conforming random number generators with [`Generator`]. This feature is
//!   deprecated and for backward compatibility only but is enabled by `default_rng`
//!   for historical reasons.

#![cfg_attr(not(feature = "std"), no_std)]
#![cfg_attr(docsrs, feature(doc_cfg))]

mod global_gen;
#[cfg(feature = "global_gen")]
pub use global_gen::{new, new_string};

pub mod id;
pub use id::Id;
#[doc(hidden)]
pub use id::{Id as Scru128Id, ParseError};

pub mod generator;
pub use generator::Generator;
#[doc(hidden)]
pub use generator::{self as r#gen, Generator as Scru128Generator};

/// The maximum value of 48-bit `timestamp` field.
const MAX_TIMESTAMP: u64 = 0xffff_ffff_ffff;

/// The maximum value of 24-bit `counter_hi` field.
const MAX_COUNTER_HI: u32 = 0xff_ffff;

/// The maximum value of 24-bit `counter_lo` field.
const MAX_COUNTER_LO: u32 = 0xff_ffff;

#[cfg(all(test, feature = "std"))]
mod tests {
    use std::{collections, sync, time};

    use crate::{Generator, Id};

    static SAMPLES: sync::LazyLock<Vec<String>> = sync::LazyLock::new(|| {
        Generator::for_testing()
            .iter()
            .map(String::from)
            .take(100_000)
            .collect()
    });

    /// Generates 25-digit canonical string
    #[test]
    fn generates_25_digit_canonical_string() {
        let re = regex::Regex::new(r"^[0-9a-z]{25}$").unwrap();
        for e in &SAMPLES[..] {
            assert!(re.is_match(e));
        }
    }

    /// Generates 100k identifiers without collision
    #[test]
    fn generates_100k_identifiers_without_collision() {
        let s: collections::HashSet<&String> = SAMPLES.iter().collect();
        assert_eq!(s.len(), SAMPLES.len());
    }

    /// Generates sortable string representation by creation time
    #[test]
    fn generates_sortable_string_representation_by_creation_time() {
        for i in 1..SAMPLES.len() {
            assert!(SAMPLES[i - 1] < SAMPLES[i]);
        }
    }

    /// Encodes up-to-date timestamp
    #[test]
    fn encodes_up_to_date_timestamp() {
        let mut g = Generator::for_testing();
        for _ in 0..10_000 {
            let ts_now = (time::SystemTime::now()
                .duration_since(time::UNIX_EPOCH)
                .expect("clock may have gone backwards")
                .as_millis()) as i64;
            let timestamp = g.generate().timestamp() as i64;
            assert!((ts_now - timestamp).abs() < 16);
        }
    }

    /// Encodes unique sortable tuple of timestamp and counters
    #[test]
    fn encodes_unique_sortable_tuple_of_timestamp_and_counters() {
        let mut prev = SAMPLES[0].parse::<Id>().unwrap();
        for e in &SAMPLES[1..] {
            let curr = e.parse::<Id>().unwrap();
            assert!(
                prev.timestamp() < curr.timestamp()
                    || (prev.timestamp() == curr.timestamp()
                        && prev.counter_hi() < curr.counter_hi())
                    || (prev.timestamp() == curr.timestamp()
                        && prev.counter_hi() == curr.counter_hi()
                        && prev.counter_lo() < curr.counter_lo())
            );
            prev = curr;
        }
    }
}