fergalmoran/ladybird
1
0
Fork 0
mirror of https://github.com/fergalmoran/ladybird.git synced 2026-01-04 07:36:50 +00:00
Code Issues Packages Projects Releases Wiki Activity

LibSQL: Use Block::Index everywhere; rename pointer to block_index

Browse Source 
No functional changes.
This commit is contained in:
Jelle Raaijmakers
2023-04-23 13:59:56 +02:00
committed by Tim Flynn
parent 6601ff9d65
commit fdac8331cc
19 changed files with 202 additions and 203 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
Userland/Libraries/LibSQL/BTreeIterator.cpp
View File

@@ -107,7 +107,7 @@ BTreeIterator BTreeIterator::next() const
for (size_t i = 0; i < up->size(); i++) {
// One level up, try to find the entry with the current
// node's pointer as the left pointer:
if (up->down_pointer(i) == node->pointer())
if (up->down_pointer(i) == node->block_index())
// Found it. This is the iterator's next value:
return BTreeIterator(up, (int)i);
}
@@ -182,7 +182,7 @@ BTreeIterator BTreeIterator::previous() const
for (size_t i = up->size(); i > 0; i--) {
// One level up, try to find the entry with the current
// node's pointer as the right pointer:
if (up->down_pointer(i) == node->pointer()) {
if (up->down_pointer(i) == node->block_index()) {
// Found it. This is the iterator's next value:
node = up;
ix = (int)i - 1;
@@ -218,7 +218,7 @@ bool BTreeIterator::update(Key const& new_value)
{
if (is_end())
return false;
if ((cmp(new_value) == 0) && (key().pointer() == new_value.pointer()))
if ((cmp(new_value) == 0) && (key().block_index() == new_value.block_index()))
return true;
auto previous_iter = previous();
auto next_iter = next();