private Split newSplitLeft(Node newNode) { Split split = new Split(false, newNode); // New left node cannot be a high extremity, and this node cannot be a low extremity. newNode.type((byte) (type() & ~HIGH_EXTREMITY)); type((byte) (type() & ~LOW_EXTREMITY)); return split; }
private Split newSplitLeft(Node newNode) { Split split = new Split(false, newNode); // New left node cannot be a high extremity, and this node cannot be a low extremity. newNode.type((byte) (type() & ~HIGH_EXTREMITY)); type((byte) (type() & ~LOW_EXTREMITY)); return split; }
private Split newSplitRight(Node newNode) { Split split = new Split(true, newNode); // New right node cannot be a low extremity, and this node cannot be a high extremity. newNode.type((byte) (type() & ~LOW_EXTREMITY)); type((byte) (type() & ~HIGH_EXTREMITY)); return split; }
private Split newSplitLeft(Node newNode) { Split split = new Split(false, newNode); // New left node cannot be a high extremity, and this node cannot be a low extremity. newNode.type((byte) (type() & ~HIGH_EXTREMITY)); type((byte) (type() & ~LOW_EXTREMITY)); return split; }
private Split newSplitRight(Node newNode) { Split split = new Split(true, newNode); // New right node cannot be a low extremity, and this node cannot be a high extremity. newNode.type((byte) (type() & ~LOW_EXTREMITY)); type((byte) (type() & ~HIGH_EXTREMITY)); return split; }
private Split newSplitRight(Node newNode) { Split split = new Split(true, newNode); // New right node cannot be a low extremity, and this node cannot be a high extremity. newNode.type((byte) (type() & ~LOW_EXTREMITY)); type((byte) (type() & ~HIGH_EXTREMITY)); return split; }
Split split = new Split(lowTree == survivor, victimNode); split.setKey(survivor, midKey); survivorNode = survivorFrame.acquireExclusive();