Unordered: Overhaul the implementation.

Browse Source

Store nodes in a single linked list, with hash values so that their
buckets can be found when needed. Iterators now only have to store a
pointer to the node and don't have to iterate over empty buckets to
reach the next node. This allows the container to meet the iterator
requirements - fixing the speed issues with `equal_range` and `erase`.

Also, define iterators in their own namespace, so that they don't
accidentally pull in detail functions via ADL.

I've simplified the code slightly by removing some of the special
cases for empty containers. Renamed a few things as well and other
minor changes that were made as I went along.

[SVN r71327]

...

This commit is contained in:

Daniel James

2011-04-16 18:47:33 +00:00

parent d9c49a6cde

commit 547e141166

14 changed files with 4330 additions and 3985 deletions

Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL

Download Patch File Download Diff File Expand all files Collapse all files

include/boost/unordered/unordered_map.hpp

+1058 -604

File diff suppressed because it is too large Load Diff