| 4656 | * before call |
| 4657 | */ |
| 4658 | private void appendFromRight(Node<K, V> node, K keyObj, V value) { |
| 4659 | if (node.right_idx == Node.NODE_SIZE - 1) { |
| 4660 | int left_idx = node.left_idx; |
| 4661 | int left_idxMinus1 = left_idx - 1; |
| 4662 | System.arraycopy(node.keys, left_idx, node.keys, left_idxMinus1, |
| 4663 | Node.NODE_SIZE - left_idx); |
| 4664 | System.arraycopy(node.values, left_idx, node.values, |
| 4665 | left_idxMinus1, Node.NODE_SIZE - left_idx); |
| 4666 | node.left_idx = left_idxMinus1; |
| 4667 | } else { |
| 4668 | node.right_idx++; |
| 4669 | } |
| 4670 | node.size++; |
| 4671 | node.keys[node.right_idx] = keyObj; |
| 4672 | node.values[node.right_idx] = value; |
| 4673 | } |
| 4674 | |
| 4675 | private void attachToRight(Node<K, V> node, Node<K, V> newNode) { |
| 4676 | newNode.parent = node; |