Method find_position

python/bplustree/bplus_tree.py:736–744

Find where a key should be inserted. Returns (position, exists) where exists is True if key already exists.

(self, key: Any)

        self.next = right_sibling.next

    def find_position(self, key: Any) -> Tuple[int, bool]:
        """
        Find where a key should be inserted.
        Returns (position, exists) where exists is True if key already exists.
        """
        # Use optimized bisect module for binary search
        pos = bisect.bisect_left(self.keys, key)
        exists = pos < len(self.keys) and self.keys[pos] == key
        return pos, exists

    def insert(self, key: Any, value: Any) -> Optional[Any]:
        """