Method items

python/bplustree/bplus_tree.py:459–478

Return an iterator over (key, value) pairs in the given range

(self, start_key=None, end_key=None)

            yield value

    def items(self, start_key=None, end_key=None) -> Iterator[Tuple[Any, Any]]:
        """Return an iterator over (key, value) pairs in the given range"""
        if start_key is None:
            current = self.leaves
            start_index = 0
        else:
            current = self._find_leaf_for_key(start_key)
            if current is None:
                return
            start_index = self._find_position_in_leaf(current, start_key)

        while current is not None:
            for i in range(start_index, len(current.keys)):
                key = current.keys[i]
                if end_key is not None and key >= end_key:
                    return
                yield (key, current.values[i])

            current = current.next
            start_index = 0

    def _find_leaf_for_key(self, key: Any) -> Optional["LeafNode"]:
        """Find the leaf node that contains or would contain the given key"""