STL之insert_iterator

insert_iterator功能:指定要插入容器的位置,然后向插入点后插入元素。如ListA{1,2,3,4,5,6,7,8,9} 。插入点位置在5处。要插入的链表为ListB{555,666,777}
,则结果为{1,2,3,4,5,555,666,777,6,7,8,9}。
  

     见以下例子

//advance(i, n) 指定迭代器i前进n步 相当于i=i+n

//http://www.cplusplus.com/reference/iterator/advance/
#include <iostream>
#include <iterator>
#include <list>
using namespace std;

void TestAdvance()
{
  list<int> mylist;
  for (int i=0; i<10; i++) mylist.push_back (i*10);

  list<int>::iterator it = mylist.begin();

  advance (it,5);

  cout << "The sixth element in mylist is: " << *it << endl;
}

//http://www.cplusplus.com/reference/iterator/inserter/
//输出A链表到B链表中 输出的位置由B链表迭代器的位置指定
//this function generates an insert iterator for a container.
//template<class InputIterator, class OutputIterator>
 // OutputIterator copy ( InputIterator first, InputIterator last, OutputIterator result )
//{
//  while (first!=last) *result++ = *first++;
//  return result;
//}

void TestCopyOutputIterator()
{
  list<int> firstlist, secondlist;
  for (int i=1; i<=5; i++)
  { firstlist.push_back(i); secondlist.push_back(i*10); }

  list<int>::iterator it;
  it = firstlist.begin(); advance (it,3);

  copy (secondlist.begin(),secondlist.end(),inserter(firstlist,it));

  for ( it = firstlist.begin(); it!= firstlist.end(); ++it )
	  cout << *it << " ";
  cout << endl;
}
/*
template <class Container>
  class insert_iterator :
    public iterator<output_iterator_tag,void,void,void,void>
{
protected:
  Container* container;
  typename Container::iterator iter;

public:
  typedef Container container_type;
  explicit insert_iterator (Container& x, typename Container::iterator i)
    : container(&x), iter(i) {}
  insert_iterator<Container>& operator= (typename Container::const_reference value)
    { iter=container->insert(iter,value); ++iter; return *this; }
  insert_iterator<Container>& operator* ()
    { return *this; }
  insert_iterator<Container>& operator++ ()
    { return *this; }
  insert_iterator<Container> operator++ (int)
    { return *this; }
};
*/
//还可以直接使用insert_iterator迭代器
void TestCopy()
{
	  list<int> firstlist, secondlist;
  for (int i=1; i<=5; i++)
  { firstlist.push_back(i); secondlist.push_back(i*10); }

  list<int>::iterator it;
  it = firstlist.begin(); advance (it,3);

  insert_iterator< list<int> > insert_it (firstlist,it);

  copy (secondlist.begin(),secondlist.end(),insert_it);

  for ( it = firstlist.begin(); it!= firstlist.end(); ++it )
	  cout << *it << " ";
  cout << endl;
}

int main () {

	TestAdvance();
	TestCopyOutputIterator();
	TestCopy();
  return 0;
}


结果

The sixth element in mylist is: 50
1 2 3 10 20 30 40 50 4 5
1 2 3 10 20 30 40 50 4 5


 

  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值