ulid-rs
ulid-rs copied to clipboard
This is a Rust implementation of the ulid project
ulid-rs
This is a Rust implementation of the ulid project which provides Universally Unique Lexicographically Sortable Identifiers.
Quickstart
use ulid::Ulid;
// Generate a ulid
let ulid = Ulid::new();
// Generate a string for a ulid
let s = ulid.to_string();
// Create from a String
let res = Ulid::from_string(&s);
assert_eq!(ulid, res.unwrap());
Crate Features
-
std
(default): Flag to toggle use ofstd
andrand
. Disable this flag for#[no_std]
support. -
serde
: Enables serialization and deserialization ofUlid
types viaserde
. ULIDs are serialized using their canonical 26-character representation as defined in the ULID standard. An optionalulid_as_u128
module is provided, which enables serialization through anUlid
's inneru128
primitive type. See the documentation and serde docs for more information. -
uuid
: Implements infallible conversions between ULIDs and UUIDs from theuuid
crate via thestd::convert::From
trait.
Benchmark
Benchmarks were run on my desktop (Win 10/WSL2 Ubuntu; Ryzen 7 5950x). Run them yourself with cargo bench
.
test bench_from_string ... bench: 13 ns/iter (+/- 0)
test bench_from_time ... bench: 13 ns/iter (+/- 0)
test bench_generator_generate ... bench: 29 ns/iter (+/- 0)
test bench_new ... bench: 31 ns/iter (+/- 1)
test bench_to_str ... bench: 7 ns/iter (+/- 0)
test bench_to_string ... bench: 19 ns/iter (+/- 0)