Generate a reordered time-based UUID v6 with improved sortability for databases.
Code
Utilitiesrequire 'securerandom'
time_greg = (Time.now.to_f * 10_000_000).to_i + 0x01b21dd213814000
time_high = (time_greg >> 28) & 0xffffffff
time_mid = (time_greg >> 12) & 0xffff
time_low = (time_greg & 0xfff) | 0x6000
clock_seq = SecureRandom.random_number(0x3fff) | 0x8000
node = SecureRandom.random_number(0xffffffffffff)
return '%08x-%04x-%04x-%04x-%012x' % [time_high, time_mid, time_low, clock_seq, node]Server
More Ruby Snippets
Generate UUID v1
Generate a time-based UUID v1 using timestamp and random node ID.
Generate UUID v3
Generate a name-based UUID v3 using MD5 hashing of namespace and name.
Generate UUID v4
Generate a random UUID v4 (Universally Unique Identifier).
Generate UUID v5
Generate a name-based UUID v5 using SHA-1 hashing of namespace and name.
Generate UUID v7
Generate a Unix timestamp-based UUID v7 with millisecond precision, ideal for database primary keys.
Array Difference
Find elements in the first array that are not present in the second array.