Daniel James 9bd73e4ba7 New version of the unordered associative containers, with a more efficient data ...

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]

2006-05-07 13:24:17 +00:00

..

boost

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

2006-05-07 13:24:17 +00:00