File

HACKERS @ 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 9858:54147de1d1b1
line wrap: on
line source

Welcome hackers!

This project accepts and *encourages* contributions. If you would like to get 
involved you can join us on our mailing list and discussion rooms. More 
information on these at https://prosody.im/discuss

Patches are welcome, though before sending we would appreciate if you read 
docs/coding_style.md for guidelines on how to format your code, and other tips.

Documentation for developers can be found at https://prosody.im/doc/developers

Have fun :)