Annotate
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 |
11706:56feb0cf7052 |
| child |
13191:1266efb7101c |
| rev |
line source |
|
11706
|
1 root = true
|
|
|
2
|
|
|
3 [*]
|
|
|
4 end_of_line = lf
|
|
|
5 indent_style = tab
|
|
|
6 insert_final_newline = true
|
|
|
7 trim_trailing_whitespace = true
|
|
|
8
|
|
|
9 [CHANGES]
|
|
|
10 indent_size = 4
|
|
|
11 indent_style = space
|
|
|
12
|
|
|
13 [configure]
|
|
|
14 indent_size = 3
|
|
|
15 indent_style = space
|
|
|
16
|
|
|
17 [**.xml]
|
|
|
18 indent_size = 2
|
|
|
19 indent_style = space
|
