ulid
Version 0.1.0.0 revision 0 uploaded by steven777400.
Package meta
- Synopsis
- Implementation of ULID, lexicographically sortable unique identifiers
- Description
Implementation of alizain's ULID identifier (https:/github.comalizain/ulid ). UUID can be suboptimal for many uses-cases because: It isn't the most character efficient way of encoding 128 bits of randomness UUID v1/v2 is impractical in many environments, as it requires access to a unique, stable MAC address UUID v3/v5 requires a unique seed and produces randomly distributed IDs, which can cause fragmentation in many data structures UUID v4 provides no other information than randomness which can cause fragmentation in many data structures Instead, herein is proposed ULID: 128-bit compatibility with UUID 1.21e+24 unique ULIDs per millisecond Lexicographically sortable! Canonically encoded as a 26 character string, as opposed to the 36 character UUID Uses Crockford's base32 for better efficiency and readability (5 bits per character) Case insensitive No special characters (URL safe)
- Author
- Steve Kollmansberger
- Bug reports
- n/a
- Category
- Data
- Copyright
- 2017 Steve Kollmansberger
- Homepage
- https://github.com/steven777400/ulid
- Maintainer
- steve@kolls.net
- Package URL
- n/a
- Stability
- n/a