Method insert

python/tests/test_optimized_bplus_tree.py:40–66

Insert with optimized array access.

(self, key, value)

        return self

    def insert(self, key, value) -> Optional[Tuple[Any, "OptimizedLeafNode"]]:
        """Insert with optimized array access."""
        pos = self.find_position(key)

        # Update existing key
        if pos < self.num_keys and self.data[pos] == key:
            self.data[self.capacity + pos] = value
            return None

        # Check if split needed
        if self.num_keys >= self.capacity:
            return self._split_and_insert(pos, key, value)

        # Shift in single operation
        if pos < self.num_keys:
            # Move keys
            self.data[pos + 1 : self.num_keys + 1] = self.data[pos : self.num_keys]
            # Move values
            start_val = self.capacity + pos
            end_val = self.capacity + self.num_keys
            self.data[start_val + 1 : end_val + 1] = self.data[start_val:end_val]

        # Insert
        self.data[pos] = key
        self.data[self.capacity + pos] = value
        self.num_keys += 1
        return None

    def _split_and_insert(
        self, pos: int, key, value