long time = timeGetTime( );
for( Mptable::iterator itr = mapnode.begin() ; itr != mapnode.end() ; )
{
delete itr->second;
mapnode.erase( itr++ );
}
std::cout <<"map : spend " << timeGetTime() - time << " second " << std::endl;
list
long time = timeGetTime( );
for( List::iterator itr = listnode.begin() ; itr != listnode.end() ; )
{
delete *itr;
itr = listnode.erase( itr );
}
std::cout <<"list : spend " << timeGetTime() - time << " second " << std::endl;
typedef std::map<long,node*> Mptable;
typedef std::list<node*> List;
Mptable mapnode;
List listnode;
每个容器都有10W个item,遍历删除，要释放item空间，然后在删除迭代器。
测试发现，list比map容器还要慢，map本身erase的时候本身会维护，list是双向链表，删除是O(1);
咋list比map容器还要慢？
还是上面的代码不能说明问题。
