| 1658 | } |
| 1659 | |
| 1660 | private void appendFromLeft(Node<K, V> node, K keyObj, V value) { |
| 1661 | if (node.left_idx == 0) { |
| 1662 | int new_right = node.right_idx + 1; |
| 1663 | System.arraycopy(node.keys, 0, node.keys, 1, new_right); |
| 1664 | System.arraycopy(node.values, 0, node.values, 1, new_right); |
| 1665 | node.right_idx = new_right; |
| 1666 | } else { |
| 1667 | node.left_idx--; |
| 1668 | } |
| 1669 | node.size++; |
| 1670 | node.keys[node.left_idx] = keyObj; |
| 1671 | node.values[node.left_idx] = value; |
| 1672 | } |
| 1673 | |
| 1674 | private void attachToLeft(Node<K, V> node, Node<K, V> newNode) { |
| 1675 | newNode.parent = node; |