| 4678 | * before call |
| 4679 | */ |
| 4680 | private void appendFromRight(Node<K, V> node, K keyObj, V value) { |
| 4681 | if (node.right_idx == Node.NODE_SIZE - 1) { |
| 4682 | int left_idx = node.left_idx; |
| 4683 | int left_idxMinus1 = left_idx - 1; |
| 4684 | System.arraycopy(node.keys, left_idx, node.keys, left_idxMinus1, |
| 4685 | Node.NODE_SIZE - left_idx); |
| 4686 | System.arraycopy(node.values, left_idx, node.values, |
| 4687 | left_idxMinus1, Node.NODE_SIZE - left_idx); |
| 4688 | node.left_idx = left_idxMinus1; |
| 4689 | } else { |
| 4690 | node.right_idx++; |
| 4691 | } |
| 4692 | node.size++; |
| 4693 | node.keys[node.right_idx] = keyObj; |
| 4694 | node.values[node.right_idx] = value; |
| 4695 | } |
| 4696 | |
| 4697 | private void attachToRight(Node<K, V> node, Node<K, V> newNode) { |
| 4698 | newNode.parent = node; |