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.
root = true
[*]
end_of_line = lf
indent_style = tab
insert_final_newline = true
trim_trailing_whitespace = true
[CHANGES]
indent_size = 4
indent_style = space
[configure]
indent_size = 3
indent_style = space
[**.xml]
indent_size = 2
indent_style = space