Software /
code /
prosody
Annotate
spec/util_time_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 | 9193:aba99b6539f5 |
rev | line source |
---|---|
9193 | 1 describe("util.time", function () |
2 local time; | |
3 setup(function () | |
4 time = require "util.time"; | |
5 end); | |
6 describe("now()", function () | |
7 it("exists", function () | |
8 assert.is_function(time.now); | |
9 end); | |
10 it("returns a number", function () | |
11 assert.is_number(time.now()); | |
12 end); | |
13 end); | |
14 describe("monotonic()", function () | |
15 it("exists", function () | |
16 assert.is_function(time.monotonic); | |
17 end); | |
18 it("returns a number", function () | |
19 assert.is_number(time.monotonic()); | |
20 end); | |
21 it("time goes in one direction", function () | |
22 local a = time.monotonic(); | |
23 local b = time.monotonic(); | |
24 assert.truthy(a <= b); | |
25 end); | |
26 end); | |
27 end); | |
28 | |
29 | |
30 | |
31 |