[Feautre Request] --> unordered_node_map::erase(pointer) [Probably not possible]

[nbooster]

Hello,

probably it is not possible,
but I was wondering if there can be a way
to erase a node from a boost::unordered_node_map
by passing the pointer to it (since iterators are not stable),
and avoid recomputing the hash by calling erase(key)...

Or maybe if we could get an iterator from a pointer
(something similar to what intrusive containers have)....

The idea is to find an item (key) in the container,
store it somewhere (through it's pointer, since only that is stable),
add, edit and remove other items in the container,
and then decide to erase that item,
without having to recompute the hash (we did it once).

We basically save one hash computation every time we want to erase an already found item,
and the container has changed, but our item hasn't...

Does this seem like a good idea to anyone (even if it is not possible) ?