STL堆栈和priority_queue的插入器 [英] Inserters for STL stack and priority_queue

问题描述

向量，列表，deque有std :: back_inserter和set有std :: insertionter。

vector, list, deque have std::back_inserter and set has std::inserter.

对于stack和priority_queue，我假设equivelent插入器是一个push （），但我似乎找不到正确的函数来调用。

For stack and priority_queue I would assume the equivelent inserter would be a push() but I can't seem to find the correct function to call.

我的意图是能够使用下面的函数与正确的插入迭代器： p>

My intent is to be able to use the following function with the correct insert iterator:

#include <string>
#include <queue>
#include <iterator>

template<typename outiter>
void foo(outiter oitr)
{
   static const std::string s1 ("abcdefghji");
   static const std::string s2 ("1234567890");
   *oitr++ = s1;
   *oitr++ = s2;
}

int main()
{
   std::priority_queue<std::string> spq;
   std::stack<std::string> stk;

   foo(std::inserter(spq));
   foo(std::inserter(stk));

   return 0;
}

推荐答案

方法和自己实现一个迭代器。我没有验证这个代码，但它应该工作。强调我还没有验证。

You can always go your own way and implement an iterator yourself. I haven't verified this code but it should work. Emphasis on "I haven't verified."

template <class Container>
  class push_insert_iterator:
    public iterator<output_iterator_tag,void,void,void,void>
{
protected:
  Container* container;

public:
  typedef Container container_type;
  explicit push_insert_iterator(Container& x) : container(&x) {}
  push_insert_iterator<Container>& operator= (typename Container::const_reference value){
    container->push(value); return *this; }
  push_insert_iterator<Container>& operator* (){ return *this; }
  push_insert_iterator<Container>& operator++ (){ return *this; }
  push_insert_iterator<Container> operator++ (int){ return *this; }
};

我还要添加以下函数来帮助使用它：

I'd also add in the following function to help use it:

template<typename Container>
push_insert_iterator<Container> push_inserter(Container container){
    return push_insert_iterator<Container>(container);
}

这篇关于STL堆栈和priority_queue的插入器的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！