setSplitKey(tree, split, retrieveKeyAtLoc(page, entryLoc)); } catch (Throwable e) { cleanupSplit(e, newNode, split); setSplitKey(tree, split, retrieveKeyAtLoc(page, entryLoc)); } catch (Throwable e) { cleanupSplit(e, newNode, split);
setSplitKey(tree, split, retrieveKeyAtLoc(page, entryLoc)); } catch (Throwable e) { cleanupSplit(e, newNode, split); setSplitKey(tree, split, retrieveKeyAtLoc(page, entryLoc)); } catch (Throwable e) { cleanupSplit(e, newNode, split);
split = newSplitLeft(newNode); setSplitKey(tree, split, midKey(okey, 0)); } catch (Throwable e) { cleanupSplit(e, newNode, split); split = newSplitRight(newNode); setSplitKey(tree, split, midKey(pos - searchVecStart - 2, okey)); } catch (Throwable e) { cleanupSplit(e, newNode, split); setSplitKey(tree, mSplit, newNode.midKey(newNode.highestKeyPos(), this, 0)); setSplitKey(tree, mSplit, this.midKey(this.highestKeyPos(), newNode, 0));
split = newSplitLeft(newNode); setSplitKey(tree, split, midKey(okey, 0)); } catch (Throwable e) { cleanupSplit(e, newNode, split); split = newSplitRight(newNode); setSplitKey(tree, split, midKey(pos - searchVecStart - 2, okey)); } catch (Throwable e) { cleanupSplit(e, newNode, split); setSplitKey(tree, mSplit, newNode.midKey(newNode.highestKeyPos(), this, 0)); setSplitKey(tree, mSplit, this.midKey(this.highestKeyPos(), newNode, 0));