mirrors/scylladb
1
0
Fork 0
mirror of https://github.com/scylladb/scylladb.git synced 2026-06-06 23:13:15 +00:00
Code Issues Packages Projects Releases Wiki Activity

mvcc: partition_snapshot_row_cursor: Extract prepare_heap()

Browse Source
This commit is contained in:
Tomasz Grabiec
2017-12-06 14:10:07 +01:00
parent a6e083ef6f
commit 8e9f8d93ef
1 changed files with 22 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

40
partition_snapshot_row_cursor.hh
View File

@@ -129,6 +129,27 @@ class partition_snapshot_row_cursor final {
} while (!_heap.empty() && eq(_current_row[0].it->position(), _heap[0].it->position()));
_position = position_in_partition(_current_row[0].it->position());
}
void prepare_heap(position_in_partition_view lower_bound) {
memory::on_alloc_point();
rows_entry::compare less(_schema);
position_in_version::less_compare heap_less(_schema);
_heap.clear();
_current_row.clear();
_iterators.clear();
int version_no = 0;
for (auto&& v : _snp.versions()) {
auto& rows = v.partition().clustered_rows();
auto pos = rows.lower_bound(lower_bound, less);
auto end = rows.end();
_iterators.push_back(pos);
if (pos != end) {
_heap.push_back({pos, end, version_no});
}
++version_no;
}
boost::range::make_heap(_heap, heap_less);
}
public:
partition_snapshot_row_cursor(const schema& s, partition_snapshot& snp)
: _schema(s)
@@ -205,24 +226,7 @@ public:
// Must be called under reclaim lock.
// When throws, the cursor is invalidated and its position is not changed.
bool advance_to(position_in_partition_view lower_bound) {
memory::on_alloc_point();
rows_entry::compare less(_schema);
position_in_version::less_compare heap_less(_schema);
_heap.clear();
_current_row.clear();
_iterators.clear();
int version_no = 0;
for (auto&& v : _snp.versions()) {
auto& rows = v.partition().clustered_rows();
auto pos = rows.lower_bound(lower_bound, less);
auto end = rows.end();
_iterators.push_back(pos);
if (pos != end) {
_heap.push_back({pos, end, version_no});
}
++version_no;
}
boost::range::make_heap(_heap, heap_less);
prepare_heap(lower_bound);
_change_mark = _snp.get_change_mark();
bool found = no_clustering_row_between(_schema, lower_bound, _heap[0].it->position());
recreate_current_row();