This is a Rust implementation of the ulid project which provides Universally Unique Lexicographically Sortable Identifiers.
```rust // 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()); ```
serde: Enables serialization and deserialization of Ulid types via serde. ULIDs are serialized using their canonical 26-character representation as defined in the ULID standard. An optional ulid_as_u128 module is provided, which enables serialization through an Ulid's inner u128 primitive type. See the documentation and serde docs for more information.uuid: Implements infallible conversions between ULIDs and UUIDs from the uuid crate via the std::convert::From trait.Benchmarks were run on my laptop. Run them yourself with cargo bench.
test bench_from_string ... bench: 34 ns/iter (+/- 0)
test bench_from_time ... bench: 16 ns/iter (+/- 0)
test bench_generator_generate ... bench: 56 ns/iter (+/- 0)
test bench_new ... bench: 69 ns/iter (+/- 1)
test bench_to_str ... bench: 14 ns/iter (+/- 0)
test bench_to_string ... bench: 116 ns/iter (+/- 1)