int type = type() & ~(LOW_EXTREMITY | HIGH_EXTREMITY); if (type != TYPE_TN_IN && type != TYPE_TN_BIN && !isLeaf()) { return verifyFailed(level, observer, "Not a tree node: " + type); return verifyFailed(level, observer, "Left segment tail: " + leftSegTail()); return verifyFailed(level, observer, "Search vector start: " + searchVecStart()); return verifyFailed(level, observer, "Search vector end: " + searchVecEnd()); return verifyFailed(level, observer, "Right segment tail: " + rightSegTail()); int childIdsEnd = childIdsStart + ((childIdsStart - searchVecStart()) << 2) + 8; if (childIdsEnd > (rightSegTail() + 1)) { return verifyFailed(level, observer, "Child ids end: " + childIdsEnd); long childId = p_uint48GetLE(page, i); if (mId > 1 && childId <= 1) { // stubs don't have a valid child id return verifyFailed(level, observer, "Illegal child id: " + childId); return verifyFailed(level, observer, "Duplicate child id: " + childId); return verifyFailed(level, observer, "Entry location: " + loc); : (((keyLen & 0x3f) << 8) | p_ubyteGet(page, loc++)); } catch (IndexOutOfBoundsException e) { return verifyFailed(level, observer, "Key location out of bounds"); return verifyFailed(level, observer, "Key end location: " + (loc + keyLen));
int type = type() & ~(LOW_EXTREMITY | HIGH_EXTREMITY); if (type != TYPE_TN_IN && type != TYPE_TN_BIN && !isLeaf()) { return verifyFailed(level, observer, "Not a tree node: " + type); return verifyFailed(level, observer, "Left segment tail: " + leftSegTail()); return verifyFailed(level, observer, "Search vector start: " + searchVecStart()); return verifyFailed(level, observer, "Search vector end: " + searchVecEnd()); return verifyFailed(level, observer, "Right segment tail: " + rightSegTail()); int childIdsEnd = childIdsStart + ((childIdsStart - searchVecStart()) << 2) + 8; if (childIdsEnd > (rightSegTail() + 1)) { return verifyFailed(level, observer, "Child ids end: " + childIdsEnd); long childId = p_uint48GetLE(page, i); if (mId > 1 && childId <= 1) { // stubs don't have a valid child id return verifyFailed(level, observer, "Illegal child id: " + childId); return verifyFailed(level, observer, "Duplicate child id: " + childId); return verifyFailed(level, observer, "Entry location: " + loc); : (((keyLen & 0x3f) << 8) | p_ubyteGet(page, loc++)); } catch (IndexOutOfBoundsException e) { return verifyFailed(level, observer, "Key location out of bounds"); return verifyFailed(level, observer, "Key end location: " + (loc + keyLen));
return verifyFailed(level, observer, "Not a tree node: " + type); return verifyFailed(level, observer, "Left segment tail: " + leftSegTail()); return verifyFailed(level, observer, "Search vector start: " + searchVecStart()); return verifyFailed(level, observer, "Search vector end: " + searchVecEnd()); return verifyFailed(level, observer, "Right segment tail: " + rightSegTail()); int childIdsEnd = childIdsStart + ((childIdsStart - searchVecStart()) << 2) + 8; if (childIdsEnd > (rightSegTail() + 1)) { return verifyFailed(level, observer, "Child ids end: " + childIdsEnd); long childId = p_uint48GetLE(page, i); if (mId > 1 && childId <= 1) { // stubs don't have a valid child id return verifyFailed(level, observer, "Illegal child id: " + childId); return verifyFailed(level, observer, "Duplicate child id: " + childId); return verifyFailed(level, observer, "Entry location: " + loc); : (((keyLen & 0x3f) << 8) | p_ubyteGet(page, loc++)); } catch (IndexOutOfBoundsException e) { return verifyFailed(level, observer, "Key location out of bounds"); return verifyFailed(level, observer, "Key end location: " + loc); int result = compareKeys(this, lastKeyLoc, this, keyLoc);