Re: About std::list

This is something I've always wondered about... which is, yes: "For
std::list, complexity of removing an element is actually O(1)", that is if:

line 1: std::list<T>::iterator itr;
line 2: std::list<T>::erase(itr);

Then the complexity of "line 2" is *certainly* O(1). But what about "itr"?
In order to erase an element (or elements) from a list, I assume we mean to
erase something specific. That is, normally we're going to wind up doing
something like...

MyType SpecificElement(specifics);
std::list<MyType>::iterator itr = MyList.find(SpecificElement);
if(itr != MyList.end()) MyList.erase(itr);

And the complexity becomes ~= O(N) again due to "find".

So my question is this... is there a *safe* way one could store off the
iterator corresponding with a particular object? That way, on destroy one
could write:

~MyType()
{
  g_lstEveryone.erase(m_itrThis);
}

Reducing the complexity back to O(1).