【C++】普通迭代器的模拟实现

 

 正向迭代器

namespace bit
{
	template<class Iterator,class Ref,class Ptr>
	struct Iterator
	{
		typedef Iterator<Iterator, Ref, Ptr> Self;

		Iterator _it;

		Iterator(Iterator it)
			:_it(it)
		{}

		Ref operator*()
		{
			Iterator tmp = _it;
			return *(tmp);
		}
		Ptr operator->()
		{
			return &(operator*());
		}

		Self& operator++()
		{
			++_it;
			return *this;
		}

		Self& operator--()
		{
			--_it;
			return *this;
		}

        bool operator==(const Self& s) const
		{
			return _it == s._it;
		}

		bool operator!=(const Self& s) const
		{
			return _it != s._it;
		}
	};

}

 

 反向迭代器

namespace bit
{
	template<class Iterator,class Ref,class Ptr>
	struct ReverseIterator
	{
		typedef ReverseIterator<Iterator, Ref, Ptr> Self;

		Iterator _it;

		ReverseIterator(Iterator it)
			:_it(it)
		{}

		Ref operator*()
		{
			Iterator tmp = _it;
			return *(--tmp);
		}
		Ptr operator->()
		{
			return &(operator*());
		}

		Self& operator++()
		{
			--_it;
			return *this;
		}

		Self& operator--()
		{
			++_it;
			return *this;
		}

        bool operator==(const Self& s) const
		{
			return _it == s._it;
		}

		bool operator!=(const Self& s) const
		{
			return _it != s._it;
		}
	};

}