Re: [Boost-bugs] [Boost C++ Libraries] #4264: boost multi_index hashed_unique erase takes linear time

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #4264: boost multi_index hashed_unique erase takes linear time
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2010-06-09 20:28:49

#4264: boost multi_index hashed_unique erase takes linear time
--------------------------+-------------------------------------------------
 Reporter:  anonymous     |       Owner:  joaquin    
     Type:  Bugs          |      Status:  new        
Milestone:                |   Component:  multi_index
  Version:  Boost 1.41.0  |    Severity:  Showstopper
 Keywords:                |  
--------------------------+-------------------------------------------------

Comment(by joaquin):

 ''I understand that you're waiting for clarity from the standard, so I'll
 drop all comparisons to gcc4.1.2's unordered_set/map and other
 implementations.''

 There are definitely some dark corners in the specification, and it'd be
 great if some consensus could be reached.

 ''As feedback from a big fan and user of multi-index, I am willing to eat
 the increased size of the nodes when using an intrusive list for
 guaranteed performance, and I am pretty sure all of your others fans and
 users feel the same.''

 Hashed indices have minimal memory penalty, and this is something I'd like
 to preserve at all costs (and I think some users would, too.) I'm actively
 tracking these problems and will act upon them as soon as C++0x provides a
 clarification.

-- 
Ticket URL: <https://svn.boost.org/trac/boost/ticket/4264#comment:9>
Boost C++ Libraries <http://www.boost.org/>
Boost provides free peer-reviewed portable C++ source libraries.