Split leaf and insert key-value, returning (new_leaf, separator_key)
(self, key: Any, value: Any)
| 798 | return new_leaf |
| 799 | |
| 800 | def split_and_insert(self, key: Any, value: Any) -> Tuple["LeafNode", Any]: |
| 801 | """Split leaf and insert key-value, returning (new_leaf, separator_key)""" |
| 802 | new_leaf = self.split() |
| 803 | |
| 804 | # Insert into appropriate leaf |
| 805 | if key < new_leaf.keys[0]: |
| 806 | self.insert(key, value) |
| 807 | else: |
| 808 | new_leaf.insert(key, value) |
| 809 | |
| 810 | return new_leaf, new_leaf.keys[0] |
| 811 | |
| 812 | def find_leaf_for_key(self, _key: Any) -> "LeafNode": |
| 813 | """Find the leaf node that contains or would contain the given key""" |
no test coverage detected