c++ List 容器对象从后向前查找某元素并删除

//删除节点的操作   ListNode是一个结构体
bool DeleteNode(unsigned long uID, list& LISTNODE)
{
list::reverse_iterator Iter;
for (Iter = LISTNODE.rbegin(); Iter != LISTNODE.rend(); )
{
if(uID == Iter->iValue)
{
break;
}
list::iterator iter = LISTNODE.erase((++Iter).base());
Iter = list::reverse_iterator(iter);
}
return true;
}