New version of the unordered associative containers, with a more efficient data

Browse Source

structure for unordered_multimap/unordered_multiset that uses an extra
pointer per node but makes most operations more efficient when equivalent
nodes are present.

Now uses macros instead of template metaprogramming to implement the
differences between containers with equivalent and unique keys.

Removed the erase_iterator stuff which complicated matters more than it helped.
Now just using pointers with some helper functions.


[SVN r2950]

...

This commit is contained in:

Daniel James committed 2006-05-07 13:24:17 +00:00

1 parent d3b8b2f38d

commit 9bd73e4ba7

4 files changed

+2182 -1849

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

No files matched your search

include/boost/unordered/detail/hash_table.hpp

+52 -1827

File diff suppressed because it is too large. Load diff

include/boost/unordered/detail/hash_table_impl.hpp

+2112

File diff suppressed because it is too large. Load diff