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.

# Settings for using `hg email`

[email]
# See `hg help config.email`
to = prosody-dev@googlegroups.com

[smtp]
# See `hg help config.smtp`
host = mail.example.com
port = submission
tls = starttls
username =

[extensions]
# command to send changesets as (a series of) patch emails
patchbomb =