Software /
code /
prosody
File
spec/util_random_spec.lua @ 13136:396db0e7084f
mod_storage_internal: Use a binary search for time based ranges
Iterating over an entire archive to find a few items in the far end from
where iteration started is expensive, and probably more expensive with
the lazy-loading of items added in the previous commit.
Since we can now efficiently read items in random order, we can now use
a binary search to find a better starting point for iteration.
author | Kim Alvefur <zash@zash.se> |
---|---|
date | Wed, 12 May 2021 01:32:03 +0200 |
parent | 8450:3a9a3d90c44c |
line wrap: on
line source
local random = require "util.random"; describe("util.random", function() describe("#bytes()", function() it("should return a string", function() assert.is_string(random.bytes(16)); end); it("should return the requested number of bytes", function() -- Makes no attempt at testing how random the bytes are, -- just that it returns the number of bytes requested for i = 1, 20 do assert.are.equal(2^i, #random.bytes(2^i)); end end); end); end);