if (!isInternal()) { return;
if (!isInternal()) { return;
if (!isInternal()) { return;
toLower: while (node.isInternal()) { final int highestPos = node.highestInternalPos(); while (true) {
toLower: while (node.isInternal()) { final int highestPos = node.highestInternalPos(); while (true) {
toLower: while (node.isInternal()) { final int highestPos = node.highestInternalPos(); while (true) {
} else if (childNode.isInternal()) { if (compare <= 0) { observer.failed = true;
} else if (childNode.isInternal()) { if (compare <= 0) { observer.failed = true;
} else if (childNode.isInternal()) { if (compare <= 0) { observer.failed = true;
rootNode.acquireExclusive(); if (rootNode.numKeys() == 1 && rootNode.isInternal()) {