mirror of
https://github.com/bjc/prosody.git
synced 2025-04-01 20:27:39 +03:00
Allows sorting by id as a substitute for sorting by timestamp since it has the timestamp in the encoded in the first part, and only things that happen extremely close together may get out of order by such a sort, which might not matter. From draft-ietf-uuidrev-rfc4122bis formerly draft-peabody-dispatch-new-uuid-format
47 lines
1.3 KiB
Lua
47 lines
1.3 KiB
Lua
-- This tests the format, not the randomness
|
|
|
|
local uuid = require "util.uuid";
|
|
|
|
describe("util.uuid", function()
|
|
describe("#generate()", function()
|
|
it("should work follow the UUID pattern", function()
|
|
-- https://www.rfc-editor.org/rfc/rfc4122.html#section-4.4
|
|
|
|
local pattern = "^" .. table.concat({
|
|
string.rep("%x", 8),
|
|
string.rep("%x", 4),
|
|
"4" .. -- version
|
|
string.rep("%x", 3),
|
|
"[89ab]" .. -- reserved bits of 1 and 0
|
|
string.rep("%x", 3),
|
|
string.rep("%x", 12),
|
|
}, "%-") .. "$";
|
|
|
|
for _ = 1, 100 do
|
|
assert.is_string(uuid.generate():match(pattern));
|
|
end
|
|
|
|
assert.truthy(uuid.generate() ~= uuid.generate(), "does not generate the same UUIDv4 twice")
|
|
end);
|
|
end);
|
|
describe("#v7", function()
|
|
it("should also follow the UUID pattern", function()
|
|
local pattern = "^" .. table.concat({
|
|
string.rep("%x", 8),
|
|
string.rep("%x", 4),
|
|
"7" .. -- version
|
|
string.rep("%x", 3),
|
|
"[89ab]" .. -- reserved bits of 1 and 0
|
|
string.rep("%x", 3),
|
|
string.rep("%x", 12),
|
|
}, "%-") .. "$";
|
|
|
|
local one = uuid.v7(); -- one before the loop to ensure some time passes
|
|
for _ = 1, 100 do
|
|
assert.is_string(uuid.v7():match(pattern));
|
|
end
|
|
-- one after the loop when some time should have passed
|
|
assert.truthy(one < uuid.v7(), "should be ordererd")
|
|
end);
|
|
end);
|
|
end);
|