c++ - 如何以优雅高效的方式实现各种迭代器类别?

标签 c++ stl

我正在实现 STL 容器,例如 vector。令我困惑的是迭代器的实现。

如果我想实现所有迭代器类别:input_iterator、output_iterator、forward_iterator、bidirectional_iterator 和random_access_iterator。

我如何管理他们的继承关系? 我读过 How to implement an STL-style iterator and avoid common pitfalls?-Mooing Duck's Answer

这是他的象征性例子:

iterator {
    iterator(const iterator&);
    ~iterator();
    iterator& operator=(const iterator&);
    iterator& operator++(); //prefix increment
    reference operator*() const;
    friend void swap(iterator& lhs, iterator& rhs); //C++11 I think
};
input_iterator : public virtual iterator {
    iterator operator++(int); //postfix increment
    value_type operator*() const;
    pointer operator->() const;
    friend bool operator==(const iterator&, const iterator&);
    friend bool operator!=(const iterator&, const iterator&); 
};
//once an input iterator has been dereferenced, it is 
//undefined to dereference one before that.
output_iterator : public virtual iterator {
    reference operator*() const;
    iterator operator++(int); //postfix increment
};
//dereferences may only be on the left side of an assignment
//once an input iterator has been dereferenced, it is 
//undefined to dereference one before that.
forward_iterator : input_iterator, output_iterator {
    forward_iterator();
};
//multiple passes allowed
bidirectional_iterator : forward_iterator {
    iterator& operator--(); //prefix increment
    iterator operator--(int); //postfix decrement
};

random_access_iterator : bidirectional_iterator {
    friend bool operator<(const iterator&, const iterator&);
    friend bool operator>(const iterator&, const iterator&);
    friend bool operator<=(const iterator&, const iterator&);
    friend bool operator>=(const iterator&, const iterator&);

    iterator& operator+=(size_type);
    friend iterator operator+(const iterator&, size_type);
    friend iterator operator+(size_type, const iterator&);
    iterator& operator-=(size_type);  
    friend iterator operator-(const iterator&, size_type);
    friend difference_type operator-(iterator, iterator);

    reference operator[](size_type) const;
};

但是我发现了一个问题: 如果我有一个来自 random_access_iterator 类的实例 a,我使用代码 random_access_iterator b = a + 1。这将导致编译错误。因为 a + 1 的类是基础 iterator,而不是 random_access_iterator

所以我认为这不是一个合理的解决方案。

我理解错了吗?或者请告诉我一种优雅高效的实现方式。

谢谢

最佳答案

我认为您应该使用 CRTP ( https://en.wikipedia.org/wiki/Curiously_recurring_template_pattern )。 像这样:

template <typename T, typename ItT>
struct iiterator_t {
    typedef T value_type;
    typedef T& reference;
    typedef T* pointer;

    typedef ItT iterator_type;

    virtual iterator_type& operator=(const iterator_type&) = 0;
    virtual iterator_type& operator++() = 0;
    virtual reference operator*() const = 0;
};

template <typename T, typename ItT>
struct iterator_impl_t :  virtual public iiterator_t<T, ItT>{
    typedef T value_type;
    typedef T& reference;
    typedef T* pointer;

    typedef ItT iterator_type;

    iterator_type& operator=(const iterator_type &rhs)
    {
        p = static_cast<const iterator_impl_t&>(rhs).p;
        return dynamic_cast<iterator_type&>(*this);
    }

    iterator_type& operator++()
    {
        ++p;
        return dynamic_cast<iterator_type&>(*this);
    }

    reference operator*() const
    {
        return *p;
    }

private:
    pointer p;
};

template <typename T, typename ItT>
struct iinput_iterator_t : public virtual iiterator_t<T, ItT> {
    typedef T value_type;
    typedef T& reference;
    typedef T* pointer;

    typedef ItT iterator_type;

    virtual iterator_type operator++(int) = 0;
};


template <typename T, typename ItT>
struct input_iterator_impl_t :
    public virtual iinput_iterator_t<T, ItT>,
    public virtual iterator_impl_t<T, ItT>
{
    typedef T value_type;
    typedef T& reference;
    typedef T* pointer;

    typedef ItT iterator_type;

    iterator_type operator++(int)
    {
        iterator_type result(dynamic_cast<const iterator_type &>(*this));
        ++dynamic_cast<iterator_impl_t<T, ItT> &>(*this);
        return result;
    }
};


template <typename T>
struct iterator :
    public virtual iterator_impl_t<T, iterator<T> >
{
};


template <typename T>
struct input_iterator :
    public virtual input_iterator_impl_t<T, input_iterator<T>>
{
};

int main(int , char** )
{
    iterator<int> i;
    iterator<int> i2 = ++i;
    input_iterator<int> inpi;
    input_iterator<int> inpi2 = inpi++;
    return 0;
 }

关于c++ - 如何以优雅高效的方式实现各种迭代器类别?,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/35174494/

相关文章:

c++ - 获取错误 : 'mutex' in namespace 'std' does not name a type in MinGW mysys prompt

C++,boost asio,慢读

c++ - 使用迭代器获取 std::list 中的下一个元素

c++ - 从模板化容器类型中获取元素类型

c++ - 使用带有 STL 算法的本地类

c++ - (Boost 库) - boost::container::flat_set with boost::fast_pool_allocator

c++ - 将指向派生类的指针强制转换为指向指向基类的指针的引用

c++ - 从两个线程调用 std::deque 上的删除和push_back是否是线程安全的?

c++ - 使用 mem_fun() 作为智能指针的容器

c++ - 将字符串解析为 C 风格字符数组的结构