while (searchVecStart <= searchVecEnd) { int entryLoc = p_ushortGetLE(rightPage, searchVecStart); int encodedLen = leafEntryLengthAtLoc(rightPage, entryLoc); int leftEntryLoc = leftNode.createLeafEntry (null, tree, leftNode.highestLeafPos() + 2, encodedLen);
while (searchVecStart <= searchVecEnd) { int entryLoc = p_ushortGetLE(rightPage, searchVecStart); int encodedLen = leafEntryLengthAtLoc(rightPage, entryLoc); int leftEntryLoc = leftNode.createLeafEntry (null, tree, leftNode.highestLeafPos() + 2, encodedLen);
while (searchVecStart <= searchVecEnd) { int entryLoc = p_ushortGetLE(rightPage, searchVecStart); int encodedLen = leafEntryLengthAtLoc(rightPage, entryLoc); int leftEntryLoc = leftNode.createLeafEntry (null, tree, leftNode.highestLeafPos() + 2, encodedLen);
final /*P*/ byte[] spage = source.mPage; final int sloc = p_ushortGetLE(spage, source.searchVecStart()); final int encodedLen = Node.leafEntryLengthAtLoc(spage, sloc);
int len = leafEntryLengthAtLoc(page, sourceLoc); p_copy(page, sourceLoc, dest, destLoc, len); destLoc += len;
int len = leafEntryLengthAtLoc(page, sourceLoc); p_copy(page, sourceLoc, dest, destLoc, len); destLoc += len;
int len = leafEntryLengthAtLoc(page, sourceLoc); p_copy(page, sourceLoc, dest, destLoc, len); destLoc += len;
final /*P*/ byte[] spage = snode.mPage; final int sloc = p_ushortGetLE(spage, snode.searchVecStart() + spos); final int encodedLen = Node.leafEntryLengthAtLoc(spage, sloc);
int encodedLen = leafEntryLengthAtLoc(rightPage, entryLoc); int encodedLen = leafEntryLengthAtLoc(rightPage, entryLoc); int leftEntryLoc = left.createLeafEntry (null, tree, left.highestLeafPos() + 2, encodedLen);
int encodedLen = leafEntryLengthAtLoc(rightPage, entryLoc); int encodedLen = leafEntryLengthAtLoc(rightPage, entryLoc); int leftEntryLoc = left.createLeafEntry (null, tree, left.highestLeafPos() + 2, encodedLen);
int encodedLen = leafEntryLengthAtLoc(leftPage, entryLoc); int encodedLen = leafEntryLengthAtLoc(leftPage, entryLoc); int rightEntryLoc = right.createLeafEntry(null, tree, 0, encodedLen);
int encodedLen = leafEntryLengthAtLoc(rightPage, entryLoc); int encodedLen = leafEntryLengthAtLoc(rightPage, entryLoc); int leftEntryLoc = left.createLeafEntry (null, tree, left.highestLeafPos() + 2, encodedLen);
int encodedLen = leafEntryLengthAtLoc(leftPage, entryLoc); int encodedLen = leafEntryLengthAtLoc(leftPage, entryLoc); int rightEntryLoc = right.createLeafEntry(null, tree, 0, encodedLen);
int encodedLen = leafEntryLengthAtLoc(leftPage, entryLoc); int encodedLen = leafEntryLengthAtLoc(leftPage, entryLoc); int rightEntryLoc = right.createLeafEntry(null, tree, 0, encodedLen);
used += leafEntryLengthAtLoc(page, loc); } else { used += keyLengthAtLoc(page, loc);
for (; newAvail > avail; searchVecLoc += 2, newSearchVecLoc += 2) { int entryLoc = p_ushortGetLE(page, searchVecLoc); int entryLen = leafEntryLengthAtLoc(page, entryLoc); for (; newAvail > avail; searchVecLoc -= 2, newSearchVecLoc -= 2) { int entryLoc = p_ushortGetLE(page, searchVecLoc); int entryLen = leafEntryLengthAtLoc(page, entryLoc);
for (; newAvail > avail; searchVecLoc += 2, newSearchVecLoc += 2) { int entryLoc = p_ushortGetLE(page, searchVecLoc); int entryLen = leafEntryLengthAtLoc(page, entryLoc); for (; newAvail > avail; searchVecLoc -= 2, newSearchVecLoc -= 2) { int entryLoc = p_ushortGetLE(page, searchVecLoc); int entryLen = leafEntryLengthAtLoc(page, entryLoc);
for (; newAvail > avail; searchVecLoc += 2, newSearchVecLoc += 2) { int entryLoc = p_ushortGetLE(page, searchVecLoc); int entryLen = leafEntryLengthAtLoc(page, entryLoc); for (; newAvail > avail; searchVecLoc -= 2, newSearchVecLoc -= 2) { int entryLoc = p_ushortGetLE(page, searchVecLoc); int entryLen = leafEntryLengthAtLoc(page, entryLoc);
used += leafEntryLengthAtLoc(page, loc); } else { used += keyLengthAtLoc(page, loc);
used += leafEntryLengthAtLoc(page, loc); } else { used += keyLengthAtLoc(page, loc);