Method items

python/tests/test_optimized_bplus_tree.py:269–292

Iterate over key-value pairs in range.

(self, start_key=None, end_key=None)

            return None

    def items(self, start_key=None, end_key=None) -> Iterator[Tuple[Any, Any]]:
        """Iterate over key-value pairs in range."""
        # Find start leaf
        if start_key is None:
            current = self.leaves
        else:
            current = self.root
            while not current.is_leaf():
                current = current.get_child(start_key)

        # Iterate through leaves
        while current is not None:
            start_pos = 0
            if start_key is not None and current is self.root:
                start_pos = current.find_position(start_key)

            for i in range(start_pos, current.num_keys):
                key = current.data[i]
                if end_key is not None and key >= end_key:
                    return
                yield (key, current.data[current.capacity + i])

            current = current.next
            start_key = None  # Only apply to first leaf


def test_optimized_performance():