File

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.

The Prosody project is open to contributions (see HACKERS file), but is
maintained daily by:

  - Matthew Wild (mail: matthew [at] prosody.im)
  - Waqas Hussain (mail: waqas [at] prosody.im)
  - Kim Alvefur (mail: zash [at] prosody.im)

You can reach us collectively by email: developers [at] prosody.im
or in realtime in the Prosody chatroom: prosody@conference.prosody.im