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.

     1

Thanks for your interest in contributing to the project!

     2

     3

There are many ways to contribute, such as helping improve the

     4

documentation, reporting bugs, spreading the word or testing the latest

     5

development version.

     6

     7

You can find more information on how to contribute at <https://prosody.im/doc/contributing>

     8

     9

See also the HACKERS and README files.