Great package! You are already supporting different types of identifiers, but I was wondering if you had considered including ULIDs, e.g. by importing functions from the ulid package?
I learned about ULIDs when I was looking for lexicographically sortable unique identifiers, but they have other advantages as well
[ULILDs] have 128-bit compatibility with 'UUID', 1.21e+24 unique 'ULIDs' per millisecond, are lexicographically sortable, canonically encoded as a 26 character string, as opposed to the 36 character 'UUID', use Crockford's 'base32' for better efficiency and readability (5 bits per character), are case insensitive, have no special characters (i.e. are 'URL' safe) and have a onotonic sort order (correctly detects and handles the same millisecond).
Great package! You are already supporting different types of identifiers, but I was wondering if you had considered including ULIDs, e.g. by importing functions from the ulid package?
I learned about ULIDs when I was looking for lexicographically sortable unique identifiers, but they have other advantages as well