forked from boostorg/unordered
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]
This commit is contained in:
1 parent
d3b8b2f38d
commit
9bd73e4ba7
4 files changed
+2182
-1849
No files matched your search
File diff suppressed because it is too large.
Load diff
Reference in new issue
Block a user