This is the mail archive of the libstdc++@gcc.gnu.org mailing list for the libstdc++ project.

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]
Other format:	[Raw text]

Re: tr1::hashtable::operator[]

From: Paolo Carlini <pcarlini at suse dot de>
To: Joe Buck <Joe dot Buck at synopsys dot COM>
Cc: Peter Doerfler <gcc at pdoerfler dot com>, libstdc++ at gcc dot gnu dot org
Date: Sun, 14 May 2006 10:10:50 +0200
Subject: Re: tr1::hashtable::operator[]
References: <4465F6FD.2070701@pdoerfler.com> <4466241A.6030202@suse.de> <20060514054352.GA18276@synopsys.com>

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.

Follow-Ups:
- Re: tr1::hashtable::operator[]
  - From: Paolo Carlini

References:
- tr1::hashtable::operator[]
  - From: Peter Doerfler
- Re: tr1::hashtable::operator[]
  - From: Paolo Carlini
- Re: tr1::hashtable::operator[]
  - From: Joe Buck

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]