| commit | fe3b6b5a42e36d63e0ddd5d80e8228902347e5f2 | |
| author | Evgeniy Polyakov <zbr@ioremap.net> | |
| Wed, 14 Nov 2012 15:44:16 +0000 (14 19:44 +0400) | ||
| committer | Evgeniy Polyakov <zbr@ioremap.net> | |
| Wed, 14 Nov 2012 15:44:16 +0000 (14 19:44 +0400) | ||
| tree | e6b0b0bf317b7d33fabe13a8f56908d67c1cc21a | treesnapshot (tar.gz zip) |
| parent | 84659591ef6c76638d44f7c306f85c660e47c5bf | commitdiff |
Range iterator starts with keys found in ram (for the unsorted blobs).
But in background we can sort indexes (or even blobs).
Keys found in RAM should only be processed, if they are not present on disk.
Thus we check if blob has sorted index for given key, and if so, we postpone it to disk operation.
But in background we can sort indexes (or even blobs).
Keys found in RAM should only be processed, if they are not present on disk.
Thus we check if blob has sorted index for given key, and if so, we postpone it to disk operation.
| library/range.c | diffblobblamehistory |