为不返回真实基础类型的迭代器实现运算符>

问：

假设我想为一个表示 2D 点数组的类实现迭代器。 迭代器应该使类看起来像是存储了一对双精度值的数组，但该类实际上使用了 2 个单独的数组（一个用于 X 坐标，一个用于 Y 坐标）。我想知道我应该如何实现迭代器。我当然不能从中获取返回值的地址，因为它是一个临时值。我应该在每次调用时在堆上分配一个吗？有没有好办法？operator->()operator*pair<double&, double&>operator->()

struct PointArray {
    std::vector<double> m_x;
    std::vector<double> m_y;

    // Define a custom iterator class for ControlPointArray
    class iterator {
    public:
        using value_type = std::pair<double&, double&> const;
        using reference = value_type;
        using pointer = value_type*;
        using difference_type = std::ptrdiff_t;
        using iterator_category = std::random_access_iterator_tag;

        iterator() = default;
        iterator(const typename std::vector<double>::iterator& x_it, const typename std::vector<double>::iterator& y_it)
            : m_x_it(x_it), m_y_it(y_it) {}

        reference operator*() const { return { *m_x_it, *m_y_it }; }
        pointer operator->() const {
            // how to implement this method ??
        }

        iterator& operator++() { ++m_x_it; ++m_y_it; return *this; }
        iterator operator++(int) { auto copy = *this; ++(*this); return copy; }
        iterator& operator--() { --m_x_it; --m_y_it; return *this; }
        iterator operator--(int) { auto copy = *this; --(*this); return copy; }
        iterator& operator+=(difference_type n) { m_x_it += n; m_y_it += n; return *this; }
        iterator operator+(difference_type n) const { auto copy = *this; copy += n; return copy; }
        iterator& operator-=(difference_type n) { return (*this) += -n; }
        iterator operator-(difference_type n) const { auto copy = *this; copy -= n; return copy; }
        difference_type operator-(const iterator& other) const { return m_x_it - other.m_x_it; }
        reference operator[](difference_type n) const { return *(*this + n); }
        bool operator==(const iterator& other) const { return m_x_it == other.m_x_it; }
        bool operator!=(const iterator& other) const { return !(*this == other); }
        bool operator<(const iterator& other) const { return m_x_it < other.m_x_it; }
        bool operator<=(const iterator& other) const { return m_x_it <= other.m_x_it; }
        bool operator>(const iterator& other) const { return m_x_it > other.m_x_it; }
        bool operator>=(const iterator& other) const { return m_x_it >= other.m_x_it; }

    private:
        typename std::vector<double>::iterator m_x_it;
        typename std::vector<double>::iterator m_y_it;
    };

    // Define begin() and end() functions to return iterators
    iterator begin() { return { m_x.begin(), m_y.begin() }; }
    iterator end() { return { m_x.end(), m_y.end() }; }

// the rest of the PointArray class...
};