tr1::hashtable::operator[]

[Paolo Carlini]

Joe Buck wrote:

>There is wasted work because of the two lookups, but perhaps there's
>a way to further improve the situation by exposing the common part
>of find() and insert(), namely the hash computation.  If there were
>a way to do the find(), and somehow reuse the hash computed by the
>find() to do the insert() more quickly, then I think Peter's approach
>would be an even bigger win.
>
Definitely. That is exactly my point.

Paolo.