remove 用法

remove

function template

template < class ForwardIterator, class T > ForwardIterator remove ( ForwardIterator first, ForwardIterator last, const T& value );

<algorithm>

Remove value from range

Removes from the range [first,last) the elements with a value equal to value and returns an iterator to the new end of the range, which now includes only the values not equal to value.

The behavior of this function template is equivalent to:

template < class ForwardIterator, class T > ForwardIterator remove ( ForwardIterator first, ForwardIterator last, const T& value ) { ForwardIterator result = first; for ( ; first != last; ++first) if (!(*first == value)) *result++ = *first; return result; }

Notice that this function does not alter the elements past the new end, which keep their old values and are still accessible.

Parameters

first, last

Forward iterators to the initial and final positions in a sequence. The range used is  [first,last), which contains all the elements between  first and  last, including the element pointed by  first but not the element pointed by  last.

value

Value to be removed.

Return value

A forward iterator pointing to the new end of the sequence, which now includes all the elements with a value other than  value.

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
class student{
	public:
		int key;
		int value;
	bool operator==(student s){
		return value==s.value;
}
};
int main(){
	vector<student>vec(4);
	vec[0].key=1;
	vec[0].value=1;
	vec[1].key=2;
	vec[1].value=2;
	vec[2].key=2;
	vec[2].value=2;
	vec[3].key=3;
	vec[3].value=3;
	vector<student>::iterator it,p;
	p=remove(vec.begin(),vec.end(),vec[2]);
	for(it=vec.begin();it!=p;it++)
		cout<<(*it).value<<endl;
}