You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@ignite.apache.org by sb...@apache.org on 2019/02/26 12:17:36 UTC
[ignite] 05/11: minor
This is an automated email from the ASF dual-hosted git repository.
sboikov pushed a commit to branch ignite-invokeAll
in repository https://gitbox.apache.org/repos/asf/ignite.git
commit 5368c2505ee4e3ac6a7aca89f7fd721bb0d1a55b
Author: Sergi Vladykin <se...@gmail.com>
AuthorDate: Sun Feb 24 16:37:53 2019 +0300
minor
---
.../ignite/internal/processors/cache/persistence/tree/BPlusTree.java | 4 +---
1 file changed, 1 insertion(+), 3 deletions(-)
diff --git a/modules/core/src/main/java/org/apache/ignite/internal/processors/cache/persistence/tree/BPlusTree.java b/modules/core/src/main/java/org/apache/ignite/internal/processors/cache/persistence/tree/BPlusTree.java
index e4fa862..8d484ca 100644
--- a/modules/core/src/main/java/org/apache/ignite/internal/processors/cache/persistence/tree/BPlusTree.java
+++ b/modules/core/src/main/java/org/apache/ignite/internal/processors/cache/persistence/tree/BPlusTree.java
@@ -3058,8 +3058,6 @@ public abstract class BPlusTree<L, T extends L> extends DataStructure implements
if (fwdId == 0L || compare(io, pageAddr, cnt - 1, nextRow) >= 0)
gettingHighLvl = lvl;
else {
- // TODO may be compare to currently found insertion point instead of the rightmost row in the page??
-
// Because we unfinalize it after each switch to the next row.
assert gettingHighLvl >= 0: gettingHighLvl + " " + lvl;
@@ -3102,7 +3100,7 @@ public abstract class BPlusTree<L, T extends L> extends DataStructure implements
// If it is a routing page or the search row is out of bounds for this page, need to get higher.
if (cnt == 0 || compare(lvl, io, pageAddr, cnt - 1, row) < 0)
- return Integer.MIN_VALUE; // Will be ignored, will get higher because gettingHigh flag was not reset.
+ return Integer.MIN_VALUE; // Will be ignored, we will get higher because gettingHigh flag was not reset.
gettingHigh = false; // Starting from this point we are high enough to have valid search.
}