| 1688 | * before call |
| 1689 | */ |
| 1690 | private void appendFromRight(Node<K, V> node, K keyObj, V value) { |
| 1691 | if (node.right_idx == Node.NODE_SIZE - 1) { |
| 1692 | int left_idx = node.left_idx; |
| 1693 | int left_idxMinus1 = left_idx - 1; |
| 1694 | System.arraycopy(node.keys, left_idx, node.keys, left_idxMinus1, Node.NODE_SIZE - left_idx); |
| 1695 | System.arraycopy(node.values, left_idx, node.values, left_idxMinus1, Node.NODE_SIZE - left_idx); |
| 1696 | node.left_idx = left_idxMinus1; |
| 1697 | } else { |
| 1698 | node.right_idx++; |
| 1699 | } |
| 1700 | node.size++; |
| 1701 | node.keys[node.right_idx] = keyObj; |
| 1702 | node.values[node.right_idx] = value; |
| 1703 | } |
| 1704 | |
| 1705 | private void attachToRight(Node<K, V> node, Node<K, V> newNode) { |
| 1706 | newNode.parent = node; |