sid2 0.4.1

Id schema that is: 128-bit (uuid compatible); sorted (won't explode database indexes); random (gen anywhere); readable (has object type and a "short" segment); and highlights on double click. Includes postgres extension.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47

use std::time::{Duration, SystemTime};
use crate::{Label, NoLabel, Sid};

pub struct MonotonicGenerator<T = NoLabel> {
    previous: Sid<T>,
}

impl<T: Label> MonotonicGenerator<T> {
    pub fn new() -> Self {
        Self {
            previous: Sid::<T>::null(),
        }
    }

    pub fn generate(&mut self) -> Sid<T> {
        let now = SystemTime::now();
        self.generate_from_datetime(now)
    }

    pub fn generate_from_datetime(&mut self, datetime: SystemTime) -> Sid<T> {
        self.generate_from_datetime_with_source(datetime, &mut rand::thread_rng())
    }

    pub fn generate_from_datetime_with_source<R>(
        &mut self,
        datetime: SystemTime,
        source: &mut R,
    ) -> Sid<T>
        where
            R: rand::Rng,
    {
        let last_ms = self.previous.timestamp();
        // maybe time went backward, or it is the same ms.
        // increment instead of generating a new random so that it is monotonic
        let ts = datetime
            .duration_since(SystemTime::UNIX_EPOCH)
            .unwrap_or(Duration::ZERO)
            .as_millis() as u64;
        let next = if ts <= last_ms {
            self.previous.increment()
        } else {
            Sid::from_timestamp_with_rng(ts, source)
        };
        self.previous = next.clone();
        next
    }
}