ids.rs 100.0%

22 of 22 lines run, 11 of 11 functions · run #6 on main · run missed

//! Identifiers (spec §9.4): ULIDs, 26 characters of Crockford base32, time
//! ordered and globally unique, so an id made on one machine merges into a
//! hub without renaming.

use rand::RngCore;

const CROCKFORD: &[u8; 32] = b"0123456789ABCDEFGHJKMNPQRSTVWXYZ";

/// A new ULID for the current time.
pub fn ulid() -> String {
    let mut r = [0u8; 16];
    rand::rngs::OsRng.fill_bytes(&mut r);
    ulid_from(now_ms(), u128::from_be_bytes(r))
}

/// A ULID from a millisecond time and 80 bits taken from `random`.
pub fn ulid_from(ms: u64, random: u128) -> String {
    let v: u128 = ((ms as u128 & ((1 << 48) - 1)) << 80) | (random & ((1u128 << 80) - 1));
    (0..26).map(|i| CROCKFORD[((v >> (125 - 5 * i)) & 31) as usize] as char).collect()
}

/// Milliseconds since the Unix epoch.
pub fn now_ms() -> u64 {
    std::time::SystemTime::now().duration_since(std::time::UNIX_EPOCH).map(|d| d.as_millis() as u64).unwrap_or(0)
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn ulids_are_26_chars_and_sort_by_time() {
        let a = ulid_from(1_000, 5);
        let b = ulid_from(2_000, 0);
        assert_eq!(a.len(), 26);
        assert!(a < b);
        assert_eq!(ulid_from(0, 0), "00000000000000000000000000");
        assert_ne!(ulid(), ulid());
    }
}

`/`	Search
`g` `c`	Code
`g` `h`	History
`g` `b`	Bookmarks
`g` `t`	Trust
`y`	Permalink to this state (files and trees)
`?`	This sheet

1		//! Identifiers (spec §9.4): ULIDs, 26 characters of Crockford base32, time
2		//! ordered and globally unique, so an id made on one machine merges into a
3		//! hub without renaming.
4
5		use rand::RngCore;
6
7		const CROCKFORD: &[u8; 32] = b"0123456789ABCDEFGHJKMNPQRSTVWXYZ";
8
9		/// A new ULID for the current time.
10	11520×	pub fn ulid() -> String {
11	11520×	let mut r = [0u8; 16];
12	11520×	rand::rngs::OsRng.fill_bytes(&mut r);
13	11520×	ulid_from(now_ms(), u128::from_be_bytes(r))
14	11520×	}
15
16		/// A ULID from a millisecond time and 80 bits taken from `random`.
17	11523×	pub fn ulid_from(ms: u64, random: u128) -> String {
18	11523×	let v: u128 = ((ms as u128 & ((1 << 48) - 1)) << 80) \| (random & ((1u128 << 80) - 1));
19	299598×	(0..26).map(\|i\| CROCKFORD[((v >> (125 - 5 * i)) & 31) as usize] as char).collect()
20	11523×	}
21
22		/// Milliseconds since the Unix epoch.
23	25008×	pub fn now_ms() -> u64 {
24	25008×	std::time::SystemTime::now().duration_since(std::time::UNIX_EPOCH).map(\|d\| d.as_millis() as u64).unwrap_or(0)
25	25008×	}
26
27		#[cfg(test)]
28		mod tests {
29		use super::*;
30
31		#[test]
32	1×	fn ulids_are_26_chars_and_sort_by_time() {
33	1×	let a = ulid_from(1_000, 5);
34	1×	let b = ulid_from(2_000, 0);
35	1×	assert_eq!(a.len(), 26);
36	1×	assert!(a < b);
37	1×	assert_eq!(ulid_from(0, 0), "00000000000000000000000000");
38	1×	assert_ne!(ulid(), ulid());
39	1×	}
40		}

Coverage / crates/spectra-core/src/ids.rs 100.0%

Keyboard