/** * Set full and actual key. */ final void setKey(_Tree tree, byte[] fullKey) throws IOException { setKey(tree.mDatabase, fullKey); }
private void setSplitKey(_Tree tree, _Split split, byte[] fullKey) throws IOException { byte[] actualKey = fullKey; _LocalDatabase db = tree.mDatabase; if (calculateAllowedKeyLength(db, fullKey) < 0) { // Key must be fragmented. actualKey = db.fragmentKey(fullKey); } split.setKey(fullKey, actualKey); }
private void setSplitKey(_Tree tree, _Split split, byte[] fullKey) throws IOException { byte[] actualKey = fullKey; _LocalDatabase db = tree.mDatabase; if (calculateAllowedKeyLength(db, fullKey) < 0) { // Key must be fragmented. actualKey = db.fragmentKey(fullKey); } split.setKey(fullKey, actualKey); }
split = newSplitRight(newNode); split.setKey(tree, midKey(highestLeafPos(), snode, spos)); } catch (Throwable e) { cleanupSplit(e, newNode, split);
mSplit.setKey(split); } else {
mSplit.setKey(split); } else {
mSplit.setKey(split); } else {
split = newSplitLeft(newNode); split.setKey(tree, midKey(okey, 0)); } catch (Throwable e) { cleanupSplit(e, newNode, split); split = newSplitRight(newNode); split.setKey(tree, midKey(pos - searchVecStart - 2, okey)); } catch (Throwable e) { cleanupSplit(e, newNode, split); mSplit.setKey(tree, newNode.midKey(newNode.highestKeyPos(), this, 0)); mSplit.setKey(tree, this.midKey(this.highestKeyPos(), newNode, 0));
try { _Split split = new _Split(lowTree == survivor, victimNode); split.setKey(survivor, midKey); survivorNode = survivorFrame.acquireExclusive(); survivorNode.mSplit = split;