private void promoteValue(Transaction tx, Key key, long nodeId) throws IOException { int idx = Arrays.binarySearch(keys, key); idx = idx < 0 ? -(idx + 1) : idx + 1; setBranchData(arrayInsert(keys, key, idx), arrayInsert(children, nodeId, idx + 1)); try { index.storeNode(tx, this, allowOverflow()); } catch ( Transaction.PageOverflowIOException e ) { split(tx); } }
setLeafData(arrayInsert(keys, key, idx), arrayInsert(values, value, idx));
private void promoteValue(Transaction tx, Key key, long nodeId) throws IOException { int idx = Arrays.binarySearch(keys, key); idx = idx < 0 ? -(idx + 1) : idx + 1; setBranchData(arrayInsert(keys, key, idx), arrayInsert(children, nodeId, idx + 1)); try { index.storeNode(tx, this, allowOverflow()); } catch ( Transaction.PageOverflowIOException e ) { split(tx); } }
private void promoteValue(Transaction tx, Key key, long nodeId) throws IOException { int idx = Arrays.binarySearch(keys, key); idx = idx < 0 ? -(idx + 1) : idx + 1; setBranchData(arrayInsert(keys, key, idx), arrayInsert(children, nodeId, idx + 1)); try { index.storeNode(tx, this, allowOverflow()); } catch ( Transaction.PageOverflowIOException e ) { split(tx); } }
private void promoteValue(Transaction tx, Key key, long nodeId) throws IOException { int idx = Arrays.binarySearch(keys, key); idx = idx < 0 ? -(idx + 1) : idx + 1; setBranchData(arrayInsert(keys, key, idx), arrayInsert(children, nodeId, idx + 1)); try { index.storeNode(tx, this, allowOverflow()); } catch ( Transaction.PageOverflowIOException e ) { split(tx); } }
setLeafData(arrayInsert(keys, key, idx), arrayInsert(values, value, idx));
setLeafData(arrayInsert(keys, key, idx), arrayInsert(values, value, idx));
setLeafData(arrayInsert(keys, key, idx), arrayInsert(values, value, idx));