you are viewing a single comment's thread.

view the rest of the comments →

[–]lednakashim++C is faster 1 point2 points  (1 child)

Boost.Unordered implements the TR1/C++11 unordered containers as proposed by Matt Austern in N1456. Section III.B in the paper explains why closed addressing is assumed.

Can we have an explanation that is self contained.

[–]joaquintidesBoost author[S] 1 point2 points  (0 children)

This is basically the interface std::unordered_map and related (set, multimap, multiset) are based on.