3 Jan
2008
3 Jan
'08
2:39 p.m.
Ion Gaztañaga skrev:
Hi to all,
Unordered. Basically, Daniel's implementation uses an smart double-buffering technique to obtain strong safety guarantees (stricter than the requirements of the standard) in some operations. There's an slight size overhead (the container must allocate space for two equality functors and hashers) but according to Daniel, speed should not suffer.
Can boost::compressed_pair not be used to remove the overhead of stateless functors and hashers? -Thorsten