Boost logo

Boost-Commit :

From: daniel_james_at_[hidden]
Date: 2007-10-11 19:57:53


Author: danieljames
Date: 2007-10-11 19:57:52 EDT (Thu, 11 Oct 2007)
New Revision: 39952
URL: http://svn.boost.org/trac/boost/changeset/39952

Log:
Rewrite the swap implementation note so that it make some sort of sense.
Text files modified:
   sandbox/unordered/libs/unordered/doc/rationale.qbk | 9 ++++-----
   1 files changed, 4 insertions(+), 5 deletions(-)

Modified: sandbox/unordered/libs/unordered/doc/rationale.qbk
==============================================================================
--- sandbox/unordered/libs/unordered/doc/rationale.qbk (original)
+++ sandbox/unordered/libs/unordered/doc/rationale.qbk 2007-10-11 19:57:52 EDT (Thu, 11 Oct 2007)
@@ -115,11 +115,10 @@
 no guarantee what state the allocators will be in. The only solution seems to
 be to double buffer the allocators. But I'm assuming that it won't throw for now.
 
-Update: the comittee have now decided that swap should do a fast swap if the
-allocator is Swappable and a slow swap using copy construction otherwise. In
-the future I develop support for concepts and do this, but what should I do for
-the current implementation and, in the future, compilers without concepts? I
-should probably change it to a slow swap.
+Update: The comittee have now decided that `swap` should do a fast swap if the
+allocator is Swappable and a slow swap using copy construction otherwise. To
+make this distinction requires concepts. For now I'm sticking with the current
+implementation.
 
 [h3 [@http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#518
     518. Are insert and erase stable for unordered_multiset and unordered_multimap?]]


Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk