boolean nextNodeNeedsCopy = true; if (BTree.getKeyEnd(nextNode) > BTree.MINIMAL_NODE_SIZE) node = copyIfNeeded(node, needsCopy); else if (i > 0 && BTree.getKeyEnd((Object[]) node[keyEnd + i - 1]) > BTree.MINIMAL_NODE_SIZE) node = copyIfNeeded(node, needsCopy); final Object[] leftNeighbour = (Object[]) node[keyEnd + i - 1]; index++; node = copyIfNeeded(node, needsCopy); nextNode = rotateRight(node, i);
boolean nextNodeNeedsCopy = true; if (BTree.getKeyEnd(nextNode) > BTree.MINIMAL_NODE_SIZE) node = copyIfNeeded(node, needsCopy); else if (i > 0 && BTree.getKeyEnd((Object[]) node[keyEnd + i - 1]) > BTree.MINIMAL_NODE_SIZE) node = copyIfNeeded(node, needsCopy); final Object[] leftNeighbour = (Object[]) node[keyEnd + i - 1]; index++; node = copyIfNeeded(node, needsCopy); nextNode = rotateRight(node, i);
boolean nextNodeNeedsCopy = true; if (BTree.getKeyEnd(nextNode) > BTree.MINIMAL_NODE_SIZE) node = copyIfNeeded(node, needsCopy); else if (i > 0 && BTree.getKeyEnd((Object[]) node[keyEnd + i - 1]) > BTree.MINIMAL_NODE_SIZE) node = copyIfNeeded(node, needsCopy); final Object[] leftNeighbour = (Object[]) node[keyEnd + i - 1]; index++; node = copyIfNeeded(node, needsCopy); nextNode = rotateRight(node, i);
boolean nextNodeNeedsCopy = true; if (BTree.getKeyEnd(nextNode) > BTree.MINIMAL_NODE_SIZE) node = copyIfNeeded(node, needsCopy); else if (i > 0 && BTree.getKeyEnd((Object[]) node[keyEnd + i - 1]) > BTree.MINIMAL_NODE_SIZE) node = copyIfNeeded(node, needsCopy); final Object[] leftNeighbour = (Object[]) node[keyEnd + i - 1]; index++; node = copyIfNeeded(node, needsCopy); nextNode = rotateRight(node, i);