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 14:06:18
#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 anonymous):
Hello
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.
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.
Thanks,
Sasha
-- Ticket URL: <https://svn.boost.org/trac/boost/ticket/4264#comment:8> Boost C++ Libraries <http://www.boost.org/> Boost provides free peer-reviewed portable C++ source libraries.
This archive was generated by hypermail 2.1.7 : 2017-02-16 18:50:03 UTC