You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
If multiple UUIDs are generated in the same millisecond, the random bits are not guaranteed to be monotonically increasing. So given const [a, b, c] = [ulid(), ulid(), ulid()] c and b could sort lower than a
This implementation already has an algo for incrementing the base32 of the ulid. It should just change to increment the most significant bits instead of the least significant bits of the random portion.
The text was updated successfully, but these errors were encountered:
This is related to #21 and ulid/spec#11
If multiple UUIDs are generated in the same millisecond, the random bits are not guaranteed to be monotonically increasing. So given
const [a, b, c] = [ulid(), ulid(), ulid()]
c
andb
could sort lower thana
This implementation already has an algo for incrementing the base32 of the ulid. It should just change to increment the most significant bits instead of the least significant bits of the random portion.
The text was updated successfully, but these errors were encountered: