在向量中存储Peekable迭代器时无法推断适当的生存期

#include <iostream>
#include <vector>
#include <memory>

template<typename T>
class PeekableIterator {
public:
    PeekableIterator(const std::vector<T>& data) : mData(data), mIndex(0) {}

    bool hasNext() const {
        return mIndex < mData.size();
    }

    T next() {
        return mData[mIndex++];
    }

    T peek() const {
        return mData[mIndex];
    }

private:
    const std::vector<T>& mData;
    size_t mIndex;
};

int main() {
    std::vector<int> data = {1, 2, 3, 4, 5};
    std::shared_ptr<PeekableIterator<int>> iterator = std::make_shared<PeekableIterator<int>>(data);

    while (iterator->hasNext()) {
        int value = iterator->next();
        std::cout << "Next value: " << value << std::endl;

        if (iterator->hasNext()) {
            int peekValue = iterator->peek();
            std::cout << "Peek value: " << peekValue << std::endl;
        }
    }

    return 0;
}