From: Thorsten Ottosen (thorsten.ottosen_at_[hidden])
Date: 2008-01-03 09:39:19
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?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk