zoukankan      html  css  js  c++  java
  • STL: remove

    remove

    Eliminates a specified value from a given range without disturbing the order of the remaining elements and returning the end of a new range free of the specified value.

     
    template<class ForwardIterator, class Type> 
       ForwardIterator remove( 
          ForwardIterator _First,  
          ForwardIterator _Last,  
          const Type& _Val 
       );

    注,The list class has a more efficient member function version of remove, which also relinks pointers. remove并不真正从容器中删除那些元素(也就说,容器大小并没有改变),而是将每一个不等于value的元素依次赋值给first之后的空间。返回值ForwardIterator 标示出重新整理后的最后一个元素的下一个位置。如果要删除那些残余的数据,可以讲返回的迭代器交给区间所在容器的erase成员函数。

    remove_copy

    Copies elements from a source range to a destination range, except that elements of a specified value are not copied, without disturbing the order of the remaining elements and returning the end of a new destination range.

    template<class InputIterator, class OutputIterator, class Type> 
       OutputIterator remove_copy( 
          InputIterator _First,  
          InputIterator _Last,  
          OutputIterator _Result, 
          const Type& _Val 
       );

    remove_copy_if

    Copies elements from a source range to a destination range, except that satisfying a predicate are not copied, without disturbing the order of the remaining elements and returning the end of a new destination range.

     
    template<class InputIterator, class OutputIterator, class Predicate> 
       OutputIterator remove_copy_if( 
          InputIterator _First,  
          InputIterator _Last,  
          OutputIterator _Result, 
          Predicate _Pred 
       );

    remove_if

    Eliminates elements that satisfy a predicate from a given range without disturbing the order of the remaining elements and returning the end of a new range free of the specified value.

    template<class ForwardIterator, class Predicate> 
       ForwardIterator remove_if( 
          ForwardIterator _First,  
          ForwardIterator _Last, 
          Predicate _Pred 
       );
  • 相关阅读:
    【Educational Codeforces Round 36 C】 Permute Digits
    【Educational Codeforces Round 36 B】Browser
    【Educational Codeforces Round 36 A】 Garden
    【习题 8-14 UVA
    【习题 8-13 UVA
    【习题 8-12 UVA
    【习题 8-11 UVA
    【习题 8-10 UVA
    关于货仓选址问题的方法及证明(在数轴上找一点使得该点到所有其他点的距离之和最小)
    P2512 [HAOI2008]糖果传递
  • 原文地址:https://www.cnblogs.com/freewater/p/2953607.html
Copyright © 2011-2022 走看看