diff options
| author | Kim Alvefur <zash@zash.se> | 2021-05-12 01:32:03 +0200 |
|---|---|---|
| committer | Kim Alvefur <zash@zash.se> | 2021-05-12 01:32:03 +0200 |
| commit | 7259b41e2397af9b6d58dee3785bcd5e9684ca56 (patch) | |
| tree | 99ddd4816b0408a2e2fd881a656ecb2effe764e7 /net/resolvers/service.lua | |
| parent | f4be79f6d6bc148f7dee8acba304217bd4c964e4 (diff) | |
| download | prosody-7259b41e2397af9b6d58dee3785bcd5e9684ca56.tar.gz prosody-7259b41e2397af9b6d58dee3785bcd5e9684ca56.zip | |
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.
Diffstat (limited to 'net/resolvers/service.lua')
0 files changed, 0 insertions, 0 deletions