正确做法是:
std::list< int> List;
std::list< int>::iterator itList;
for( itList = List.begin(); itList != List.end(); )
{
if( WillDelete( *itList) )
{
itList = List.erase( itList);
}
else
{
itList++;
}
}
因为vector中在删除一个元素后,迭代器会自动指向下一个元素。
erase的效率其实是比较低的
typedef struct tag_FrameInfo
{
int id;
int abc;
string abcs;
char sadf;
unsigned long w023;
}FrameInfo;
typedef vector<FrameInfo> FI_VECTOR;
int i = 0;
FrameInfo info;
FI_VECTOR vt;
for (i = 0; i < 10000; i++)
{
info.abc = i;
info.id = i;
info.abcs = "asdfa029lwjae;;rw9aweo";
vt.push_back(info);
}
FI_VECTOR::iterator pi;
FrameInfo* pInfo = NULL;
DWORD dw = GetTickCount();
for (pi = vt.begin(); pi != vt.end();)
{
pInfo = (FrameInfo*)pi;
if (pInfo->id < 100)
{
vt.erase(pi);
}
else
{
pi++;
}
}
TRACE("##########= %d/n", GetTickCount()-dw);
dw = GetTickCount();
for (i = 0; i < vt.size();)
{
if (vt[i].id < 100)
{
swap(vt[i], vt[vt.size()-1]);
vt.pop_back();
}
else
{
i++;
}
}
TRACE("$$$$$$$$$$$= %d/n", GetTickCount()-dw);
第一种方法,我机上测试花掉500ms,第二种方法0ms
所以使用swap将当前需要删除的项与最后一项对换后,pop_back()掉最后一项,
这种方法是相对比较高效的